14 Result(s)
within
Shiho Moriai
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
Privacy-Preserving Deep Learning: Revisited and Enhanced
We build a privacy-preserving deep learning system in which many learning participants perform neural network-based deep learning over a combined dataset of all, without actually revealing the participants’ lo...
-
Chapter and Conference Paper
Lightweight Cryptography for the Cloud: Exploit the Power of Bitslice Implementation
This paper shows the great potential of lightweight cryptography in fast and timing-attack resistant software implementations in cloud computing by exploiting bitslice implementation. This is demonstrated by b...
-
Chapter and Conference Paper
The 128-Bit Blockcipher CLEFIA (Extended Abstract)
We propose a new 128-bit blockcipher CLEFIA supporting key lengths of 128, 192 and 256 bits, which is compatible with AES. CLEFIA achieves enough immunity against known attacks and flexibility for efficient im...
-
Chapter and Conference Paper
Impossible Differential Cryptanalysis of Zodiac
We discuss the impossible differential cryptanalysis of the block cipher Zodiac [7]. The main design principles of Zodiac are simplicity and efficiency. However the diffusion layer in its round function is too si...
-
Chapter and Conference Paper
Efficient Algorithms for Computing Differential Properties of Addition
In this paper we systematically study the differential properties of addition modulo 2n. We derive Θ(logn)-time algorithms for most of the properties, including differential probability of addition. We also prese...
-
Chapter and Conference Paper
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
We present a new 128-bit block cipher called Camellia. Camellia supports 128-bit block size and 128-, 192-, and 256-bit keys, i.e., the same interface specifications as the Advanced Encryption Standard (AES). Eff...
-
Chapter and Conference Paper
Security of E2 against Truncated Differential Cryptanalysis
This paper studies the security offered by the block cipher E2 against truncated differential cryptanalysis. At FSE’99 Matsui and Tokita showed a possible attack on an 8-round variant of E2 without IT-Function (t...
-
Chapter and Conference Paper
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
Block ciphers are usually basedon one top-level scheme into which we plug “roundf unctions”. To analyze security, it is important to study the intrinsic security provided by the top-level scheme from the viewp...
-
Chapter and Conference Paper
Higher Order Differential Attack Using Chosen Higher Order Differences
This paper introduces an improved higher order differential attack using chosen higher order differences. We can find a lower order of the higher order differential by choosing higher order differences. It fol...
-
Chapter and Conference Paper
Interpolation Attacks of the Block Cipher: SNAKE
This paper presents an efficient interpolation attack using a computer algebra system. The interpolation attack proposed by Jakobsen and Knudsen was shown to be effective for attacking ciphers that use simple ...
-
Chapter and Conference Paper
Improving the higher order differential attack and cryptanalysis of the KN cipher
Since the proposal of differential cryptanalysis and linear cryptanalysis in 1991 and 1993, respectively, the resistance to these cryptanalyses have been studied for many cryptosystems. Moreover, some block ci...
-
Chapter and Conference Paper
Higher Order Differential Attack of a CAST Cipher
This paper proposes a new higher order differential attack. The higher order differential attack proposed at FSE’97 by Jakobsen and Knudsen used exhaustive search for recovering the last round key. Our new att...
-
Chapter and Conference Paper
Best differential characteristic search of FEAL
This paper presents the results of the best differential characteristic search of FEAL.
-
Chapter and Conference Paper
Improving the Search Algorithm for the Best Linear Expression
It is important to find the best linear expression to estimate the vulnerability of crytosystems to Linear Cryptanalysis. This paper presents a method to improve Matsui’s search algorithm which determines the ...
