Almost all current block-cipher-based MACs reduce their security to the pseudorandomness
of their underlying block ciphers, except for a few of them to the unpredictability, a strictly …

We design an efficient mode of operation on block ciphers, SS-NMAC. Our mode has the
following properties, when instantiated with a block cipher f to yield a variable-length, keyed …

I am most grateful to Professor Hideki Imai, my thesis supervisor, for his continuous support,
encouragement and guidance. I am also very grateful to Professor Tsutomu Matsumoto for …

In this paper, we propose TMAC. TMAC is a refinement of XCBC such that it requires only
two keys while XCBC requires three keys. More precisely, TMAC requires only (k+ n)-bit …

We suggest some simple variants of the CBC MAC that let you efficiently MAC messages of
arbitrary lengths. Our constructions use three keys, K1, K2, K3, to avoid unnecessary …

Recent advances in block-cipher theory deliver security analyses in models where one or
more underlying components (eg, a function or a permutation) are ideal (ie, randomly …

Abstract The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model
dating back to Shannon [25] and has seen frequent use in proving the security of various …

Lightweight cryptography strives to protect communication in constrained environments
without sacrificing security. However, security often conflicts with efficiency, shown by the …

In this paper, we define and analyze a new blockcipher mode of operation for encryption,
CENC, which stands for Cipher-based ENCryption. CENC has the following advantages:(1) …

Given any weak pseudorandom function, we present a general and efficient technique
transforming such a function to a new weak pseudorandom function with an arbitrary length …