Open AccessA Pseudorandom-Function Mode Based on Lesamnta-LW and the MDP Domain Extension and Its Applications
Author(s) -
Shoichi Hirose,
Hidenori Kuwakado,
Hirotaka Yoshida
Publication year - 2017
Publication title -
ieice transactions on fundamentals of electronics communications and computer sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.188
H-Index - 52
eISSN - 1745-1337
pISSN - 0916-8508
DOI - 10.1587/transfun.e101.a.110
Subject(s) - pseudorandom permutation , pseudorandom number generator , pseudorandom function family , padding , block cipher , hash function , computer science , block cipher mode of operation , algorithm , extension (predicate logic) , initialization , permutation (music) , block (permutation group theory) , mathematics , cryptography , combinatorics , physics , computer security , acoustics , programming language
This paper discusses a mode for pseudorandom functions (PRFs) based on the hashing mode of Lesamnta-LW and the domain extension called Merkle-Damgård with permutation (MDP). The hashing mode of Lesamnta-LW is a plain Merkle-Damgård iteration of a block cipher with its key size half of its block size. First, a PRF mode is presented which produces multiple independent PRFs with multiple permutations and initialization vectors if the underlying block cipher is a PRP. Then, two applications of the PRF mode are presented. One is a PRF with minimum padding. Here, padding is said to be minimum if the produced message blocks do not include message blocks only with the padded sequence for any non-empty input message. The other is a vector-input PRF using the PRFs with minimum padding. key words: compression function, MAC, provable security, pseudorandom function, vector-input PRF
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom