Welcome to the resource topic for 2010/114
Title:
The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin–Abu cryptosystem
Authors: 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.
ePrint: https://eprint.iacr.org/2010/114
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .