Article
Open Access
A recursive construction for perfect hash families
-
Charles J. Colbourn
Published/Copyright:
March 19, 2010
Received: 2008-12-04
Revised: 2009-09-10
Published Online: 2010-03-19
Published in Print: 2009-December
© de Gruyter 2009
Articles in the same Issue
- On a conjecture for balanced symmetric Boolean functions
- A recursive construction for perfect hash families
- The Miller–Rabin test with randomized exponents
- Cryptanalysis of the MST3 public key cryptosystem
- An efficient identification protocol secure against concurrent-reset attacks
- On hashing into elliptic curves
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- On a conjecture for balanced symmetric Boolean functions
- A recursive construction for perfect hash families
- The Miller–Rabin test with randomized exponents
- Cryptanalysis of the MST3 public key cryptosystem
- An efficient identification protocol secure against concurrent-reset attacks
- On hashing into elliptic curves
