12 Result(s)
within
Computer Science
Cryptology
Management of Computing and Information Systems
Yosuke Todo
Chapter
Conference Paper
-
Chapter and Conference Paper
Improved Integral Attack on HIGHT
HIGHT is a lightweight block cipher with 64-bit block length and 128-bit security, and it is based on the ARX-based generalized Feistel network. HIGHT became a standard encryption algorithm in South Korea and ...
-
Chapter and Conference Paper
Division Property: Efficient Method to Estimate Upper Bound of Algebraic Degree
We proposed the division property, which is a new method to find integral characteristics, at EUROCRYPT2015. Then, we applied this technique to analyze the full MISTY1 at CRYPTO2015. After the proposal of the ...
-
Chapter and Conference Paper
Analyzing Key Schedule of Simon: Iterative Key Differences and Application to Related-Key Impossible Differentials
The current paper analyzes the key schedule function of lightweight block cipher Simon, which was designed by NSA in 2013. In particular, a list of all iterative key differences is provided for all members of the...
-
Chapter and Conference Paper
New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
In this paper, a new tool searching for impossible differentials is presented. Our tool can detect any contradiction between input and output differences. It can also take into account the property inside the ...
-
Chapter and Conference Paper
Nonlinear Invariant Attack
In this paper we introduce a new type of attack, called nonlinear invariant attack. As application examples, we present new attacks that are able to distinguish the full versions of the (tweakable) block ciphers
-
Chapter and Conference Paper
Compact Representation for Division Property
The division property, which is a new method to find integral characteristics, was proposed at Eurocrypt 2015. Thereafter, some applications and improvements have been proposed. The bit-based division property...
-
Chapter and Conference Paper
Bit-Based Division Property and Application to Simon Family
Ciphers that do not use S-boxes have been discussed for the demand on lightweight cryptosystems, and their round functions consist of and, rotation, and xor. Especially, the Simon family is one of the most famous...
-
Chapter and Conference Paper
Wide Trail Design Strategy for Binary MixColumns
AES is one of the most common block ciphers and many AES-like primitives have been proposed. Recently, many lightweight symmetric-key cryptographic primitives have also been proposed. Some such primitives requ...
-
Chapter and Conference Paper
How Much Can Complexity of Linear Cryptanalysis Be Reduced?
The linear cryptanalysis proposed by Matsui is one of the most effective attacks on block ciphers, and he demonstrated an experimental cryptanalysis against DES at CRYPTO 1994. In this paper, we show how to op...
-
Chapter and Conference Paper
Structural Evaluation by Generalized Integral Property
In this paper, we show structural cryptanalyses against two popular networks, i.e., the Feistel Network and the Substitute-Permutation Network (SPN). Our cryptanalyses are distinguishing attacks by an improved...
-
Chapter and Conference Paper
FFT Key Recovery for Integral Attack
An integral attack is one of the most powerful attacks against block ciphers. We propose a new technique for the integral attack called the Fast Fourier Transform (FFT) key recovery. When the integral distingu...
-
Chapter and Conference Paper
Upper Bounds for the Security of Several Feistel Networks
In this paper, we are dealing with upper bounds for the security of some Feistel networks. Such a topic has been discussed since the introduction of Luby-Rackoff construction, but it is unrealistic constructio...
