Preview

Qaz1234

Better Essays
Open Document
Open Document
4226 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Qaz1234
Chandrasekharappa T.G.S et al. / International Journal on Computer Science and Engineering (IJCSE)

S-boxes generated using Affine Transformation giving Maximum Avalanche Effect
Chandrasekharappa T.G.S., Prema K.V. and Kumara Shama
Department of Electronics and Communication Engineering Manipal Institute of Technology Manipal - 576104 INDIA tgscmpl@gmail.com

Abstract: The Advanced Encryption Standard (AES) was published by National Institute of Standards and Technology (NIST) in November 2001, to replace DES (Data Encryption Standard) and Triple DES. The S-box (Substitution box) used in AES is designed to be resistant to known cryptanalytic attacks [1][2]. The property of the S-box is that the output cannot be described as a simple mathematical function of the input. The S-box is designed to provide good avalanche effect. The Avalanche Criteria of S-box depends on the generator matrix A used in affine transformation to construct the S-box. This paper investigates the construction of Sboxes by affine transformation which satisfy maximum Avalanche Criteria.

Keywords: Affine transformation, AES algorithm, Irreducible polynomial, Avalanche Criteria, S-box. 1. Introduction: The S-box, constructed in AES algorithm uses the Affine transformation

y  Ax  C mod m( x)

(1).

where A is an 8 x 8 matrix with entries in GF(2) and C is a column matrix in GF(2), m(x) is an irreducible polynomial in GF(29). The entries used in A matrix are [f8h; 7ch, 3eh, 1fh, 8fh, c7h, e1h, f1h]T and C = [63h]T (2) To be useful as S-box generator, matrix A should be non-singular. We can generate approximately 263 such non-singular matrices with each irreducible polynomials. The polynomials that result in non-singular matrices are bound by [01; 02; 04; 08; 10; 20; 40; 80]T on lower end and [feh, 7fh, bfh, dfh, efh, f7h, fbh, fdh]T on higher end. As per Avalanche criteria a one bit change in input should result in at least 50% changes in the output bits. A cryptographic



References: [1] [2] [3] [4] [5] [6] [7] [8] William Stallings, “Cryptography and Network Security Principles and Practices”, Fourth Edition, Pearson, Prentice Hall, 2006. Daemen, J. and V. Rijmen, “The Design of RIJNDAEL- AES The Advanced Encryption Standard”, Springer-Verlag, Berlin, 2002. Chandrasekharappa T G S, Prema K V, Kumara Shama, “Possible S-boxes generated from Affine transformation those satisfy Maximum Strict Avalanche Criteria, Proceedings of World Academy of Science, Engineering and Technology 60, pp.880-883 Dec. 2009. Elif Saygi, Zulfukar Saygi, Meltem SOnmezturan, Ali doganaksoy, Statistical approach on the number of SAC satisfying functions, IEEE transactions on computers, vol. 44. No. 9, September 1995. Rejane Forre, The strict avalanche criterion: spectral properties of Boolean Functions and an Extended De_nitio, Advances in cryptologycrypto 88, Lecture notes in computer science, volume 403, pp. 450-468 Springer-verlag. Isil VERGILI, Melek D. YUCEL, Avalanche and Bit Independence Properties for the Ensembles of Randomly Chosen n _ n S-boxes, Turk J Elec. Engin, VOL.9, NO.2 2001. ISSN : 0975-3397 Vol. 3 No. 9 september 2011 3193

You May Also Find These Documents Helpful

  • Powerful Essays

    Nt1310 Unit 1 Exercise 1

    • 5033 Words
    • 21 Pages

    Figure: Euclidean division algorithm The message is represented by a information polynomial i(x). i(x) is store as a bit pattern of k length in an integer array. The k information bits are represented by k-1 degree polynomial i(x) = i(k-1)x(k-1) + i(k-2)x(k-2) +……………………………..+i1x+i0 A polynomial code is specified by its generating polynomial g(x). If we assume that we are dealing with a code in which codewords have n bits of which k are information bits and n-k are check bits . The…

    • 5033 Words
    • 21 Pages
    Powerful Essays
  • Good Essays

    NETWORKING ADMIN

    • 606 Words
    • 3 Pages

    Match common encryption algorithms and methods with the scenarios representing real-world business applications and requirements.…

    • 606 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    -It was so important because it was a landmark case, it was known for being the crime of the century, the first trial by media and the first to be dominated by forensic science.…

    • 339 Words
    • 1 Page
    Satisfactory Essays
  • Powerful Essays

    SAMPLE Security Policy

    • 3395 Words
    • 13 Pages

    References: Hausman, K., Weiss, M., & Barrett, D. (2011). Comptia security sy0-301. (3rd ed.). Pearson Education, Inc.…

    • 3395 Words
    • 13 Pages
    Powerful Essays
  • Good Essays

    • Ideally, it is the responsibility of the courts to weed out the facts as it applies to the law to acquit the innocent and convict the guilty.…

    • 869 Words
    • 4 Pages
    Good Essays
  • Good Essays

    ISSC362 Lab 2 Assessment

    • 492 Words
    • 2 Pages

    Compare the hash values calculated for example.txt that you documented during this lab. Explain in your own words why the hash values will change when the data is modified.…

    • 492 Words
    • 2 Pages
    Good Essays
  • Good Essays

    WFV1 Notes

    • 4474 Words
    • 16 Pages

    Symmetric/ asymertric encryption Network Technology Associate v2.0, Lesson 6: Network and Cloud Security Risks, section "Encryption.”…

    • 4474 Words
    • 16 Pages
    Good Essays
  • Powerful Essays

    Tilborg, H. (2002). Fundamentals of Cryptology: A Professional Reference and Interactive Tutorial. Kluwer Academic Publishers.…

    • 2890 Words
    • 12 Pages
    Powerful Essays
  • Powerful Essays

    Indium Research Paper

    • 2125 Words
    • 9 Pages

    A simple, precise and accurate solvent extraction method is described for the separation and estimation of Indium in geological materials. Solvent extraction of Indium from 6 M HCl medium using tri-n-butyl phosphate, selectively separates Indium from accompanying elements in different type of geological samples. Acid hydrolysis of Nb/Ta samples separates Indium from major matrix elements like Nb and Ta and the remaining elements do not influence the selective extraction and preconcentration of In and its subsequent determination by ICP-AES or flame AAS. The silica rich geological samples are decomposed by HF-H2SO4-HCl treatment followed by dissolution in 6M HCl before applying solvent extraction procedure. In Nb/Ta type of samples, Indium was separated from Nb and Ta by acid hydrolysis, involving fusion with Na2O2, dissolution in HCl followed by NH4OH precipitation and hydrolysis in HCl. The oxychloride precipitates of Nb and Ta are filtered off and subjected to solvent extraction using TBP. The proposed method has been applied to some international reference standards (IGS-33 and ASK-3) and to some Nb/Ta type samples and the results are compared by ICP-AES as well flame AAS techniques. The method is simple, rapid and accurate showing a relative standard deviation of 2% (at 170 μg/g) to 7.0% (at 16 μg/g ) and the method can be applied down to 1 μg/g and above.…

    • 2125 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    At ABC Institute of Research, the value of the company is in the confidentiality of what it finds. If for example, ABC were to expend a great investment in finding a solution to a problem, only for DEF Research Inc. to discover their secret, ABC could suffer greatly. In the current age of networks and computers, the information you put in is only as safe as you make it. In order for ABC Institute of Research to keep their investment safe, they must protect their data at all costs. In the following, I will show how ABC can accomplish this using asymmetric cryptology to exchange a secret key and then use symmetric cryptology to ensure the confidentiality of data being sent; I will then show you the advantages and disadvantages.…

    • 560 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Careercup Top 150 Questions

    • 30242 Words
    • 121 Pages

    Interview Questions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Chapter 1 Chapter 2 Chapter 3 Chapter 4 Chapter 5 Chapter 6 Chapter 7 Chapter 8 Chapter 9 Chapter 10 Chapter 11 Chapter 12 Chapter 13 Chapter 14 Applied Mathematics. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 Arrays & Hash Tables. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 Bit Manipulation . . . . . . . . . . . . . .…

    • 30242 Words
    • 121 Pages
    Powerful Essays
  • Better Essays

    Hi How R U

    • 2214 Words
    • 9 Pages

    References: * Alvaro A. C´ardenas, S. S. (2008). Research Challenges for the Security of Control Systems.…

    • 2214 Words
    • 9 Pages
    Better Essays
  • Good Essays

    INTRODUCTION: Blowfish, a symmetric block cipher developed by Bruce Schneier[SCHN93, SCHN94), is a Feistel network, iterating simple encryption and decryption functions of 16 times each. The block size is 64 bits, and the key can be any length up to 448 bits. Although there is a complex initialization phase required before any encryption can take place, the actual encryption of data is very efficient on large microprocessors. Blowfish was designed to have the following characteristics: Fast: Blowfish encrypts data on 32-bit microprocessors at a rate of 18 clock cycles per byte. Compact: Blowfish can run in less than 5K of memory. Simple: Blowfish's simple structure is easy to implement and eases the task of determining the strength of the algorithm. Variably secure: The key length is variable and can be as long as 448 bits. This allows a tradeoff between higher speed and higher security. Blowfish encrypts 64-bit blocks of plaintext into 64-bit blocks of ciphertext. Blowfish is implemented in numerous products and has received a fair amount of scrutiny. So far, the security of Blowfish is unchallenged. DESIGN DECISIONS Based on Schneier's design parameters, he have made these design decisions. The algorithm should: - Manipulate data in large blocks, preferably 32 bits in size (and not in single bits, such as DES). - Have either a 64-bit or a 128-bit block size. - Have a scalable key, from 32 bits to at least 256 bits. - Use simple operations that are efficient on microprocessors: e.g., exclusiveor, addition, table lookup, modular- multiplication. It should not use variablelength shifts or bit-wise permutations, or conditional jumps. - Be implementable on an 8-bit processor with a minimum of 24 bytes of RAM (in addition to the RAM required to store the key) and 1 kilobyte of ROM. - Employ precomputable subkeys. On large-memory systems, these subkeys can be precomputed for faster operation. Not precomputing the subkeys will result in…

    • 607 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Dynamic Source Routing

    • 375 Words
    • 2 Pages

    A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to Enhance the Information Security…

    • 375 Words
    • 2 Pages
    Satisfactory Essays