International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Shiho Moriai

Affiliation: NICT, Japan

Publications

Year
Venue
Title
2017
FSE
2012
CHES
2007
FSE
2001
FSE
2001
FSE
2001
EPRINT
Efficient Algorithms for Computing Differential Properties of Addition
Helger Lipmaa Shiho Moriai
In this paper we systematically study the differential properties of addition modulo $2^n$. We derive $\Theta(\log n)$-time algorithms for most of the properties, including differential probability of addition. We also present log-time algorithms for finding good differentials. Despite the apparent simplicity of modular addition, the best known algorithms require naive exhaustive computation. Our results represent a significant improvement over them. In the most extreme case, we present a complexity reduction from $\Omega(2^{4n})$ to $\Theta(\log n)$.
2000
ASIACRYPT
1999
FSE
1998
FSE
1997
FSE
1995
CRYPTO

Program Committees

Asiacrypt 2020 (Program chair)
Asiacrypt 2019 (Program chair)
FSE 2018
FSE 2017
Eurocrypt 2014
FSE 2013 (Program chair)
CHES 2013
FSE 2012
FSE 2011
Eurocrypt 2003