You are looking at a specific version 20100427:141839 of this paper. See the latest version.

Paper 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.

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

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
s blackburn @ rhul ac uk
History
2010-04-27: revised
2010-03-04: received
See all versions
Short URL
https://ia.cr/2010/114
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.