Name
Abstract | ||
|---|---|---|
We define and analyze the security of a blockcipher mode of operation, CLOC, for provably secure authenticated encryption with associated data. The design of CLOC aims at optimizing previous schemes, CCM, EAX, and EAX-prime, in terms of the implementation overhead beyond the blockcipher, the precomputation complexity, and the memory requirement. With these features, CLOC is suitable for handling short input data, say 16 bytes, without needing precomputation nor large memory. This property is especially beneficial to small microprocessors, where the word size is typically 8 bits or 16 bits, and there are significant restrictions in the size and the number of registers. CLOC uses a variant of CFB mode in its encryption part and a variant of CBC MAC in the authentication part. We introduce various design techniques in order to achieve the above mentioned design goals. We prove CLOC secure, in a reduction-based provable security paradigm, under the assumption that the blockcipher is a pseudorandom permutation. We also present our preliminary implementation results. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-46706-0_8 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
CLOC,Blockcipher,Authenticated encryption with associated data,Security analysis,Efficiency analysis | Journal | 8540 |
ISSN | Citations | PageRank |
0302-9743 | 16 | 1.11 |
References | Authors | |
23 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tetsu Iwata | 1 | 545 | 50.28 |
| Kazuhiko Minematsu | 2 | 306 | 28.14 |
| Jian Guo | 3 | 294 | 24.22 |
| Sumio Morioka | 4 | 493 | 45.23 |