scientific article; zbMATH DE number 177029

zbMATH Open0779.65005MaRDI QIDQ4036865FDOQ4036865

Authors: Josef Pieprzyk 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 503343
• A construction of the simplest super pseudorandom permutation generator
• scientific article; zbMATH DE number 1559534
• On the construction of pseudorandom permutations: Luby-Rackoff revisited

zbMATH Keywords

pseudorandom functionrandom number generatorspermutation generatorscryptographic randomnessDES application

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Cited In (13)

• Some applications of IFS based on square symmetries
• Title not available (Why is that?)
• About Feistel schemes with six (or more) rounds
• A construction of the simplest super pseudorandom permutation generator
• Feistel ciphers based on a single primitive
• Title not available (Why is that?)
• Luby-Rackoff Ciphers from Weak Round Functions?
• Keyed sum of permutations: a simpler RP-based PRF
• Pseudorandomness of Camellia-like scheme
• Constructing pseudo-random permutations with a prescribed structure
• Pseudorandom permutation
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036865)