The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
The paper provides a cryptanalysis of the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group ℝ/ℤ (the reals modulo 1). The paper breaks the AAβ-cryptosystem (i...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2010-10-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc.2010.008 |