Abstract
Pseudo random sequences of integers are most commonly generated by linear congruence methods [5] or by linear shift registers [1]. These sequences can be used in cryptology if they are cryptographically secure [9]:
-
A pseudo-random sequence is cryptographically secure if given any segment of the sequence, it is computationally infeasible to compute other segments of the sequence.
This work was supported by the Natural Sciences and Engineering Research Council of Canada under Strategic Grant G0381.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Beker and F. Piper, Cipher Systems, John Wiley, 1982.
L. Blum, M. Blum and M. Shub, Comparison of two pseudo-random generators, Proceedings of Crypto 1982.
M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo random bits, FOCS, 1982.
G.D. Knott, A numbering system for permutations and combinations, Communications of the ACM Vol. 19, No. 6, June 1976.
D.E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, 1981.
D.E. Knuth, Deciphering a linear congruential encryption, Technical Report 024800, Stanford University, 1980.
J.B. Plumstead, Inferring a sequence generated by a linear congruence, FOCS, 1982.
J. Reeds, Cracking a random number generator, Cryptologia, Vol. 1, January 1977.
A. Shamir, On the generation of cryptographically strong pseudorandom sequences, ACM Transactions on Computer Systems, Vol. 1, No. 1, February 1983.
U.V. Vazirani and V.V. Vazirani, Trapdoor pseudo-random number generators with applications to protocol design, FOCS, 1983.
A. Yao, Theory and applications of trapdoor functions, FOCS, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akl, S.G., Meijer, H. (1985). A Fast Pseudo Random Permutation Generator With Applications to Cryptology. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_21
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive