SCIENCE CHINA Information Sciences, Volume 59 , Issue 9 : 099104(2016) https://doi.org/10.1007/s11432-015-0345-0

Algebraic techniques in slender-set differential cryptanalysis of PRESENT-like cipher

More info
  • ReceivedSep 15, 2015
  • AcceptedDec 29, 2015
  • PublishedAug 11, 2016




This work was supported by National Natural Science Foundation of China (Grant Nos. 61272488, 61402523), and Foundation of Science and Technology on Information Assurance Laboratory (Grant No. KJ-13-007).


[1] Borghoff J, Knudsen L, Leander G, et al. Cryptanalysis of PRESENT-like ciphers with secret S-boxes. Fast Softw Encryption, 2011, 6733: 270-289 Google Scholar

[2] Borghoff J, Knudsen L, Leander G, et al. Slender-set differential cryptanalysis. J Cryptol, 2013, 26: 11-38 CrossRef Google Scholar

[3] Liu G-Q, Jin C-H. Differential cryptanalysis of PRESENT-like cipher. Design Code Cryptogr, 2015, 76: 385-408 CrossRef Google Scholar

[4] Courtois N, Pieprzyk J. Cryptanalysis of block ciphers with overdefined systems of equations. In: Advances in Cryptology --- ASIACRYPT 2002. Berlin: Springer, 2002. 267--287. Google Scholar

[5] Buchberger B. Gröbner-bases: an algorithmic method in polynomial ideal theory. In: Multidimensional Systems Theory. Dordrecht: Reidel Publishing Company, 1985. 184--232. Google Scholar

[6] Chai F, Gao X S, Yuan C. A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers. J Syst Sci Complex, 2008, 21: 191-208 CrossRef Google Scholar