The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
(2007) · Brute Force · doi:10.1007/0-387-27160-0_3 · Cited by 934
A fast and simple randomized parallel algorithm for the maximal independent set problem
Alon, N., Babai, L., & Itai, A. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90019-2 · Cited by 823
Small-Bias Probability Spaces: Efficient Constructions and Applications
Naor, J., & Naor, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222053 · Cited by 560
Self-citationSimple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
Finite Permutation Groups and Finite Simple Groups
Cameron, P. J. (1981) · Bulletin of the London Mathematical Society · doi:10.1112/blms/13.1.1 · Cited by 526
LFSR-based Hashing and Authentication
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_15 · Cited by 491
The Security of Cipher Block Chaining
Bellare, M., Kilian, J., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_32 · Cited by 394
A construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1997) · Journal of Cryptology · doi:10.1007/s001459900025 · Cited by 351
A simple parallel algorithm for the maximal independent set problem
Luby, M. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22146 · Cited by 349
Universal hashing and authentication codes
Stinson, D. R. (1994) · Designs, Codes and Cryptography · doi:10.1007/bf01388651 · Cited by 292
Strong uniform times and finite random walks
Aldous, D., & Diaconis, P. (1987) · Advances in Applied Mathematics · doi:10.1016/0196-8858(87)90006-6 · Cited by 233
Pseudorandom functions revisited: the cascade construction and its concrete security
Bellare, M., Canetti, R., & Krawczyk, H. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548510 · Cited by 208
Unbalanced Feistel networks and block cipher design
Schneier, B., & Kelsey, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_49 · Cited by 202
On the power of two-point based sampling
Chor, B., & Goldreich, O. (1989) · Journal of Complexity · doi:10.1016/0885-064x(89)90015-0 · Cited by 191
How to Protect DES Against Exhaustive Key Search
Kilian, J., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_20 · Cited by 187
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
Naor, M., & Reingold, O. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1618 · Cited by 168
Self-citationTwo practical and provably secure block ciphers: BEAR and LION
Anderson, R., & Biham, E. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60865-6_48 · Cited by 122
Lucks, S. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60865-6_53 · Cited by 104
Bucket Hashing and its Application to Fast Message Authentication
Rogaway, P. (1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4_3 · Cited by 103
Tiny families of functions with random properties: A quality-size trade-off for hashing
Goldreich, O., & Wigderson, A. (1997) · Random Structures and Algorithms · Cited by 103
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
Maurer, U. M. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_21 · Cited by 78
Goldreich, O., & Wigderson, A. (1994) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/195058.195410 · Cited by 11
Cited by
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
Courtois, N. T., & Pieprzyk, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_17 · Cited by 688
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
Self-citationOn Cryptographic Assumptions and Challenges
Naor, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_6 · Cited by 360
Self-citationBellare, M., Ristenpart, T., Rogaway, P., & Stegers, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-05445-7_19 · Cited by 274
Halevi, S., & Rogaway, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_28 · Cited by 261
Metadata
- Authors
- Naor, M., & Reingold, O.
- Venue
- Journal of Cryptology
- Published
- 1999-01
- Volume
- 12
- Issue
- 1
- Pages
- 29-66
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W1972464518
- Cited by
- 285
- References
- 30
- FWCI
- 15.87
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.