3 problems

0 votes0 replies0 views
The security advantage conjecture for cyclic-algebra LWE over RLWE
Let CLWE denote learning with errors based on cyclic algebras, and let RLWE denote ring learning with errors. The CLWE construction uses the non-commutative multiplication of a cyc…
Conjectureopenlattice-based-cryptography noncommutative-algebras post-quantum-cryptographyarXiv posted 2 days ago
0 votes0 replies0 views
Post-quantum security conjecture for symmetric-key authenticated key exchange bootstrapped by PAKE
Post-quantum SAKE conjecture. The SAKE-based construction should be post-quantum secure because it uses symmetric-key primitives, yielding a low-cost and efficient post-quantum aut…
Conjectureopenauthenticated-key-exchange password-authenticated-key-exchange post-quantum-cryptographyarXiv posted 2 days ago
0 votes0 replies0 views
Probabilistic hardness of solving the keyed hash preimage problem against Shor's algorithm
Probabilistic hardness conjecture. This is a probabilistically hard problem, and Shor’s algorithm cannot be used to speed it up.
Conjectureopenexpander-graphs hash-functions post-quantum-cryptographyarXiv posted 2 days ago

The security advantage conjecture for cyclic-algebra LWE over RLWE