Faculty Profiles - IWATA Tetsu

Papers - IWATA Tetsu

Division display 61 - 80 of about 108 ／ All the affair displays >>

Cryptanalysis of 256-bit key HyRAL via equivalent keys Reviewed

Yuki Asano, Shingo Yanagihara, and Tetsu Iwata

ACNS 2012, Lecture Notes in Computer Science, Springer ( LNCS 7341 ) page： 257–274 2012.6

Further more on key wrapping Reviewed

Yasushi Osaki and Tetsu Iwata

IEICE Trans. Fundamentals Vol. Vol. E95-A ( No. 1 ) page： 8-20 2012.1

Security of Hash-then-CBC Key wrapping revisited Reviewed

Yasushi Osaki and Tetsu Iwata

IMACC 2011, Lecture Notes in Computer Science, Springer ( LNCS 7089 ) page： 413-430 2011.12

Building blockcipher from tweakable Blockcipher: Extending FSE 2009 proposal Reviewed

Kazuhiko Minematsu and Tetsu Iwata

IMACC 2011, Lecture Notes in Computer Science, Springer ( LNCS 7089 ) page： 391-412 2011.12

On permutation layer of Type 1, Source-Heavy, Target-Heavy Generalized Feistel structures Reviewed

Shingo Yanagihara and Tetsu Iwata

CANS 2011, Lecture Notes in Computer Science, Springer ( LNCS 7092 ) page： 98-117 2011.12

Further more on key wrapping Reviewed

Yasushi Osaki and Tetsu Iwata

Conference record of Symmetric Key Encryption Workshop (SKEW) 2011 page： 1-20 2011.2

MPP characteristics of variants of Merkle-Damg{\aa}rd iterated hash functions Reviewed

Shungo Nakamura and Tetsu Iwata

IEICE Trans. Fundamentals Vol. Vol. E93-A ( No. 1 ) page： 93-101 2010.1

Tweakable pseudorandom permutation from generalized Feistel structure Reviewed

Atsushi Mitsuda and Tetsu Iwata

IEICE Trans. Fundamentals Vol. Vol. E93-A ( No. 1 ) page： 13-21 2010.1

*BTM: A single-key, inverse-cipher-free mode for deterministic authenticated encryption Reviewed

Tetsu Iwata and Kan Yasuda

Selected Areas in Cryptography, SAC 2009, Lecture Notes in Computer Science, Springer ( LNCS 5867 ) page： 313-330 2009.8

Language：English

We present a new blockcipher mode of operation named BTM, which stands for Bivariate Tag Mixing. BTM falls into the category of Deterministic Authenticated Encryption, which we call DAE for short. BTM makes all-around improvements over the previous two DAE constructions, SIV (Eurocrypt 2006) and HBS (FSE 2009). Specifically, our BTM requires just one blockcipher key, whereas SIV requires two.
Our BTM does not require the decryption algorithm of the underlying blockcipher, whereas HBS does. The BTM mode utilizes bivariate polynomial hashing for authentication, which enables us to handle vectorial inputs of dynamic dimensions. BTM then generates an initial value for its countermode of encryption by mixing the resulting tag with one of the two variables (hash keys), which avoids the need for an implementation of the inverse cipher.

*HBS: A single-key mode of operation for deterministic authenticated encryption Reviewed

Tetsu Iwata and Kan Yasuda

Fast Software Encryption, FSE 2009, Lecture Notes in Computer Science, Springer ( LNCS 5665 ) page： 394-415 2009.2

Authorship：Lead author Language：English

We propose the HBS (Hash Block Stealing) mode of operation. This is the first single-key mode that provably achieves the goal of providing deterministic authenticated encryption. The authentication part of HBS utilizes a newly-developed, vector-input polynomial hash function. The encryption part uses a blockcipher-based, counter-like mode. These two parts are combined in such a way as the numbers of finite-field multiplications and blockcipher calls are minimized. Specifically, for a header of h blocks and a message of m blocks, the HBS algorithm requires just h + m + 2 multiplications in the finite field and m + 2 calls to the blockcipher. Although the HBS algorithm is fairly simple, its security proof is rather complicated.

Tweakable pseudorandom permutation from generalized Feistel structure Reviewed

Atsushi Mitsuda and Tetsu Iwata

Second International Conference, ProvSec 2008, Lecture Notes in Computer Science, Springer ( LNCS 5324 ) page： 22-37 2008.10

Bounds on fixed input/output length post-processing functions for biased physical random number generators Reviewed

Kyohei Suzuki and Tetsu Iwata

Selected Areas in Cryptography, SAC 2008, Lecture Notes in Computer Science, Springer ( LNCS 5381 ) page： 373-386 2008.8

Authenticated encryption mode for beyond the birthday bound security Reviewed

Tetsu Iwata

Progress in Cryptology, AFRICACRYPT 2008, Lecture Notes in Computer Science, Springer ( LNCS 5023 ) page： 125-142 2008.6

Security of the five-round KASUMI type permutation Reviewed

Tetsu Iwata, Tohru Yagi and Kaoru Kurosawa

IEICE Trans. Fundamentals Vol. Vol. E91-A ( No. 1 ) page： 30-38 2008.1

*The 128-bit blockcipher CLEFIA Reviewed

Taizo Shirai, Kyoji Shibutani, Toru Akishita, Shiho Moriai and Tetsu Iwata

Fast Software Encryption, FSE 2007, Lecture Notes in Computer Science, Springer ( LNCS 4593 ) page： 181-195 2007.3

How to construct super-pseudorandom permutations with short keys Reviewed

Tetsu Iwata and Kaoru Kurosawa

IEICE Trans. Fundamentals Vol. Vol. E90-A ( No. 1 ) page： 2-13 2007.1

Side channel attacks on message authentication codes Reviewed

Katsuyuki Okeya and Tetsu Iwata

IPSJ Journal Vol. Vol. 47 ( No. 8 ) page： 2571-2581 2006.8

*New blockcipher modes of operation with beyond the birthday bound security Reviewed

Tetsu Iwata

Fast Software Encryption, FSE 2006, Lecture Notes in Computer Science, Springer ( LNCS 4047 ) page： 310-327 2006.3

Authorship：Lead author Language：English

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) beyond the birthday bound security, (2) security proofs with the standard PRP assumption, (3) highly efficient, (4) single blockcipher key, (5) fully parallelizable, (6) allows precomputation of keystream, and (7) allows random access. CENC is based on the new construction of "from PRPs to PRF conversion," which is of independent interest. Based on CENC and a universal hash-based MAC (Wegman-Carter MAC), we also define a new authenticated-encryption with associated-data scheme, CHM, which stands for CENC with Hash-based MAC. The
security of CHM is also beyond the birthday bound.

Side channel attacks on message authentication codes Reviewed

Katsuyuki Okeya and Tetsu Iwata

Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005, Lecture Notes in Computer Science, Springer ( LNCS 3813 ) page： 205-217 2005.6

How to enhance the security of the 3GPP confidentiality and integrity algorithms Reviewed

Tetsu Iwata and Kaoru Kurosawa

Fast Software Encryption, FSE 2005, Lecture Notes in Computer Science, Springer ( LNCS 3557 ) page： 268-283 2005.2

　 PREV - NEXT 　

<IWATA Tetsu>

Papers - IWATA Tetsu