DOCSLIB.ORG

The Avalanche Effect of Various Hash Functions Between Encrypted Raw Images Versus Non-Encrypted Images: a Comparison Study

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Avalanche Effect of Various Hash Functions Between Encrypted Raw Images Versus Non-Encrypted Images: a Comparison Study Polawat Witoolkollachit. The avalanche effect of various hash functions The avalanche effect of various hash functions between encrypted raw images versus non-encrypted images: A comparison study Polawat Witoolkollachit Department of Information Technology, King Mongkut’s University of Technology North Bangkok, Thailand Abstract Symmetric encryption technology is widely used in of Blowfish, AES-256 and DES against SHA-1, internet security systems. To keep images secure, image HMAC-SHA256, and CMAC-SHA256, showed no encryption technique is a specific security process. The statistical significance in terms of the averages of the encryption technique should be strong enough to prevent avalanche effect but the RC4 and 3DES were statistically breaking the algorithm. The integrity checking of the significant. However, the RC4 encrypted image group had encrypted image file can detect whether any critical a lesser average avalanche effect than 3DES. The 3DES system files have been changed, thus enabling the encrypted image group with CMAC-SHA256 showed the system administrator to look for unauthorized alterations best avalanche effect with statistical significance among of the system. Hash function is the desired function for the SHA-1 and HMAC-SHA246 groups. hash value comparisons. This study focused on the comparison of the avalanche effect on the various hash Keywords: avalanche effect, encrypted raw images, values of images before and after various encryption non-encrypted images. techniques and which of the combined encryption techniques and then hash functions show the maximum Received 20 December 2015; Accepted 25 avalanche effect. According to this study, the combination March 2016 Introduction Symmetric encryption technology is widely used in should be strong enough to prevent breaking the internet security systems.1 It utilizes a confusion and algorithm.2,3 The integrity checking of the encrypted diffusion technique to encrypt the subject. The time of image file can detect whether any critical system files encryption is the most sensitive variable for encryption have been changed, thus enabling the system security techniques. Most people expect immediate administrator to look for unauthorized alteration of the results from encryption techniques. Image encryption system. Hash function is the desired function by hash is a common security process. The encryption technique value comparison.4,5 Avalanche effect is one of the desirable properties of cryptographic algorithms, typically blocking ciphers Correspondence: Polawat Witoolkollachit, Department of 6 Information Technology, King Mongkut’s University of and cryptographic hash functions. This phenomenon is Technology North Bangkok, Thailand (Tel.: +66-2555-2708; evident if, when an input is changed slightly E-mail address: [email protected]). (for example, flipping a single bit) the output changes Journal of the Thai Medical Informatics Association, 1, 69-82, 2016 69 The avalanche effect of various hash functions Polawat Witoolkollachit. significantly. If a block cipher or cryptographic hash RC4 key ought to never be used again when scrambling function does not exhibit the avalanche effect to a two other information streams. significant degree, then it has poor randomization, Blowfish is a symmetric-key block cipher, designed and thus a cryptanalyst can make predictions about in 1993 by Bruce Schneier9 and included in a large the encryption algorithm of the input by seeing the number of cipher suites and encryption products. cypher texts. This may be sufficient for guessing the Blowfish provides a good encryption rate in software difficulty to break the algorithm. Thus, the avalanche and no effective cryptanalysis of it has been found to date. effect is a desirable condition from the point of view AES is a symmetric key block cipher. It uses a fixed of the designer of the cryptographic algorithm or device. 128-bit block cipher and three key lengths supported The wide use of high resolution images in by AES as this was an NIST design requirement.10 medical care such as X-ray images, photos of wound The number of internal rounds of the cipher is a function characteristics are common in the present medical of the key length according to the Hash based message practice. The hospitals must keep all image files secret authentication code (HMAC) and has been the by privacy law. The integrity checking of the encrypted mandatory-to implement MAC for IPSEC. HMAC based images by hash values is currently the most favorable on secure hash algorithm (HMAC-SHA-1) has been technique.7 Therefore, the collision resistance property recommended for message authentication in several must be of concern. network security protocols. The key reasons behind This study observed two groups of ten images. this were the free availability, flexibility of changing The original images are the same in both groups. the hash function and reasonable speed, among others. The first group was unencrypted RAW images which The MAC based on the block ciphers such as received hash function application. The hash values were CBC-MAC-DES was generally considered slow due to recorded. The hash values from this group were used the complexity of the encryption process. as the control group. The second was five different DES is the archetypal block cipher,11 an algorithm symmetric encryption algorithms namely; AES-256, DES, that takes a fixed-length string of plain text bits and 3DES, RC4 and Blowfish against 19 raw images. transforms it through a series of complicated operations Then the hash function was applied to all images and into another cipher text bit string of the same length. all hash values were recorded. The purpose of this study In the case of DES, the block size is 64 bits. was to determine differences in the avalanche effect DES also uses a key to customize the transformation, of various hash functions on the encrypted image groups so that decryption can supposedly only be performed compared to the avalanche effect of hash function of by those who know the particular key used to encrypt. the non-encrypted image group and which pair had The key ostensibly consists of 64 bits; however, the greatest avalanche effect. This study also used only 56 of these are actually used by the algorithm. statistics to test the differences of variance of the mean Eight bits are used solely for checking parity, and are avalanche effect between all observed groups. thereafter discarded. Hence the effective key length is 56 bits. The original DES cipher's key size of Related Work 56 bits was generally sufficient when that algorithm RC4 has a utilization in both encryption and unscrambling was designed, but the availability of increasing while the information stream experiences XOR together computational power made brute-force attacks with a progression of created keys.8 It takes in keys feasible. Triple DES (3DES)12 provides a relatively of irregular lengths and this is known as a maker of simple method of increasing the key size of DES pseudo subjective numbers. The yield is then to protect against such attacks, without the XORed together with the flood of information to create need to design a completely new block cipher recently encoded information. Consequently, a specific algorithm. 70 Journal of the Thai Medical Informatics Association, 1, 69-82, 2016 Polawat Witoolkollachit. The avalanche effect of various hash functions A cryptographic hash is a kind of ‘signature’ for a nominal variable which makes multiple observations of text or a data file. These functions are mathematical the measurement variable for each value of the nominal operations run on digital data. By comparing the variable. computed "hash" (the output from execution of the algorithm) to a known and expected hash value, Material and Methods a person can determine the data's integrity. A key aspect The 19 raw images were randomly selected in this study. of cryptographic hash functions is their collision (Figure 1) A sample size calculator was used to resistance: noone should be able to find two different determine sample size needed with a fixed parameter input values that result in the same hash output.13 (95% confidence level, 5% confidence interval, SHA-256 generates an almost-unique 256-bit (32-byte) population =20). The raw files were taken from FUJINON signature for a text. See below for the source code.14 X-T10. This camera uses a 16 million mega pixels SHA-256 is novel hash function computed with photo sensor and processes image internally by 14 bits 32-bit words. It uses different shift amounts and color depth. All images are 4896x3264 in dimensions. additive Theconstants, 19 raw butimages their werestructures randomly are otherwiseselected in thisThe study size. (Figureof image 1) A iss amplebetween size 31calculator and 33 was MB. usedvirtually to identical,determine differing sample only size in the needed number with of rounds.a fixed parameterThe notebook (95 %Intel confidence core i7 3.06 level, MHz 5 %CPU, confidence Ram 8 GB, 15 interval, Analysis population of variance =20). The (ANOVA) raw files iswere the taken most from 256FUJINON GB SSD, X -T10VMware. This workstation camera uses 12.0a 16and million windows megacommonly pixels usedphoto technique sensor for andcomparing processes the meansimage of internally10 environment by 14 bits was colorused fordepth this. Allstudy. images The CentOSare groups of measurement data. There are many different 7.0 64 bit guest OS with 2 GB Ram was updated to 4896x3264 in dimensions. The size of image is between 31 and 33 MB. The notebook Intel core i7 3.06 experimental designs that can be analyzed with different the latest version. During the experiment, the use of MHz CPU, Ram 8 GB, 256 GB SSD, VMware workstation 12.0 and windows 10 environment was used kinds of ANOVA. In a one-way ANOVA (also known as external power supply prevents CPU changing to low fora thisone-factor, study. Thesingle-factor, CentOS 7 .0or 64 single-classificationbit guest OS with 2 GBpower Ram environmentwas updated automatically to the latest withversion the.
Load more

Recommended publications
  • Advanced Encryption Standard (Aes) Modes of Operation
    ADVANCED ENCRYPTION STANDARD (AES) MODES OF OPERATION 1 Arya Rohan Under the guidance of Dr. Edward Schneider University of Maryland, College Park MISSION: TO SIMULATE BLOCK CIPHER MODES OF OPERATION FOR AES IN MATLAB Simulation of the AES (Rijndael Algorithm) in MATLAB for 128 bit key-length. Simulation of the five block cipher modes of operation for AES as per FIPS publication. Comparison of the five modes based on Avalanche Effect. Future Work 2 OUTLINE A brief history of AES Galois Field Theory De-Ciphering the Algorithm-ENCRYPTION De-Ciphering the Algorithm-DECRYPTION Block Cipher Modes of Operation Avalanche Effect Simulation in MATLAB Conclusion & Future Work References 3 A BRIEF HISTORY OF AES 4 In January 1997, researchers world-over were invited by NIST to submit proposals for a new standard to be called Advanced Encryption Standard (AES). From 15 serious proposals, the Rijndael algorithm proposed by Vincent Rijmen and Joan Daemen, two Belgian cryptographers won the contest. The Rijndael algorithm supported plaintext sizes of 128, 192 and 256 bits, as well as, key-lengths of 128, 192 and 256 bits. The Rijndael algorithm is based on the Galois field theory and hence it gives the algorithm provable 5 security properties. GALOIS FIELD 6 GALOIS FIELD - GROUP Group/Albelian Group: A group G or {G, .} is a set of elements with a binary operation denoted by . , that associates to each ordered pair (a, b) of elements in G an element (a . b) such that the following properties are obeyed: Closure: If a & b belong to G, then a . b also belongs to G.
    [Show full text]
  • Block Ciphers and the Data Encryption Standard
    Lecture 3: Block Ciphers and the Data Encryption Standard Lecture Notes on “Computer and Network Security” by Avi Kak ([email protected]) January 26, 2021 3:43pm ©2021 Avinash Kak, Purdue University Goals: To introduce the notion of a block cipher in the modern context. To talk about the infeasibility of ideal block ciphers To introduce the notion of the Feistel Cipher Structure To go over DES, the Data Encryption Standard To illustrate important DES steps with Python and Perl code CONTENTS Section Title Page 3.1 Ideal Block Cipher 3 3.1.1 Size of the Encryption Key for the Ideal Block Cipher 6 3.2 The Feistel Structure for Block Ciphers 7 3.2.1 Mathematical Description of Each Round in the 10 Feistel Structure 3.2.2 Decryption in Ciphers Based on the Feistel Structure 12 3.3 DES: The Data Encryption Standard 16 3.3.1 One Round of Processing in DES 18 3.3.2 The S-Box for the Substitution Step in Each Round 22 3.3.3 The Substitution Tables 26 3.3.4 The P-Box Permutation in the Feistel Function 33 3.3.5 The DES Key Schedule: Generating the Round Keys 35 3.3.6 Initial Permutation of the Encryption Key 38 3.3.7 Contraction-Permutation that Generates the 48-Bit 42 Round Key from the 56-Bit Key 3.4 What Makes DES a Strong Cipher (to the 46 Extent It is a Strong Cipher) 3.5 Homework Problems 48 2 Computer and Network Security by Avi Kak Lecture 3 Back to TOC 3.1 IDEAL BLOCK CIPHER In a modern block cipher (but still using a classical encryption method), we replace a block of N bits from the plaintext with a block of N bits from the ciphertext.
    [Show full text]
  • Block Ciphers
    Block Ciphers Chester Rebeiro IIT Madras CR STINSON : chapters 3 Block Cipher KE KD untrusted communication link Alice E D Bob #%AR3Xf34^$ “Attack at Dawn!!” message encryption (ciphertext) decryption “Attack at Dawn!!” Encryption key is the same as the decryption key (KE = K D) CR 2 Block Cipher : Encryption Key Length Secret Key Plaintext Ciphertext Block Cipher (Encryption) Block Length • A block cipher encryption algorithm encrypts n bits of plaintext at a time • May need to pad the plaintext if necessary • y = ek(x) CR 3 Block Cipher : Decryption Key Length Secret Key Ciphertext Plaintext Block Cipher (Decryption) Block Length • A block cipher decryption algorithm recovers the plaintext from the ciphertext. • x = dk(y) CR 4 Inside the Block Cipher PlaintextBlock (an iterative cipher) Key Whitening Round 1 key1 Round 2 key2 Round 3 key3 Round n keyn Ciphertext Block • Each round has the same endomorphic cryptosystem, which takes a key and produces an intermediate ouput • Size of the key is huge… much larger than the block size. CR 5 Inside the Block Cipher (the key schedule) PlaintextBlock Secret Key Key Whitening Round 1 Round Key 1 Round 2 Round Key 2 Round 3 Round Key 3 Key Expansion Expansion Key Key Round n Round Key n Ciphertext Block • A single secret key of fixed size used to generate ‘round keys’ for each round CR 6 Inside the Round Function Round Input • Add Round key : Add Round Key Mixing operation between the round input and the round key. typically, an ex-or operation Confusion Layer • Confusion layer : Makes the relationship between round Diffusion Layer input and output complex.
    [Show full text]
  • KLEIN: a New Family of Lightweight Block Ciphers
    KLEIN: A New Family of Lightweight Block Ciphers Zheng Gong1, Svetla Nikova1;2 and Yee Wei Law3 1Faculty of EWI, University of Twente, The Netherlands fz.gong, [email protected] 2 Dept. ESAT/SCD-COSIC, Katholieke Universiteit Leuven, Belgium 3 Department of EEE, The University of Melbourne, Australia [email protected] Abstract Resource-efficient cryptographic primitives become fundamental for realizing both security and efficiency in embedded systems like RFID tags and sensor nodes. Among those primitives, lightweight block cipher plays a major role as a building block for security protocols. In this paper, we describe a new family of lightweight block ciphers named KLEIN, which is designed for resource-constrained devices such as wireless sensors and RFID tags. Compared to the related proposals, KLEIN has ad- vantage in the software performance on legacy sensor platforms, while its hardware implementation can be compact as well. Key words. Block cipher, Wireless sensor network, Low-resource implementation. 1 Introduction With the development of wireless communication and embedded systems, we become increasingly de- pendent on the so called pervasive computing; examples are smart cards, RFID tags, and sensor nodes that are used for public transport, pay TV systems, smart electricity meters, anti-counterfeiting, etc. Among those applications, wireless sensor networks (WSNs) have attracted more and more attention since their promising applications, such as environment monitoring, military scouting and healthcare. On resource-limited devices the choice of security algorithms should be very careful by consideration of the implementation costs. Symmetric-key algorithms, especially block ciphers, still play an important role for the security of the embedded systems.
    [Show full text]
  • Chapter 3 – Block Ciphers and the Data Encryption Standard
    Symmetric Cryptography Chapter 6 Block vs Stream Ciphers • Block ciphers process messages into blocks, each of which is then en/decrypted – Like a substitution on very big characters • 64-bits or more • Stream ciphers process messages a bit or byte at a time when en/decrypting – Many current ciphers are block ciphers • Better analyzed. • Broader range of applications. Block vs Stream Ciphers Block Cipher Principles • Block ciphers look like an extremely large substitution • Would need table of 264 entries for a 64-bit block • Arbitrary reversible substitution cipher for a large block size is not practical – 64-bit general substitution block cipher, key size 264! • Most symmetric block ciphers are based on a Feistel Cipher Structure • Needed since must be able to decrypt ciphertext to recover messages efficiently Ideal Block Cipher Substitution-Permutation Ciphers • in 1949 Shannon introduced idea of substitution- permutation (S-P) networks – modern substitution-transposition product cipher • These form the basis of modern block ciphers • S-P networks are based on the two primitive cryptographic operations we have seen before: – substitution (S-box) – permutation (P-box) (transposition) • Provide confusion and diffusion of message Diffusion and Confusion • Introduced by Claude Shannon to thwart cryptanalysis based on statistical analysis – Assume the attacker has some knowledge of the statistical characteristics of the plaintext • Cipher needs to completely obscure statistical properties of original message • A one-time pad does this Diffusion
    [Show full text]
  • Visualization of the Avalanche Effect in CT2
    University of Mannheim Faculty for Business Informatics & Business Mathematics Theoretical Computer Science and IT Security Group Bachelor's Thesis Visualization of the Avalanche Effect in CT2 as part of the degree program Bachelor of Science Wirtschaftsinformatik submitted by Camilo Echeverri [email protected] on October 31, 2016 (2nd revised public version, Apr 18, 2017) Supervisors: Prof. Dr. Frederik Armknecht Prof. Bernhard Esslinger Visualization of the Avalanche Effect in CT2 Abstract Cryptographic algorithms must fulfill certain properties concerning their security. This thesis aims at providing insights into the importance of the avalanche effect property by introducing a new plugin for the cryptography and cryptanalysis platform CrypTool 2. The thesis addresses some of the desired properties, discusses the implementation of the plugin for modern and classic ciphers, guides the reader on how to use it, applies the proposed tool in order to test the avalanche effect of different cryptographic ciphers and hash functions, and interprets the results obtained. 2 Contents Abstract .......................................... 2 Contents .......................................... 3 List of Abbreviations .................................. 5 List of Figures ...................................... 6 List of Tables ....................................... 7 1 Introduction ..................................... 8 1.1 CrypTool 2 . 8 1.2 Outline of the Thesis . 9 2 Properties of Secure Block Ciphers ....................... 10 2.1 Avalanche Effect . 10 2.2 Completeness . 10 3 Related Work ..................................... 11 4 Plugin Design and Implementation ....................... 12 4.1 General Description of the Plugin . 12 4.2 Prepared Methods . 14 4.2.1 AES and DES . 14 4.3 Unprepared Methods . 20 4.3.1 Classic Ciphers, Modern Ciphers, and Hash Functions . 20 4.4 Architecture of the Code . 22 4.5 Limitations and Future Work .
    [Show full text]
  • A Block Cipher Algorithm to Enhance the Avalanche Effect Using Dynamic Key- Dependent S-Box and Genetic Operations 1Balajee Maram and 2J.M
    International Journal of Pure and Applied Mathematics Volume 119 No. 10 2018, 399-418 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu Special Issue ijpam.eu A Block Cipher Algorithm to Enhance the Avalanche Effect Using Dynamic Key- Dependent S-Box and Genetic Operations 1Balajee Maram and 2J.M. Gnanasekar 1Department of CSE, GMRIT, Rajam, India. Research and Development Centre, Bharathiar University, Coimbatore. [email protected] 2Department of Computer Science & Engineering, Sri Venkateswara College of Engineering, Sriperumbudur Tamil Nadu. [email protected] Abstract In digital data security, an encryption technique plays a vital role to convert digital data into intelligible form. In this paper, a light-weight S- box is generated that depends on Pseudo-Random-Number-Generators. According to shared-secret-key, all the Pseudo-Random-Numbers are scrambled and input to the S-box. The complexity of S-box generation is very simple. Here the plain-text is encrypted using Genetic Operations and S-box which is generated based on shared-secret-key. The proposed algorithm is experimentally investigates the complexity, quality and performance using the S-box parameters which includes Hamming Distance, Balanced Output and the characteristic of cryptography is Avalanche Effect. Finally the comparison results motivates that the dynamic key-dependent S-box has good quality and performance than existing algorithms. 399 International Journal of Pure and Applied Mathematics Special Issue Index Terms:S-BOX, data security, random number, cryptography, genetic operations. 400 International Journal of Pure and Applied Mathematics Special Issue 1. Introduction In public network, several types of attacks1 can be avoided by applying Data Encryption/Decryption2.
    [Show full text]
  • A Tutorial on the Implementation of Block Ciphers: Software and Hardware Applications
    A Tutorial on the Implementation of Block Ciphers: Software and Hardware Applications Howard M. Heys Memorial University of Newfoundland, St. John's, Canada email: [email protected] Dec. 10, 2020 2 Abstract In this article, we discuss basic strategies that can be used to implement block ciphers in both software and hardware environments. As models for discussion, we use substitution- permutation networks which form the basis for many practical block cipher structures. For software implementation, we discuss approaches such as table lookups and bit-slicing, while for hardware implementation, we examine a broad range of architectures from high speed structures like pipelining, to compact structures based on serialization. To illustrate different implementation concepts, we present example data associated with specific methods and discuss sample designs that can be employed to realize different implementation strategies. We expect that the article will be of particular interest to researchers, scientists, and engineers that are new to the field of cryptographic implementation. 3 4 Terminology and Notation Abbreviation Definition SPN substitution-permutation network IoT Internet of Things AES Advanced Encryption Standard ECB electronic codebook mode CBC cipher block chaining mode CTR counter mode CMOS complementary metal-oxide semiconductor ASIC application-specific integrated circuit FPGA field-programmable gate array Table 1: Abbreviations Used in Article 5 6 Variable Definition B plaintext/ciphertext block size (also, size of cipher state) κ number
    [Show full text]
  • Construction of Stream Ciphers from Block Ciphers and Their Security
    Sridevi, International Journal of Computer Science and Mobile Computing, Vol.3 Issue.9, September- 2014, pg. 703-714 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 3, Issue. 9, September 2014, pg.703 – 714 RESEARCH ARTICLE Construction of Stream Ciphers from Block Ciphers and their Security Sridevi, Assistant Professor, Department of Computer Science, Karnatak University, Dharwad Abstract: With well-established encryption algorithms like DES or AES at hand, one could have the impression that most of the work for building a cryptosystem -for example a suite of algorithms for the transmission of encrypted data over the internet - is already done. But the task of a cipher is very specific: to encrypt or decrypt a data block of a specified length. Given an plaintext of arbitrary length, the most simple approach would be to break it down to blocks of the desired length and to use padding for the final block. Each block is encrypted separately with the same key, which results in identical ciphertext blocks for identical plaintext blocks. This is known as Electronic Code Book (ECB) mode of operation, and is not recommended in many situations because it does not hide data patterns well. Furthermore, ciphertext blocks are independent from each other, allowing an attacker to substitute, delete or replay blocks unnoticed. The feedback modes in fact turn the block cipher into a stream cipher by using the algorithm as a keystream generator. Since every mode may yield different usage and security properties, it is necessary to analyse them in detail.
    [Show full text]
  • Chapter 2 Block Ciphers
    Chapter 2 Block Ciphers Block ciphers are the central tool in the design of protocols for shared-key cryp- tography. They are the main available “technology” we have at our disposal. This chapter will take a look at these objects and describe the state of the art in their construction. It is important to stress that block ciphers are just tools—raw ingredients for cooking up something more useful. Block ciphers don’t, by themselves, do something that an end-user would care about. As with any powerful tool, one has to learn to use this one. Even a wonderful block cipher won’t give you security if you use don’t use it right. But used well, these are powerful tools indeed. Accordingly, an important theme in several upcoming chapters will be on how to use block ciphers well. We won’t be emphasizing how to design or analyze block ciphers, as this remains very much an art. The main purpose of this chapter is just to get you acquainted with what typical block ciphers look like. We’ll look at two examples, DES and AES. DES is the “old standby.” It is currently (year 2001) the most widely-used block cipher in existence, and it is of sufficient historical significance that every trained cryptographer needs to have seen its description. AES is a modern block cipher, and it is expected to supplant DES in the years to come. 2.1 What is a block cipher? A block cipher is a function E: {0, 1}k ×{0, 1}n →{0, 1}n that takes two inputs, a k- bit key K and an n-bit “plaintext” M, to return an n-bit “ciphertext” C = E(K, M).
    [Show full text]
  • Recommendation for Block Cipher Modes of Operation Methods
    NIST Special Publication 800-38A Recommendation for Block 2001 Edition Cipher Modes of Operation Methods and Techniques Morris Dworkin C O M P U T E R S E C U R I T Y ii C O M P U T E R S E C U R I T Y Computer Security Division Information Technology Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899-8930 December 2001 U.S. Department of Commerce Donald L. Evans, Secretary Technology Administration Phillip J. Bond, Under Secretary of Commerce for Technology National Institute of Standards and Technology Arden L. Bement, Jr., Director iii Reports on Information Security Technology The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the Nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analyses to advance the development and productive use of information technology. ITL’s responsibilities include the development of technical, physical, administrative, and management standards and guidelines for the cost-effective security and privacy of sensitive unclassified information in Federal computer systems. This Special Publication 800-series reports on ITL’s research, guidance, and outreach efforts in computer security, and its collaborative activities with industry, government, and academic organizations. Certain commercial entities, equipment, or materials may be identified in this document in order to describe an experimental procedure or concept adequately. Such identification is not intended to imply recommendation or endorsement by the National Institute of Standards and Technology, nor is it intended to imply that the entities, materials, or equipment are necessarily the best available for the purpose.
    [Show full text]
  • FPGA Implementation and Analysis of the Block Cipher Mode Architectures for the PRESENT Light Weight Encryption Algorithm
    ISSN (Print) : 0974-6846 Indian Journal of Science and Technology, Vol 9(38), DOI: 10.17485/ijst/2016/v9i38/90314, October 2016 ISSN (Online) : 0974-5645 FPGA Implementation and Analysis of the Block Cipher Mode Architectures for the PRESENT Light Weight Encryption Algorithm A. Prathiba* and V. S. Kanchana Bhaaskaran School of Electronics Engineering, VIT University Chennai, Chennai - 600127, India; prathi_communication@yahoo. co.in, [email protected] Abstract Objective: This paper presents the Field Programmable Gate Array (FPGA) implementations of the different block cipher mode architectures of the ISO standardized light weight block cipher PRESENT, designed for resource constrained devices. Methods/ Statistical Analysis: The performance evaluations compare the implementations of the different block cipher modes, namely Electronic Code Book (ECB) mode, Cipher Block Chaining (CBC) mode, Cipher Feedback Mode (CFB), Output Feed Back Mode (OFB) and CounTeR (CTR) mode for the PRESENT cipher. The throughput of encryption of three successive 64 bit blocks of data ranges from 565.312Mbps to 574.784Mbps for the modes other than the cipher feedback arrives as 68.912 Mbps, 155.392Mbps and300.8 Mbps for a 64 bit block of data for the input streams of size 8 bits, 16 bits andmode 32 in bits the respectively.Spartan-3 FPGA. Findings: The throughput The throughput for providing of the confidentialityblock cipher mode through hardware encryption architectures in the cipher of the feedback light weight mode cipher PRESENT demonstrates the high speed performance of the cipher in encryption/decryption of data as blocks and streams. Application/ Improvement: different modes of operation for the light weight block cipher PRESENT.
    [Show full text]