Efficient Implementation of Estream Ciphers on 8-Bit AVR Microcontrollers
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Comparison of 256-Bit Stream Ciphers at the Beginning of 2006
Comparison of 256-bit stream ciphers at the beginning of 2006 Daniel J. Bernstein ? [email protected] Abstract. This paper evaluates and compares several stream ciphers that use 256-bit keys: counter-mode AES, CryptMT, DICING, Dragon, FUBUKI, HC-256, Phelix, Py, Py6, Salsa20, SOSEMANUK, VEST, and YAMB. 1 Introduction ECRYPT, a consortium of European research organizations, issued a Call for Stream Cipher Primitives in November 2004. A remarkable variety of ciphers were proposed in response by a total of 97 authors spread among Australia, Belgium, Canada, China, Denmark, England, France, Germany, Greece, Israel, Japan, Korea, Macedonia, Norway, Russia, Singapore, Sweden, Switzerland, and the United States. Evaluating a huge pool of stream ciphers, to understand the merits of each cipher, is not an easy task. This paper simplifies the task by focusing on the relatively small pool of ciphers that allow 256-bit keys. Ciphers limited to 128- bit keys (or 80-bit keys) are ignored. See Section 2 to understand my interest in 256-bit keys. The ciphers allowing 256-bit keys are CryptMT, DICING, Dragon, FUBUKI, HC-256, Phelix, Py, Py6, Salsa20, SOSEMANUK, VEST, and YAMB. I included 256-bit AES in counter mode as a basis for comparison. Beware that there are unresolved claims of attacks against Py (see [4] and [3]), SOSEMANUK (see [1]), and YAMB (see [5]). ECRYPT, using measurement tools written by Christophe De Canni`ere, has published timings for each cipher on several common general-purpose CPUs. The original tools and timings used reference implementations (from the cipher authors) but were subsequently updated for faster implementations (also from the cipher authors). -
Security in Wireless Sensor Networks Using Cryptographic Techniques
American Journal of Engineering Research (AJER) 2014 American Journal of Engineering Research (AJER) e-ISSN : 2320-0847 p-ISSN : 2320-0936 Volume-03, Issue-01, pp-50-56 www.ajer.org Research Paper Open Access Security in Wireless Sensor Networks using Cryptographic Techniques Madhumita Panda Sambalpur University Institute of Information Technology(SUIIT)Burla, Sambalpur, Odisha, India. Abstract: -Wireless sensor networks consist of autonomous sensor nodes attached to one or more base stations.As Wireless sensor networks continues to grow,they become vulnerable to attacks and hence the need for effective security mechanisms.Identification of suitable cryptography for wireless sensor networks is an important challenge due to limitation of energy,computation capability and storage resources of the sensor nodes.Symmetric based cryptographic schemes donot scale well when the number of sensor nodes increases.Hence public key based schemes are widely used.We present here two public – key based algorithms, RSA and Elliptic Curve Cryptography (ECC) and found out that ECC have a significant advantage over RSA as it reduces the computation time and also the amount of data transmitted and stored. Keywords: -Wireless Sensor Network,Security, Cryptography, RSA,ECC. I. WIRELESS SENSOR NETWORK Sensor networks refer to a heterogeneous system combining tiny sensors and actuators with general- purpose computing elements. These networks will consist of hundreds or thousands of self-organizing, low- power, low-cost wireless nodes deployed to monitor and affect the environment [1]. Sensor networks are typically characterized by limited power supplies, low bandwidth, small memory sizes and limited energy. This leads to a very demanding environment to provide security. -
CHUCK CHONSON: AMERICAN CIPHER by ERIC NOLAN A
CHUCK CHONSON: AMERICAN CIPHER By ERIC NOLAN A THESIS PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF FINE ARTS UNIVERSITY OF FLORIDA 2003 Copyright 2003 by Eric Nolan To my parents, and to Nicky ACKNOWLEDGMENTS I thank my parents, my teachers, and my colleagues. Special thanks go to Dominique Wilkins and Don Mattingly. iv TABLE OF CONTENTS ACKNOWLEDGMENTS..................................................................................................iv ABSTRACT......................................................................................................................vii CHAPTER 1 LIVE-IN GIRLFRIEND, SHERRY CRAVENS ...................................................... 1 2 DEPARTMENT CHAIR, FURRY LUISSON..........................................................8 3 TRAIN CONDUCTOR, BISHOP PROBERT........................................................ 12 4 TWIN BROTHER, MARTY CHONSON .............................................................. 15 5 DEALER, WILLIE BARTON ................................................................................ 23 6 LADY ON BUS, MARIA WOESSNER................................................................. 33 7 CHILDHOOD PLAYMATE, WHELPS REMIEN ................................................ 36 8 GUY IN TRUCK, JOE MURHPY .........................................................................46 9 EX-WIFE, NORLITTA FUEGOS...........................................................................49 10 -
Improved Correlation Attacks on SOSEMANUK and SOBER-128
Improved Correlation Attacks on SOSEMANUK and SOBER-128 Joo Yeon Cho Helsinki University of Technology Department of Information and Computer Science, Espoo, Finland 24th March 2009 1 / 35 SOSEMANUK Attack Approximations SOBER-128 Outline SOSEMANUK Attack Method Searching Linear Approximations SOBER-128 2 / 35 SOSEMANUK Attack Approximations SOBER-128 SOSEMANUK (from Wiki) • A software-oriented stream cipher designed by Come Berbain, Olivier Billet, Anne Canteaut, Nicolas Courtois, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cedric` Lauradoux, Marine Minier, Thomas Pornin and Herve` Sibert. • One of the final four Profile 1 (software) ciphers selected for the eSTREAM Portfolio, along with HC-128, Rabbit, and Salsa20/12. • Influenced by the stream cipher SNOW and the block cipher Serpent. • The cipher key length can vary between 128 and 256 bits, but the guaranteed security is only 128 bits. • The name means ”snow snake” in the Cree Indian language because it depends both on SNOW and Serpent. 3 / 35 SOSEMANUK Attack Approximations SOBER-128 Overview 4 / 35 SOSEMANUK Attack Approximations SOBER-128 Structure 1. The states of LFSR : s0,..., s9 (320 bits) −1 st+10 = st+9 ⊕ α st+3 ⊕ αst, t ≥ 1 where α is a root of the primitive polynomial. 2. The Finite State Machine (FSM) : R1 and R2 R1t+1 = R2t ¢ (rtst+9 ⊕ st+2) R2t+1 = Trans(R1t) ft = (st+9 ¢ R1t) ⊕ R2t where rt denotes the least significant bit of R1t. F 3. The trans function Trans on 232 : 32 Trans(R1t) = (R1t × 0x54655307 mod 2 )≪7 4. The output of the FSM : (zt+3, zt+2, zt+1, zt)= Serpent1(ft+3, ft+2, ft+1, ft)⊕(st+3, st+2, st+1, st) 5 / 35 SOSEMANUK Attack Approximations SOBER-128 Previous Attacks • Authors state that ”No linear relation holds after applying Serpent1 and there are too many unknown bits...”. -
Applications of Search Techniques to Cryptanalysis and the Construction of Cipher Components. James David Mclaughlin Submitted F
Applications of search techniques to cryptanalysis and the construction of cipher components. James David McLaughlin Submitted for the degree of Doctor of Philosophy (PhD) University of York Department of Computer Science September 2012 2 Abstract In this dissertation, we investigate the ways in which search techniques, and in particular metaheuristic search techniques, can be used in cryptology. We address the design of simple cryptographic components (Boolean functions), before moving on to more complex entities (S-boxes). The emphasis then shifts from the construction of cryptographic arte- facts to the related area of cryptanalysis, in which we first derive non-linear approximations to S-boxes more powerful than the existing linear approximations, and then exploit these in cryptanalytic attacks against the ciphers DES and Serpent. Contents 1 Introduction. 11 1.1 The Structure of this Thesis . 12 2 A brief history of cryptography and cryptanalysis. 14 3 Literature review 20 3.1 Information on various types of block cipher, and a brief description of the Data Encryption Standard. 20 3.1.1 Feistel ciphers . 21 3.1.2 Other types of block cipher . 23 3.1.3 Confusion and diffusion . 24 3.2 Linear cryptanalysis. 26 3.2.1 The attack. 27 3.3 Differential cryptanalysis. 35 3.3.1 The attack. 39 3.3.2 Variants of the differential cryptanalytic attack . 44 3.4 Stream ciphers based on linear feedback shift registers . 48 3.5 A brief introduction to metaheuristics . 52 3.5.1 Hill-climbing . 55 3.5.2 Simulated annealing . 57 3.5.3 Memetic algorithms . 58 3.5.4 Ant algorithms . -
Cryptology: an Historical Introduction DRAFT
Cryptology: An Historical Introduction DRAFT Jim Sauerberg February 5, 2013 2 Copyright 2013 All rights reserved Jim Sauerberg Saint Mary's College Contents List of Figures 8 1 Caesar Ciphers 9 1.1 Saint Cyr Slide . 12 1.2 Running Down the Alphabet . 14 1.3 Frequency Analysis . 15 1.4 Linquist's Method . 20 1.5 Summary . 22 1.6 Topics and Techniques . 22 1.7 Exercises . 23 2 Cryptologic Terms 29 3 The Introduction of Numbers 31 3.1 The Remainder Operator . 33 3.2 Modular Arithmetic . 38 3.3 Decimation Ciphers . 40 3.4 Deciphering Decimation Ciphers . 42 3.5 Multiplication vs. Addition . 44 3.6 Koblitz's Kid-RSA and Public Key Codes . 44 3.7 Summary . 48 3.8 Topics and Techniques . 48 3.9 Exercises . 49 4 The Euclidean Algorithm 55 4.1 Linear Ciphers . 55 4.2 GCD's and the Euclidean Algorithm . 56 4.3 Multiplicative Inverses . 59 4.4 Deciphering Decimation and Linear Ciphers . 63 4.5 Breaking Decimation and Linear Ciphers . 65 4.6 Summary . 67 4.7 Topics and Techniques . 67 4.8 Exercises . 68 3 4 CONTENTS 5 Monoalphabetic Ciphers 71 5.1 Keyword Ciphers . 72 5.2 Keyword Mixed Ciphers . 73 5.3 Keyword Transposed Ciphers . 74 5.4 Interrupted Keyword Ciphers . 75 5.5 Frequency Counts and Exhaustion . 76 5.6 Basic Letter Characteristics . 77 5.7 Aristocrats . 78 5.8 Summary . 80 5.9 Topics and Techniques . 81 5.10 Exercises . 81 6 Decrypting Monoalphabetic Ciphers 89 6.1 Letter Interactions . 90 6.2 Decrypting Monoalphabetic Ciphers . -
Voice Encryption Using Twin Stream Cipher Algorithm تشفير الصوت باستخدام خوارزمية التوأم
Voice Encryption Using Twin Stream Cipher Algorithm تشفير الصوت باستخدام خوارزمية التوأم اﻻنسيابية Prepared by Omar Mejbel Hammad Aljouani ((401320142)) Supervisor Dr. Hebah H. O. Nasereddin Dr. Abdulkareem O. Ibadi Master Thesis Submitted in Partial Fulfillment of the Requirements of the Master Degree in Computer Science Department of Computer Science Faculty of Information Technology Middle East University Amman - Jordan January - 2016 II ((بسم هللا الرحمن الرحيم(( ّ يَ ْر ف عَََللاَهَا ّل ذي نََآ مَ هنواَ م ْن هك ْمََ وَا ّلَ ذي نََ} ه ه ْ ْ {أَوتواَال عل مََ دَ ر جات ))صدق هللا العظيم(( II III IV Acknowledgment I utilize this opportunity to thank everyone helped me reach this stage and everyone who encourage me during performing this thesis. I want to thank Dr. Hebah H. O. Nasereddin for her guidance and supervision during writing this thesis. Extended thanks are also for my family and friends who encourage me during writing this thesis. I also want to thank everyone who believes that the knowledge is right for everyone. The greatest thank ever to assistant prof. Abdulkareem O. Ibadi, the head of software engineering department at Baghdad College for economic sciences. V Dedication اهدي خﻻصة جهدي العلمي المتواضع الى : قرة عيني الرسول محمد عليه افضل الصﻻة واتم التسليم ...... وطني العراق الجريح .................................... اخي الشهيد الحاضر الغائب صهيب ................... والدي ووالدتي واختي رفاق دربي ومسيرتي ............... كل من كان له بصمة بجهدي العلمي هذا............. كل الشهداء الذين استشهدوا برصاص الغدر والخيانة ...... كل من كان يدعي لي ويوجهني ويتمنى لي الخير ......... جامعة بغداد أخص بها كلية التربية ابن الهيثم ....... اﻻعدادية المركزية للبنين .................. VI Table of Contents AUTHORIZATION STATEMENT .......................................................... -
Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks Jung-Keun Lee, Dong Hoon Lee, and Sangwoo Park ETRI Network & Communication Security Division, 909 Jeonmin-dong, Yuseong-gu, Daejeon, Korea Abstract. In this paper, we present a correlation attack on Sosemanuk with complexity less than 2150. Sosemanuk is a software oriented stream cipher proposed by Berbain et al. to the eSTREAM call for stream ci- pher and has been selected in the ¯nal portfolio. Sosemanuk consists of a linear feedback shift register(LFSR) of ten 32-bit words and a ¯nite state machine(FSM) of two 32-bit words. By combining linear approximation relations regarding the FSM update function, the FSM output function and the keystream output function, it is possible to derive linear approx- imation relations with correlation ¡2¡21:41 involving only the keystream words and the LFSR initial state. Using such linear approximation rela- tions, we mount a correlation attack with complexity 2147:88 and success probability 99% to recover the initial internal state of 384 bits. We also mount a correlation attack on SNOW 2.0 with complexity 2204:38. Keywords: stream cipher, Sosemanuk, SNOW 2.0, correlation attack, linear mask 1 Introduction Sosemanuk[3] is a software oriented stream cipher proposed by Berbain et al. to the eSTREAM call for stream cipher and has been selected in the ¯nal portfolio. The merits of Sosemanuk has been recognized as its considerable security margin and moderate performance[2]. Sosemanuk is based on the stream cipher SNOW 2.0[11] and the block cipher Serpent[1]. Though SNOW 2.0 is a highly reputed stream cipher, it is vulnerable to linear distinguishing attacks using linear masks[14, 15]. -
Efficient Implementation of Stream Ciphers on Embedded Processors
Efficient Implementation of Stream Ciphers on Embedded Processors Gordon Meiser 07.05.2007 Master Thesis Ruhr-University Bochum (Germany) Chair for Communication Security Prof. Dr.-Ing. Christof Paar Co-Advised by Kerstin Lemke-Rust and Thomas Eisenbarth “They who would give up an essential liberty for temporary security, deserve neither liberty or security.”(Benjamin Franklin, 1706-1790) iii STATEMENT / ERKLÄRUNG I hereby declare, that the work presented in this thesis is my own work and that to the best of my knowledge it is original, except where indicated by references to other authors. Hiermit versichere ich, dass ich meine Diplomarbeit selber verfasst und keine anderen als die angegebenen Quellen und Hilfsmittel benutzt, sowie Zitate kenntlich gemacht habe. Gezeichnet —————————– ——————————– Gordon Meiser Ort, Datum iv ACKNOWLEDGEMENT It is my pleasure to express my gratitude to all the people who contributed, in whatever manner, to the success of this work. I want to thank Prof. Dr.-Ing. Christof Paar for giving me the possibility to write my master thesis at the Chair for Communication Security at the Ruhr-University Bochum. Furthermore I’d like to thank my Co-Advisors Dipl.-Phys. Kerstin Lemke-Rust and Dipl.-Ing. Thomas Eisenbarth for advising me with writing scientific papers and an- swering all my questions. I also want to thank all the people sitting in my room, especially Leif Uhsadel and Sören Rinne, who helped me keep the focus on my work. I spent many nights working on my master thesis and with Leif this time was much easier to bear. Another thank you goes to all reviewers, especially to Phill Cabeen for reading, correcting, and revising my master thesis from the view of a native English speaker. -
Poly-Dragon: an Efficient Multivariate Public Key Cryptosystem
J. Math. Cryptol. 4 (2010), 349–364 DOI 10.1515/JMC.2011.002 © de Gruyter 2011 Poly-Dragon: an efficient multivariate public key cryptosystem Rajesh P. Singh, A. Saikia and B. K. Sarma Communicated by Neal Koblitz Abstract. In this paper, we propose an efficient multivariate public key cryptosystem. Public key of our cryptosystem contains polynomials of total degree three in plaintext and ciphertext variables, two in plaintext variables and one in ciphertext variables. However, it is possible to reduce the public key size by writing it as two sets of quadratic multivariate polynomials. The complexity of encryption in our public key cryptosystem is O.n3/, where n is bit size, which is equivalent to other multivariate public key cryptosystems. For decryption we need only four exponentiations in the binary field. Our Public key algorithm is bijective and can be used for encryption as well as for signatures. Keywords. Permutation polynomial, multivariate cryptography, Little Dragon and Big Dragon cryptosystems. 2010 Mathematics Subject Classification. 11T71, 11T06, 94A60. 1 Introduction Public key cryptography has several practical applications, for example in elec- tronic commerce systems for authentication (electronic signatures) and for secure communication. The most widely used cryptosystems RSA and ECC (elliptic curve cryptosystems) are based on the problems of integer factorization and dis- crete logarithm respectively. Integer factorization and discrete logarithm problems are only believed to be hard but no proof is known for their NP-completeness or NP-hardness. Improvements in factorization algorithms and computation power demands larger bit size in RSA key which makes RSA less efficient for practical applications. -
Improved Guess and Determine Attack on SOSEMANUK
Improved Guess and Determine Attack on SOSEMANUK Hadi Ahmadi 1, Taraneh Eghlidos 2, Shahram Khazaei 3 1 School of Electrical Engineering, Sharif University of Technology, Tehran, Iran. 2 Electronics Research Center, Sharif University of Technology, Tehran, Iran. 3 Zaeim Electronic Industries Co., Tehran, Iran. [email protected], [email protected], [email protected] Abstract. SOSEMANUK is a word-oriented stream cipher submitted to the ECRYPT stream cipher project, with a variable-length key between 128 and 256 bits. The algorithm is similar to the stream cipher SNOW 2.0 except having a smaller LFSR that can lead to higher efficiency. In this paper, we introduce a Guess and Determine (GD) attack on the stream cipher SOSEMANUK with a complexity of O(2226). The results show that the cipher has still the 128-bit security claimed by the authors, but does not provide full security when the key of length more than 226 bits is used. 1 Introduction Word-oriented stream ciphers are a class of stream ciphers in which the operations are done on blocks of w bits long, called word, and over the Galois Field GF(2w). The most important characteristic of these ciphers is their efficiency because they generate blocks of several bits instead of one bit per clock. Having much higher speed while being much smaller in hardware, word-oriented stream ciphers became of great interests to the industry and many cryptologists. The NESSIE project [1] started its first announcement in 2000 on cryptographic primitives from different fields of cryptography. The main objective was to collect and introduce strong cryptographic algorithms as standards in different fields of cryptography such as block ciphers, stream ciphers, MAC algorithms, hash functions, public key schemes and so on. -
A Novel Stream Cipher with Dynamic Structure By
A NOVEL STREAM CIPHER WITH DYNAMIC STRUCTURE BY FARDOUS MOHAMED ALI ELJADI A thesis submitted in fulfillment of the requirement for the degree of Doctor of Philosophy in Computer Science Kulliyyah of Information and Communication Technology International Islamic University Malaysia MARCH 2017 ABSTRACT Stream ciphers are commonly used to provide confidentiality for a wide range of frame based applications such as mobile devices or embedded systems. For these applications, stream ciphers are preferred for encryption due to the simplicity of their implementation, efficiency and high throughput. However, practical attacks have been discovered on well-known stream ciphers. Many stream ciphers are designed to resist these attacks. The majority of these ciphers has a fixed structure, which is an advantage that their security against the known attacks can be proved. However, the fixed building structure of these ciphers also provides opportunities for potential new attacks. There have been a few approaches that have tried to add dynamicity to the structure of these ciphers to improve their security level. The idea behind this is that when the structures of ciphers are unknown to attackers, they are more resistant to attacks. However, these ciphers are not widely discussed among researchers. Moreover, the existing research concerning stream ciphers with dynamic structures has focused mostly on dynamic polynomial switching in the Linear Feedback Shift Registers. This study proposes a novel dynamic structure stream cipher algorithm based on using a dynamic structure and some parameters to increase the complexity of the cipher, consequently, improving its security level. In the proposed cipher, the dynamic parameters are the number of registers, the length of the registers, the clocking system, the initialization procedure, the confusion and diffusion method, and the output function.