[HN Gopher] Lifting Discrete Logarithm Based Cryptography to Pos...
       ___________________________________________________________________
        
       Lifting Discrete Logarithm Based Cryptography to Post-Quantum
       Cryptography
        
       Author : Laaas
       Score  : 19 points
       Date   : 2023-03-05 19:18 UTC (3 hours ago)
        
 (HTM) web link (eprint.iacr.org)
 (TXT) w3m dump (eprint.iacr.org)
        
       | efitz wrote:
       | This looks really promising. I wish the abstract used some
       | English words :-D
        
       | texaslonghorn5 wrote:
       | > rising to the non-associative power indices ... in the last two
       | decades has been analyzed and does not have a quantum polynomial
       | algorithm that solves it. The problem is called Exponential
       | Congruences Problem.
       | 
       | The author uses similar wording a couple times and it is a little
       | ambiguous? Does "does not have" mean a superpolynomial quantum
       | lower bound has been discovered for this algorithm (or is there a
       | reduction to some other important conjectured complexity
       | theorem)? Or is it just that a polynomial algorithm has not been
       | discovered yet?
        
         | jmount wrote:
         | 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 wrote:
           | 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.
        
       ___________________________________________________________________
       (page generated 2023-03-05 23:00 UTC)