Revisiting a Recent Resource-Efficient Technique For
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Detection and Exploitation of Small Correlations in Stream Ciphers
Detection and Exploitation of Small Correlations in Stream Ciphers Masterthesis conducted under the guidance of Prof. Dr. Joachim Rosenthal and Dr. Gérard Maze Institute of Mathematics, University of Zurich 2008 Urs Wagner Outline This thesis gives an overview of stream ciphers based on linear feedback shift registers (LFSR) and their vulnerability to correlation attacks. In the rst chapter, a short introduction to symmetric key ciphers is given. The main focus hereby is on LFSR based stream ciphers. Further, the principles of LFSR are presented. The chapter is then closed by a stream cipher example, the Gee Generator. The second chapter treats the general approach of correlation attacks. Moreover a correlation attack is mounted on the Gee Generator and the practical results are presented. Boolean functions play an important role in stream cipher designs. The Walsh transform, a tool to analyze the cryptographic properties of Boolean functions, is introduced in chapter 3. Additionally, the cryptographic properties themselves are discussed. In the fourth chapter, an improved kind of correlation attack -the fast correlation attack- is presented. It exploits the same weaknesses in the stream cipher designs as the correlation attack, the mode of operation is however dierent. In the last chapter, the insights gained in the previous chapters are used to suggest an attack on a stream cipher by Philips, named Hitag 2. 1 Acknowledgments This thesis was written in the course of my master's studies at the University of Zurich. I am grateful to Prof. Joachim Rosenthal who gave me the opportunity to write my master thesis in cryptography. Special thanks go to Dr. -
Key Differentiation Attacks on Stream Ciphers
Key differentiation attacks on stream ciphers Abstract In this paper the applicability of differential cryptanalytic tool to stream ciphers is elaborated using the algebraic representation similar to early Shannon’s postulates regarding the concept of confusion. In 2007, Biham and Dunkelman [3] have formally introduced the concept of differential cryptanalysis in stream ciphers by addressing the three different scenarios of interest. Here we mainly consider the first scenario where the key difference and/or IV difference influence the internal state of the cipher (∆key, ∆IV ) → ∆S. We then show that under certain circumstances a chosen IV attack may be transformed in the key chosen attack. That is, whenever at some stage of the key/IV setup algorithm (KSA) we may identify linear relations between some subset of key and IV bits, and these key variables only appear through these linear relations, then using the differentiation of internal state variables (through chosen IV scenario of attack) we are able to eliminate the presence of corresponding key variables. The method leads to an attack whose complexity is beyond the exhaustive search, whenever the cipher admits exact algebraic description of internal state variables and the keystream computation is not complex. A successful application is especially noted in the context of stream ciphers whose keystream bits evolve relatively slow as a function of secret state bits. A modification of the attack can be applied to the TRIVIUM stream cipher [8], in this case 12 linear relations could be identified but at the same time the same 12 key variables appear in another part of state register. -
Side Channel Analysis Attacks on Stream Ciphers
Side Channel Analysis Attacks on Stream Ciphers Daehyun Strobel 23.03.2009 Masterarbeit Ruhr-Universität Bochum Lehrstuhl Embedded Security Prof. Dr.-Ing. Christof Paar Betreuer: Dipl.-Ing. Markus Kasper Erklärung Ich versichere, dass ich die Arbeit ohne fremde Hilfe und ohne Benutzung anderer als der angegebenen Quellen angefertigt habe und dass die Arbeit in gleicher oder ähnlicher Form noch keiner anderen Prüfungsbehörde vorgelegen hat und von dieser als Teil einer Prüfungsleistung angenommen wurde. Alle Ausführungen, die wörtlich oder sinngemäß übernommen wurden, sind als solche gekennzeichnet. Bochum, 23.März 2009 Daehyun Strobel ii Abstract In this thesis, we present results from practical differential power analysis attacks on the stream ciphers Grain and Trivium. While most published works on practical side channel analysis describe attacks on block ciphers, this work is among the first ones giving report on practical results of power analysis attacks on stream ciphers. Power analyses of stream ciphers require different methods than the ones used in todays most popular attacks. While for the majority of block ciphers it is sufficient to attack the first or last round only, to analyze a stream cipher typically the information leakages of many rounds have to be considered. Furthermore the analysis of hardware implementations of stream ciphers based on feedback shift registers inevitably leads to methods combining algebraic attacks with methods from the field of side channel analysis. Instead of a direct recovery of key bits, only terms composed of several key bits and bits from the initialization vector can be recovered. An attacker first has to identify a sufficient set of accessible terms to finally solve for the key bits. -
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. -
Analysis of Lightweight Stream Ciphers
ANALYSIS OF LIGHTWEIGHT STREAM CIPHERS THÈSE NO 4040 (2008) PRÉSENTÉE LE 18 AVRIL 2008 À LA FACULTÉ INFORMATIQUE ET COMMUNICATIONS LABORATOIRE DE SÉCURITÉ ET DE CRYPTOGRAPHIE PROGRAMME DOCTORAL EN INFORMATIQUE, COMMUNICATIONS ET INFORMATION ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR Simon FISCHER M.Sc. in physics, Université de Berne de nationalité suisse et originaire de Olten (SO) acceptée sur proposition du jury: Prof. M. A. Shokrollahi, président du jury Prof. S. Vaudenay, Dr W. Meier, directeurs de thèse Prof. C. Carlet, rapporteur Prof. A. Lenstra, rapporteur Dr M. Robshaw, rapporteur Suisse 2008 F¨ur Philomena Abstract Stream ciphers are fast cryptographic primitives to provide confidentiality of electronically transmitted data. They can be very suitable in environments with restricted resources, such as mobile devices or embedded systems. Practical examples are cell phones, RFID transponders, smart cards or devices in sensor networks. Besides efficiency, security is the most important property of a stream cipher. In this thesis, we address cryptanalysis of modern lightweight stream ciphers. We derive and improve cryptanalytic methods for dif- ferent building blocks and present dedicated attacks on specific proposals, including some eSTREAM candidates. As a result, we elaborate on the design criteria for the develop- ment of secure and efficient stream ciphers. The best-known building block is the linear feedback shift register (LFSR), which can be combined with a nonlinear Boolean output function. A powerful type of attacks against LFSR-based stream ciphers are the recent algebraic attacks, these exploit the specific structure by deriving low degree equations for recovering the secret key. -
Bahles of Cryptographic Algorithms
Ba#les of Cryptographic Algorithms: From AES to CAESAR in Soware & Hardware Kris Gaj George Mason University Collaborators Joint 3-year project (2010-2013) on benchmarking cryptographic algorithms in software and hardware sponsored by software FPGAs FPGAs/ASICs ASICs Daniel J. Bernstein, Jens-Peter Kaps Patrick Leyla University of Illinois George Mason Schaumont Nazhand-Ali at Chicago University Virginia Tech Virginia Tech CERG @ GMU hp://cryptography.gmu.edu/ 10 PhD students 4 MS students co-advised by Kris Gaj & Jens-Peter Kaps Outline • Introduction & motivation • Cryptographic standard contests Ø AES Ø eSTREAM Ø SHA-3 Ø CAESAR • Progress in evaluation methods • Benchmarking tools • Open problems Cryptography is everywhere We trust it because of standards Buying a book on-line Withdrawing cash from ATM Teleconferencing Backing up files over Intranets on remote server Cryptographic Standards Before 1997 Secret-Key Block Ciphers 1977 1999 2005 IBM DES – Data Encryption Standard & NSA Triple DES Hash Functions 1993 1995 2003 NSA SHA-1–Secure Hash Algorithm SHA SHA-2 1970 1980 1990 2000 2010 time Cryptographic Standard Contests IX.1997 X.2000 AES 15 block ciphers → 1 winner NESSIE I.2000 XII.2002 CRYPTREC XI.2004 V.2008 34 stream 4 HW winners eSTREAM ciphers → + 4 SW winners XI.2007 X.2012 51 hash functions → 1 winner SHA-3 IV.2013 XII.2017 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 Why a Contest for a Cryptographic Standard? • Avoid back-door theories • Speed-up -
New Cryptanalysis of Irregularly Decimated Stream Ciphers
New Cryptanalysis of Irregularly Decimated Stream Ciphers Bin Zhang Laboratory of Algorithmics, Cryptology and Security, University of Luxembourg, 6, rue Coudenhove-Kalergi, L-1359, Luxembourg [email protected] Abstract. In this paper we investigate the security of irregularly dec- imated stream ciphers. We present an improved correlation analysis of various irregular decimation mechanisms, which allows us to get much larger correlation probabilities than previously known methods. Then new correlation attacks are launched against the shrinking generator with Krawczyk’s parameters, LILI-,DECIMv2 and DECIM-128 to access the security margin of these ciphers. We show that the shrinking generator with Krawczyk’s parameters is practically insecure; the initial internal state of LILI- can be recovered reliably in 272.5 operations, if 224.1-bit keystream and 274.1-bit memory are available. This disproves the de- signers’ conjecture that the complexity of any divide-and-conquer attack on LILI- is in excess of 2128 operations and requires a large amount of keystream. We also examine the main design idea behind DECIM, i.e., to filter and then decimate the output using the ABSG algorithm, by show- ing a class of correlations in the ABSG mechanism and mounting attacks faster than exhaustive search on a 160-bit (out of 192-bit) reduced ver- sion of DECIMv2 and on a 256-bit (out of 288-bit) reduced version of DECIM-128. Our result on DECIM is the first nontrivial cryptanalytic result besides the time/memory/data tradeoffs. While our result con- firms the underlying design idea, it shows an interesting fact that the security of DECIM rely more on the length of the involved LFSR than on the ABSG algorithm. -
Cryptanalysis of Achterbahn-128/80
Cryptanalysis of Achterbahn-128/80 María Naya-Plasencia? INRIA, projet CODES, Domaine de Voluceau 78153 Le Chesnay Cedex, FRANCE [email protected] Abstract. This paper presents two key-recovery attacks against Achter- bahn-128/80, the last version of one of the stream cipher proposals in the eSTREAM project. The attack against the 80-bit variant, Achterbahn- 80, has complexity 261. The attack against Achterbahn-128 requires 280.58 operations and 260 keystream bits. These attacks are based on an im- provement of the attack due to Hell and Johansson against Achterbahn version 2. They mainly rely on an algorithm that makes prot of the independence of the constituent registers. Keywords: stream cipher, eSTREAM, Achterbahn, cryptanalysis, correlation attack, linear approximation, parity check, key-recovery attack. 1 Introduction Achterbahn [4, 6] is a stream cipher proposal submitted to the eSTREAM project. After the cryptanalysis of the rst two versions [10, 9], it has moved on to a new one called Achterbahn-128/80 [5] published in June 2006. Achterbahn-128/80 corresponds to two keystream generators with key sizes of 128 bits and 80 bits, respectively. Their maximal keystream length is limited to 263. We present here two attacks against both generators. The attack against the 80-bit variant, Achterbahn-80, has complexity 261. The attack against Achterbahn- 128 requires 280.58 operations and 261 keystream bits. These attacks are based on an improvement of the attack against Achterbahn version 2 and also on an algorithm that makes prot of the independence of the constituent registers. The paper is organized as follows. -
Automatické Hledání Závislostí U Proudových Šifer Projektu Estream
MASARYKOVA UNIVERZITA F}w¡¢£¤¥¦§¨ AKULTA INFORMATIKY !"#$%&'()+,-./012345<yA| Automatické hledání závislostí u proudových šifer projektu eStream DIPLOMOVÁ PRÁCA Matej Prišt’ák Brno, Jaro 2012 Prehlásenie Prehlasujem, že táto diplomová práca je mojím pôvodným autorským dielom, ktoré som vypracoval samostatne. Všetky zdroje, pramene a literatúru, ktoré som pri vypracovaní po- užíval alebo z nich ˇcerpal,v práci riadne citujem s uvedením úplného odkazu na príslušný zdroj. Vedúci práce: Petr Švenda ii Pod’akovanie Rád by som pod’akoval v prvom rade vedúcemu práce RNDr. Petrovi Švendovi, Ph.D. za odborné vedenie, pravidelné zhodnotenie a pripomienky k práci. Pod’akovanie patrí aj ko- legovi Ondrejovi Dubovcovi za spoluprácu pri úpravách použitej aplikácie. Nakoniec by som chcel pod’akovat’ celej mojej rodine a priatel’ke Zuzke za podporu a trpezlivost’ poˇcas písania tejto práce. iii Zhrnutie Ciel’om práce je príprava existujúcich implementácií širšieho okruhu kandidátov na prú- dovú šifru v rámci projektu eSTREAM do jednotného rozhrania tak, aby bolo možné auto- matické hl’adanie nežiadúcich závislostí vo výstupe (ktoré by sa nemali vyskytovat’) všet- kých týchto kandidátnych funkcií naraz. Pre automatické hl’adanie bol využitý existujúci nástroj využívajúci techniky evoluˇcnýchobvodov. K dispozícii bola možnost’ spúšt’at’ vý- poˇctydistribuovane pomocou nástroja BOINC s využitím laboratórnych poˇcítaˇcov. Imple- mentaˇcnáˇcast’ je doplnená analýzou a diskusiou získaných výsledkov a porovnaním úspeš- nosti hl’adania závislostí evoluˇcnýmobvodom verzus závislosti nájdené bežnými batériami pre štatistické testovanie výstupu dát (Diehard a NIST). iv Kl’úˇcovéslová genetický algoritmus, genetic algorithm, prúdová šifra, stream cipher, ECRYPT, eSTREAM, kryptoanalýza, cryptoanalysis, štatistické testovanie, statistical testing v Obsah 1 Úvod .............................................1 2 Definícia pojmov ......................................2 2.1 Genetický algoritmus .................................2 2.1.1 Initializer . -
Foreign Languages for the Use of Printers and Translators
u. Gmm^-mi'mr printing office k. K GIEGJij^^a^GlI, Public Pbinter FOREIGN LANG-UAGI SUPPLEMENT TO STYLE MANUAL JIICVISED EDITION FOREIGN LANGUAGES For the Use of Printers and Translators SUPPLEMENT TO STYLE MANUAL of the UNITED STATES GOVERNMENT PRINTING OFFICE SECOND EDITION, REVISED AND ENLARGED APRIL 1935 By GEORGE F. von OSTERMANN Foreign Reader A. E. GIEGENGACK Public Printer WASHINGTON, D. C. 1935 For sale by the Superintendent of Documents, Washington, D. C. Price $1.00 (Buckram) PREFACE This manual relating to foreign languages is purposely condensed for ready reference and is intended merely as a guide, not a textbook. Only elementary rules and examples are given, and no effort is made to deal exhaustively with any one subject. Minor exceptions exist to some of the rules given, but a close adherence to the usage indicated will be sufficient for most foreign-language work. In the Romance languages, especially, there are other good forms and styles not shovm in the following pages. It is desired to acknowledge the assistance and cooperation of officials and members of the staff of the Library of Congress in the preparation of these pages and, in particular. Dr. Herbert Putnam, Librarian of Congress; Mr. Martin A. Roberts, Superintendent of the Reading Room; Mr. Charles Martel, Consultant in Cataloging, Classification, and Bibliography; Mr. Julian Leavitt, Chief of Catalog Division; Mr. James B. Childs, Chief of Document Division; Dr. Israel Schapiro, Chief of the Semitic Division; Mr. George B. Sanderlin; Mr. S. N. Cerick; Mr. Jens Nyholm; Mr. N. H. Randers-Pehrson; Mr. Oscar E. -
Design and Implementation of a Most Secure Cryptographic Scheme for Lightweight Environment Using Elliptic Curve and Trigonohash Technique
(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 12, No. 6, 2021 Design and Implementation of a Most Secure Cryptographic Scheme for Lightweight Environment using Elliptic Curve and Trigonohash Technique BhaskarPrakash Kosta1, Dr. PasalaSanyasi Naidu2 Computer Science and Engineering Department GIT, GITAM Deemed to be University Vishakhapatnam, AP, India Abstract—The Internet of Things (IoT) is a rising by the affiliation who runs the center, taking into account development and is an organization of all gadgets that can be which the treatment is overseen without the actual presence of gotten to through the web. As a central advancement of the IoT, clinical master (This technique can be used to perceive wireless sensor networks (WSN) can be used to accumulate the COVID-19 patient among the people who are in separate so vital environment parameters for express applications. In light of the spread of sickness can be avoided). the resource limitation of sensor devices and the open idea of remote channel, security has become an enormous test in WSN. Using WSN biological data can be accumulated. WSN are Validation as an essential security service can be used to regularly involved customers, passages(gateway server) and guarantee the authenticity of data access in WSN. The proposed sensors centers. By and large sensor centers have limited three factor system using one way hash function is depicted by energy, computational force and limit power moreover it has low computational cost, and limit overhead, while achieving all been seen that the energy usage of sensor center depends upon other benefits. Keys are made from secret key for meeting for correspondence detachment [4][28], the energy usage for improving the security. -
Comparison of FPGA-Targeted Hardware Implementations of Estream Stream Cipher Candidates
Comparison of FPGA-Targeted Hardware Implementations of eSTREAM Stream Cipher Candidates David Hwang, Mark Chaney, Shashi Karanam, Nick Ton, and Kris Gaj Department of Electrical and Computer Engineering George Mason University, Fairfax, Virginia, U.S.A. {dhwang, mchaney, skaranam, nton1, kgaj}@gmu.edu Abstract. This work discusses FPGA hardware implementations of all eSTREAM phase 3 hardware stream cipher candidates (profile 2) and some of their derivatives. The designs are optimized for maximum through- put per unit area as well as minimum area, and targeted for Xilinx Spartan 3 FPGAs. The results have found that the Grain and Trivium families of ciphers have demonstrated relative implementation efficiency compared to the rest of the cipher candidates; Mickey also provided a balance of low area with high throughput per area. 1 Introduction Efficient hardware implementations of stream ciphers are important in both high-performance and low-power applications which require encryption. To this end, in 2004 the ECRYPT stream cipher project (eSTREAM) [1] was launched to identify new stream ciphers for adoption in a variety of systems; the call for profile 2 stream cipher candidates in particular focused on stream ciphers suited toward hardware implementation. Currently in phase 3 of the eSTREAM competition there are eight families of hardware-oriented stream ciphers which remain as candidates: DECIM, Edon80, F-FCSR, Grain, MICKEY, Moustique, Pomaranch, and Trivium. The general characteristics of these ciphers and their variants are shown in Table 1. In this paper we compare the hardware imple- mentations of all hardware-oriented candidates (profile 2) and their variants, targeted toward the Xilinx Spartan 3 family of FPGAs.