IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
Optimality of Tweak Functions in CLOC
Hayato KOBAYASHIKazuhiko MINEMATSUTetsu IWATA
Author information
JOURNALS RESTRICTED ACCESS

2015 Volume E98.A Issue 10 Pages 2152-2164

Details
Abstract

An Authenticated Encryption scheme is used to guarantee both privacy and authenticity of digital data. At FSE 2014, an authenticated encryption scheme called CLOC was proposed. CLOC is designed to handle short input data efficiently without needing heavy precomputation nor large memory. This is achieved by making various cases of different treatments in the encryption process depending on the input data. Five tweak functions are used to handle the conditional branches, and they are designed to satisfy 55 differential probability constraints, which are used in the security proof of CLOC. In this paper, we show that all these 55 constraints are necessary. This shows the design optimality of the tweak functions in CLOC in that the constraints cannot be relaxed, and hence the specification of the tweak functions cannot be simplified.

Information related to the author
© 2015 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top