Estimation of the number of "good" permutations with applications to cryptography

Cybernetics and Systems Analysis

Volumn 35, Issue 5, 1999, Pages 688-693

  Cooper, C ^a,b   Gilchrist, R ^a   Kovalenko, I N ^b   Novakovic, D ^a,b  

^a LONDON METROPOLITAN UNIVERSITY   (United Kingdom)

^b V M GLUSHKOV INSTITUTE OF CYBERNETICS   (Ukraine)

Author keywords

"good" permutations; Cipher systems; Complete maps; Enumeration of complete maps

Indexed keywords

EID: 33747230487     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02733401     Document Type: Article

References (5)

1. C. Cooper and I. N. Kovalenko, "Upper bound of the number of complete maps," Teor. Imovirn. Mat. Stat., No. 53, 69-75 (1995).
2. I. N. Kovalenko, "Upper bound on the number of complete maps," Kibern. Sist. Anal., No. 1, 81-85 (1996).
3. J. Denes and A. D. Keedwell, Latin Squares and Their Applications, English University Press, London (1974).
4. R. Konheim, Cryptography: A Primer, Wiley, Chichester (1991).
5. R. Hockings and S. Cheshire, Chelsea Football Club: The full statistical story 1905-1985, Ken Hockings, Middlesex.