DOCSLIB.ORG

Transformation and Security Analysis of NLFSR-Based Stream Ciphers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Transformation and Security Analysis of NLFSR-based Stream Ciphers by Ge Yao ORCID: 0000-0003-4523-8816 A thesis submitted in total fulfillment for the degree of Doctor of Philosophy in the School of of Computing and Information Systems THE UNIVERSITY OF MELBOURNE March 2021 i Abstract The Nonlinear Feedback Shift Register (NLFSR) based stream cipher is becoming the mainstream design of modern stream ciphers. The properties of high operation speed, small footprint in hardware and low power consumption make such ciphers preferable in resource constrained applications requiring secure communications. In the last decade, many NLFSR-based stream ciphers have been proposed, among which the Grain family ciphers are the most mature and well studied ciphers. However, security concerns hinder the development and application of such ciphers. Cryptanalytic attacks like the Time- Memory-Data Trade-Off (TMDTO) attack requires that the size of the internal state should be at least twice of the security level, which is conflict with the requirement of high efficiency. In order to optimise the trade-off between the performance and security, researchers focus on developing new ideas to design stream ciphers inheriting the effi- ciency of Grain family ciphers but remaining resist to the known attacks especially the TMDTO attack. To this end, new design ideas of using shorter Feedback Shift Registers (FSRs) or deploying single Galois NLFSR spark interest in this field. In this thesis, we aim to analyse the security of the newly designed stream ciphers and explore the theory of NLFSR to make progress in studying the NLFSR-based stream ciphers. This research aims to address four research questions. The four research questions and the corresponding contributions are detailed as follows. The first research question is about the security of small-state stream ciphers. As the initial design of small-state stream ciphers, Sprout is proved to be insecure. Its successors including Plantlet, Fruit and Lizard are also not as secure as expected. In this research, we aim to improve the Sprout cipher against the divide-and-conquer key recovery attack and analyze the security of all the small-state stream ciphers. By analyzing the four types of sieving and merging techniques used in the key recovery attack, we identify the design weakness in Sprout. Then we propose countermeasures to resist each type of the sieving and merging techniques. Five experiments are conducted to verify our theoretical improvements. The results of the first four experiments show that our countermeasures are effective and the result of the last experiment shows that the improved cipher resists the key recovery attack. Moreover, we analyze the attack results on Plantlet and Fruit and find that the countermeasures we propose are consistent with the improvements made in these. Finally, we summarize the design principles for small-state Sprout-like stream ciphers. The second research question is how to determine whether a Galois NLFSR is equiva- lent to a Fibonacci NLFSR. We refer to those equivalent ones as transformable Galois NLFSRs. The transformation between Fibonacci and Galois NLFSRs have been studied extensively, but still the equivalence is not fully established. To address this issue, we ii adopt the notion nonlinear recurrence and derive the necessary and sufficient condition for a Galois NLFSR to be equivalent to a Fibonacci NLFSR. We prove that the three types of transformable Galois NLFSRs discovered in literature satisfy this condition. Besides, we study several properties of the nonlinear recurrence and discover a special case where a Galois NLFSR is equivalent to two different Fibonacci NLFSRs. The third research question is how to transform an NLFSR between Fibonacci and Galois configurations. For the three types of transformable Galois NLFSRs, either no transformation algorithm has been proposed or the algorithm has very high complexity. There are several limitations and a common issue in existing algorithms. In this research, we aim to address all the issues. First, we give a formal description of a transformation algorithm. Second, we develop a compensation method. The basic idea is to build relations of the internal states of the NLFSR before and after transformation. According to the established relations, it is possible to construct the output function and compute the initial state for the transformed NLFSR. Based on this unified method, we propose transformation algorithms for all the three types of Galois NLFSRs. Moreover, we discover a new type of transformable Galois NLFSRs, namely Type-IV Galois NLFSRs. We show that this new type also satisfies the necessary and sufficient condition proposed to answer the second research question in Chapter 5. Based on the same compensation method, we propose transformation algorithms for the Type-IV Galois NLFSRs. All the proposed algorithms are easy to program and have polynomial time complexity. We provide a pesudocode for each algorithm. The fourth research question is about the security of maximum period Galois NLFSR- based stream ciphers. We reinterpret the design method and identify a conditional equivalence problem. We find that this problem can be addressed by the Type-II- to-Fibonacci transformation algorithm proposed in Chapter 6. Then we apply this algorithm on Espresso cipher. The Galois NLFSR used in the cipher is transformed to a Linear Feedback Shift Register (LFSR) with a nonlinear output function, which is often referred to as an LFSR filter generator. We mount the fast algebraic attack and the Rønjom-Helleseth attack on the transformed cipher and break it with computation complexity of 268:50 and 248:59 logical operations respectively, which is far lower than the claimed security level of 2128. We then show that not only the Galois NLFSR in Espresso cipher, but also the entire class of maximum period Galois NLFSRs can be transformed back to LFSRs with precise output functions. Therefore, this kind of cipher is always equivalent to an LFSR filter generator. We discuss other related attacks and give suggestions for the future design. Declaration of Authorship I, Ge Yao, declare that this thesis titled, `Transformation and Security Analysis of NLFSR-based Stream Ciphers' and the work presented in it are my own. I confirm that: The thesis comprises only my original work towards the degree of Doctor of Phi- losophy; due acknowledgement has been made in the text to all other material used; and the thesis is fewer than the maximum word limit in length, exclusive of tables, maps, bibliographies and appendices as approved by the Research Higher Degrees Committee. Signed: Date: iii Preface The thesis is written at the School of Computing and Information Systems, The Uni- versity of Melbourne, Australia. The main contributions discussed in Chapters 4 to 7 of the thesis are based on the following publications:: Ge Yao, and Udaya Parampalli. "Improve sprout cipher to resist the divide and conquer based key recovery attack." In Proceedings of the Australasian Computer Science Week Multiconference, pp. 1-7. 2018. Ge Yao, and Udaya Parampalli. "Transformation Algorithm for NLFSRs in Hard- ware Oriented Stream Ciphers." International Conference on Sequences and Their Applications, 6-1: pp. 1-14. 2018. Ge Yao, and Udaya Parampalli. "Improved Transformation Algorithms for Gen- eralized Galois NLFSRs." International Conference on Sequences and Their Ap- plications, pp. 1-21. 2020. (The full version of this paper is submitted to Journal Cryptography and Communications Discrete Structures, Boolean Functions and Sequences (CCDS)) Ge Yao, and Udaya Parampalli. "Cryptanalysis of the Class of Maximum Period Galois NLFSR-based Stream Ciphers." Submitted to Journal Cryptography and Communications Discrete Structures, Boolean Functions and Sequences (CCDS). iv Acknowledgements First and foremost, I would like to express my sincere gratitude to my supervisor, Prof. Udaya Parampalli for his continuous support and guidance throughout my Ph.D. study and research. Without his help, I would not have had the chance to come and study at Melbourne. He has always been nice to me and encouraged me in all the phases of my research. I would like to sincerely thank my co-supervisors, Assoc. Prof. Vanessa Teague and Dr. Olga Ohrimenko. I want to thank Vanessa for giving me insightful comments and suggestions. I want to thank Olga who joined my supervision team at the last six months of my Ph.D. journey but provided practically useful feedback to improve my thesis. I also want to sincerely thank my advisory committee chair, Assoc. Prof. Michael Kirley. I enjoyed every progress review meeting because of his enthusiastic support and valuable comments. It is a privilege to have such a great committee. I would like to thank the University of Melbourne and the China Scholarship Council for funding my study and covering my living expenses. I would also like to express thanks to my friends, Yixin, Karin, Estrid, Tabinda, Lianglu and Jiajia who supported me and exchanged valuable ideas with me during the past four years. Last but not least, I would like to thank my parents, my sister and my boyfriend Meng Wang for their unconditional love, support, understanding and encouragement through- out this journey. v Contents Abstract i Declaration of Authorship iii Preface iv Acknowledgementsv List of Figures ix List of Tablesx 1 Introduction1 1.1 Background...................................1 1.1.1 Structure of Stream Cipher......................2 1.1.2 Security of Stream Cipher.......................4
Recommended publications
  • Secure Transmission of Data Using Rabbit Algorithm

    Secure Transmission of Data Using Rabbit Algorithm

    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 04 Issue: 05 | May -2017 www.irjet.net p-ISSN: 2395-0072 Secure Transmission of Data using Rabbit Algorithm Shweta S Tadkal1, Mahalinga V Mandi2 1 M. Tech Student , Department of Electronics & Communication Engineering, Dr. Ambedkar institute of Technology,Bengaluru-560056 2 Associate Professor, Department of Electronics & Communication Engineering, Dr. Ambedkar institute of Technology,Bengaluru-560056 ---------------------------------------------------------------------***----------------------------------------------------------------- Abstract— This paper presents the design and simulation of secure transmission of data using rabbit algorithm. The rabbit algorithm is a stream cipher algorithm. Stream ciphers are an important class of symmetric encryption algorithm, which uses the same secret key to encrypt and decrypt the data and has been designed for high performance in software implementation. The data or the plain text in our proposed model is the binary data which is encrypted using the keys generated by the rabbit algorithm. The rabbit algorithm is implemented and the language used to write the code is Verilog and then is simulated using Modelsim6.4a. The software tool used is Xilinx ISE Design Suit 14.7. Keywords—Cryptography, Stream ciphers, Rabbit algorithm 1. INTRODUCTION In today’s world most of the communications done using electronic media. Data security plays a vitalkrole in such communication. Hence there is a need to predict data from malicious attacks. This is achieved by cryptography. Cryptographydis the science of secretscodes, enabling the confidentiality of communication through an in secure channel. It protectssagainstbunauthorizedapartiesoby preventing unauthorized alterationhof use. Several encrypting algorithms have been built to deal with data security attacks.
  • A Differential Fault Attack on MICKEY

    A Differential Fault Attack on MICKEY

    A Differential Fault Attack on MICKEY 2.0 Subhadeep Banik and Subhamoy Maitra Applied Statistics Unit, Indian Statistical Institute Kolkata, 203, B.T. Road, Kolkata-108. s.banik [email protected], [email protected] Abstract. In this paper we present a differential fault attack on the stream cipher MICKEY 2.0 which is in eStream's hardware portfolio. While fault attacks have already been reported against the other two eStream hardware candidates Trivium and Grain, no such analysis is known for MICKEY. Using the standard assumptions for fault attacks, we show that if the adversary can induce random single bit faults in the internal state of the cipher, then by injecting around 216:7 faults and performing 232:5 computations on an average, it is possible to recover the entire internal state of MICKEY at the beginning of the key-stream generation phase. We further consider the scenario where the fault may affect at most three neighbouring bits and in that case we require around 218:4 faults on an average. Keywords: eStream, Fault attacks, MICKEY 2.0, Stream Cipher. 1 Introduction The stream cipher MICKEY 2.0 [4] was designed by Steve Babbage and Matthew Dodd as a submission to the eStream project. The cipher has been selected as a part of eStream's final hardware portfolio. MICKEY is a synchronous, bit- oriented stream cipher designed for low hardware complexity and high speed. After a TMD tradeoff attack [16] against the initial version of MICKEY (ver- sion 1), the designers responded by tweaking the design by increasing the state size from 160 to 200 bits and altering the values of some control bit tap loca- tions.
  • Vector Boolean Functions: Applications in Symmetric Cryptography

    Vector Boolean Functions: Applications in Symmetric Cryptography

    Vector Boolean Functions: Applications in Symmetric Cryptography José Antonio Álvarez Cubero Departamento de Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones Universidad Politécnica de Madrid This dissertation is submitted for the degree of Doctor Ingeniero de Telecomunicación Escuela Técnica Superior de Ingenieros de Telecomunicación November 2015 I would like to thank my wife, Isabel, for her love, kindness and support she has shown during the past years it has taken me to finalize this thesis. Furthermore I would also liketo thank my parents for their endless love and support. Last but not least, I would like to thank my loved ones such as my daughter and sisters who have supported me throughout entire process, both by keeping me harmonious and helping me putting pieces together. I will be grateful forever for your love. Declaration The following papers have been published or accepted for publication, and contain material based on the content of this thesis. 1. [7] Álvarez-Cubero, J. A. and Zufiria, P. J. (expected 2016). Algorithm xxx: VBF: A library of C++ classes for vector Boolean functions in cryptography. ACM Transactions on Mathematical Software. (In Press: http://toms.acm.org/Upcoming.html) 2. [6] Álvarez-Cubero, J. A. and Zufiria, P. J. (2012). Cryptographic Criteria on Vector Boolean Functions, chapter 3, pages 51–70. Cryptography and Security in Computing, Jaydip Sen (Ed.), http://www.intechopen.com/books/cryptography-and-security-in-computing/ cryptographic-criteria-on-vector-boolean-functions. (Published) 3. [5] Álvarez-Cubero, J. A. and Zufiria, P. J. (2010). A C++ class for analysing vector Boolean functions from a cryptographic perspective.
  • Security Evaluation of Stream Cipher Enocoro-128V2

    Security Evaluation of Stream Cipher Enocoro-128V2

    Security Evaluation of Stream Cipher Enocoro-128v2 Hell, Martin; Johansson, Thomas 2010 Link to publication Citation for published version (APA): Hell, M., & Johansson, T. (2010). Security Evaluation of Stream Cipher Enocoro-128v2. CRYPTREC Technical Report. Total number of authors: 2 General rights Unless other specific re-use rights are stated the following general rights apply: 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 Read more about Creative commons licenses: https://creativecommons.org/licenses/ Take down policy 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. LUND UNIVERSITY PO Box 117 221 00 Lund +46 46-222 00 00 Security Evaluation of Stream Cipher Enocoro-128v2 Martin Hell and Thomas Johansson Abstract. This report presents a security evaluation of the Enocoro- 128v2 stream cipher. Enocoro-128v2 was proposed in 2010 and is a mem- ber of the Enocoro family of stream ciphers. This evaluation examines several different attacks applied to the Enocoro-128v2 design. No attack better than exhaustive key search has been found.
  • High Performance Architecture for LILI-II Stream Cipher

    High Performance Architecture for LILI-II Stream Cipher

    International Journal of Computer Applications (0975 – 8887) Volume 107 – No 13, December 2014 High Performance Architecture for LILI-II Stream Cipher N. B. Hulle R. D. Kharadkar, Ph.D. S. S. Dorle, Ph.D. GHRIEET, Pune GHRIEET, Pune GHRCE, Nagpur Domkhel Road Domkhel Road Hingana Road Wagholi, Pune Wagholi, Pune Nagpur ABSTRACT cipher. This architecture uses same clock for both LFSRs. It is Proposed work presents high performance architecture for capable of shifting LFSRD content by one to four stages, LILI-II stream cipher. This cipher uses 128 bit key and 128 bit depending on value of function FC in single clock cycle IV for initialization of two LFSR. Proposed architecture uses without losing any data from function FC. single clock for both LFSRs, so this architecture will be useful in high speed communication applications. Presented 2. LILI-II STREAM CIPHER architecture uses four bit shifting of LFSR in single clock LILI-II is synchronous stream cipher developed by A. Clark et D al. in 2002 by removing existing weaknesses of LILI-128 cycle without losing any data items from function FC. Proposed architecture is coded by using VHDL language with stream cipher. It consists of two subsystems, clock controlled CAD tool Xilinx ISE Design Suite 13.2 and targeted hardware subsystem and data generation subsystem as shown in Fig. 1. is Xilinx Virtex5 FPGA having device xc4vlx60, with KEY IV package ff1148. Proposed architecture achieved throughput of 127 128 128 224.7 Mbps at 224.7 MHz frequency. 127 General Terms Hardware implementation of stream ciphers LFSRc LFSRd ... Keywords X0 X126 X0 X1 X96 X122 LILI, Stream cipher, clock controlled, FPGA, LFSR.
  • Analysis of Selected Block Cipher Modes for Authenticated Encryption

    Analysis of Selected Block Cipher Modes for Authenticated Encryption

    Analysis of Selected Block Cipher Modes for Authenticated Encryption by Hassan Musallam Ahmed Qahur Al Mahri Bachelor of Engineering (Computer Systems and Networks) (Sultan Qaboos University) – 2007 Thesis submitted in fulfilment of the requirement for the degree of Doctor of Philosophy School of Electrical Engineering and Computer Science Science and Engineering Faculty Queensland University of Technology 2018 Keywords Authenticated encryption, AE, AEAD, ++AE, AEZ, block cipher, CAESAR, confidentiality, COPA, differential fault analysis, differential power analysis, ElmD, fault attack, forgery attack, integrity assurance, leakage resilience, modes of op- eration, OCB, OTR, SHELL, side channel attack, statistical fault analysis, sym- metric encryption, tweakable block cipher, XE, XEX. i ii Abstract Cryptography assures information security through different functionalities, es- pecially confidentiality and integrity assurance. According to Menezes et al. [1], confidentiality means the process of assuring that no one could interpret infor- mation, except authorised parties, while data integrity is an assurance that any unauthorised alterations to a message content will be detected. One possible ap- proach to ensure confidentiality and data integrity is to use two different schemes where one scheme provides confidentiality and the other provides integrity as- surance. A more compact approach is to use schemes, called Authenticated En- cryption (AE) schemes, that simultaneously provide confidentiality and integrity assurance for a message. AE can be constructed using different mechanisms, and the most common construction is to use block cipher modes, which is our focus in this thesis. AE schemes have been used in a wide range of applications, and defined by standardisation organizations. The National Institute of Standards and Technol- ogy (NIST) recommended two AE block cipher modes CCM [2] and GCM [3].
  • Fair and Efficient Hardware Benchmarking of Candidates In

    Fair and Efficient Hardware Benchmarking of Candidates In

    Fair and Efficient Hardware Benchmarking of Candidates in Cryptographic Contests Kris Gaj CERG George Mason University Partially supported by NSF under grant no. 1314540 Designs & results for this talk contributed by “Ice” Homsirikamol Farnoud Farahmand Ahmed Ferozpuri Will Diehl Marcin Rogawski Panasayya Yalla Cryptographic Standard Contests IX.1997 X.2000 AES 15 block ciphers → 1 winner NESSIE I.2000 XII.2002 CRYPTREC XI.2004 IV.2008 34 stream 4 HW winners eSTREAM ciphers → + 4 SW winners X.2007 X.2012 51 hash functions → 1 winner SHA-3 I.2013 TBD 57 authenticated ciphers → multiple winners CAESAR 97 98 99 00 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 time Evaluation Criteria in Cryptographic Contests Security Software Efficiency Hardware Efficiency µProcessors µControllers FPGAs ASICs Flexibility Simplicity Licensing 4 AES Contest 1997-2000 Final Round Speed in FPGAs Votes at the AES 3 conference GMU results Hardware results matter! 5 Throughput vs. Area Normalized to Results for SHA-256 and Averaged over 11 FPGA Families – 256-bit variants Overall Normalized Throughput Early Leader Overall Normalized Area 6 SHA-3 finalists in high-performance FPGA families 0.25 0.35 0.50 0.79 1.00 1.41 2.00 2.83 4.00 7 FPGA Evaluations – From AES to SHA-3 AES eSTREAM SHA-3 Design Primary optimization Throughput Area Throughput/ target Throughput/ Area Area Multiple architectures No Yes Yes Embedded resources No No Yes Benchmarking Multiple FPGA families No No Yes Specialized tools No No Yes Experimental results No No Yes Reproducibility Availability
  • Optimizing the Placement of Tap Positions and Guess and Determine

    Optimizing the Placement of Tap Positions and Guess and Determine

    Optimizing the placement of tap positions and guess and determine cryptanalysis with variable sampling S. Hodˇzi´c, E. Pasalic, and Y. Wei∗† Abstract 1 In this article an optimal selection of tap positions for certain LFSR-based encryption schemes is investigated from both design and cryptanalytic perspective. Two novel algo- rithms towards an optimal selection of tap positions are given which can be satisfactorily used to provide (sub)optimal resistance to some generic cryptanalytic techniques applicable to these schemes. It is demonstrated that certain real-life ciphers (e.g. SOBER-t32, SFINKS and Grain-128), employing some standard criteria for tap selection such as the concept of full difference set, are not fully optimized with respect to these attacks. These standard design criteria are quite insufficient and the proposed algorithms appear to be the only generic method for the purpose of (sub)optimal selection of tap positions. We also extend the framework of a generic cryptanalytic method called Generalized Filter State Guessing Attacks (GFSGA), introduced in [26] as a generalization of the FSGA method, by applying a variable sampling of the keystream bits in order to retrieve as much information about the secret state bits as possible. Two different modes that use a variable sampling of keystream blocks are presented and it is shown that in many cases these modes may outperform the standard GFSGA mode. We also demonstrate the possibility of employing GFSGA-like at- tacks to other design strategies such as NFSR-based ciphers (Grain family for instance) and filter generators outputting a single bit each time the cipher is clocked.
  • Towards the Generation of a Dynamic Key-Dependent S-Box to Enhance Security

    Towards the Generation of a Dynamic Key-Dependent S-Box to Enhance Security

    Towards the Generation of a Dynamic Key-Dependent S-Box to Enhance Security 1 Grasha Jacob, 2 Dr. A. Murugan, 3Irine Viola 1Research and Development Centre, Bharathiar University, Coimbatore – 641046, India, [email protected] [Assoc. Prof., Dept. of Computer Science, Rani Anna Govt College for Women, Tirunelveli] 2 Assoc. Prof., Dept. of Computer Science, Dr. Ambedkar Govt Arts College, Chennai, India 3Assoc. Prof., Dept. of Computer Science, Womens Christian College, Nagercoil, India E-mail: [email protected] ABSTRACT Secure transmission of message was the concern of early men. Several techniques have been developed ever since to assure that the message is understandable only by the sender and the receiver while it would be meaningless to others. In this century, cryptography has gained much significance. This paper proposes a scheme to generate a Dynamic Key-dependent S-Box for the SubBytes Transformation used in Cryptographic Techniques. Keywords: Hamming weight, Hamming Distance, confidentiality, Dynamic Key dependent S-Box 1. INTRODUCTION Today communication networks transfer enormous volume of data. Information related to healthcare, defense and business transactions are either confidential or private and warranting security has become more and more challenging as many communication channels are arbitrated by attackers. Cryptographic techniques allow the sender and receiver to communicate secretly by transforming a plain message into meaningless form and then retransforming that back to its original form. Confidentiality is the foremost objective of cryptography. Even though cryptographic systems warrant security to sensitive information, various methods evolve every now and then like mushroom to crack and crash the cryptographic systems. NSA-approved Data Encryption Standard published in 1977 gained quick worldwide adoption.
  • (SMC) MODULE of RC4 STREAM CIPHER ALGORITHM for Wi-Fi ENCRYPTION

    (SMC) MODULE of RC4 STREAM CIPHER ALGORITHM for Wi-Fi ENCRYPTION

    InternationalINTERNATIONAL Journal of Electronics and JOURNAL Communication OF Engineering ELECTRONICS & Technology (IJECET),AND ISSN 0976 – 6464(Print), ISSN 0976 – 6472(Online), Volume 6, Issue 1, January (2015), pp. 79-85 © IAEME COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET) ISSN 0976 – 6464(Print) IJECET ISSN 0976 – 6472(Online) Volume 6, Issue 1, January (2015), pp. 79-85 © IAEME: http://www.iaeme.com/IJECET.asp © I A E M E Journal Impact Factor (2015): 7.9817 (Calculated by GISI) www.jifactor.com VHDL MODELING OF THE SRAM MODULE AND STATE MACHINE CONTROLLER (SMC) MODULE OF RC4 STREAM CIPHER ALGORITHM FOR Wi-Fi ENCRYPTION Dr.A.M. Bhavikatti 1 Mallikarjun.Mugali 2 1,2Dept of CSE, BKIT, Bhalki, Karnataka State, India ABSTRACT In this paper, VHDL modeling of the SRAM module and State Machine Controller (SMC) module of RC4 stream cipher algorithm for Wi-Fi encryption is proposed. Various individual modules of Wi-Fi security have been designed, verified functionally using VHDL-simulator. In cryptography RC4 is the most widely used software stream cipher and is used in popular protocols such as Transport Layer Security (TLS) (to protect Internet traffic) and WEP (to secure wireless networks). While remarkable for its simplicity and speed in software, RC4 has weaknesses that argue against its use in new systems. It is especially vulnerable when the beginning of the output key stream is not discarded, or when nonrandom or related keys are used; some ways of using RC4 can lead to very insecure cryptosystems such as WEP . Many stream ciphers are based on linear feedback shift registers (LFSRs), which, while efficient in hardware, are less so in software.
  • A Novel and Highly Efficient AES Implementation Robust Against Differential Power Analysis Massoud Masoumi K

    A Novel and Highly Efficient AES Implementation Robust Against Differential Power Analysis Massoud Masoumi K

    A Novel and Highly Efficient AES Implementation Robust against Differential Power Analysis Massoud Masoumi K. N. Toosi University of Tech., Tehran, Iran [email protected] ABSTRACT been proposed. Unfortunately, most of these techniques are Developed by Paul Kocher, Joshua Jaffe, and Benjamin Jun inefficient or costly or vulnerable to higher-order attacks in 1999, Differential Power Analysis (DPA) represents a [6]. They include randomized clocks, memory unique and powerful cryptanalysis technique. Insight into encryption/decryption schemes [7], power consumption the encryption and decryption behavior of a cryptographic randomization [8], and decorrelating the external power device can be determined by examining its electrical power supply from the internal power consumed by the chip. signature. This paper describes a novel approach for Moreover, the use of different hardware logic, such as implementation of the AES algorithm which provides a complementary logic, sense amplifier based logic (SABL), significantly improved strength against differential power and asynchronous logic [9, 10] have been also proposed. analysis with a minimal additional hardware overhead. Our Some of these techniques require about twice as much area method is based on randomization in composite field and will consume twice as much power as an arithmetic which entails an area penalty of only 7% while implementation that is not protected against power attacks. does not decrease the working frequency, does not alter the For example, the technique proposed in [10] adds area 3 algorithm and keeps perfect compatibility with the times and reduces throughput by a factor of 4. Another published standard. The efficiency of the proposed method is masking which involves ensuring the attacker technique was verified by practical results obtained from cannot predict any full registers in the system without real implementation on a Xilinx Spartan-II FPGA.
  • Cryptographic Sponge Functions

    Cryptographic Sponge Functions

    Cryptographic sponge functions Guido B1 Joan D1 Michaël P2 Gilles V A1 http://sponge.noekeon.org/ Version 0.1 1STMicroelectronics January 14, 2011 2NXP Semiconductors Cryptographic sponge functions 2 / 93 Contents 1 Introduction 7 1.1 Roots .......................................... 7 1.2 The sponge construction ............................... 8 1.3 Sponge as a reference of security claims ...................... 8 1.4 Sponge as a design tool ................................ 9 1.5 Sponge as a versatile cryptographic primitive ................... 9 1.6 Structure of this document .............................. 10 2 Definitions 11 2.1 Conventions and notation .............................. 11 2.1.1 Bitstrings .................................... 11 2.1.2 Padding rules ................................. 11 2.1.3 Random oracles, transformations and permutations ........... 12 2.2 The sponge construction ............................... 12 2.3 The duplex construction ............................... 13 2.4 Auxiliary functions .................................. 15 2.4.1 The absorbing function and path ...................... 15 2.4.2 The squeezing function ........................... 16 2.5 Primary aacks on a sponge function ........................ 16 3 Sponge applications 19 3.1 Basic techniques .................................... 19 3.1.1 Domain separation .............................. 19 3.1.2 Keying ..................................... 20 3.1.3 State precomputation ............................ 20 3.2 Modes of use of sponge functions .........................