Artikel
Open Access
The power of primes: security of authentication based on a universal hash-function family
-
Basel Alomair
Veröffentlicht/Copyright:
21. Juli 2010
Received: 2009-10-08
Revised: 2010-04-05
Published Online: 2010-07-21
Published in Print: 2010-October
© de Gruyter 2010
Artikel in diesem Heft
- 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
Schlagwörter für diesen Artikel
Cryptography;
authentication;
finite integer rings;
universal hash-function families
Creative Commons
BY-NC-ND 3.0
Artikel in diesem Heft
- 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
