Cryptology ePrint Archive: Report 2010/114

The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin--Abu cryptosystem

Simon R. Blackburn

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.

Category / Keywords: public-key cryptography /

Date: received 2 Mar 2010, last revised 27 Apr 2010

Contact author: s blackburn at rhul ac uk

Available format(s): PDF | BibTeX Citation

Note: New version shortens (and corrects) the proof that the attack is polynomial time.

Version: 20100427:141839 (All versions of this report)

Short URL: ia.cr/2010/114

Discussion forum: Show discussion | Start new discussion