DOCSLIB.ORG

Integral Cryptanalysis of SPN Ciphers with Binary Permutations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Integral Cryptanalysis of SPN Ciphers with Binary Permutations SCIENCE CHINA Information Sciences . LETTER . January 2018, Vol. 61 019101:1–019101:3 doi: 10.1007/s11432-016-9184-y Integral cryptanalysis of SPN ciphers with binary permutations Hailong SONG1,2 & Yuechuan WEI3* 1School of Information Science and Engineering, Central South University, Changsha 410083, China; 2School of Information Science and Engineering, Jishou University, Jishou 416000, China; 3Electronics Technology Department, Engineering University of Armed Police Force, Xi’an 710086, China Received 22 December 2016/Revised 20 March 2017/Accepted 21 June 2017/Published online 3 November 2017 Citation Song H L, Wei Y C. Integral cryptanalysis of SPN ciphers with binary permutations. Sci China Inf Sci, 2018, 61(1): 019101, doi: 10.1007/s11432-016-9184-y Dear editor, is. In some papers, many people believe that the As one of the most powerful cryptanalytic vectors, branch number can also be used to evaluate the se- integral cryptanalysis [1] exploits the simultaneous curity against integral attack. However, it seems relationship between multiple encryptions. In [1], that the branch number cannot characterize the the integral of f(x) over some subset V (V is not security of block ciphers against integral crypt- necessarily but often a linear subspace) is defined analysis. For example, since the branch number of as follows: the linear layer of ARIA is 8, the designers believe that there does not exist any integral distinguisher f = f (x) . which covers more than 3 rounds [5]. However, ZV xX∈V 3-round and 4-round integral distinguishers were As the expansion of integral, several concepts such constructed in [6] and [7], respectively. as bit-pattern-based integral [2], higher order in- In this letter, we mainly discuss the security tegral and higher degree integral [3] are proposed of SPN ciphers with binary permutations against respectively. Integrals are especially well-suited in integral cryptanalysis. Firstly, it is pointed that analyzing ciphers with primarily bijective compo- the branch number of the linear transformations nents. Consequently, they are applied to a lot of cannot properly characterize the security of ci- (round-reduced) ciphers which are not vulnerable phers against integral cryptanalysis, and we pro- to differential and linear cryptanalysis. pose the integral branch number of binary linear At EUROCRYPT 2016, Sun et al. [4] proved transformations to evaluate the immunity of ci- that the length of the impossible differential of an phers against integral cryptanalysis and these re- SPN cipher is upper bounded by the sum of the sults can be successfully used to explain the exis- primitive indexes of both the diffusion layer and its tence of integrals of SPN ciphers such as ARIA. inverse. This inspires us to characterize the inte- Secondly, some combinational properties of inte- grals of ciphers using properties of diffusion layers. gral branch number are studied, we show that for Branch number of diffusion layer plays an im- an n × n non-singular binary matrix, the integral portant role in evaluating the security of block ci- branch number is upper bounded by n − 2 and phers against differential and linear cryptanalysis. construction of binary matrix with optimal inte- The larger a branch number is, the more resistant gral branch number is discussed. Note that this to differential and linear cryptanalysis the cipher letter only presents the results, and the details of * Corresponding author (email: [email protected]) The authors declare that they have no conflict of interest. c Science China Press and Springer-Verlag Berlin Heidelberg 2017 info.scichina.com link.springer.com Song H L, et al. Sci China Inf Sci January 2018 Vol. 61 019101:2 the proof refer to the supplemental file. the times that ai appears in B. Then the proba- Many block ciphers are designed based on the bility that SPN structure. Let the input to a cipher E be X = T Fn (a0)B ≡ (a1)B ≡ · · · ≡ (aN−1)B ≡ 0 mod 2 (X0,...,Xn−1) ∈ 2t , and the input and output of the ith round be X(i) = (X(i),...,X(i) )T ∈ is 0 n−1 N−1 n (i+1) (i+1) (i+1) T n CM+N−1 F t and X = (X ,...,X ) ∈ F t , re- 2 0 n−1 2 Pe (N, 2M) = N−1 . (i) (i) (i) T Fn C2M+N−1 spectively. Let K = (K0 ,...,Kn−1) ∈ 2t be Definition 5. Fn the ith round key. If the procedure of the round The Hamming Weight of X ∈ 2t function is defined as follows, E is named as an is defined as the number of non-zero components SPN cipher: of X: T w (X) = # i X = (x0, . , xn−1) , xi = 0 . X(i+1) = PS X(i) ⊕ K(i) , n o Definition 6. Let L be a linear transformation Fn where over 2t , then the branch number of L is defined as T T ,...,T B (L) = min n {w (X) + w (L (X))}. S ( 0 n−1) 0= X∈F 2t T = (S0 (T0) ,...,Sn−1 (Tn−1)) Definition 7. T Fn Let X = (x0, . , xn−1) ∈ 2t , T n Y y , . , y F t X Y and Si (0 6 i 6 n − 1) are nonlinear bijec- = ( 0 n−1) ∈ 2 . Then ⊗ is defined T as tive transformations; P (T0,...,Tn−1) = T T P (T0,...,Tn−1) is a linear transformation where X ⊗ Y = (x0y0, . , xiyi, . , xn−1yn−1) . Fn×n P ∈ 2 . Definition 8. Let P be an invertible element of The following definitions are essential in com- n×n F t P 6 i 6 n i P puting the integrals of f (x) over some subsets. 2 ,( )i (0 − 1) be the th column of and P T be the transpose of P . Then the Integral Definition 1. A multi-set A = {a |a ∈ F n , 0 6 i i 2 Branch Number of P is defined as i 6 2n − 1} is active, if for any 0 6 i < j 6 2n − 1, F t T ai = aj. A polynomial p (x) ∈ 2 [x] is active if I (P ) = min w (P )i ⊗ P . 06i,j6n−1 j p (x) is a permutation over F2t . n o Definition 2. A multi-set C = {ai|ai ∈ F2n , 0 6 To evaluate the security of ciphers against inte- i 6 2n − 1} is passive, if for any 0 < i 6 2n − 1, gral cryptanalysis, the following Theorem holds. ai = a0. A polynomial p (x) ∈ F2t [x] is passive if Theorem 3. Let E be an iterated SPN block n n F t F × p (x) is a constant over 2 . cipher. Let P ∈ 2 be the binary linear trans- Definition 3. A multi-set B = {ai|ai ∈ F2n , 0 6 formation that used in E, and the confusion layer n n 2 −1 is defined as i 6 2 −1} is balanced, if i=0 ai = 0. A polyno- mial p (x) ∈ F t [x] is balancedP if F p (x) = 0. T 2 x∈ 2t S (X)=(S0 (X0) ,...,Si (Xi) ,...,Sn−1 (Xn−1)) , Definition 4. For an iteratedP cipher E, denote where S s are nonlinear function over F t . As- by D (i, j, r) an r-round integral distinguisher with i 2 sume I (P ) = 2, and the corresponding 2 non-zero only the ith byte of the input being active and the positions are m and m . If S = S , then jth byte of the output being balanced. 0 1 m0 m1 D (m0, m1) is an integral distinguisher of SPSPS. In some cases, if r is known from the context, By Theorem 3, when designing an SPN cipher, D (i, j, r) can be simplified by D (i, j). I (P ) should be 3 at least. However, this theo- Theorem 1. Let S be a bijective transforma- rem does not imply that a larger integral branch F t F t tion over 2 , α, β ∈ 2 , and T (x) = S (x ⊕ α) ⊕ number gives better security bound against inte- S (x ⊕ β). Then different values of T (x) appear gral attack. even times, thus S (T (x)) is balanced. Theorem 3 can be directly applied to SPN F For a random function f (x) ∈ q[x], the prob- ciphers. The main observation of [6] is some −1 ability that x∈V f (x) = 0 is q . However, the 2.5-round integral distinguishers of ARIA, one of following theoremP tells that the probability that which can be simply denoted by [0, (6, 9, 15)]. By any different element appear even times is much using Theorem 3, we can list all possible values −1 lower than q : where [a, (b, c, d)] means that if only the ath byte F 8 Theorem 2. Let A = {a0, . , aN−1} be a set of input takes all values of 2 and other bytes with N different elements, B be a multi-set with are constants, then Z3,b,Z3,c and Z3,d are bal- 2M elements which are from A. Denote by (ai)B anced. In [8], a 32 × 32 matrix is designed and Song H L, et al. Sci China Inf Sci January 2018 Vol. 61 019101:3 the authors proposed that there could not exist non-singular matrices with optimal integral branch some integral distinguishers which cover more than number is discussed. However, though the integral 2 rounds, if the designer uses such 32 × 32 ma- branch number is optimal, the branch number is trix. However, by Theorem 3, we find that if only 4. This tells that maybe we can construct Sm1 = Sm2 , then some 2.5-round distinguishers some binary matrices whose integral branch num- D (i, j) of SPSPS could be found.
Load more

Recommended publications
  • Authentication Key Recovery on Galois/Counter Mode (GCM)
    Authentication Key Recovery on Galois/Counter Mode (GCM) John Mattsson and Magnus Westerlund Ericsson Research, Stockholm, Sweden {firstname.lastname}@ericsson.com Abstract. GCM is used in a vast amount of security protocols and is quickly becoming the de facto mode of operation for block ciphers due to its exceptional performance. In this paper we analyze the NIST stan- dardized version (SP 800-38D) of GCM, and in particular the use of short tag lengths. We show that feedback of successful or unsuccessful forgery attempts is almost always possible, contradicting the NIST assumptions for short tags. We also provide a complexity estimation of Ferguson’s authentication key recovery method on short tags, and suggest several novel improvements to Fergusons’s attacks that significantly reduce the security level for short tags. We show that for many truncated tag sizes; the security levels are far below, not only the current NIST requirement of 112-bit security, but also the old NIST requirement of 80-bit security. We therefore strongly recommend NIST to revise SP 800-38D. Keywords. Secret-key Cryptography, Message Authentication Codes, Block Ciphers, Cryptanalysis, Galois/Counter Mode, GCM, Authentica- tion Key Recovery, AES-GCM, Suite B, IPsec, ESP, SRTP, Re-forgery. 1 Introduction Galois/Counter Mode (GCM) [1] is quickly becoming the de facto mode of op- eration for block ciphers. GCM is included in the NSA Suite B set of cryp- tographic algorithms [2], and AES-GCM is the benchmark algorithm for the AEAD competition CAESAR [3]. Together with Galois Message Authentication Code (GMAC), GCM is used in a vast amount of security protocols: – Many protocols such as IPsec [4], TLS [5], SSH [6], JOSE [7], 802.1AE (MAC- sec) [8], 802.11ad (WiGig) [9], 802.11ac (Wi-Fi) [10], P1619.1 (data storage) [11], Fibre Channel [12], and SRTP [13, 14]1 only allow 128-bit tags.
    [Show full text]
  • Impossible Differential Cryptanalysis of Reduced Round Hight
    1 IMPOSSIBLE DIFFERENTIAL CRYPTANALYSIS OF REDUCED ROUND HIGHT A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF APPLIED MATHEMATICS OF MIDDLE EAST TECHNICAL UNIVERSITY BY CIHANG˙ IR˙ TEZCAN IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN CRYPTOGRAPHY JUNE 2009 Approval of the thesis: IMPOSSIBLE DIFFERENTIAL CRYPTANALYSIS OF REDUCED ROUND HIGHT submitted by CIHANG˙ IR˙ TEZCAN in partial fulfillment of the requirements for the degree of Master of Science in Department of Cryptography, Middle East Technical University by, Prof. Dr. Ersan Akyıldız Director, Graduate School of Applied Mathematics Prof. Dr. Ferruh Ozbudak¨ Head of Department, Cryptography Assoc. Prof. Dr. Ali Doganaksoy˘ Supervisor, Mathematics Examining Committee Members: Prof. Dr. Ersan Akyıldız METU, Institute of Applied Mathematics Assoc. Prof. Ali Doganaksoy˘ METU, Department of Mathematics Dr. Muhiddin Uguz˘ METU, Department of Mathematics Dr. Meltem Sonmez¨ Turan Dr. Nurdan Saran C¸ankaya University, Department of Computer Engineering Date: I hereby declare that all information in this document has been obtained and presented in accordance with academic rules and ethical conduct. I also declare that, as required by these rules and conduct, I have fully cited and referenced all material and results that are not original to this work. Name, Last Name: CIHANG˙ IR˙ TEZCAN Signature : iii ABSTRACT IMPOSSIBLE DIFFERENTIAL CRYPTANALYSIS OF REDUCED ROUND HIGHT Tezcan, Cihangir M.Sc., Department of Cryptography Supervisor : Assoc. Prof. Dr. Ali Doganaksoy˘ June 2009, 49 pages Design and analysis of lightweight block ciphers have become more popular due to the fact that the future use of block ciphers in ubiquitous devices is generally assumed to be extensive.
    [Show full text]
  • Security Enhancement in Cloud Storage Using ARIA and Elgamal Algorithms
    International Journal of Computer Applications (0975 – 8887) Volume 171 – No. 9, August 2017 Security Enhancement in Cloud Storage using ARIA and Elgamal Algorithms Navdeep Kaur Heena Wadhwa Research Scholar Assistant Professor Department of IT Department of CSE CEC Landran, Mohali, Punjab CEC Landran, Mohali, Punjab ABSTRACT Cloud Computing examination [3]. The cloud does appear Cloud Computing is not an improvement, excluding an resolve some ancient issues with the still growing costs of income towards constructs information technology services apply, preserve, & supporting an IT communications that is that utilize superior computational authority & better storage rarely utilized everywhere near its ability in the single-owner space utilization. The major centre of Cloud Computing starts atmosphere. There is a chance to amplify competence & when the supplier vision as irrelevant hardware associated to reduce expenses in the IT section of the commerce & sustain down-time on some appliance in the system. It is not a decision-makers are commencement to pay concentration. modification in the user viewpoint. As well, the user software Vendors who can supply a protected, high-availability, picture should be simply convertible as of one confuse to a scalable communications to the loads may be poised to be new. Though cloud computing is embattled to offer better successful in receiving association to accept their cloud operation of possessions using virtualization method and to services[20]. receive up a great deal of the job load from the customer and Due to the current development in computer network provides safety also. Cloud Computing is a rising technology technology, giving out of digital multimedia pleased through with joint property and lower cost that relies on pay per use the internet is massive.
    [Show full text]
  • ARIA-CTR Encryption for Low-End Embedded Processors
    sensors Article ACE: ARIA-CTR Encryption for Low-End Embedded Processors Hwajeong Seo * , Hyeokdong Kwon, Hyunji Kim and Jaehoon Park Division of IT Convergence Engineering, Hansung University, Seoul, 02876, Korea; [email protected] (H.K.); [email protected] (H.K.); [email protected] (J.P.) * Correspondence: [email protected]; Tel.:+82-2-760-8033 Received: 21 June 2020; Accepted: 4 July 2020; Published: 6 July 2020 Abstract: In this paper, we present the first optimized implementation of ARIA block cipher on low-end 8-bit Alf and Vegard’s RISC processor (AVR) microcontrollers. To achieve high-speed implementation, primitive operations, including rotation operation, a substitute layer, and a diffusion layer, are carefully optimized for the target low-end embedded processor. The proposed ARIA implementation supports the electronic codebook (ECB) and the counter (CTR) modes of operation. In particular, the CTR mode of operation is further optimized with the pre-computed table of two add-round-key, one substitute layer, and one diffusion layer operations. Finally, the proposed ARIA-CTR implementations on 8-bit AVR microcontrollers achieved 187.1, 216.8, and 246.6 clock cycles per byte for 128-bit, 192-bit, and 256-bit security levels, respectively. Compared with previous reference implementations, the execution timing is improved by 69.8%, 69.6%, and 69.5% for 128-bit, 192-bit, and 256-bit security levels, respectively. Keywords: ARIA; electronic codebook mode of operation; counter mode of operation; software implementation; embedded processors 1. Introduction Data encryption is a fundamental technology for secure network communication in the Internet of Things (IoT).
    [Show full text]
  • Cryptanalysis of Selected Block Ciphers
    Downloaded from orbit.dtu.dk on: Sep 24, 2021 Cryptanalysis of Selected Block Ciphers Alkhzaimi, Hoda A. Publication date: 2016 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Alkhzaimi, H. A. (2016). Cryptanalysis of Selected Block Ciphers. Technical University of Denmark. DTU Compute PHD-2015 No. 360 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Cryptanalysis of Selected Block Ciphers Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy at the Department of Mathematics and Computer Science-COMPUTE in The Technical University of Denmark by Hoda A.Alkhzaimi December 2014 To my Sanctuary in life Bladi, Baba Zayed and My family with love Title of Thesis Cryptanalysis of Selected Block Ciphers PhD Project Supervisor Professor Lars R. Knudsen(DTU Compute, Denmark) PhD Student Hoda A.Alkhzaimi Assessment Committee Associate Professor Christian Rechberger (DTU Compute, Denmark) Professor Thomas Johansson (Lund University, Sweden) Professor Bart Preneel (Katholieke Universiteit Leuven, Belgium) Abstract The focus of this dissertation is to present cryptanalytic results on selected block ci- phers.
    [Show full text]
  • Encryption Block Cipher
    10/29/2007 Encryption Encryption Block Cipher Dr.Talal Alkharobi 2 Block Cipher A symmetric key cipher which operates on fixed-length groups of bits, termed blocks, with an unvarying transformation. When encrypting, a block cipher take n-bit block of plaintext as input, and output a corresponding n-bit block of ciphertext. The exact transformation is controlled using a secret key. Decryption is similar: the decryption algorithm takes n-bit block of ciphertext together with the secret key, and yields the original n-bit block of plaintext. Mode of operation is used to encrypt messages longer than the block size. 1 Dr.Talal Alkharobi 10/29/2007 Encryption 3 Encryption 4 Decryption 2 Dr.Talal Alkharobi 10/29/2007 Encryption 5 Block Cipher Consists of two algorithms, encryption, E, and decryption, D. Both require two inputs: n-bits block of data and key of size k bits, The output is an n-bit block. Decryption is the inverse function of encryption: D(E(B,K),K) = B For each key K, E is a permutation over the set of input blocks. n Each key K selects one permutation from the possible set of 2 !. 6 Block Cipher The block size, n, is typically 64 or 128 bits, although some ciphers have a variable block size. 64 bits was the most common length until the mid-1990s, when new designs began to switch to 128-bit. Padding scheme is used to allow plaintexts of arbitrary lengths to be encrypted. Typical key sizes (k) include 40, 56, 64, 80, 128, 192 and 256 bits.
    [Show full text]
  • Cryptanalysis of Block Ciphers
    Cryptanalysis of Block Ciphers Jiqiang Lu Technical Report RHUL–MA–2008–19 30 July 2008 Royal Holloway University of London Department of Mathematics Royal Holloway, University of London Egham, Surrey TW20 0EX, England http://www.rhul.ac.uk/mathematics/techreports CRYPTANALYSIS OF BLOCK CIPHERS JIQIANG LU Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Mathematics Royal Holloway, University of London 2008 Declaration These doctoral studies were conducted under the supervision of Prof. Chris Mitchell. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Information Security Group of Royal Holloway, University of London as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Jiqiang Lu July 2008 2 Acknowledgements First of all, I thank my supervisor Prof. Chris Mitchell for suggesting block cipher cryptanalysis as my research topic when I began my Ph.D. studies in September 2005. I had never done research in this challenging ¯eld before, but I soon found it to be really interesting. Every time I ¯nished a manuscript, Chris would give me detailed comments on it, both editorial and technical, which not only bene¯tted my research, but also improved my written English. Chris' comments are fantastic, and it is straightforward to follow them to make revisions. I thank my advisor Dr. Alex Dent for his constructive suggestions, although we work in very di®erent ¯elds.
    [Show full text]
  • S-Box Construction Based on Linear Fractional Transformation and Permutation Function
    S S symmetry Article S-box Construction Based on Linear Fractional Transformation and Permutation Function Liyana Chew Nizam Chew 1,2,* and Eddie Shahril Ismail 1 1 Department of Mathematical Sciences, Faculty of Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600 UKM, Selangor, Malaysia; [email protected] 2 Cryptography Development Department, CyberSecurity Malaysia, Cyberjaya 63000, Selangor, Malaysia * Correspondence: [email protected] Received: 7 April 2020; Accepted: 7 May 2020; Published: 17 May 2020 Abstract: Substitution boxes (S-box) with strong and secure cryptographic properties are widely used for providing the key property of nonlinearity in block ciphers. This is critical to be resistant to a standard attack including linear and differential cryptanalysis. The ability to create a cryptographically strong S-box depends on its construction technique. This work aims to design and develop a cryptographically strong 8 8 S-box for block ciphers. In this work, the construction of the S-box × is based on the linear fractional transformation and permutation function. Three steps involved in producing the S-box. In step one, an irreducible polynomial of degree eight is chosen, and all roots of the primitive irreducible polynomial are calculated. In step two, algebraic properties of linear fractional transformation are applied in Galois Field GF (28). Finally, the produced matrix is permuted to add randomness to the S-box. The strength of the S-box is measured by calculating its potency to create confusion. To analyze the security properties of the S-box, some well-known and commonly used algebraic attacks are used. The proposed S-box is analyzed by nonlinearity test, algebraic degree, differential uniformity, and strict avalanche criterion which are the avalanche effect test, completeness test, and strong S-box test.
    [Show full text]
  • Multidimensional Differential-Linear Cryptanalysis of ARIA Block Cipher
    Multidimensional Differential-Linear Cryptanalysis of ARIA Block Cipher Wentan Yi, Jiongjiong Ren, and Shaozhen Chen ARIA is a 128-bit block cipher that has been selected as I. Introduction a Korean encryption standard. Similar to AES, it is robust against differential cryptanalysis and linear cryptanalysis. ARIA [1] is a block cipher designed by the Korean In this study, we analyze the security of ARIA against cryptographers Kwon and others in ICISC 2003. The upgraded differential-linear cryptanalysis. We present five rounds version 1.0 of ARIA [2] was selected as a Korean standard of differential-linear distinguishers for ARIA, which block cipher by the Ministry of Commerce, Industry, and can distinguish five rounds of ARIA from random Energy [3] in 2004. ARIA has also been adopted by several permutations using only 284.8 chosen plaintexts. standard protocols such as IETF (RFC 5794 [4]), SSL/TLS Moreover, we develop differential-linear attacks based on (RFC 6209 [5]) and PKCS #11 [6]. In Korea, ARIA has been six rounds of ARIA-128 and seven rounds of ARIA-256. used widely, especially in government-to-public services. Thus, This is the first multidimensional differential-linear studies of the security of ARIA are important in various areas cryptanalysis of ARIA and it has lower data complexity of cryptanalysis and it is necessary to constantly reevaluate its than all previous results. This is a preliminary study and security using various cryptanalytic techniques. further research may obtain better results in the future. The design of ARIA is provably resistant against differential and linear attacks, but many other cryptanalysis methods have Keywords: ARIA, Block cipher, Cryptanalysis, Linear been developed to attack ARIA, such as integral attacks [7], [8], hull, Multidimensional differential-linear attack.
    [Show full text]
  • Analysis of Linear Relationships in Block Ciphers
    Analysis of Linear Relationships in Block Ciphers by Muhammad Reza Z’aba Bachelor of Science (Computer) (Universiti Teknologi Malaysia) – 2004 Thesis submitted in accordance with the regulations for the Degree of Doctor of Philosophy Information Security Institute Faculty of Science and Technology Queensland University of Technology May 7, 2010 Keywords Block cipher, stream cipher, symmetric cipher, linear transformation, diffusion, cryptanalysis, fixed points, round function, key scheduling algorithm, integral attack, bit-pattern, algebraic analysis, system of equations, branch number, AES, ARIA, LEX, BES, Noekeon, PRESENT, Serpent, SMS4 i ii Abstract This thesis is devoted to the study of linear relationships in symmetric block ciphers. A block cipher is designed so that the ciphertext is produced as a nonlinear function of the plaintext and secret master key. However, linear re- lationships within the cipher can still exist if the texts and components of the cipher are manipulated in a number of ways, as shown in this thesis. There are four main contributions of this thesis. The first contribution is the extension of the applicability of integral attacks from word-based to bit- based block ciphers. Integral attacks exploit the linear relationship between texts at intermediate stages of encryption. This relationship can be used to recover subkey bits in a key recovery attack. In principle, integral attacks can be applied to bit-based block ciphers. However, specific tools to define the attack on these ciphers are not available. This problem is addressed in this thesis by introducing a refined set of notations to describe the attack. The bit pattern- based integral attack is successfully demonstrated on reduced-round variants of the block ciphers Noekeon, Present and Serpent.
    [Show full text]
  • Design and Implementation of Unified Hardware for 128-Bit Block Ciphers ARIA and AES
    Design and Implementation of Unified Hardware for 128-Bit Block Ciphers ARIA and AES Bonseok Koo, Gwonho Ryu, Taejoo Chang, and Sangjin Lee ABSTRACT⎯ARIA and the Advanced Encryption Standard AES, and we measure its performance using a 0.25 μm CMOS (AES) are next generation standard block cipher algorithms of standard cell library. Our processor is very suitable to implement Korea and the US, respectively. This letter presents an area- low-cost and area-constrained cryptographic modules that efficient unified hardware architecture of ARIA and AES. Both should support both algorithms. Note also that the Public Key algorithms have 128-bit substitution permutation network (SPN) structures, and their substitution and permutation layers Cryptography Standard (PKCS) #11 has recently begun to could be efficiently merged. Therefore, we propose a 128-bit support the mechanisms of ARIA as well as those of AES [3]. processor architecture with resource sharing, which is capable of processing ARIA and AES. This is the first architecture which supports both algorithms. Furthermore, it requires only II. Unified Substitution Layer 19,056 logic gates and encrypts data at 720 Mbps and 1,047 Mbps for ARIA and AES, respectively. The substitution layer of ARIA consists of two kinds of S-boxes, S1, S2, and their inverses. The S-box S1 is composed of Keywords⎯ARIA, AES, hardware architecture, resource multiplicative inversion over GF(28) and affine transformation, sharing. 247 while S2 is a combination of x and affine transformation. Both S-boxes are defined over the GF(28) with the irreducible I. Introduction polynomial m(x)=x8 +x4+x3+x+1, which is the same as that of 247 AES.
    [Show full text]
  • Attacking Reduced Rounds of the ARIA Block Cipher
    Attacking Reduced Rounds of the ARIA Block Cipher Ewan Fleischmann, Michael Gorski, and Stefan Lucks Bauhaus-University Weimar, Germany {Ewan.Fleischmann, Michael.Gorski, Stefan.Lucks}@uni-weimar.de Abstract. ARIA [4] is a block cipher proposed at ICISC’03. Its design is very similar to the advanced encryption standard (AES). The authors propose that on 32-bit processors, the encryption speed is at least 70% of that of the AES. They claim to offer a higher security level than AES. In this paper we present two attacks of reduced round ARIA which shows some weaknesses of the cipher. Moreover, our attacks have the lowest memory requirements compared to existing attacks on ARIA with an increase in the time complexity. Keywords: block ciphers, differential cryptanalysis, ARIA. 1 Introduction The ARIA block cipher [4] was presented at ICISC’03. Its design is very similar to the advanced encryption standard (AES/Rijndael) [3]. The block size is 128-bit and the key size is either 128, 192 or 256 bits. It uses the same number of rounds as the AES, which are 10, 12 and 14 respectively. ARIA employs two kinds of S-Boxes and two types of substitution layers which are different between even and odd rounds. They skip using a MixComuns operation and use an 16 × 16 binary matrix with branch number 8 in their diffusion layer. The authors propose that ARIA can increase the efficiency in 8-bit and 32-bit software implementations in comparison to AES. Moreover, they claim to have better security against all existing attacks on block ciphers.
    [Show full text]