Article
Open Access
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
-
Simon R. Blackburn
Published/Copyright:
August 23, 2010
Received: 2010-03-12
Published Online: 2010-08-23
Published in Print: 2010-October
© de Gruyter 2010
Articles in the same Issue
- On secret sharing schemes, matroids and polymatroids
- The power of primes: security of authentication based on a universal hash-function family
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
- On the asymptotic effectiveness of Weil descent attacks
- The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- On secret sharing schemes, matroids and polymatroids
- The power of primes: security of authentication based on a universal hash-function family
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
- On the asymptotic effectiveness of Weil descent attacks
- The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
