DOCSLIB.ORG

Cryptography

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

IN3210 – Network Security Cryptographic Foundations History of Cryptography 2 Confidential Communication Eve Dear Dear Bob Bob .... .... Alice Bob 3 Confidential Communication A B 4 Steganography ⚫ Examples: − Tattoo on head + growing hair back − Invisible ink − Micro dot ⚫ Security by obscurity ⚫ Typically not conforming with Kerckhoff’s principle ⚫ Modern steganography: − Printer steganography − Embedding into multimedia Image Source: Wikipedia Source: Image data 5 Cryptology ⚫ Cryptography − Practice and study of using mathematics to protect data/information − From Greek ▪ kryptos: "hidden, secret" and ▪ gráphō: "I write" ⚫ Cryptanalysis − Practice and study of finding weaknesses or insecurity in a cryptographic scheme, thus permitting its subversion or evasion − From Greek ▪ analýein: "to loosen" or "to untie" 6 Classical Cipher ⚫ Caesar Cipher (50 B.C.) X Y Z A B C D E 3 Key X Y Z A B C D E Hello Khoor Plaintext Chiffre- text Image Source: www.asterix.com Source: Image 7 Encryption Key = 3 Key = 3 KhoorHello Hello 8 Symmetric Encryption 6R4Y2 Eve hlbMZ CB... Dear Dear Bob Bob Encryption Decryption .... .... Alice Bob 9 Caesar Cipher Testing all possible values (e.g. of a key) is called ⚫ Which plaintext is encrypted here? Brute Force Attack − Ymjvznhpgwtbsktcozruxtajwymjqfeditl. ⚫ Try each possible key: 1. Xliuymgofvsarjsbnyqtwszivxlipedchsk. 2. Wkhtxlfneurzqiramxpsvryhuwkhodcbgrj. 3. Vjgswkemdtqyphqzlworuqxgtvjgncbafqi. 4. Uifrvjdlcspxogpykvnqtpwfsuifmbazeph. 5. Thequickbrownfoxjumpsoverthelazydog. 6. Sgdpthbjaqnvmenwitlornudqsgdkzyxcnf. 7. Rfcosgaizpmuldmvhsknqmtcprfcjyxwbme. 8. Qebnrfzhyoltkclugrjmplsboqebixwvald. 9. Pdamqeygxnksjbktfqilokranpdahwvuzkc. 10. … 10 Security of Crypto Systems ⚫ The previous attack assumes that the attacker knows: a) the Caesar cipher was used for encryption b) how the Caesar cipher work ⚫ What is the effect if the attacker does not have this information? ⚫ More general: is a crypto system more secure if the system and its internal function kept secret? 11 Kerckhoff‘s Principle ⚫ “A cryptosystem should be secure even if the attacker knows all details about the system (including the encryption and decryption algorithms), with the exception of the secret key.“ ⚫ Common mistake: keeping cryptographic algorithms secret increases the security (“security by obscurity”) ⚫ Example: GSM A5 algorithms Auguste Kerckhoffs − Details kept secret (1835 – 1903) Dutch crytographer − No cryptanalysis by the research community possible − Attackers found weaknesses Wikipedia Source: Image − Nearly all variants nowadays broken! 12 Caesar Cipher BON 18 TGF HUT 12 Finding the correct key 2 is hard, without RED knowledge of (at least part of) the plaintext. 13 One-Time Pad Encryption Attack at dawn! k1 k2 Retreat at 1100 B2 A0 C1 C2 E7 FB FE FA 89 AA AF 56 6A 67 k3 The cat is dead k4 14 Basic Types of Attacks (on the Encryption Key) ⚫ Ciphertext-only attack − The attacker has access to one or several ciphertexts ⚫ Known-plaintext attack − The attacker has access to one or several plaintext / ciphertext pairs ⚫ Chosen-plaintext attack − The attacker can retrieve ciphertexts for arbitrarily chosen plaintexts ⚫ (Adaptive) chosen-ciphertext attack − The attacker can retrieve plaintexts for arbitrarily chosen ciphertexts 15 Monoalphabetical Substitution ⚫ Improvement over Caesar cipher ⚫ Each letter is replaced by (exactly) one other letter ⚫ Example: Plaintext: a b c d e f g h i j k l m n o p q r s t u v w x y z Ciphertext: U F L P W D R A S J M C O N Q Y B V T E X H Z K G I ⚫ Number of possible keys? ⚫ 26! 1026 288 16 Monoalphabetical Substitution ⚫ Can easily be broken by analyzing the letter frequency in the cipher text ⚫ Large key space is a requisite but not sufficient for a secure encryption scheme ⚫ Next improvement: polyalphabetical substitution (e.g. Vignere, 1550) th 1.52% he 1.28% Bigram Frequency in 0.94% (english text) er 2,26% an 2,00% re 1,99% nd 1,88% Letter Frequency at 1,79% (english text) 17 Enigma ⚫ Invented 1918 by Arthur Scherbius ⚫ Electro-mechanical rotor cipher machines ⚫ Used by the German forces during WWII ⚫ Implements a polyalphabetical substitution cipher 18 Image Source: Wikipedia Source:Image Enigma ⚫ When pressing a button on the keyboard: − (at least) on rotor is turning on position − an electrical circuit is closed and one bulb lights up Wikipedia 19 Image Source : : Source Image Enigma ⚫ Encryption was broken by Polish and British codebreakers in Bletchley Park ⚫ Most famous member: − Alan Turing Wikipedia , http://www.cryptomuseum.com/ 20 Source: Image Enigma ⚫ Simulator: − http://users.telenet.be/d.rijmenants/en/enigmasim.htm 21 History of Cryptography ⚫ Simon Singh ⚫ The Code Book: The Secret History of Codes and Code- breaking 22 Crypto Primitives and their Usage Confidentiality Integrity Authenticity Non-repudiation Encryption Hash Functions Digital Signature (Cipher) 23 (Symmetric) Encryption 24 Encryption ⚫ Encryption − Process of converting ordinary information the so-called plaintext into unintelligible gibberish the so-called ciphertext ⚫ Decryption − Reverse process converting ciphertext back to plaintext ⚫ Cipher (or cypher) − Pair of algorithms which create the encryption and the reversing decryption − The detailed operation of a cipher is controlled both by the algorithm and in each instance by a key 25 Symmetric Encryption ⚫ The same key (secret key) is used for encryption and decryption 6R4Y2 Eve hlbMZ CB... Dear Dear Bob Bob Encryption Decryption .... .... Alice Bob Key Generator Symmectric Key 26 Formalization of (symmetric) Encryption ⚫ Space of plain texts: P ⚫ Space of cipher texts: C ⚫ Space of keys: K ⚫ Encryption: E: P x K → C, E(x, k) = Ek(x) ⚫ Decryption: D: C x K → P, D(y, k) = Dk(y) ⚫ D is the invers function of E, i.e. for all x ∈ P and k ∈ K: Dk(Ek(x)) = x 27 Formalization of Caesar Cipher ⚫ Numerical encoding of letters: A → 0, B → 1, …, Z → 25 ⚫ Space of plain texts: P = ℤ26 = {0, 1, …, 25} ⚫ Space of cipher texts: C = ℤ26 ⚫ Space of keys: K = ℤ26 ⚫ Encryption: Ek(x) = x + k mod 26 ⚫ Decryption: Dk(x) = x + (– k) mod 26 ⚫ Size of key space? → |K| = 26 28 Stream Cipher Key stream ks Cipher stream c Plain text m Encryption Key stream ks Cipher stream c Plain text m‘ = m Decryption 29 Stream Ciphers ⚫ A stream cipher is a symmetric key cipher where plaintext bits (mi) are combined with a pseudorandom cipher bit stream (key stream ks) ⚫ The pseudorandom key stream is generated by a pseudorandom number generator from a (shared) key Key k PRNG Key stream ks Cipher stream c Plain text m 30 One time pad ⚫ Key stream is completely random and only used once ⚫ Problem: key exchange (key has same size than plain/cipher text) ⚫ Provable perfectly secure (can only broken if key is known) ⚫ Cipher text can mean anything 31 Examples for Stream Ciphers ⚫ A5/1 and A5/2 (1989; used in GSM) → broken ⚫ RC4 (1987) → broken ⚫ Salsa20 (2005) ⚫ ChaCha20 (2008) 32 Block Cipher ⚫ A block cipher (Enc) is a symmetric key cipher and takes as input an n-bit block of plaintext and a key (k), and outputs a n-bit block of ciphertext THIS IS A SIMPLE PLAINTEXT MESSAGE. n bit k Enc k Encryption k Encryption k Encryption n bit X&jÜ(mA’8Dwßµ<3 Ji8(clÄ+#/2Haq%7Ö1k5a$jA~Kq1§ü 33 Examples for Block Ciphers ⚫ DES (Data Encryption Standard) ⚫ AES (Advanced Encryption Standard) ⚫ Blowfish ⚫ Twofish ⚫ RC6 ⚫ MARS ⚫ Serpent AES Image Source: Wikipedia Source: Image 35 AES and DES ⚫ DES (NIST 1977) − 64 bit blocks und 56 bit keys − Standard encryption in 1980s and 1990s ⚫ Advanced Encryption Standard (AES) − AES (Rijndael) developed by Belgian cryptographers − Standardized by NIST in 2000 as DES successor − 128 bit blocks and 128, 192, 256 bit keys Brute force attack on AES and DES ⚫ Brute force attack on 56 key: − 1998: EFF DES Cracker (ASICs), 4.5 days, 250.000$ − 2006: COPACOBANA (FPGA), 6.4 days, 10.000$ Key length Duration − 2012: Pico Computing (FPGA), 0.5 days 56 bit 1 s ⚫ Brute force attack on 128 or 256 bit key? 64 bit 4 m (Assumption: breaking 56 bit in 1 80 bit 194 d second) 112 bit 109 a 128 bit 1014 a 192 bit 1033 a 256 bit 1052 a Padding ⚫ What happens if you want to encrypt 100 bit with a 128 bit block cipher? ⚫ You must fill the plaintext up to the block length of the cipher ⚫ Approaches − Decryption process knows the data length ▪ Example: from a header entry ▪ Block can be filled with random bits/byte − Decryption process does not know the data length ▪ Padding bits/bytes must be marked Padding – One and Zeros ⚫ Attach one binary 1 followed by none, one or multiple binary 0 11010010 101110 11010010 10111010 11010010 1011100 11010010 10111001 11010010 10111001 11010010 10111001 10000000 00000000 Padding PKCS#5 ⚫ Padding of whole bytes ⚫ Let L be the block size (in bytes) ⚫ When N bytes are missing to a full block (1 N L): add N bytes each with the value N ⚫ Examples (L = 8, XX = existing message, all numbers in hex) − XX XX XX XX XX XX XX XX | XX XX XX XX XX XX XX 01 − XX XX XX XX XX XX XX XX | XX XX XX XX XX 03 03 03 − XX XX XX XX XX XX XX XX | XX 07 07 07 07 07 07 07 − XX XX XX XX XX XX XX XX | 08 08 08 08 08 08 08 08 ⚫ Invalid padding example: − XX XX XX XX XX XX XX XX | XX XX XX XX XX XX 08 02 40 Modes of Operation ⚫ Block ciphers operate on a fixed length input − DES, 3DES, IDEA: 64 bit − AES: 128, 192, 256 bit ⚫ Processing of larger input − Cut input into blocks of the required block size and process them one after the other ⚫ This naïve approach is also known as the Electronic Codebook (ECB) mode of operation Block Cipher: Electronic Code Book THIS IS A SIMPLE PLAINTEXT MESSAGE. Encryption Encryption Encryption X&jÜ(mA’8Dwßµ<3Ji8(clÄ+#/2Haq% 7Ö1k5a$jA~Kq1§ü 42 Block Cipher: Electronic Code Book THIS IS A SIMPLE PLAINTEXT MESSAGE.
Recommended publications
  • A Quantitative Study of Advanced Encryption Standard Performance

    A Quantitative Study of Advanced Encryption Standard Performance

    United States Military Academy USMA Digital Commons West Point ETD 12-2018 A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility Daniel Hawthorne United States Military Academy, [email protected] Follow this and additional works at: https://digitalcommons.usmalibrary.org/faculty_etd Part of the Information Security Commons Recommended Citation Hawthorne, Daniel, "A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility" (2018). West Point ETD. 9. https://digitalcommons.usmalibrary.org/faculty_etd/9 This Doctoral Dissertation is brought to you for free and open access by USMA Digital Commons. It has been accepted for inclusion in West Point ETD by an authorized administrator of USMA Digital Commons. For more information, please contact [email protected]. A QUANTITATIVE STUDY OF ADVANCED ENCRYPTION STANDARD PERFORMANCE AS IT RELATES TO CRYPTOGRAPHIC ATTACK FEASIBILITY A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree of Doctor of Computer Science By Daniel Stephen Hawthorne Colorado Technical University December, 2018 Committee Dr. Richard Livingood, Ph.D., Chair Dr. Kelly Hughes, DCS, Committee Member Dr. James O. Webb, Ph.D., Committee Member December 17, 2018 © Daniel Stephen Hawthorne, 2018 1 Abstract The advanced encryption standard (AES) is the premier symmetric key cryptosystem in use today. Given its prevalence, the security provided by AES is of utmost importance. Technology is advancing at an incredible rate, in both capability and popularity, much faster than its rate of advancement in the late 1990s when AES was selected as the replacement standard for DES. Although the literature surrounding AES is robust, most studies fall into either theoretical or practical yet infeasible.
  • Rc-6 Cryptosystem in Vhdl

    Rc-6 Cryptosystem in Vhdl

    RC-6 CRYPTOSYSTEM IN VHDL BY:- Deepak Singh Samant OBJECTIVE: TO IMPLEMENT A CRYPTOSYSTEM USING RIVEST CIPHER-6 (RC6) ALGORITHM IN VHDL(FPGA) What is CRYPTOLOGY? CRYPTOGRAPHY is the art and science of achieving security by encoding message to make them non-readable . CRYPTANALYSIS is the technique of decoding messages from a non-readable format back to readable format without knowing how they were initially converted from readable format to non-readable format. CRYPTOGRAPHY + = CRYPTOLOGY CRYPTANALYSIS Cryptography Overview: Comm. E(k) N/W D(k) Key Set K Key Set K Types Of Attacks: . General View: 1.Criminal Attack 2.Publicity Attack 3.Legal Attack .Technical View: oPassive Attacks oActive Attacks Release of message Interruption Traffic Attacks Modification Fabrication Symmetric key cryptography If same key is used for encryption and decryption,we call the mechanism as symmetric key cryptography. It has the key distribution problem. Symmetric key cryptography Algorithm DES IDEA RC4 RC5 BLOW AES FISH AES: US government wanted to standardize a cryptographic algorithm,which was to be used universally by them.It was to be called as the Advanced Encryption Standard(AES). Among various proposal submitted,only 5 were short listed: 1.Rijndael 3.Serpent 5.MARS 2.Twofish 4.RC6 LITERATURE SURVEY • Comparison: (1) MARS: Its throughput in the studies was generally low. Therefore, its efficiency (throughput/area) was uniformly less than the other finalists. (2) RC6 throughput is generally average. RC6 seems to perform relatively better in pipelined implementations, non-feedback mode (3) Rijndael: good performance in fully pipelined implementations. Efficiency is generally very good. 4) Serpent: feedback mode encryption.
  • The Long Road to the Advanced Encryption Standard

    The Long Road to the Advanced Encryption Standard

    The Long Road to the Advanced Encryption Standard Jean-Luc Cooke CertainKey Inc. [email protected], http://www.certainkey.com/˜jlcooke Abstract 1 Introduction This paper will start with a brief background of the Advanced Encryption Standard (AES) process, lessons learned from the Data Encryp- tion Standard (DES), other U.S. government Two decades ago the state-of-the-art in cryptographic publications and the fifteen first the private sector cryptography was—we round candidate algorithms. The focus of the know now—far behind the public sector. presentation will lie in presenting the general Don Coppersmith’s knowledge of the Data design of the five final candidate algorithms, Encryption Standard’s (DES) resilience to and the specifics of the AES and how it dif- the then unknown Differential Cryptanaly- fers from the Rijndael design. A presentation sis (DC), the design principles used in the on the AES modes of operation and Secure Secure Hash Algorithm (SHA) in Digital Hash Algorithm (SHA) family of algorithms Signature Standard (DSS) being case and will follow and will include discussion about point[NISTDSS][NISTDES][DC][NISTSHA1]. how it is directly implicated by AES develop- ments. The selection and design of the DES was shrouded in controversy and suspicion. This very controversy has lead to a fantastic acceler- Intended Audience ation in private sector cryptographic advance- ment. So intrigued by the NSA’s modifica- tions to the Lucifer algorithm, researchers— This paper was written as a supplement to a academic and industry alike—powerful tools presentation at the Ottawa International Linux in assessing block cipher strength were devel- Symposium.
  • The RC6TM Block Cipher

    The RC6TM Block Cipher

    TM The RC6 Blo ck Cipher 1 2 2 2 Ronald L. Rivest , M.J.B. Robshaw , R. Sidney , and Y.L. Yin 1 M.I.T. Lab oratory for Computer Science, 545 Technology Square, Cambridge, MA 02139, USA [email protected] 2 RSA Lab oratories, 2955 Campus Drive, Suite 400, San Mateo, CA 94403, USA fmatt,ray,[email protected] Version 1.1 - August 20, 1998 TM Abstract. We intro duce the RC6 blo ck cipher. RC6 is an evolu- tionary improvementofRC5, designed to meet the requirements of the Advanced Encryption Standard AES. LikeRC5, RC6 makes essential use of data-dep endent rotations. New features of RC6 include the use of four working registers instead of two, and the inclusion of integer multi- plication as an additional primitive op eration. The use of multiplication greatly increases the di usion achieved p er round, allowing for greater security, fewer rounds, and increased throughput. 1 Intro duction TM RC6 is a new blo ck cipher submitted to NIST for consideration as the new Advanced Encryption Standard AES. The design of RC6 b egan with a consideration of RC5 [18] as a p otential candidate for an AES submission. Mo di cations were then made to meet the AES requirements, to increase security, and to improve p erformance. The inner lo op, however, is based around the same \half-round" found in RC5. RC5 was intentionally designed to be extremely simple, to invite analysis shedding light on the security provided by extensive use of data-dep endent ro- tations. Since RC5 was prop osed in 1995, various studies [2, 5, 8, 11, 15, 19] have provided a greater understanding of howRC5's structure and op erations contribute to its security.
  • New Comparative Study Between DES, 3DES and AES Within Nine Factors

    New Comparative Study Between DES, 3DES and AES Within Nine Factors

    JOURNAL OF COMPUTING, VOLUME 2, ISSUE 3, MARCH 2010, ISSN 2151-9617 152 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ New Comparative Study Between DES, 3DES and AES within Nine Factors Hamdan.O.Alanazi, B.B.Zaidan, A.A.Zaidan, Hamid A.Jalab, M.Shabbir and Y. Al-Nabhani ABSTRACT---With the rapid development of various multimedia technologies, more and more multimedia data are generated and transmitted in the medical, also the internet allows for wide distribution of digital media data. It becomes much easier to edit, modify and duplicate digital information .Besides that, digital documents are also easy to copy and distribute, therefore it will be faced by many threats. It is a big security and privacy issue, it become necessary to find appropriate protection because of the significance, accuracy and sensitivity of the information. , which may include some sensitive information which should not be accessed by or can only be partially exposed to the general users. Therefore, security and privacy has become an important. Another problem with digital document and video is that undetectable modifications can be made with very simple and widely available equipment, which put the digital material for evidential purposes under question. Cryptography considers one of the techniques which used to protect the important information. In this paper a three algorithm of multimedia encryption schemes have been proposed in the literature and description. The New Comparative Study between DES, 3DES and AES within Nine Factors achieving an efficiency, flexibility and security, which is a challenge of researchers. Index Terms—Data Encryption Standared, Triple Data Encryption Standared, Advance Encryption Standared.
  • The Aes Project Any Lessons For

    The Aes Project Any Lessons For

    THE AES PROJECT: Any Lessons for NC3? THOMAS A. BERSON, ANAGRAM LABORATORIES Technology for Global Security | June 23, 2020 THE AES PROJECT: ANY LESSONS FOR NC3? THOMAS A. BERSON JUNE 23, 2020 I. INTRODUCTION In this report, Tom Berson details how lessons from the Advanced Encryption Standard Competition can aid the development of international NC3 components and even be mirrored in the creation of a CATALINK1 community. Tom Berson is a cryptologist and founder of Anagram Laboratories. Contact: [email protected] This paper was prepared for the Antidotes for Emerging NC3 Technical Vulnerabilities, A Scenarios-Based Workshop held October 21-22, 2019 and convened by The Nautilus Institute for Security and Sustainability, Technology for Global Security, The Stanley Center for Peace and Security, and hosted by The Center for International Security and Cooperation (CISAC) Stanford University. A podcast with Tom Berson and Philip Reiner can be found here. It is published simultaneously here by Technology for Global Security and here by Nautilus Institute and is published under a 4.0 International Creative Commons License the terms of which are found here. Acknowledgments: The workshop was funded by the John D. and Catherine T. MacArthur Foundation. Maureen Jerrett provided copy editing services. Banner image is by Lauren Hostetter of Heyhoss Design II. TECH4GS SPECIAL REPORT BY TOM BERSON THE AES PROJECT: ANY LESSONS FOR NC3? JUNE 23, 2020 1. THE AES PROJECT From 1997 through 2001, the National Institute for Standards and Technology (US) (NIST) ran an open, transparent, international competition to design and select a standard block cipher called the Advanced Encryption Standard (AES)2.
  • Data Encryption Standard

    Data Encryption Standard

    Data Encryption Standard The Data Encryption Standard (DES /ˌdiːˌiːˈɛs, dɛz/) is a Data Encryption Standard symmetric-key algorithm for the encryption of electronic data. Although insecure, it was highly influential in the advancement of modern cryptography. Developed in the early 1970s atIBM and based on an earlier design by Horst Feistel, the algorithm was submitted to the National Bureau of Standards (NBS) following the agency's invitation to propose a candidate for the protection of sensitive, unclassified electronic government data. In 1976, after consultation with theNational Security Agency (NSA), the NBS eventually selected a slightly modified version (strengthened against differential cryptanalysis, but weakened against brute-force attacks), which was published as an official Federal Information Processing Standard (FIPS) for the United States in 1977. The publication of an NSA-approved encryption standard simultaneously resulted in its quick international adoption and widespread academic scrutiny. Controversies arose out of classified The Feistel function (F function) of DES design elements, a relatively short key length of the symmetric-key General block cipher design, and the involvement of the NSA, nourishing Designers IBM suspicions about a backdoor. Today it is known that the S-boxes that had raised those suspicions were in fact designed by the NSA to First 1975 (Federal Register) actually remove a backdoor they secretly knew (differential published (standardized in January 1977) cryptanalysis). However, the NSA also ensured that the key size was Derived Lucifer drastically reduced such that they could break it by brute force from [2] attack. The intense academic scrutiny the algorithm received over Successors Triple DES, G-DES, DES-X, time led to the modern understanding of block ciphers and their LOKI89, ICE cryptanalysis.
  • Soft Error Resistant Design of the AES Cipher Using SRAM-Based FPGA

    Soft Error Resistant Design of the AES Cipher Using SRAM-Based FPGA

    Soft Error Resistant Design of the AES Cipher Using SRAM-based FPGA by Solmaz Ghaznavi A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Electrical and Computer Engineering Waterloo, Ontario, Canada, 2011 ©Solmaz Ghaznavi 2011 AUTHOR'S DECLARATION I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract This thesis presents a new architecture for the reliable implementation of the symmetric-key algorithm Advanced Encryption Standard (AES) in Field Programmable Gate Arrays (FPGAs). Since FPGAs are prone to soft errors caused by radiation, and AES is highly sensitive to errors, reliable architectures are of significant concern. Energetic particles hitting a device can flip bits in FPGA SRAM cells controlling all aspects of the implementation. Unlike previous research, heterogeneous error detection techniques based on properties of the circuit and functionality are used to provide adequate reliability at the lowest possible cost. The use of dual ported block memory for SubBytes, duplication for the control circuitry, and a new enhanced parity technique for MixColumns is proposed. Previous parity techniques cover single errors in datapath registers, however, soft errors can occur in the control circuitry as well as in SRAM cells forming the combinational logic and routing. In this research, propagation of single errors is investigated in the routed netlist. Weaknesses of the previous parity techniques are identified.
  • Cryptographic Algorithm Analysis and Implementation

    Cryptographic Algorithm Analysis and Implementation

    EasyChair Preprint № 3210 Cryptographic Algorithm Analysis and Implementation Nandkumar Niture EasyChair preprints are intended for rapid dissemination of research results and are integrated with the rest of EasyChair. April 20, 2020 Cryptographic Algorithm Analysis and Implementation By: - Nandkumar A Niture 1 Abstract The impact and necessity of information security has increased exponentially over the last f ew decades as the denial-of-service attacks are increasing, information is being stolen, hackers are using more sophisticated and smart methods with help of agile tools for stealing sensitive information. Do small/mid-size/large corporate organizations need the security of their system? Yes. They have sensitive user data, employee data, trading data, customer data and other sensitive confidential information stored in office systems. Do common people need the security of their systems at home? Yes. They may have their taxes files, social security card information, bank account details, private pictures, marketing strategy for their small business and many more private things. Computer cryptography was the exclusive domain for long period of time since World War II but now is practiced outside of military agencies. Cryptography is both science and art, it uses known obscurity and mathematical formulae. Cryptographic systems should have ability to assure the authenticity of source from where message gets originated and proof of complete message delivery. It is sometimes insufficient to protect ourselves from the rules and laws, but we need to protect ourselves with applying sufficient mathematical equations. So, it is individuals and legal organizations responsibility to protect their own data. By combining the digital signature with public-key cryptography, we can develop a protocol that combines the security of encryption with the authenticity of digital signatures.
  • 1. AES Seems Weak. 2. Linear Time Secure Cryptography

    1. AES Seems Weak. 2. Linear Time Secure Cryptography

    Smith typeset 19:27 8 Jun 2007 AES bust 1. AES seems weak. 2. Linear time secure cryptography Warren D. Smith∗ [email protected] June 8, 2007 Abstract — We describe a new simple but more power- ciphertext pair. It would run almost instantaneously.) Any ful form of linear cryptanalysis. It appears to break AES secret key cipher with a K-bit key can be cracked by exhaus- (and undoubtably other cryptosystems too, e.g. SKIP- tive key search by performing 2K encryptions. It is a usual JACK). The break is “nonconstructive,” i.e. we make it design aim to try to make the≈ security level attain this 2K plausible (e.g. prove it in certain approximate probabilis- upper bound. tic models) that a small algorithm for quickly determining AES-256 keys from plaintext-ciphertext pairs exists – but without constructing the algorithm. The attack’s runtime is comparable to performing 64w encryptions where w is 1 DES and AES, their demise, and the (unknown) minimum Hamming weight in certain bi- the demise of privacy generally nary linear error-correcting codes (BLECCs) associated with AES-256. If w < 43 then our attack is faster than ex- DES and its successor AES were the product of cryptosystem- haustive key search; probably w < 10. (Also there should design competitions (1974, 2001) sponsored and judged by the be ciphertext-only attacks if the plaintext is natural En- US Government and as such are the two most famous cryp- glish.) tosystems. Even if this break breaks due to the underlying models in- DES’s obvious weakness was its short (56 bit) secret-key adequately approximating the real world, we explain how AES still could contain “trapdoors” which would make length.
  • DES Cracker" Machine

    DES Cracker" Machine

    Frequently Asked Questions (FAQ) About the Electronic Frontier Foundation's "DES Cracker" Machine Table of Contents Introduction What are cryptography, encryption and cryptanalysis? What is DES? Who uses DES? What claims have been made about DES? What is the 'EFF DES Cracker' and how does it work? Who built the EFF DES Cracker? Does the EFF DES Cracker really work? How much did the EFF DES Cracker cost to build? Why was the EFF DES Cracker built? What should those who depend on DES do now that we are clear on its insecurity? How long should cipher keys be to avoid these attacks? How long does the EFF DES Cracker take to crack DES? How does this affect cryptographic algorithms other than DES? What standards are replacing DES? How does this relate to the movie "Sneakers?" Is the EFF DES Cracker practical or a laboratory curiosity? What has been the impact of export controls on cryptography? Have other groups studied the implications of controls over the research and application of cryptography? What is the Electronic Frontier Foundation (EFF)? Sources Introduction The Electronic Frontier Foundation began its investigation into DES cracking in 1997 to determine just how easily and cheaply a hardware-based DES Cracker could be constructed. EFF set out to design and build a DES Cracker to counter the claim made by U.S. government officials that American industry or foreign governments cannot decrypt information when protected by DES or weaker encryption, or that it would take multimillion-dollar networks or computers months to decrypt one message. Less than one year later and for well under US $250,000, EFF's DES Cracker entered and won the RSA DES Challenge II-2 competition in less than 3 days, proving that DES is not secure and that such a machine is inexpensive to design and build.
  • Cryptanalysis of Selected Block Ciphers

    Cryptanalysis of Selected Block Ciphers

    Downloaded from orbit.dtu.dk on: Sep 24, 2021 Cryptanalysis of Selected Block Ciphers Alkhzaimi, Hoda A. Publication date: 2016 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Alkhzaimi, H. A. (2016). Cryptanalysis of Selected Block Ciphers. Technical University of Denmark. DTU Compute PHD-2015 No. 360 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Cryptanalysis of Selected Block Ciphers Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy at the Department of Mathematics and Computer Science-COMPUTE in The Technical University of Denmark by Hoda A.Alkhzaimi December 2014 To my Sanctuary in life Bladi, Baba Zayed and My family with love Title of Thesis Cryptanalysis of Selected Block Ciphers PhD Project Supervisor Professor Lars R. Knudsen(DTU Compute, Denmark) PhD Student Hoda A.Alkhzaimi Assessment Committee Associate Professor Christian Rechberger (DTU Compute, Denmark) Professor Thomas Johansson (Lund University, Sweden) Professor Bart Preneel (Katholieke Universiteit Leuven, Belgium) Abstract The focus of this dissertation is to present cryptanalytic results on selected block ci- phers.