Ciphers with Arbitrary Finite Domains
- 8 February 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 114-130
- https://doi.org/10.1007/3-540-45760-7_9
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Encrypted key exchange: password-based protocols secure against dictionary attacksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Security of the Cipher Block Chaining Message Authentication CodeJournal of Computer and System Sciences, 2000
- On the Construction of Variable-Input-Length CiphersLecture Notes in Computer Science, 1999
- Towards Making Luby-Rackoff Ciphers Optimal and PracticalLecture Notes in Computer Science, 1999
- On the Construction of Pseudorandom Permutations: Luby—Rackoff RevisitedJournal of Cryptology, 1999
- Pseudorandomness and Cryptographic ApplicationsPublished by Walter de Gruyter GmbH ,1996
- Information HidingPublished by Springer Science and Business Media LLC ,1996
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986