International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Simon R. Blackburn
Download:
URL: http://eprint.iacr.org/2010/114
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-23015,
  title={The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin--Abu cryptosystem},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2010/114},
  note={ s.blackburn@rhul.ac.uk 14726 received 2 Mar 2010, last revised 27 Apr 2010},
  author={Simon R. Blackburn},
  year=2010
}