DOCSLIB.ORG

Thèse De Doctorat Ons JALLOULI

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Thèse de Doctorat Ons JALLOULI Mémoire présenté en vue de l’obtention du grade de Docteur de l’Université de Nantes sous le sceau de l’Université Bretagne Loire École doctorale : Sciences et technologies de l’information, et mathématiques Discipline : Electronique/spécialité:Sciences de l’Information et de la Communication. Unité de recherche : Institut d’Electronique et de Télécommunications de Rennes UMR CNRS 6164(IETR) Soutenue le 27 Octobre 2017 Chaos-based security under real-time and energy constraints for the Internet of Things JURY Président : M. René LOZI, Professeur des Universités, Université de Nice Sophia-Antipolis Rapporteurs : M. Thomas GROSGES, Professeur des Universités, Université de Technologie de Troyes Mme Samia BOUZEFRANE, Maître de conférences, HDR, Conservatoire National des Arts et Métiers (CNAM Paris) Invités : M. Thang HOANG MANH, Maître de conférences, Hanoi University of Science and Technology M. Marc BIDAN, Professeur des Universités, Université de Nantes Directeur de thèse : M. Safwan EL ASSAD, Maître de Conférences, HDR, Université de Nantes Co-directrice de thèse : Mme Maryline CHETTO, Professeur des Universités, Université de Nantes Contents 1 Introduction 13 1.1 Preface . 14 1.2 Motivations and objectives . 15 1.3 Thesis Outline and Contributions . 16 2 State of the art 19 2.1 Introduction . 20 2.2 Cryptography: foundation and basic concepts . 20 2.2.1 Symmetric encryption algorithms . 21 2.2.2 Block ciphers . 22 2.2.3 Stream ciphers . 24 2.3 Chaos-based cryptography . 31 2.3.1 Chaos Theory . 31 2.3.2 Chaotic maps . 32 2.3.3 Chaos Applications in Cryptography . 35 2.4 Conclusion . 44 3 Performance evaluation of some chaotic maps as base of proposed chaos-based stream ciphers 45 3.1 Introduction . 46 3.2 Common and standard security performance evaluation tools . 46 3.2.1 Phase space . 47 3.2.2 Histogram analysis . 47 3.2.3 Chi-square test analysis . 47 3.2.4 Correlation analysis . 47 3.2.5 NIST test analysis . 48 3.2.6 Computing performance analysis . 48 3.3 Performance Evaluation of some chaotic maps . 48 3.3.1 Performance Evaluation of the Logistic map . 49 3.3.2 Performance Evaluation of the Skew Tent map . 51 3.3.3 Performance Evaluation of the PWLCM map . 57 3.4 Performance Evaluation of some disturbed chaotic maps . 60 3.4.1 Description of the used perturbation technique . 60 3.4.2 Performance Evaluation of the disturbed Logistic map . 62 3.4.3 Performance Evaluation of the disturbed Skew Tent map . 66 3.4.4 Performance Evaluation of the disturbed PWLCM map . 67 3.5 Performance Evaluation of some disturbed chaotic maps including recursive technique . 68 3.5.1 Description of the proposed non linear recursive structure . 68 3.5.2 Performance evaluation of the non linear recursive structure using the disturbed Logistic map . 70 3 4 CONTENTS 3.5.3 Performance evaluation of the non linear recursive structure using the disturbed Skew Tent map . 74 3.5.4 Performance evaluation of the non linear recursive structure using the disturbed PWLCM map . 75 3.6 Conclusion . 78 4 Design, implementation and analysis of Pseudo-chaotic Number Generators and Stream ci- phers 85 4.1 Introduction . 86 4.2 Proposed Pseudo-Chaotic Number Generators . 86 4.2.1 Description of the general proposed structure of PCNGs . 87 4.2.2 Implementation of the proposed PCNGs . 90 4.2.3 Security Analysis of the proposed PCNGs . 96 4.2.4 Statistical Analysis of the proposed PCNGs . 97 4.2.5 Speed performance of the proposed PCNGs . 105 4.3 Proposed chaos-based stream ciphers . 107 4.3.1 Security analysis of the proposed stream ciphers . 111 4.3.2 Statistical analysis of the proposed stream ciphers . 114 4.3.3 Computing performance of the proposed stream ciphers . 118 4.4 Conclusion . 120 5 Energy and Power consumption evaluation and Real-Time Implementation of the proposed stream ciphers 123 5.1 Introduction . 124 5.2 Energy and Power consumption evaluation . 125 5.2.1 Energy and power measurement tools . 125 5.2.2 Measurement of energy consumption with RAPL . 127 5.2.3 Measurement of power consumption with PowerTOP tool . 128 5.3 Memory assessment . 128 5.3.1 FELICS framework . 128 5.3.2 Code size and RAM consumption results . 130 5.4 Integration of a real-time crypto-system . 130 5.4.1 Definitions . 130 5.4.2 Classification of real-time systems . 132 5.4.3 Real-time task characterization and modelling . 132 5.4.4 Real-time operating system . 135 5.4.5 Integration of crypto-systems in Xenomai framework . 137 5.4.6 Measurements under the RTOS Xenomai . 141 5.5 Conclusion . 144 6 Conclusions and Perspectives 147 Appendices 151 A Synthèse des travaux réalisés: Sécurité basée Chaos sous contraintes temps réel et d’énergie pour l’Internet des Objets 153 A.1 Contexte et Objectives . 153 A.2 Contributions: . 154 A.2.1 1 ère contribution: Conception, mise en oeuvre et analyse de générateurs de nom- bres pseudo-chaotiques et systèmes de chiffrement par flux . 154 CONTENTS 5 A.2.2 2 ème contribution: Évaluation de la consommation d’énergie et mise en œuvre en temps réel des systèmes de chiffrement par flux proposés . 158 B List of perturbation polynomials 161 List of Tables 2.1 Key lengths and number of rounds for AES. 23 2.2 Parameters of the A5/1 Registers. 27 2.3 The finalist stream ciphers for the eStream project. 27 2.4 Symbols and their meaning used in HC-128 stream cipher. 30 2.5 Functions used in HC-128 stream cipher and their description. 30 3.1 P-values and Proportion results of NIST test for the Logistic map. 54 3.2 Computing performance of the Logistic map. 54 3.3 P-values and Proportion results of NIST test for the Skew Tent map. 58 3.4 Computing performance of the Skew Tent map. 58 3.5 P-values and Proportion results of NIST test for the PWLCM map. 63 3.6 Computing performance of the PWLCM map. 63 3.7 P-values and Proportion results of NIST test for the disturbed Logistic map. 64 3.8 Computing performance of the disturbed Logistic map. 65 3.9 P-values and Proportion results of NIST test for the disturbed Skew Tent map. 67 3.10 Computing performance of the disturbed Skew Tent map. 67 3.11 P-values and Proportion results of NIST test for the disturbed PWLCM map. 69 3.12 Computing performance of the disturbed PWLCM map. 69 3.13 Correlation coefficient values for sequences generated by the structure of Figure 3.5.2 using the disturbed Logistic map with delays equal to 1, 2 and 3. 71 3.14 Theoretical and experimental values of Chi-square test for sequences generated by the struc- ture of Fig. 3.5.2 with delay equal to 1 and using the disturbed Logistic map. 72 3.15 P-values and Proportion results of NIST test for the disturbed Logistic map in a recursive structure. 74 3.16 Computing performance of the structure of Fig. 3.5.2 with delays equal to 1, 2 and 3 and using the disturbed Logistic map. 74 3.17 Correlation coefficient values for sequences generated by the structure of Fig. 3.5.2 using the disturbed Skew Tent map with delays equal to 1, 2 and 3. 74 3.18 Theoretical and experimental values of Chi-square test for sequences generated by the struc- ture of Fig. 3.5.2 with delay equal to 1 and using the disturbed Skew Tent map. 75 3.19 P-values and Proportion results of NIST test for the disturbed Skew Tent map in a recursive structure. 79 3.20 Computing performance of the structure of Fig. 3.5.2 with delays equal to 1, 2 and 3 and using the disturbed Skew Tent map. 79 3.21 Correlation coefficient values for sequences generated by the structure of Fig. 3.5.2 using the disturbed PWLCM map with delays equal to 1, 2 and 3. 79 3.22 Theoretical and experimental values of Chi-square test for sequences generated by the struc- ture of Fig. 3.5.2 with delay equal to 1 and using the disturbed PWLCM map. 79 3.23 P-values and Proportion results of NIST test for the disturbed PWLCM map in a recursive structure. ..
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.
  • (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.
  • Most Popular ■ CORN STALK RUNNER at Flock Together This 2017 TROY TURKEY TROT

    Most Popular ■ CORN STALK RUNNER at Flock Together This 2017 TROY TURKEY TROT

    COVERING FREE! UPSTATE NY NOVEMBER SINCE 2000 2018 Flock Together this Thanksgiving ■ 5K START AT 2013 TROY TURKEY TROT. JOIN THE CONTENTS 1 Running & Walking Most Popular ■ CORN STALK RUNNER AT Flock Together this 2017 TROY TURKEY TROT. Thanksgiving! 3 Alpine Skiing & Boarding Strutting Day! Ready for Ski Season! By Laura Clark 5 News Briefs 5 From the Publishers hat I enjoy most about Thanksgiving is that it is a teams are encouraged and die-hards relaxed, all-American holiday. And what is more are invited to try for the individual 50K option. 6-9 CALENDAR OF EVENTS WAmerican than our plucky, ungainly turkey? Granted, Proceeds benefit the Regional Food Bank of Northeastern New although Ben Franklin lost his bid to elevate our native species to November to January York, enabling them to ensure a bountiful Thanksgiving for every- national symbol status, the turkey gets the last cackle. For when one. (fleetfeetalbany.com) Things to Do was the last time you celebrated eagle day? On Thanksgiving Day, Thursday, November 22, get ready for 11 Hiking, Snowshoeing In a wishbone world, Thanksgiving gives the least offense. the most popular running day of the whole year. Sample one of Sure, it is a worry for turkeys but a trade-off if you consider all the these six races in our area. & Camping free publicity. While slightly distasteful for vegetarians, there are While most trots cater to the 5K crowd, perfect for strollers, West Stony Creek: Well-Suited all those yummy sides and desserts to consider. Best of all is the aspiring turklings and elders, the premiere 71st annual Troy emphasis on family members, from toms to hens to the littlest Turkey Trot is the only area race where it is still possible to double for Late Fall/Early Winter turklings (think ducklings).
  • The Moral Character of Cryptographic Work⋆

    The Moral Character of Cryptographic Work⋆

    The Moral Character of Cryptographic Work? Phillip Rogaway Department of Computer Science University of California, Davis, USA [email protected] December 2015 (minor revisions March 2016) Abstract. Cryptography rearranges power: it configures who can do what, from what. This makes cryptography an inherently political tool, and it confers on the field an intrinsically moral dimension. The Snowden revelations motivate a reassessment of the political and moral positioning of cryptography. They lead one to ask if our inability to effectively address mass surveillance constitutes a failure of our field. I believe that it does. I call for a community-wide effort to develop more effective means to resist mass surveillance. I plead for a reinvention of our disciplinary culture to attend not only to puzzles and math, but, also, to the societal implications of our work. Keywords: cryptography · ethics · mass surveillance · privacy · Snowden · social responsibility Preamble. Most academic cryptographers seem to think that our field is a fun, deep, and politically neutral game|a set of puzzles involving communicating parties and notional adversaries. This vision of who we are animates a field whose work is intellectually impressive and rapidly produced, but also quite inbred and divorced from real-world concerns. Is this what cryptography should be like? Is it how we should expend the bulk of our intellectual capital? For me, these questions came to a head with the Snowden disclosures of 2013. If cryptography's most basic aim is to enable secure communications, how could it not be a colossal failure of our field when ordinary people lack even a modicum of communication privacy when interacting electronically? Yet I soon realized that most cryptographers didn't see it this way.
  • An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext

    An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext

    An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext By Isaac Quinn DuPont A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Faculty of Information University of Toronto © Copyright by Isaac Quinn DuPont 2017 ii An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext Isaac Quinn DuPont Doctor of Philosophy Faculty of Information University of Toronto 2017 Abstract Tis dissertation is an archeological study of cryptography. It questions the validity of thinking about cryptography in familiar, instrumentalist terms, and instead reveals the ways that cryptography can been understood as writing, media, and computation. In this dissertation, I ofer a critique of the prevailing views of cryptography by tracing a number of long overlooked themes in its history, including the development of artifcial languages, machine translation, media, code, notation, silence, and order. Using an archeological method, I detail historical conditions of possibility and the technical a priori of cryptography. Te conditions of possibility are explored in three parts, where I rhetorically rewrite the conventional terms of art, namely, plaintext, encryption, and ciphertext. I argue that plaintext has historically been understood as kind of inscription or form of writing, and has been associated with the development of artifcial languages, and used to analyze and investigate the natural world. I argue that the technical a priori of plaintext, encryption, and ciphertext is constitutive of the syntactic iii and semantic properties detailed in Nelson Goodman’s theory of notation, as described in his Languages of Art. I argue that encryption (and its reverse, decryption) are deterministic modes of transcription, which have historically been thought of as the medium between plaintext and ciphertext.
  • Solutions Manual

    Solutions Manual

    SOLUTIONS MANUAL CRYPTOGRAPHY AND NETWORK SECURITY PRINCIPLES AND PRACTICE FOURTH EDITION WILLIAM STALLINGS Copyright 2006: William Stallings -2- © 2006 by William Stallings All rights reserved. No part of this document may be reproduced, in any form or by any means, or posted on the Internet, without permission in writing from the author. -3- NOTICE This manual contains solutions to all of the review questions and homework problems in Cryptography and Network Security, Fourth Edition. If you spot an error in a solution or in the wording of a problem, I would greatly appreciate it if you would forward the information via email to [email protected]. An errata sheet for this manual, if needed, is available at ftp://shell.shore.net/members/w/s/ws/S. W.S. -4- TABLE OF CONTENTS Chapter 1: Introduction..............................................................................................5 Chapter 2: Classical Encryption Techniques ............................................................7 Chapter 3: Block Ciphers and the Date Encryption Standard .............................. 13 Chapter 4: Finite Fields ............................................................................................ 21 Chapter 5: Advanced Encryption Standard ........................................................... 28 Chapter 6: More on Symmetric Ciphers ................................................................. 33 Chapter 7: Confidentiality Using Symmetric Encryption..................................... 38 Chapter 8: Introduction to Number Theory..........................................................
  • Bias in the LEVIATHAN Stream Cipher

    Bias in the LEVIATHAN Stream Cipher

    Bias in the LEVIATHAN Stream Cipher Paul Crowley1? and Stefan Lucks2?? 1 cryptolabs Amsterdam [email protected] 2 University of Mannheim [email protected] Abstract. We show two methods of distinguishing the LEVIATHAN stream cipher from a random stream using 236 bytes of output and pro- portional effort; both arise from compression within the cipher. The first models the cipher as two random functions in sequence, and shows that the probability of a collision in 64-bit output blocks is doubled as a re- sult; the second shows artifacts where the same inputs are presented to the key-dependent S-boxes in the final stage of the cipher for two suc- cessive outputs. Both distinguishers are demonstrated with experiments on a reduced variant of the cipher. 1 Introduction LEVIATHAN [5] is a stream cipher proposed by David McGrew and Scott Fluhrer for the NESSIE project [6]. Like most stream ciphers, it maps a key onto a pseudorandom keystream that can be XORed with the plaintext to generate the ciphertext. But it is unusual in that the keystream need not be generated in strict order from byte 0 onwards; arbitrary ranges of the keystream may be generated efficiently without the cost of generating and discarding all prior val- ues. In other words, the keystream is “seekable”. This property allows data from any part of a large encrypted file to be retrieved efficiently, without decrypting the whole file prior to the desired point; it is also useful for applications such as IPsec [2]. Other stream ciphers with this property include block ciphers in CTR mode [3].
  • RC4-2S: RC4 Stream Cipher with Two State Tables

    RC4-2S: RC4 Stream Cipher with Two State Tables

    RC4-2S: RC4 Stream Cipher with Two State Tables Maytham M. Hammood, Kenji Yoshigoe and Ali M. Sagheer Abstract One of the most important symmetric cryptographic algorithms is Rivest Cipher 4 (RC4) stream cipher which can be applied to many security applications in real time security. However, RC4 cipher shows some weaknesses including a correlation problem between the public known outputs of the internal state. We propose RC4 stream cipher with two state tables (RC4-2S) as an enhancement to RC4. RC4-2S stream cipher system solves the correlation problem between the public known outputs of the internal state using permutation between state 1 (S1) and state 2 (S2). Furthermore, key generation time of the RC4-2S is faster than that of the original RC4 due to less number of operations per a key generation required by the former. The experimental results confirm that the output streams generated by the RC4-2S are more random than that generated by RC4 while requiring less time than RC4. Moreover, RC4-2S’s high resistivity protects against many attacks vulnerable to RC4 and solves several weaknesses of RC4 such as distinguishing attack. Keywords Stream cipher Á RC4 Á Pseudo-random number generator This work is based in part, upon research supported by the National Science Foundation (under Grant Nos. CNS-0855248 and EPS-0918970). Any opinions, findings and conclusions or recommendations expressed in this material are those of the author (s) and do not necessarily reflect the views of the funding agencies or those of the employers. M. M. Hammood Applied Science, University of Arkansas at Little Rock, Little Rock, USA e-mail: [email protected] K.
  • On the Use of Continued Fractions for Stream Ciphers

    On the Use of Continued Fractions for Stream Ciphers

    On the use of continued fractions for stream ciphers Amadou Moctar Kane Département de Mathématiques et de Statistiques, Université Laval, Pavillon Alexandre-Vachon, 1045 av. de la Médecine, Québec G1V 0A6 Canada. [email protected] May 25, 2013 Abstract In this paper, we present a new approach to stream ciphers. This method draws its strength from public key algorithms such as RSA and the development in continued fractions of certain irrational numbers to produce a pseudo-random stream. Although the encryption scheme proposed in this paper is based on a hard mathematical problem, its use is fast. Keywords: continued fractions, cryptography, pseudo-random, symmetric-key encryption, stream cipher. 1 Introduction The one time pad is presently known as one of the simplest and fastest encryption methods. In binary data, applying a one time pad algorithm consists of combining the pad and the plain text with XOR. This requires the use of a key size equal to the size of the plain text, which unfortunately is very difficult to implement. If a deterministic program is used to generate the keystream, then the system will be called stream cipher instead of one time pad. Stream ciphers use a great deal of pseudo- random generators such as the Linear Feedback Shift Registers (LFSR); although cryptographically weak [37], the LFSRs present some advantages like the fast time of execution. There are also generators based on Non-Linear transitions, examples included the Non-Linear Feedback Shift Register NLFSR and the Feedback Shift with Carry Register FCSR. Such generators appear to be more secure than those based on LFSR.
  • On the Design and Analysis of Stream Ciphers Hell, Martin

    On the Design and Analysis of Stream Ciphers Hell, Martin

    On the Design and Analysis of Stream Ciphers Hell, Martin 2007 Link to publication Citation for published version (APA): Hell, M. (2007). On the Design and Analysis of Stream Ciphers. Department of Electrical and Information Technology, Lund University. Total number of authors: 1 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 On the Design and Analysis of Stream Ciphers Martin Hell Ph.D. Thesis September 13, 2007 Martin Hell Department of Electrical and Information Technology Lund University Box 118 S-221 00 Lund, Sweden e-mail: [email protected] http://www.eit.lth.se/ ISBN: 91-7167-043-2 ISRN: LUTEDX/TEIT-07/1039-SE c Martin Hell, 2007 Abstract his thesis presents new cryptanalysis results for several different stream Tcipher constructions.
  • Grein a New Non-Linear Cryptoprimitive

    Grein a New Non-Linear Cryptoprimitive

    UNIVERSITY OF BERGEN Grein A New Non-Linear Cryptoprimitive by Ole R. Thorsen Thesis for the degree Master of Science December 2013 in the Faculty of Mathematics and Natural Sciences Department of Informatics Acknowledgements I want to thank my supervisor Tor Helleseth for all his help during the writing of this thesis. Further, I wish to thank the Norwegian National Security Authority, for giving me access to their Grein cryptosystem. I also wish to thank all my colleagues at the Selmer Centre, for all the inspiring discus- sions. Most of all I wish to thank prof. Matthew Parker for all his input, and my dear friends Stian, Mikal and Jørgen for their spellchecking, and socialising in the breaks. Finally, I wish to thank my girlfriend, Therese, and my family, for their continuous sup- port during the writing of this thesis. Without you, this would not have been possible. i Contents Acknowledgementsi List of Figures iv List of Tablesv 1 Introduction1 2 Cryptography2 2.1 Classical Cryptography............................3 2.2 Modern Cryptography.............................4 3 Stream Ciphers5 3.1 Stream Cipher Fundamentals.........................5 3.2 Classification of Stream Ciphers........................6 3.3 One-Time Pad.................................7 4 Building Blocks8 4.1 Boolean Functions...............................8 4.1.1 Cryptographic Properties....................... 10 4.2 Linear Feedback Shift Registers........................ 11 4.2.1 The Recurrence Relation....................... 12 4.2.2 The Matrix Method.......................... 12 4.2.3 Characteristic Polynomial....................... 13 4.2.4 Period of a Sequence.......................... 14 4.3 Linear Complexity............................... 16 4.4 The Berlekamp-Massey Algorithm...................... 16 4.5 Non-Linear Feedback Shift Registers....................