A Pseudorandom-Function Mode Based on Lesamnta-LW and the MDP Domain Extension and Its Applications

Shoichi HIROSE  Hidenori KUWAKADO  Hirotaka YOSHIDA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.1   pp.110-118
Publication Date: 2018/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.110
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)
Category: 
Keyword: 
compression function,  MAC,  provable security,  pseudorandom function,  vector-input PRF,  

Full Text: PDF(959.2KB)
>>Buy this Article


Summary: 
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.