Non-cryptographic primitive for pseudorandom permutation.
type: Item
instance of: scholarly article
title: Non-cryptographic primitive for pseudorandom permutation.
zbMATH Open document ID: 1059.68039
DOI: 10.1016/S0304-3975(03)00245-7
author: Tetsu Iwata
author: Tomonobu Yoshino
author: Kaoru Kurosawa
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 2056794
zbMATH Keywords: Block cipher
zbMATH Keywords: Pseudorandomness
zbMATH Keywords: MISTY type permutation
describes a project that uses: MISTY
MaRDI profile type: Publication
cites work: Universal classes of hash functions
cites work: New Results on the Pseudorandomness of Some Blockcipher Constructions
cites work: Round Security and Super-Pseudorandomness of MISTY Type Structure
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Faster Luby-Rackoff ciphers
cites work: New structure of block ciphers with provable security against differential and linear cryptanalysis
cites work: New block encryption algorithm MISTY
cites work: On the construction of pseudorandom permutations: Luby-Rackoff revisited
cites work: Q4536814
cites work: New hash functions and their use in authentication and set equality
full work available at URL: s0304-3975(03)00245-7
OpenAlex ID: W2078550030
description: scientific article; zbMATH DE number 2056794