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 条
  • [31] ALGORITHM FOR GENERATING OPTIMAL TESTS FOR EXCLUSIVE-OR NETWORKS
    DEBANY, WH
    HARTMANN, CRP
    SNETHEN, TJ
    IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1991, 138 (02): : 93 - 96
  • [32] Area minimization of Exclusive-OR intensive circuits in FPGAs
    Ko, SB
    JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2004, 20 (06): : 661 - 665
  • [33] A quantum algorithm for finding minimum exclusive-or expressions
    Sampson, M.
    Voudouris, D.
    Papakonstantinou, G.
    IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS: EMERGING VLSI TECHNOLOGIES AND ARCHITECTURES, 2007, : 416 - +
  • [34] On fault-tolerant design of Exclusive-OR gates in QCA
    Kumar, Dharmendra
    Mitra, Debasis
    Bhattacharya, Bhargab B.
    JOURNAL OF COMPUTATIONAL ELECTRONICS, 2017, 16 (03) : 896 - 906
  • [35] 2 DIODES FORM HIGH-POWER EXCLUSIVE-OR
    MCKAY, JE
    EDN MAGAZINE-ELECTRICAL DESIGN NEWS, 1977, 22 (06): : 149 - &
  • [36] EXCLUSIVE-OR ICS SERVE FOR PHASE-LOCKING TASKS
    OSHIRO, GS
    ELECTRONICS, 1970, 43 (13): : 83 - &
  • [37] Image Encryption Using the Recursive Attributes of the eXclusive-OR Filter
    Chatzichristofis, Savvas A.
    Bampis, Loukas
    Marques, Oge
    Lux, Mathias
    Boutalis, Yiannis
    JOURNAL OF CELLULAR AUTOMATA, 2014, 9 (2-3) : 125 - 137
  • [38] On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
    Selezneva S.N.
    Moscow University Computational Mathematics and Cybernetics, 2014, 38 (2) : 64 - 68
  • [39] An all-optical parallel scheme for the exclusive-or operation
    Song, Q.
    Cai, P.
    Wang, P. X.
    OPTICS COMMUNICATIONS, 2012, 285 (15) : 3281 - 3283
  • [40] Implementation of the Exclusive-Or Function in a Hopfield Style Recurrent Network
    Roelof Brouwer
    Neural Processing Letters, 1997, 5 : 1 - 7