![](bg6.png)
Table 3: State-of-art regarding cryptanalysis of Simon-64/128.
Authors Rounds Attacked Type Time Data Memory
(Farzaneh et al., 2013) 24/44 Diff 2
58.427
2
62.012
2
32
(Farzaneh et al., 2013) 16/44 Imp-Diff 2
91.986
2
65.248
2
60.203
(Alkhzaimi and Lauridsen, 2013) 26/44 Diff 2
94.0
2
63.0
2
31.0
(Biryukov et al., 2014) 26/44 Diff 2
121.0
2
63.0
2
31.0
This paper 9/44 Alg 2
29.8
2
2.59
negl.
This paper 10/44 Alg 2
118.5
2
3.0
negl.
This paper 10/44 Trunc-Diff-Alg 2
98.79
2
17
negl.
REFERENCES
Alkhzaimi, H. and Lauridsen, M. (2013). Differential and
linear cryptanalysis of reduced-round simon. In Cryp-
tology ePrint Archive, Report 2013/543.
Aysu, A., Gulcan, E., and Schaumont, P. (2014). Simon
says, break the area records for symmetric key block
ciphers on fpgas. In Cryptology ePrint Archive, Re-
port 2014/237.
Bard, G., Courtois, N., and Jefferson, C. (2007). Efficient
methods for conversion and solution of sparse systems
of low-degree multivariate polynomials over gf(2) via
sat-solvers.
Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S.,
Weeks, B., and Wingers, L. (2013). The simon and
speck families of lightweight block ciphers. In Cryp-
tology ePrint Archive, Report 2013/404.
Biryukov, A., A. Roy, A., and Velichkov, V. (2014). Dif-
ferential analysis of block ciphers simon and speck.
In 21st International Workshop on Fast Software En-
cryption, FSE 2014.
Boyar, J., Find, M., and Peralta, R. (2013). Four measures
of nonlinearity. In In Algorithms and Complexity, pp.
61-72. Springer Berlin Heidelberg.
Boyar, J. and Peralta, R. (2010). A new combinational logic
minimization technique with applications to cryptol-
ogy.
Boyar, J., Peralta, R., and Pochuev, D. (2000). On the mul-
tiplicative complexity of boolean functions over the
basis. In Theoretical Computer Science 235, no. 1,
pp. 43-57.
Courtois, N. and Bard, G. (2007). Algebraic cryptanalysis
of the data encryption standard. In In IMA Int. Conf.
volume 4887, Springer.
Courtois, N., Gawinecki, J., and Song, G. (2012a). Contra-
diction immunity and guess-then-determine attacks on
gost. In In Tatra Mountains Mathematic Publications,
Vol. 53 no. 3, pp. 65-79.
Courtois, N., Hulme, D., and Mourouzis, T. (2011). Solv-
ing circuit optimisation problems in cryptography and
cryptanalysis. In In electronic proceedings of 2nd IMA
Conference Mathematics in Defence 2011.
Courtois, N., Mourouzis, T., and Hulme, D. (2013). Exact
logic minimization and multiplicative complexity of
concrete algebraic and cryptographic circuits. In To
Appear in IARIA Journal: IntSys13v6n34.
Courtois, N., Mourouzis, T., and Song, G. (2014).
Reference implementation of simon and
speck and a basic generator of equations -
https://github.com/gsonghashrate/simonspeck/.
Courtois, N., Sepehrdad, P., Susil, P., and Vaudenay, S.
(2012b). Elimlin algorithm revisited. In Fast Software
Encryption, pp. 306-325, Springer Berlin Heidelberg.
Farzaneh, A., List, E., Lucks, S., and Wenzel, J. (2013). Dif-
ferential and linear cryptanalysis of reduced-round si-
mon. In Cryptology ePrint Archive, Report 2013/526.
Faugere, J.-C. (1999). A new efficient algorithm for com-
puting grobner bases (f4). In Journal of pure and ap-
plied Algebra, Vol. 139, pp. 61-88.
Knudsen, L. (1995). Truncated and higher order differen-
tials. In In Fast Software Encryption, pp. 196-211,
Springer Berlin Heidelberg.
Semaev, I. and Mikus, M. (2010). Methods to solve alge-
braic equations in cryptanalysis. In In Tatra Moun-
tains Mathematic Publications, Vol. 45, pp. 107-136.
Shannon, C. (1949). Communication theory of secrecy sys-
tems. In Bell System Technical Journal 28.
Susil, P., Sepehrdad, P., and Vaudenay, S. (2014). On selec-
tion of samples in algebraic attacks and a new tech-
nique to find hidden low degree equations. In ACISP.
SECRYPT2014-InternationalConferenceonSecurityandCryptography
404