Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jmount
on March 5, 2023
|
parent
|
context
|
favorite
| on:
Lifting Discrete Logarithm Based Cryptography to P...
Yeah, knowing there is no poly-time quantum algo would be as big as showing P!=NP. If it is "no known" algo, it is well known not to use the stronger wording. Outside of oracle results an "at least this hard result" is a big deal.
tromp
on March 5, 2023
[β]
There is indeed no excuse for saying "there is no" when they mean "there is no known"
It's almost as bad as saying that NP stands for Non Polynomial time.
opheliate
on March 6, 2023
|
parent
|
next
[β]
Itβs probably worth remembering this is a pre-print of the paper. This is the kind of thing that would be corrected when actually published.
cryptonector
on March 6, 2023
|
parent
|
prev
[β]
It could be a translation error. The author clearly does not speak English as a first language.
Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
