Paper 2021/583
Entropoids: Groups in Disguise
Lorenz Panny
Abstract
A recent preprint [ePrint 2021/469] suggests the use of exponentiation in a non-associative algebraic structure called "entropoid" to construct post-quantum analogues of DLP-based cryptosystems. In this note, we show a polynomial-time reduction from the entropoid version of DLP to the conventional DLP in the underlying finite field. The resulting attack takes less than 10 minutes on a laptop against parameters suggested in [ePrint 2021/469] for 128-bit post-quantum secure key exchange and runs in polynomial time on a quantum computer. We briefly discuss how to generalize the attack to the generic setting.
Note: Updated following ePrint 2021/896.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- cryptanalysispost-quantum cryptographyentropic quasigroupnon-associative exponentiationlinearization attackdiscrete-logarithm problem
- Contact author(s)
- lorenz @ yx7 cc
- History
- 2021-07-27: revised
- 2021-05-04: received
- See all versions
- Short URL
- https://ia.cr/2021/583
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/583,
author = {Lorenz Panny},
title = {Entropoids: Groups in Disguise},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/583},
year = {2021},
url = {https://eprint.iacr.org/2021/583}
}
