Article

Free access

Pseudo-random permutation generators and cryptographic composition

Authors:

M Luby,

C RackoffAuthors Info & Claims

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

Pages 356 - 363

https://doi.org/10.1145/12130.12167

Published: 01 November 1986 Publication History

PDF eReader

References

[1]

Bamford, J., The Puzzle Palace." A Report on America's Most Secret Agency, Penguin Books Publishers, 1983

Google Scholar

[2]

Blare, M., Micali, S., How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, J~, f l?gq), SIAM Journal of Computing, preliminary version in 23 rd Annual Symposium on Foundations of Computer Science, November 3-5, 1982, pp 112-117

Google Scholar

[3]

Denning, D., Cryptography and Data Security, January, 1983, Addison-Wesley Puslishing Company, Inc.

Digital Library

Google Scholar

[4]

Goldreich, 0., Goldwasser, S., Micali, S., How to Construct Random Functions, Proceedings of the 25 th Annual Symposium on Foundations of Computer Science, October 24-26, 1984

Google Scholar

[5]

Hodges, A., _41an Turing: The Enigma of Intelligence, Unwin Paperbacks, 1985

Google Scholar

[6]

Yao, A.C., Theory and Applications of Trapdoor Functions,23 rd Annual Symposium on Foundations of Computer Science, November 3-5, 1982, pp 112-117

Google Scholar

Cited By

View all

Khurana DTomer KMohar BShinkar IO'Donnell R(2024)Commitments from Quantum One-WaynessProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649654(968-978)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649654
Malavolta GMorimae TWalter MYamakawa T(2024)Exponential Quantum One-Wayness and EFI PairsSecurity and Cryptography for Networks10.1007/978-3-031-71070-4_6(121-138)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71070-4_6
Meça A(2023)Exploring Data Encryption Standard (DES) Through CrypTool Implementation: A Comprehensive Examination and Historical PerspectiveEmerging Technologies in Computing10.1007/978-3-031-50215-6_10(143-160)Online publication date: 20-Dec-2023
https://doi.org/10.1007/978-3-031-50215-6_10
Show More Cited By

Index Terms

Pseudo-random permutation generators and cryptographic composition

Recommendations

Simple extractors via constructions of cryptographic pseudo-random generators

Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) ...
Practical Seed-Recovery of Fast Cryptographic Pseudo-Random Number Generators
Applied Cryptography and Network Security
Abstract
Trifork is a family of pseudo-random number generators described in 2010 by Orue et al. It is based on Lagged Fibonacci Generators and has been claimed as cryptographically secure. In 2017 was presented a new family of lightweight pseudo-random ...
Splittable pseudorandom number generators using cryptographic hashing
Haskell '13: Proceedings of the 2013 ACM SIGPLAN symposium on Haskell

We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash function. Splittable PRNGs, in contrast to linear PRNGs, allow the creation of two (seemingly) independent generators from a given random number generator. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

November 1986

461 pages

ISBN:0897911938

DOI:10.1145/12130

Chairman:
Juris Hartmanis

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC86

Sponsor:

SIGACT

STOC86: Eighteenth Annaul ACM Symposium on Theory of Computing

May 28 - 30, 1986

California, Berkeley, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
1,422
Total Downloads

Downloads (Last 12 months)222
Downloads (Last 6 weeks)14

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Khurana DTomer KMohar BShinkar IO'Donnell R(2024)Commitments from Quantum One-WaynessProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649654(968-978)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649654
Malavolta GMorimae TWalter MYamakawa T(2024)Exponential Quantum One-Wayness and EFI PairsSecurity and Cryptography for Networks10.1007/978-3-031-71070-4_6(121-138)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71070-4_6
Meça A(2023)Exploring Data Encryption Standard (DES) Through CrypTool Implementation: A Comprehensive Examination and Historical PerspectiveEmerging Technologies in Computing10.1007/978-3-031-50215-6_10(143-160)Online publication date: 20-Dec-2023
https://doi.org/10.1007/978-3-031-50215-6_10
Morimae TYamakawa T(2022)Quantum Commitments and Signatures Without One-Way FunctionsAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15802-5_10(269-295)Online publication date: 12-Oct-2022
https://doi.org/10.1007/978-3-031-15802-5_10
Bartusek JColadangelo AKhurana DMa F(2021)One-Way Functions Imply Secure Computation in a Quantum WorldAdvances in Cryptology – CRYPTO 202110.1007/978-3-030-84242-0_17(467-496)Online publication date: 11-Aug-2021
https://doi.org/10.1007/978-3-030-84242-0_17
Fitzi MGaži PKiayias ARussell A(2020)Ledger Combiners for Fast SettlementTheory of Cryptography10.1007/978-3-030-64375-1_12(322-352)Online publication date: 9-Dec-2020
https://doi.org/10.1007/978-3-030-64375-1_12
Guo CShen YWang LGu D(2019)Beyond-birthday secure domain-preserving PRFs from a single permutationDesigns, Codes and Cryptography10.1007/s10623-018-0528-887:6(1297-1322)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10623-018-0528-8
Dijkhuizen NHam J(2018)A Survey of Network Traffic Anonymisation Techniques and ImplementationsACM Computing Surveys10.1145/318266051:3(1-27)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3182660
Seferian VKanj RChehab AKayssi A(2018)Identity Based Key Distribution Framework for Link Layer Security of AMI NetworksIEEE Transactions on Smart Grid10.1109/TSG.2016.26280909:4(3166-3179)Online publication date: Jul-2018
https://doi.org/10.1109/TSG.2016.2628090
Guo CWang L(2018)Revisiting Key-Alternating Feistel Ciphers for Shorter Keys and Multi-user SecurityAdvances in Cryptology – ASIACRYPT 201810.1007/978-3-030-03326-2_8(213-243)Online publication date: 27-Oct-2018
https://doi.org/10.1007/978-3-030-03326-2_8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Simple extractors via constructions of cryptographic pseudo-random generators

Practical Seed-Recovery of Fast Cryptographic Pseudo-Random Number Generators

Splittable pseudorandom number generators using cryptographic hashing