Non-cryptographic primitive for pseudorandom permutation.

DOI10.1016/S0304-3975(03)00245-7zbMath1059.68039OpenAlexW2078550030MaRDI QIDQ1426446

Kaoru Kurosawa, Tetsu Iwata, Tomonobu Yoshino

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00245-7

zbMATH Keywords

Block cipherMISTY type permutationPseudorandomness

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data encryption (aspects in computer science) (68P25)

Uses Software

• MISTY

Cites Work

• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Round Security and Super-Pseudorandomness of MISTY Type Structure
• New Results on the Pseudorandomness of Some Blockcipher Constructions
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Faster Luby-Rackoff ciphers
• New structure of block ciphers with provable security against differential and linear cryptanalysis
• New block encryption algorithm MISTY
• Unnamed Item

This page was built for publication: Non-cryptographic primitive for pseudorandom permutation.