Pseudorandomness of Camellia-like scheme

DOI10.1007/S11390-006-0082-0zbMath1190.94032OpenAlexW2087913627MaRDI QIDQ2508379

Wenling Wu

Publication date: 12 October 2006

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11390-006-0082-0

zbMATH Keywords

block cipherpseudorandomnessCamelliarandom functionsuper-pseudorandomness

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• Camellia

Cites Work

• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• A construction of a cipher from a single pseudorandom permutation.
• Round Security and Super-Pseudorandomness of MISTY Type Structure
• New Results on the Pseudorandomness of Some Blockcipher Constructions
• On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Faster Luby-Rackoff ciphers
• Selected Areas in Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudorandomness of Camellia-like scheme