Abstract
We prove relationships between the security of a function generator when used in an encryption scheme and the security of a function generator when used in a UNIX-like password scheme.
References
Blum, M., and Micali, S., How to generate cryptographically strong sequences of pseudorandom bits,SIAM J. Comput. Vol. 13, 1984, pp. 850–864.
Denning, D.,Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983.
Goldreich, O., Goldwasser, S., and Micali, S., How to construct random functions,J. Assoc. Comput. Mach., Vol. 33, No. 4, October 1986, pp. 792–807.
Luby, M., and Rackoff, C., Pseudo-random permutation generators and cryptographic composition,Proceedings of the 18th ACM Annual Symposium on Theory of Computing, May 28–30, 1986, pp. 356–363.
Luby, M., and Rackoff, C., How to construct pseudo-random permutations from pseudorandom functions,SIAM J. Comput., Vol. 17, 1988, pp. 373–386.
Luby, M., and Rackoff, C., A study of password security,Proceedings of Crypto '87, Lecture Notes in Computer Science, Vol. 293, Springer-Verlag, Berlin 1988, pp. 392–397.
Yao, A. C., Theory and applications of trapdoor functions,Proceedings of the 23rd Symposium on the Foundations of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Additional information
On leave of absence from the Computer Science Department, University of Toronto. Research partially supported by the Canadian Natural Sciences and Engineering Research Council Operating Grant A8092 and by a University of Toronto research grant.
Research partially supported by the Canadian Natural Sciences and Engineering Research Council Operating Grant A3611.
Rights and permissions
About this article
Cite this article
Luby, M., Rackoff, C. A study of password security. J. Cryptology 1, 151–158 (1989). https://doi.org/10.1007/BF02252873
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02252873
Key words
- Password security
- UNIX
- Pseudorandom function generator