Paper 2010/114 Original: eprint.iacr.org/2010/114 ↗
The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin--Abu cryptosystem
Abstract
The paper provides a cryptanalysis the $AA_\beta$-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 $\mathbb{R}/\mathbb{Z}$ (the reals modulo $1$). The paper breaks the $AA_\beta$-cryptosystem (in a passive adversary model) by showing that this discrete logarithm problem can be efficiently solved in practice.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-04-27: last updated
- 2010-03-04: published
- Short URL
- https://ia.cr/2010/114
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/114,
author = {Simon R. Blackburn},
title = {The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin--Abu cryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/114},
year = {2010},
url = {https://eprint.iacr.org/2010/114}
}