Welcome to the resource topic for 2001/001
Title:
Efficient Algorithms for Computing Differential Properties of Addition
Authors: Helger Lipmaa, Shiho Moriai
Abstract: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).
ePrint: https://eprint.iacr.org/2001/001
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .