Algebraic Techniques in Linear Cryptanalysis

Hong Ru Wei; Ya Fei   Zheng

doi:10.4028/www.scientific.net/AMR.756-759.3634

Paper Titles

Control Algorithm Optimization of Electric Air Conditioning Based on ADVISOR
p.3611

A Cross-Entropy Method for Solving Passenger Flow Routing Problem
p.3617

Code-Switching Speech Detection Method by Combination of Language and Acoustic Information
p.3622

The Strong Convergence of a New Iterative Algorithm for Asymptotically Nonexpansive Mappings
p.3628

Algebraic Techniques in Linear Cryptanalysis
p.3634

An Evaluation Method of Combat Service Operation Performance for Surface-to-Air Missile Based on FNN
p.3640

A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem
p.3647

Imbalanced Data Detection Kernel Method in Closed Systems
p.3652

Parallel Outlier Detection in Dial-Back Fraud Calls
p.3659

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759Algebraic Techniques in Linear Cryptanalysis

Algebraic Techniques in Linear Cryptanalysis

Abstract:

Linear cryptanalysis is a statistical analysis method. Linear cryptanalysis constructs probabilistic patterns first and then distinguishes the cipher from a random permutation using lots of plaintext-ciphertext pairs. Linear cryptanalysis has a big data complexity. Algebraic attack attempts to exploit the algebraic structure of the cipher by expressing the encryption transformation as a set of polynomial equations and then attempts to solve the system to recover the encryption key. Algebraic attacks do not need too much data. This paper combines these two methods by using algebraic techniques in linear cryptanalysis, and proposes a new cryptanalysis method called Algebraic Techniques in Linear Cryptanalysis. This new method is used in the existing linear cryptanalysis of PRESENT. To recover 8-bit key information of 21-round PRESENT, the data complexity is2'and the time complexity is 2'.Compared with the result of linear cryptanalysis, the data complexity is obviously decreased.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

3634-3639

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.3634

Citation:

Cite this paper

Online since:

September 2013

Authors:

Hong Ru Wei, Ya Fei Zheng

Keywords:

Algebraic Attack, Data Complexity, Linear Cryptanalysis

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] A. Bogdanov, L.R. Knudsen, G. Leander, C. Paar1, A. Poschmann, M.J.B. Robshaw, Y. Seurin, and C. Vikkelsoe. PRESENT: An Ultra-Lightweight Block Cipher. CHES 2007, LNCS 4727：450~466.

DOI: 10.1007/978-3-540-74735-2_31

Google Scholar

[2] Howard M. Heys. A Tutorial on Linear and Differential Cryptanalysis. CORR 2001-17.

Google Scholar

[3] Wu wenling, Feng Dengguo, Zhang Wwentao. Design and analysis of block cipher. Beijing: Tsinghua University press. 2009 (in Chinese).

Google Scholar

[4] Jorge Nakabara Jr, Pouyan Sepehrdad, Bingsheng Zhang, Meiqin Wang. Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT. Cryptology and Network Security, 8th International Conference, CANS 2009: 1~18.

DOI: 10.1007/978-3-642-10433-6_5

Google Scholar

[5] Martin Albrecht, Carlos Cid. Algebraic Techniques in Differential Cryptanalysis. FSE (2009).

Google Scholar