Maximums of the Additive Differential Probability of Exclusive-Or

被引:3
|
作者
Mouha, Nicky [1 ]
Kolomeec, Nikolay [2 ]
Akhtiamov, Danil [3 ]
Sutormin, Ivan [2 ]
Panferov, Matvey [4 ]
Titova, Kseniya [4 ]
Bonich, Tatiana [4 ]
Ishchukova, Evgeniya [5 ]
Tokareva, Natalia [2 ]
Zhantulikov, Bulat [4 ]
机构
[1] Strativia, Largo, MD 20774 USA
[2] Sobolev Inst Math, Novosibirsk, Russia
[3] Hebrew Univ Jerusalem, Jerusalem, Israel
[4] Novosibirsk State Univ, Novosibirsk, Russia
[5] Southern Fed Univ, Taganrog, Russia
关键词
Differential cryptanalysis; ARX; XOR; modular addition; DESIGN;
D O I
10.46586/tosc.v2021.i2.292-313
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
At FSE 2004, Lipmaa et al. studied the additive differential probability adp(circle plus)(alpha, beta -> gamma) of exclusive-or where differences alpha, beta, gamma is an element of F-2(n) are expressed using addition modulo 2(n). This probability is used in the analysis of symmetrickey primitives that combine XOR and modular addition, such as the increasingly popular Addition-Rotation-XOR (ARX) constructions. The focus of this paper is on maximal differentials, which are helpful when constructing differential trails. We provide the missing proof for Theorem 3 of the FSE 2004 paper, which states that max(alpha,beta) adp(circle plus)(alpha, beta -> gamma) = adp(circle plus)(0, gamma -> gamma) for all gamma. Furthermore, we prove that there always exist either two or eight distinct pairs alpha,beta such that adp(circle plus)(alpha, beta -> gamma) = adp(circle plus)(0, gamma -> gamma), and we obtain recurrence formulas for calculating adp(circle plus). To gain insight into the range of possible differential probabilities, we also study other properties such as the minimum value of adp(circle plus)(0, gamma -> gamma), and we find all gamma that satisfy this minimum value.
引用
收藏
页码:292 / 313
页数:22
相关论文
共 50 条
  • [1] On the additive differential probability of exclusive-or
    Lipmaa, Helger
    Wallén, Johan
    Dumas, Philippe
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3017 : 317 - 331
  • [2] On the additive differential probability of exclusive-Or
    Lipmaa, H
    Wallén, J
    Dumas, P
    FAST SOFTWARE ENCRYPTION, 2004, 3017 : 317 - 331
  • [3] On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation
    Kolomeec, Nikolay
    Sutormin, Ivan
    Bykov, Denis
    Panferov, Matvey
    Bonich, Tatyana
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2025, 17 (02): : 541 - 570
  • [4] AN EXCLUSIVE-OR GATE
    UZUNOGLU, V
    PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (03): : 418 - &
  • [5] OPTOELECTRONIC EXCLUSIVE-OR (XOR) GATE
    BEYETTE, FR
    GEIB, KM
    FELD, SA
    HAFICH, MJ
    AN, X
    ROBINSON, GY
    WILMSEN, CW
    IEEE PHOTONICS TECHNOLOGY LETTERS, 1993, 5 (06) : 686 - 688
  • [6] EXCLUSIVE-OR REPRESENTATIONS OF BOOLEAN FUNCTIONS
    FLEISHER, H
    TAVEL, M
    YEAGER, J
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1983, 27 (04) : 412 - 416
  • [7] GETTING MORE OUT OF EXCLUSIVE-OR
    GREGORY, V
    BARNES, J
    CONTROL ENGINEERING, 1975, 22 (03) : 79 - 80
  • [8] The inactive-active phase transition in the noisy additive (exclusive-or) probabilistic cellular automaton
    Mendonca, J. Ricardo G.
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2016, 27 (02):
  • [9] SUBNANOSECOND EXCLUSIVE-OR LOGIC CIRCUIT
    WHITEHEAD, DG
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1976, 40 (01) : 93 - 96
  • [10] MINIMIZATION OF EXCLUSIVE-OR LOGIC FUNCTIONS
    ZHANG, YZ
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 1990, 33 (04): : 477 - 485