CHAPTER 6 EC BASED KEY GENERATION FOR SYMMETRIC ENCRYPTION
|
|
- Amberly Collins
- 6 years ago
- Views:
Transcription
1 100 CHAPTER 6 EC BASED KEY GENERATION FOR SYMMETRIC ENCRYPTION 6.1 INTRODUCTION Stream ciphers are cryptographic primitives used to ensure privacy in digital communication. Security of stream cipher depends on the generation of unpredictable sequence called key stream that must be of sufficient size and randomness (Goldreich et al 1986). Hence, key stream generator is incredibly a vital building block for stream cipher applications. This chapter presents the implementation of stream cipher, where the key stream is generated based on the properties of LFSR and cyclic EC over a finite prime field. The process of encryption / decryption of an image in spatial domain are illustrated and the key file parameters needed for generating the key stream to other parties are also encrypted using ECC. Therefore, the encrypted key file parameters are only transmitted and not the entire full length key. Whereas ECC is replacing RSA for key exchange, EC based stream cipher offers a good choice for encryption in real time application. The strength of the proposed cipher lies in the generation of random sequence using LFSR over GF(p), the difficulty of ECDLP for determining the key file parameters and no need to transmit the entire key stream in the encryption process. This chapter also discusses the security aspects of the proposed cipher which is secure against all kinds of attacks.
2 101 The rest of the chapter is organized as follows. Section 6.2 describes the concepts of pseudo random sequence generation. Section 6.3 discusses security issues related to image encryption techniques. Section 6.4 proposes an efficient EC based stream cipher for confidential communication. The algorithm is also defined. Section 6.5 gives experiment results. Section 6.6 evaluates the security analysis, and finally section 6.7 concludes this chapter. 6.2 PSEUDO RANDOM SEQUENCE GENERATION Random numbers are of crucial importance in almost every aspect of modern digital cryptography, responsible for the strength of cryptographic primitives in securing precious information by rendering it unknown, unguessable, unpredictable and unrepeatable for an adversary. One of the most important roles randomness plays in cryptography is represented by cryptographic keys which determine the transformation of the plaintext into cipher text and vice versa. Considering that both the encryption and the decryption algorithms are publicly known together with all the cipher texts transmitted between the sender and receiver, the security of the whole cryptosystem is dependent on how the key information is managed, generated, agreed on, applied, stored and destroyed. The knowledge of the key entails the access to the secret message, thus the choice of the key space and the key derivation method is critical. Cryptographic keys must be unpredictable for the adversary meaning a high information content and high uncertainty, and the measure of these properties is entropy. Thus sequences chosen for cryptographic keys must also exhibit independency of values, uniform distribution and irreproducibility. As a result, what cryptography needs for its keys is
3 102 randomness. But randomness comes in many flavours and deciding on a certain source of randomness for a given application is a difficult task, considering the quality and quantity of randomness necessary for a key to withstand possible attacks. Furthermore, aspects such as the performance implications of working with a long key sequence and the effort of managing such a key also have to be taken into account. One of the properties that a key sequence provides is to classify the cipher using these keys in different security categories. The most demanding requirements on the quality of the key sequence are stated by unconditional security. The most notable work in this area is Shannon s demonstration that a vernam cipher which uses a perfectly random key and applies it only once, known as OTP, is unbreakable. The need for design of efficient and secure pseudo random sequence generators remains an ongoing challenge and an important field in cryptographic research up to the present day. The cryptosystems that exploit the idea of the pseudo random sequence generators are the stream ciphers. The cryptographically random generators follow this property: from a piece of an arbitrary long sequence, it is computationally impossible to predict the following bit of the sequence. The requirement is that the complete sequence cannot be computed from a piece of it, and at the same time, it can be completely regenerated from the seed. Pseudo random generators allow ciphering messages of arbitrary length combining the message with the sequence using the exclusive OR operation byte to byte. Considerable research has been made in the design and analysis of pseudo random generators over the last decade (Rueppel 1986). Kaliski(1986) discussed how to generate a pseudo random sequence from elliptic curves,
4 103 wherein randomness criteria based on the computational difficulty of the DL over the elliptic curves is used. Guang et al (1999) use the unconditional randomness criteria to measure the EC sequences and the generation of binary sequences by applying trace functions to EC over GF(2 m ). Deepthi et al (2009) presented stream cipher based on elliptic curve point multiplication over GF(2 m ). Pareek et al (2010) discussed the random bit generators based on properties of chaotic maps. Thus there are ongoing research efforts that aim to reveal secure ways of using PRNG in cryptography and this search has brought about several PRNG designs that are considered cryptographically secure PRNG built on cryptographic primitives such as hash functions or block ciphers, mathematical problems considered to be extremely difficult such as EC generators, or integer factorization. In this work, the focus is on stream cipher built using LFSR and cyclic EC over a finite prime field Linear Feedback Shift Register Linear feedback shift register is the basis for generating key sequences of stream ciphers because they generate sequences having long periods and good randomness and statistical properties. The LFSR was first presented by Golomb (1982) as pseudo random number generator. The secret key in these ciphers is the LFSR s initial state. The pseudo random number generators based on LFSRs are very quick, easy and secure in the implementation of hardware and software (Schneier 1996). This work aims to extend the period of a LFSR in order to make them more secure. Any LFSR can be characterized as a polynomial of variable x, referred to as the generator polynomial:
5 104 G(x) = g m x m + g m-1 x m g 2 x 2 + g 1 x + g 0 (6.1) The coefficients g i denotes the tap weights. The order of the polynomial, m, specifies the number of LFSR stages. Finite field is used to attain m-sequence feedback taps. As an example of polynomial representation, the generator polynomial G(x) = g 4 x 4 + g 3 x 3 + g 2 x 2 + g 1 x + g 0 represents an LFSR with feedback taps 2 and 1, denoted in Figure 6.1. These taps are elected based on the primitive polynomial. Random sequence (r i ) g 4 g 3 g 2 g 1 Seed mod p Figure 6.1 Linear feedback shift register To determine maximum length tap sequences, the following points are to be considered. The polynomial is primitive. Maximal length tap sequences constantly have an even number of taps. The tap values in a maximal length tap sequence are all relatively prime. Recent works point out that the key stream generation plays a major role in the performance of a secure stream cipher. The key stream generation presented in this work is a variation of the above methods, where the key streams are generated based on the combination of LFSR and cyclic EC over a finite prime field.
6 SECURITY ISSUES IN IMAGE ENCRYPTION Images are widely used in various areas and hence the protection of image data from unauthorized access has become a major concern. Image encryption plays an important role in real time multimedia applications because of large data sizes. Therefore, communication security of digital images and textual digital media can be accomplished by means of standard symmetric key cryptography. Such media can be treated as binary sequence and the whole data can be encrypted using a cryptosystem such as Advanced Encryption Standard (AES) or Data Encryption Standard (DES) (Stinson 2002). In general, when the multimedia data is static (not a real time streaming) it can be treated as a regular binary data and the conventional encryption techniques can be used. Deciding upon what level of security is needed is harder than it looks. To identify an optimal security level, the cost of the multimedia information to be protected and the cost of the protection itself are to be compared carefully. At present, there are many available image encryption algorithms such as magic cube transformation (Jun et al 2002), baker s transformation (Feng 2003), affine transformation (Guibin et al 2003) and tangram algorithm (Ding et al 2005). In some algorithms, the secret key and algorithm cannot be separated effectively. This does not satisfy the requirements of the modern cryptographic mechanism and are prone to various attacks. In recent years, image encryption has been developed to overcome the above disadvantages as discussed in (Stinson 2002, Gang et al 2002).
7 106 Various image encryption schemes have been proposed by several researchers to overcome image encryption problems. Sinha et al (2003) have proposed a technique to encrypt an image for secure image transmission. Image encoding is done by using an appropriate error control code like a Bose Chaudhuri Hochquenghem (BCH) code. Shin et al (2003) proposed the multilevel image encryption by using binary phase exclusive OR operation and image dividing technique. Salleh et al (2003) discussed a chaos based symmetric key encryption algorithm for securing images. Mitra et al (2006) proposed an image encryption using permutation method where the image can be sighted as an arrangement of bits, pixels and blocks. El-din et al (2007) presented a feedback stream cipher based on chaos for image encryption. Zeghid et al (2007) illustrated a modified version of AES algorithm for image encryption by introducing a key stream generator. Ismail et al (2010) established a chaos based stream cipher, where the key is tailored after encryption of each pixel of the plain image. Based on the study, EC based key stream is generated and is used to enhance the security of the stream cipher system further. 6.4 EC BASED STREAM CIPHER Generally, elliptic curve is used in public key cryptosystems. The security of ECC is based on discrete logarithmic problem and has advantages over RSA scheme (Koblitz 1987). In this section, the use of ECs over finite prime field in stream cipher cryptosystems is discussed.
8 Methodology Stream ciphers are a symmetric key cryptosystem used to encrypt large amounts of data very fast. Figure 6.2 presents the block diagram of the proposed stream cipher. Let the source be A and destination be B. Here, plaintext message is represented as a stream of characters, M i. The key stream K i is chosen from the EC points. The same key stream is exploited for encryption and decryption procedure. The cipher stream is indicated by C i. The length of the message is taken as n bytes. P B n B Key file parameters (a, b, p, x, seed) E D Key file parameters (a, b, p, x, seed) E PB (keyfile) EC based Key Stream Generator over GF (p) EC based Key Stream Generator over GF (p) Message (M i) K i Ciphertext (Ci) E PB (keyfile) K i Message (M i) C i User A User B Figure 6.2 Elliptic curve based stream cipher system Assume that user A wants to encrypt and transmit the message to user B, it does the following step by step procedure. 1. Generate elliptic curve y 2 = x 3 + ax + b by choosing the appropriate parameters a and b over GF(p). The algorithm genpoints described in Section is used to generate EC points P i.
9 Generate random numbers r i using LFSR. For LFSR, choose a primitive or irreducible polynomial of order m over GF(p) so that maximal length sequence can be obtained of period p m Map the generated random numbers r i to the EC points P i using scalar multiplication described in Section Get a symmetric key K i which is either x or y coordinate or Least Significant Bit (LSB) or Most Significant Bit (MSB) of eight consecutive bits of x or y coordinates from the computed stream of EC points. 5. Encrypt the message M i using the symmetric key K i. 6. Communicate parameters needed for generating the key stream to other parties using ECC based public key system along with the cipher message. 7. Decrypt the cipher message C i using the same symmetric key K i generated by the other parties Algorithm The proposed algorithm ecstream is used for enciphering and deciphering the message using key stream generated from EC points. At the encryption end, symmetric key stream is exclusive OR with the plaintext stream to produce the cipher stream. At the decryption end, the cipher stream is exclusive OR with the same key stream to recover the plaintext stream. Hence, stream ciphers can be sighted as computational analogy of an OTP cipher, replacing a long secret key by short secret key file parameters. The key file parameters needed for generating the key stream is ciphered using ECC. This algorithm is pertinent for messages like text, image, video and speech samples.
10 109 Algorithm ecstream( ) // Input : EC parameters (a, b, p, G), Coefficient x, seed, Input message M i // Output : Key stream K i, M i Decrypted Cipher message C i { // Key Distribution // Let U A and U B be legitimate users U A = {P A, n A } // Key pair for U A U B = {P B, n B } // Key pair for U B // Send the Public key of U B to U A Send (P B, U A ); // Send the Public key of U A to U B Send (P A, U B ); // Encryption at U A P i = genpoints (a, b, p) Construct an irreducible polynomial using coefficient as x and a seed. Generate r i from this irreducible polynomial Q i = r i P i // Scalar Multiplication K i = Q i {x, y, LSB(x), LSB(y), MSB(x), MSB(y)} C i = M i K i // Encrypt the message Key file parameters are converted into EC points as P kp k = random ( ) E PB (keyfile) = {kg, P kp + kp B } // Encrypt the key file parameters Send (C i, E PB (keyfile), U B ) // Decryption at U B P kp = P kp + kp B n B kg // Decrypt the encrypted key file Compute key file parameters from EC points (P kp ) using discrete logarithm
11 110 } P i = genpoints (a, b, p) Construct an irreducible polynomial using coefficient as x and a seed. Generate r i from this irreducible polynomial Q i = r i P i // Scalar Multiplication K i = Q i {x, y, LSB(x), LSB(y), MSB(x), MSB(y)} M i = C i K i // Decrypt the cipher message The challenge of this proposal lies in the generation of key stream and the secure distribution of the parameters needed for generating the key stream through unsecured channels. In several of the existing algorithms, the key will be of equal length as the message. In the proposed scheme presented in this chapter, the key stream is never transmitted. Instead the key file needed for generating the key stream is encrypted using ECC technique and transmitted along with the cipher stream. The key file contains the parameters a, b, p, x, and seed values needed for generating the key stream. For the EC based stream cipher, the secret key is tailored after encryption of each pixel of the plain image, and for each cipher image the key file parameters are also changed. These factors are used to enhance the security of the proposed EC based stream cipher. In the proposed work, the security using ECC is realized on byte basis only. Hence the work carried out for the image could be extended for the video applications also. However for any embedded system work environment, fast computing techniques with the help of hardware processing system could be deployed.
12 RESULTS AND DISCUSSION For demonstration purposes typical EC is represented by y 2 mod 841 = x 3-5x + 25 mod 841 where a = -5, b = 25 and p = 841. The generated points on the EC can be represented as (0, 5), (0, 836), (2, 368), (2, 473), (5, 258), (5, 583), (8, 85), (8, 756), (9, 338), (9, 503), (11, 372), (11, 469), and so on. The base point G is selected as (0, 5). P i is affine point, which is picked out of a series of affine points evaluated for the given EC. However, for the purpose of individual identity, P i is chosen differently for every random number. Varying values of P i can be chosen as part of an exercise to work with ECC process on the given EC. In the proposed EC based key stream generation, a sequence of random numbers r i using LFSR is generated, which needs to be kept secret. For LFSR, first construct an irreducible polynomial x x 3-940x x of order 4 over GF(587) using randomly selected coefficient x as 1076 and a seed value as Then generate random sequences from this irreducible polynomial that are represented as 495, 234, 14, 31, 261, 228, 17, 282, 481, 245, 267, 251, 276, 510, and so on. Next the generated random number r i and the EC point P i are scalar multiplied, which is carried out with a series of doubling and additions, depending on the value of r i. Efficient procedure can be adapted for optimal number of doublings and additions. For example, the first EC point (0, 5) is multiplied with the random number 495 to get an affine point (0, 836) which is also an EC point. Similarly, other EC points are multiplied with consecutive random numbers to obtain a point on EC. Some of them are tabulated in the following Table 6.1.
13 112 The computed EC point (Q i ) should fit into the EC. This conversion is done for two reasons. First, the random sequence is mapped into an affine point on an EC. Second, it will be entirely concealed from the hacker. These steps are introduced to add some level of complexity for the key stream generation process. Table 6.1 Computed EC point Generated Random Sequence (r i ) Generated EC Point (P i ) Computed EC Point (Q i ) 495 (0, 5) (0, 836) 234 (0, 836) (603, 358) 14 (2, 368) (817, 525) 31 (2, 473) (171, 155) 261 (5, 258) (58, 24) 228 (5, 583) (544, 329) 17 (8, 85) (574, 338) 282 (8, 756) (116, 295) 481 (9, 338) (727, 600) 245 (9, 503) (669, 716) 267 (11, 372) (564, 633) 251 (11, 469) (292, 212) 276 (18, 411) (150, 32) 510 (18, 430) (646, 727) From the computed EC points Q i, choose a symmetric key K i from any one of the methods specified in Table 6.2. For example, in method 2, y coordinate of computed EC points is taken as a key stream K i means the key stream are 836, 358, 525, 155, 24, 329, 338, 295, 600, 716, 633, 212, 32, 727, and so on. The same key stream K i is exploited for encryption and decryption procedure. The key stream generator plays a major role in a stream cipher for the overall security.
14 113 Using the generated key stream K i, any sort of messages like document, text, or image can be encrypted as well as decrypted byte by byte. In this work, ( ) bmp standard test image of lena that has the size of 148 KB is considered as an example. The selection of key dictates the complexity of encryption algorithm for breaking. A novel key stream generation method based on LFSR and EC over finite prime field is introduced, which is not part of any of the existing work on stream cipher key generation. Table 6.2 Key selection methods Methods Method 1 Method 2 Method 3 Method 4 Method 5 Method 6 K i Q i (x) Q i (y) LSB {Q i (x)} LSB {Q i (y)} MSB {Q i (x)} MSB {Q i (y)} where Q i (x) - x coordinates of random EC point. Q i (y) - y coordinates of random EC point. LSB{Q i (x)} - LSB of x coordinates of eight consecutive random EC point. LSB{Q i (y)} - LSB of y coordinates of eight consecutive random EC point. MSB{Q i (x)} - MSB of x coordinates of eight consecutive random EC point. MSB{Q i (y)} - MSB of y coordinates of eight consecutive random EC point. Here, the secret key stream is tailored after encryption of each pixel of the plain image and for each cipher image, the key file parameters are also changed. The key file parameters are also encrypted using ECC based
15 114 technique and sent along with the cipher image. The discrete logarithm concept is applied to recover the value of key file parameters. This also increases the security of the proposed EC based stream cipher. The software implementation of the EC based key generation for stream cipher is done using Java. The input image and respective cipher images are shown in Figure 6.3. The corresponding histograms are shown in Figure 6.4. Figure 6.3 Input and cipher images of bmp lena image Figure 6.4 Histograms of input and cipher images of lena image
16 115 Table 6.3 lists the values of entropy and correlation between two adjacent pixels. Computations for the plain and cipher images are carried out using the procedure given in equation ( ). The encryption time taken by method 2 of the proposed stream cipher is 2620 ms. The selection of the methods in Table 6.2 is of arbitrary choice and only the key size decides the complexity of the encryption algorithm. From this, it is observed that the proposed stream cipher can be efficiently used in real time multimedia and wireless applications because it has simple structure and generates a key stream faster than other generators. 6.6 SECURITY ANALYSIS Application of computing power to encryption schemes is a potential area of research. A good encryption scheme is the need of the hour against the background of multi-nationalism. Globalization has opened up frontiers, but cryptography has become more essential in the modern times. A good encryption scheme should be insulated against possible attacks. An analysis of encryption schemes such as key space analysis, statistical analysis, correlation analysis and key sensitivity analysis ensures right development of the security system Key Space Analysis The key space that is being used for encryption must be large enough to prevent the brute force attackers to intrude. For, the proposed EC based stream cipher has a flexible, moderately large key space, which comprises number of stages of LFSR over GF(p), initial values of LFSR, feedback coefficients, possible elliptic curves and the base point. Hence for
17 116 this image encryption, this large key space is sufficient which is immune to all kinds of brute force attacks Statistical Analysis Statistical analysis generally depends on the measure of the randomness of the cipher image. Also, it works on the relative frequency of the occurred cipher image. It is eminent that a lot of ciphers have been successfully analyzed with the help of statistical analysis and numerous statistical attacks have been formulated on them. Hence, a perfect cipher should be vigorous against any statistical attack. The following aspects related to statistical attack are considered in this work Histograms To prevent the leakage of information to an adversary, it is important to ensure that cipher image does not have any statistical resemblance to the input image. An image histogram shows how pixels in an image are distributed by plotting the number of pixels at each intensity level. In this work, the histograms are plotted for input and cipher images as shown in Figure 6.4. The histogram of the input image has large spikes. But, the histogram of the cipher image is nearly smooth and uniform, representing almost equivalent probability of occurrence of each intensity level. They are considerably different and tolerate no statistical similarity to the input image. Hence, this does not give any hint to use any statistical attack on the proposed stream cipher.
18 Entropy The recital of the encryption algorithms is measured by computing entropy of the input and the cipher images and then comparing them. Entropy is defined to express the measure of uncertainty. The entropy E m of the image is calculated as: E m P( i) log 2 (6.2) P( i) i 0 where P ( i) Number of occurrence of a pixel Total number of pixel in the image Table 6.3 Entropy and correlation of plain and cipher image Image Entropy Adjacent Pixels Correlation Coefficient Vertical Horizontal Diagonal Plain image Cipher image e Table 6.3 gives the values of entropy calculated for the input and the cipher images as stated by the formula specified in equation (6.2). The entropy of the input image is It can be noticed from the table that the entropy of the cipher image is extremely close to the theoretical value of 8. Therefore, the information leakage in the proposed cipher is negligible and it is secure upon the entropy attack.
19 Randomness tests The proposed key stream generator is based on the arithmetic operation of EC and the properties of LFSR. The random sequences are unpredictable and the period of the sequences is analysed theoretically. In addition, sequences produced by the proposed key stream generator have passed the Federal Information Processing Standards (FIPS) statistical tests of the Cryptographic Standards and Validation Programs (CSVP) at NIST. As a result, statistical attacks are difficult to perform in the proposed key stream generator. Based on these aspects, it is observed that the proposed stream cipher is resistant against statistical attack Correlation Analysis The correlation between two neighbouring pixels in horizontal, vertical and diagonal orientations of input and cipher image is analysed. The process is as follows: First, randomly pick M pairs of neighbouring pixels from an image. Afterwards, calculate their correlation coefficient using the following equation ( ). Here, x and y are intensity values of two neighbouring pixels in the image. 1 E( x) (6.3) M M x i i 1 i 1 2 M 1 D ( x) xi E( x) (6.4) M cov( x, y) 1 M M i 1 xi E( x) yi E( y) (6.5)
20 119 cov( x, y) r xy (6.6) D( x) D( y) To test correlation, 500 pairs of two neighbouring pixels are selected randomly from the image. Table 6.3 presents the correlation between two adjacent pixels for the plain and cipher images. It is observed that the two neighbouring pixels in the input image are highly correlated, while there is a negligibly less correlation between the two neighbouring pixels in the cipher image Key Sensitivity Analysis Even a change in a single bit of key will make a completely different cipher image for the intruders to guess the key. This makes the encryption procedure sensitive enough to the secret key. To prove the heftiness of the proposed cipher, key sensitivity analysis is performed with the following procedure. (a) Input image (b) Cipher image 1 Figure 6.5 Key sensitivity test (c) Cipher image 2 First, the input image in Figure 6.5(a) is encrypted by using the secret key that is the initial values of LFSR as (14, -940, 1082, 1076) and the cipher image 1 as shown in Figure 6.5(b). Then the initial values of LFSR is changed to (14, -940, 1082, 1077) and the cipher image 2 as shown in
21 120 Figure 6.5(c). Finally, the two cipher images are compared. It is not easy to compare the cipher images by simply observing these images. Thus for comparison, correlation between the matching pixels of the two cipher images is calculated. Table 6.4 Entropy and correlation between two cipher images Image Entropy Adjacent Pixels Correlation Coefficient Vertical Horizontal Diagonal Cipher image e Cipher image The results of the correlation coefficients between the matching pixels of the two cipher images using method 2 are given in Table 6.4. It is clear that no correlation exists among cipher images corresponding to small change in the key Algebraic Attack Algebraic attack is a technique of cryptanalysis against a cipher. If the key stream is linearly narrated even if the period is large, by knowing a small section of key stream, it is likely to make a set of linear simultaneous equations and solve for the entire key stream. In the case of random sequence of EC points, the key stream is nonlinearly related. Therefore, it may not be probable to make finite number of proper equations whose solution finally escorts to knowledge of entire sequence. Therefore, the nonlinear key stream
22 121 makes the relation between input and cipher image nonlinear and provides resistance against algebraic type attack. From the above analysis, it is concluded that the proposed EC based stream cipher is secure against brute force, statistical, correlation, key sensitivity and algebraic attacks. 6.7 SUMMARY In this chapter, EC based key generation for stream cipher is proposed. The key streams are generated based on the combination of LFSR and cyclic EC over a finite prime field. In this work, ( ) bmp standard test image of lena that has the size of 148 KB is considered as an example. The input image and the respective cipher image histograms are conversed. It is seen that cipher image does not have residual information and the histogram is nearly smooth and uniform, offering good security for images. The entropy and the correlation between two neighbouring pixels for the input and cipher images are computed and analysed. The proposed scheme key space is sufficient to resist all sorts of brute force attacks. Hence, the proposed EC based image encryption algorithm is protected against brute force, statistical, correlation, key sensitivity and algebraic attacks. For the proposed cipher, the secret key stream is altered after encryption of each pixel of the plain image and for each cipher image, the key file parameters are also changed. The key file parameters are also encrypted using ECC based technique and sent along with the cipher image. It is difficult for an adversary to determine the key file parameters since the ECDLP is considered difficult. These factors are used to enhance the security of the proposed EC based stream cipher. The encryption time required for the
23 122 proposed scheme is estimated. It can be scrutinized that the proposed EC based stream cipher can be a potential candidate for real time multimedia applications.
This chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest
1 2 3 This chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest PKCS, Diffie- Hellman key exchange. This first published
More informationSyrvey on block ciphers
Syrvey on block ciphers Anna Rimoldi Department of Mathematics - University of Trento BunnyTn 2012 A. Rimoldi (Univ. Trento) Survey on block ciphers 12 March 2012 1 / 21 Symmetric Key Cryptosystem M-Source
More informationA Combined Encryption Compression Scheme Using Chaotic Maps
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 2 Sofia 2013 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0016 A Combined Encryption Compression
More informationCryptography BITS F463 S.K. Sahay
Cryptography BITS F463 S.K. Sahay BITS-Pilani, K.K. Birla Goa Campus, Goa S.K. Sahay Cryptography 1 Terminology Cryptography: science of secret writing with the goal of hiding the meaning of a message.
More informationECC Elliptic Curve Cryptography. Foundations of Cryptography - ECC pp. 1 / 31
ECC Elliptic Curve Cryptography Foundations of Cryptography - ECC pp. 1 / 31 Elliptic Curve an elliptic curve E is a smooth, projective, algebraic curve defined by the following equation: y 2 3 2 a xy
More informationInformation Security CS526
Information Security CS 526 Topic 3 Cryptography: One-time Pad, Information Theoretic Security, and Stream CIphers 1 Announcements HW1 is out, due on Sept 11 Start early, late policy is 3 total late days
More informationBasic principles of pseudo-random number generators
Basic principles of pseudo-random number generators Faculty of Informatics, Masaryk University Outline PRNGs True-randomness and pseudo-randomness Linear feedback shift registers Cryptographically secure
More informationThe most important development from the work on public-key cryptography is the digital signature. Message authentication protects two parties who
1 The most important development from the work on public-key cryptography is the digital signature. Message authentication protects two parties who exchange messages from any third party. However, it does
More informationResearch Article International Journals of Advanced Research in Computer Science and Software Engineering ISSN: X (Volume-7, Issue-6)
International Journals of Advanced Research in Computer Science and Software Engineering ISS: 2277-128X (Volume-7, Issue-6) Research Article June 2017 Image Encryption Based on 2D Baker Map and 1D Logistic
More informationChapter 3 Traditional Symmetric-Key Ciphers 3.1
Chapter 3 Traditional Symmetric-Key Ciphers 3.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Objectives To define the terms and the concepts of symmetric
More information3 Symmetric Key Cryptography 3.1 Block Ciphers Symmetric key strength analysis Electronic Code Book Mode (ECB) Cipher Block Chaining Mode (CBC) Some
3 Symmetric Key Cryptography 3.1 Block Ciphers Symmetric key strength analysis Electronic Code Book Mode (ECB) Cipher Block Chaining Mode (CBC) Some popular block ciphers Triple DES Advanced Encryption
More informationStream Ciphers An Overview
Stream Ciphers An Overview Palash Sarkar Indian Statistical Institute, Kolkata email: palash@isicalacin stream cipher overview, Palash Sarkar p1/51 Classical Encryption Adversary message ciphertext ciphertext
More informationIssues in Information Systems Volume 18, Issue 2, pp , 2017
IMPLEMENTING ELLIPTIC CURVE CRYPTOGRAPHY USING MICROSOFT EXCEL Abhijit Sen, Kwantlen Polytechnic University, abhijit.sen@kpu.ca ABSTRACT Microsoft Excel offers a number of data manipulation tools that
More informationComputer Security 3/23/18
s s encrypt a block of plaintext at a time and produce ciphertext Computer Security 08. Cryptography Part II Paul Krzyzanowski DES & AES are two popular block ciphers DES: 64 bit blocks AES: 128 bit blocks
More informationComputer Security: Principles and Practice
Computer Security: Principles and Practice Chapter 2 Cryptographic Tools First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Cryptographic Tools cryptographic algorithms
More informationAbhijith Chandrashekar and Dushyant Maheshwary
By Abhijith Chandrashekar and Dushyant Maheshwary Introduction What are Elliptic Curves? Curve with standard form y 2 = x 3 + ax + b a, b ϵ R Characteristics of Elliptic Curve Forms an abelian group Symmetric
More informationIntroduction. CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell
Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell 1 Cryptography Merriam-Webster Online Dictionary: 1. secret writing 2. the enciphering and deciphering
More informationCryptographic Concepts
Outline Identify the different types of cryptography Learn about current cryptographic methods Chapter #23: Cryptography Understand how cryptography is applied for security Given a scenario, utilize general
More informationComputer Security. 08. Cryptography Part II. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08. Cryptography Part II Paul Krzyzanowski Rutgers University Spring 2018 March 23, 2018 CS 419 2018 Paul Krzyzanowski 1 Block ciphers Block ciphers encrypt a block of plaintext at a
More informationInformation Security CS526
Information CS 526 Topic 3 Ciphers and Cipher : Stream Ciphers, Block Ciphers, Perfect Secrecy, and IND-CPA 1 Announcements HW1 is out, due on Sept 10 Start early, late policy is 3 total late days for
More informationSecurity+ Guide to Network Security Fundamentals, Third Edition. Chapter 11 Basic Cryptography
Security+ Guide to Network Security Fundamentals, Third Edition Chapter 11 Basic Cryptography Objectives Define cryptography Describe hashing List the basic symmetric cryptographic algorithms 2 Objectives
More informationLecture 2. Cryptography: History + Simple Encryption,Methods & Preliminaries. Cryptography can be used at different levels
Lecture 2 Cryptography: History + Simple Encryption,Methods & Preliminaries 1 Cryptography can be used at different levels algorithms: encryption, signatures, hashing, RNG protocols (2 or more parties):
More informationImproved ELGAMAL Encryption for Elliptic Curve Cryptography
Volume 118 No. 17 2018, 341-353 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Improved ELGAMAL Encryption for Elliptic Curve Cryptography Dr. C.R.
More informationFPGA Implementation of WG Stream Cipher
FPGA Implementation of WG Stream Cipher Anna Johnson Assistant Professor,ECE Department, Jyothi Engineering College,Thrissur Abstract Cryptography is the technique of providing security to a network. The
More informationCryptography MIS
Cryptography MIS-5903 http://community.mis.temple.edu/mis5903sec011s17/ Cryptography History Substitution Monoalphabetic Polyalphabetic (uses multiple alphabets) uses Vigenere Table Scytale cipher (message
More informationComputer Security CS 526
Computer Security CS 526 Topic 4 Cryptography: Semantic Security, Block Ciphers and Encryption Modes CS555 Topic 4 1 Readings for This Lecture Required reading from wikipedia Block Cipher Ciphertext Indistinguishability
More informationElliptic Curve Public Key Cryptography
Why? Elliptic Curve Public Key Cryptography ECC offers greater security for a given key size. Why? Elliptic Curve Public Key Cryptography ECC offers greater security for a given key size. The smaller key
More informationStudy on data encryption technology in network information security. Jianliang Meng, Tao Wu a
nd International Workshop on Materials Engineering and Computer Sciences (IWMECS 05) Study on data encryption technology in network information security Jianliang Meng, Tao Wu a School of North China Electric
More informationA New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam Patel 3 Rakesh Patel 4
IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 08, 2014 ISSN (online): 2321-0613 A New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam
More informationAcronyms. International Organization for Standardization International Telecommunication Union ITU Telecommunication Standardization Sector
Acronyms 3DES AES AH ANSI CBC CESG CFB CMAC CRT DoS DEA DES DoS DSA DSS ECB ECC ECDSA ESP FIPS IAB IETF IP IPsec ISO ITU ITU-T Triple DES Advanced Encryption Standard Authentication Header American National
More informationSecret Key Cryptography
Secret Key Cryptography 1 Block Cipher Scheme Encrypt Plaintext block of length N Decrypt Secret key Cipher block of length N 2 Generic Block Encryption Convert a plaintext block into an encrypted block:
More informationCombine and Multilevel Implementation of Cryptographic and Data Hiding Algorithms to Provide a Hybrid Data-Security Scheme
American Scientific Research Journal for Engineering, Technology, and Sciences (ASRJETS) ISSN (Print) 2313-4410, ISSN (Online) 2313-4402 Global Society of Scientific Research and Researchers http://asrjetsjournal.org/
More informationLecture 1 Applied Cryptography (Part 1)
Lecture 1 Applied Cryptography (Part 1) Patrick P. C. Lee Tsinghua Summer Course 2010 1-1 Roadmap Introduction to Security Introduction to Cryptography Symmetric key cryptography Hash and message authentication
More informationPrime Field over Elliptic Curve Cryptography for Secured Message Transaction
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 IMPACT FACTOR: 5.258 IJCSMC,
More informationAnalysis, demands, and properties of pseudorandom number generators
Analysis, demands, and properties of pseudorandom number generators Jan Krhovják Department of Computer Systems and Communications Faculty of Informatics, Masaryk University Brno, Czech Republic Jan Krhovják
More informationANALYSIS OF AES ENCRYPTION WITH ECC
ANALYSIS OF AES ENCRYPTION WITH ECC Samiksha Sharma Department of Computer Science & Engineering, DAV Institute of Engineering and Technology, Jalandhar, Punjab, India Vinay Chopra Department of Computer
More informationCryptographic Techniques. Information Technologies for IPR Protections 2003/11/12 R107, CSIE Building
Cryptographic Techniques Information Technologies for IPR Protections 2003/11/12 R107, CSIE Building Outline Data security Cryptography basics Cryptographic systems DES RSA C. H. HUANG IN CML 2 Cryptography
More informationImage Encryption Algorithm Based on. Logistic Map and Pixel Mapping Table. Hazem Al-Najjar Asem Al-Najjar
Encryption Algorithm Based on Logistic Map and Pixel Mapping Table Hazem Al-Najjar Asem Al-Najjar Encryption Algorithm Based on Logistic Map and Pixel Mapping Table Hazem Mohammad Al-Najjar Technical College
More informationData Encryption Standard (DES)
Data Encryption Standard (DES) Best-known symmetric cryptography method: DES 1973: Call for a public cryptographic algorithm standard for commercial purposes by the National Bureau of Standards Goals:
More informationCPS2323. Symmetric Ciphers: Stream Ciphers
Symmetric Ciphers: Stream Ciphers Content Stream and Block Ciphers True Random (Stream) Generators, Perfectly Secure Ciphers and the One Time Pad Cryptographically Strong Pseudo Random Generators: Practical
More informationPublished by: PIONEER RESEARCH & DEVELOPMENT GROUP (www.prdg.org) 158
Enhancing The Security Of Koblitz s Method Using Transposition Techniques For Elliptic Curve Cryptography Santoshi Pote Electronics and Communication Engineering, Asso.Professor, SNDT Women s University,
More informationNetwork Security Essentials
Network Security Essentials Applications and Standards Third Edition William Stallings Chapter 2 Symmetric Encryption and Message Confidentiality Dr. BHARGAVI H. GOSWAMI Department of Computer Science
More informationCryptography and Network Security
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 10 Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would
More informationKey Management and Distribution
CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Chapter 10 Key Management; Other Public Key Cryptosystems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan
More informationGoals for Today. Substitution Permutation Ciphers. Substitution Permutation stages. Encryption Details 8/24/2010
Encryption Details COMP620 Goals for Today Understand how some of the most common encryption algorithms operate Learn about some new potential encryption systems Substitution Permutation Ciphers A Substitution
More informationCS669 Network Security
UNIT II PUBLIC KEY ENCRYPTION Uniqueness Number Theory concepts Primality Modular Arithmetic Fermet & Euler Theorem Euclid Algorithm RSA Elliptic Curve Cryptography Diffie Hellman Key Exchange Uniqueness
More informationStream Ciphers. Çetin Kaya Koç Winter / 13
Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 13 Block Ciphers Cryptography Plaintext: M i with M i = n, where n is the block length (in bits) Ciphertext: C i with C i = m, where m n, however,
More informationGoals of Modern Cryptography
Goals of Modern Cryptography Providing information security: Data Privacy Data Integrity and Authenticity in various computational settings. Data Privacy M Alice Bob The goal is to ensure that the adversary
More informationVinita Shadangi 1, Siddharth Kumar Choudhary 1, K. Abhimanyu Kumar Patro 1 and Bibhudendra Acharya 1
N o v e l A r n o l d S c r a m b l i n g B a s e d C B C - A E S I m a g e E n c r y p t i o n Novel Arnold Scrambling Based CBC-AES Image Encryption Vinita Shadangi 1, Siddharth Kumar Choudhary 1, K.
More informationCryptographic Primitives A brief introduction. Ragesh Jaiswal CSE, IIT Delhi
Cryptographic Primitives A brief introduction Ragesh Jaiswal CSE, IIT Delhi Cryptography: Introduction Throughout most of history: Cryptography = art of secret writing Secure communication M M = D K (C)
More informationIntroduction to Cryptography and Security Mechanisms: Unit 5. Public-Key Encryption
Introduction to Cryptography and Security Mechanisms: Unit 5 Public-Key Encryption Learning Outcomes Explain the basic principles behind public-key cryptography Recognise the fundamental problems that
More informationSymmetric Encryption Algorithms
Symmetric Encryption Algorithms CS-480b Dick Steflik Text Network Security Essentials Wm. Stallings Lecture slides by Lawrie Brown Edited by Dick Steflik Symmetric Cipher Model Plaintext Encryption Algorithm
More informationUnderstanding Cryptography by Christof Paar and Jan Pelzl. Chapter 9 Elliptic Curve Cryptography
Understanding Cryptography by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 9 Elliptic Curve Cryptography ver. February 2nd, 2015 These slides were prepared by Tim Güneysu, Christof Paar
More informationKALASALINGAM UNIVERSITY
KALASALINGAM UNIVERSITY (Kalasalingam Academy of Research and Education) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CLASS NOTES CRYPTOGRAPHY AND NETWOTK SECURITY (CSE 405) Prepared by M.RAJA AP/CSE
More information2 Secure Communication in Private Key Setting
CSA E0 235: Cryptography January 11, 2016 Instructor: Arpita Patra Scribe for Lecture 2 Submitted by: Jayam Modi 1 Discrete Probability Background Probability Distribution -A probability distribution over
More informationCryptography Introduction to Computer Security. Chapter 8
Cryptography Introduction to Computer Security Chapter 8 Introduction Cryptology: science of encryption; combines cryptography and cryptanalysis Cryptography: process of making and using codes to secure
More informationImproved Attack on Full-round Grain-128
Improved Attack on Full-round Grain-128 Ximing Fu 1, and Xiaoyun Wang 1,2,3,4, and Jiazhe Chen 5, and Marc Stevens 6, and Xiaoyang Dong 2 1 Department of Computer Science and Technology, Tsinghua University,
More informationBasic Concepts and Definitions. CSC/ECE 574 Computer and Network Security. Outline
CSC/ECE 574 Computer and Network Security Topic 2. Introduction to Cryptography 1 Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More information4 Hybrid Cryptographic Algorithm
This chapter describes the MD5 hashing mechanism for general m-commerce transactions and Hybrid algorithm that combines the AES and ECC operations for the security mechanism. Part of the work is presented
More informationImage Encryption by Pixel Property Separation
Image Encryption by Pixel Property Separation Karthik Chandrashekar Iyer and Aravinda Subramanya 1 Abstract Pixels in an image are essentially constituted of two properties, position and colour. Pixel
More informationIMAGE ENCRYPTION BASED ON ARNOLD TRANSFORMATION
Gulf Journal of Mathematics Vol 4, Issue 4 (2016) 103-107 IMAGE ENCRYPTION BASED ON ARNOLD TRANSFORMATION M. ESSAID 1, A. JARJAR 2, I. AKHARRAZ 3 A. SAAIDI 4 AND A. MOUHIB 5 Abstract. In this paper we
More informationTraditional Symmetric-Key Ciphers. A Biswas, IT, BESU Shibpur
Traditional Symmetric-Key Ciphers A Biswas, IT, BESU Shibpur General idea of symmetric-key cipher The original message from Alice to Bob is called plaintext; the message that is sent through the channel
More informationChapter 6. Stream Cipher Design
Chapter 6. Stream Cipher Design 1 Model for Secure Communications and Attacks 2 Shannon's Theory on Perfect Secrecy and Product Cryptosystems (self reading, Stinson s book, or Chapters 1 and 2 in Stalling's
More information-3- Additionally or alternatively, the invention may comprise a method of controlling access to a digital wallet, the method comprising the steps:
-1- Secure Multiparty loss resistant Storage and Transfer of Cryptographic Keys for blockchain based systems in conjunction with a wallet management system 1 This invention relates generally to computer
More informationMPEG-2 and ECC Security in DCT Domain
MPEG-2 and ECC Security in DCT Domain Samia Bouaziz, Ramzi Hadaji and Abdellatif Mtibaa National School of Engineering of Monastir, Skannes 5000, Monastir, Tunisia. Abstract In this paper we give a new
More informationNonce Based Elliptic Curve Cryptosystem for Text and Image Applications
International Journal of Network Security, Vol.14, No.4, PP.236-242, July 2012 236 Nonce Based Elliptic Curve Cryptosystem for Text and Image Applications S. Maria Celestin Vigila 1 and K. Muneeswaran
More informationContent of this part
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Introduction to Cryptography ECE 597XX/697XX Part 5 More About Block Ciphers Israel Koren ECE597/697 Koren Part.5.1 Content of this
More informationDiffie-Hellman Protocol as a Symmetric Cryptosystem
IJCSNS International Journal of Computer Science and Network Security, VOL.18 No.7, July 2018 33 Diffie-Hellman Protocol as a Symmetric Cryptosystem Karel Burda, Brno University of Technology, Brno, Czech
More informationA Novel Image Stream Cipher Based On Dynamic Substitution
Engineering, Technology & Applied Science Research Vol. 6, No. 5, 2016, 1195-1199 1195 A Novel Image Stream Cipher Based On Dynamic Substitution Abdelfattah Elsharkawi Software Engineering, Communication
More informationLecture IV : Cryptography, Fundamentals
Lecture IV : Cryptography, Fundamentals Internet Security: Principles & Practices John K. Zao, PhD (Harvard) SMIEEE Computer Science Department, National Chiao Tung University Spring 2012 Basic Principles
More informationThe Application of Elliptic Curves Cryptography in Embedded Systems
The Application of Elliptic Curves Cryptography in Embedded Systems Wang Qingxian School of Computer Science and Engineering University of Electronic Science and Technology China Introduction to Cryptography
More informationCryptography and Network Security
Cryptography and Network Security CRYPTOGRAPHY AND NETWORK SECURITY PRAKASH C. GUPTA Former Head Department of Information Technology Maharashtra Institute of Technology Pune Delhi-110092 2015 CRYPTOGRAPHY
More informationCSCI 454/554 Computer and Network Security. Topic 2. Introduction to Cryptography
CSCI 454/554 Computer and Network Security Topic 2. Introduction to Cryptography Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationJournal of Information Engineering and Applications ISSN (print) ISSN (online) Vol 2, No.10, 2012
Abstract Encryption Quality and Performance Analysis of GKSBC Algorithm S. Arul jothi 1* Dr. M. Venkatesulu 2 1. Research Scholar, Department of Computer Applications, Kalasalingam University, Krishnankoil,
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 23 wenbing@ieee.org (Lecture notes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Introduction to
More informationKey Management and Elliptic Curves
Key Management and Elliptic Curves Key Management Distribution of ublic Keys ublic-key Distribution of Secret Keys Diffie-Hellman Key Echange Elliptic Curves Mathematical foundations Elliptic curves over
More informationEncryption Details COMP620
Encryption Details COMP620 Encryption is a powerful defensive weapon for free people. It offers a technical guarantee of privacy, regardless of who is running the government It s hard to think of a more
More informationSharing Several Secrets based on Lagrange s Interpolation formula and Cipher Feedback Mode
Int. J. Nonlinear Anal. Appl. 5 (2014) No. 2, 60-66 ISSN: 2008-6822 (electronic) http://www.ijnaa.semnan.ac.ir Sharing Several Secrets based on Lagrange s Interpolation formula and Cipher Feedback Mode
More informationCryptography and Network Security Chapter 10. Fourth Edition by William Stallings
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Chapter 10 Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture out of the
More informationCSC 474/574 Information Systems Security
CSC 474/574 Information Systems Security Topic 2.5 Public Key Algorithms CSC 474/574 Dr. Peng Ning 1 Public Key Algorithms Public key algorithms covered in this class RSA: encryption and digital signature
More informationParallelizing Cryptography. Gordon Werner Samantha Kenyon
Parallelizing Cryptography Gordon Werner Samantha Kenyon Outline Security requirements Cryptographic Primitives Block Cipher Parallelization of current Standards AES RSA Elliptic Curve Cryptographic Attacks
More informationOutline. Cryptography. Encryption/Decryption. Basic Concepts and Definitions. Cryptography vs. Steganography. Cryptography: the art of secret writing
Outline CSCI 454/554 Computer and Network Security Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues Topic 2. Introduction to Cryptography 2 Cryptography Basic Concepts
More informationDataTraveler 5000 (DT5000) and DataTraveler 6000 (DT6000) Ultimate Security in a USB Flash Drive. Submitted by SPYRUS, Inc.
Submitted by SPYRUS, Inc. Contents DT5000 and DT6000 Technology Overview...2 Why DT5000 and DT6000 Encryption Is Different...3 Why DT5000 and DT6000 Encryption Is Different - Summary...4 XTS-AES Sector-Based
More informationElliptic Curve Cryptography
Elliptic Curve Cryptography Dimitri Dimoulakis, Steve Jones, and Lee Haughton May 05 2000 Abstract. Elliptic curves can provide methods of encryption that, in some cases, are faster and use smaller keys
More informationContent of this part
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Introduction to Cryptography ECE 597XX/697XX Part 4 The Advanced Encryption Standard (AES) Israel Koren ECE597/697 Koren Part.4.1
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Michael J. Fischer Lecture 4 September 11, 2017 CPSC 467, Lecture 4 1/23 Analyzing Confidentiality of Cryptosystems Secret ballot elections Information protection Adversaries
More informationStream Ciphers. Koç ( ucsb ccs 130h explore crypto fall / 13
Stream Ciphers Çetin Kaya Koç http://cs.ucsb.edu/~koc koc@cs.ucsb.edu Koç (http://cs.ucsb.edu/~koc) ucsb ccs 130h explore crypto fall 2014 1 / 13 Block Ciphers Plaintext: M i with M i = n, where n is the
More informationAdvanced WG and MOWG Stream Cipher with Secured Initial vector
International Journal of Scientific and Research Publications, Volume 5, Issue 12, December 2015 471 Advanced WG and MOWG Stream Cipher with Secured Initial vector Dijomol Alias Pursuing M.Tech in VLSI
More informationDistributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015
Distributed Systems 26. Cryptographic Systems: An Introduction Paul Krzyzanowski Rutgers University Fall 2015 1 Cryptography Security Cryptography may be a component of a secure system Adding cryptography
More informationA New Attack with Side Channel Leakage during Exponent Recoding Computations
A New Attack with Side Channel Leakage during Exponent Recoding Computations Yasuyuki Sakai 1 and Kouichi Sakurai 2 1 Mitsubishi Electric Corporation, 5-1-1 Ofuna, Kamakura, Kanagawa 247-8501, Japan ysakai@iss.isl.melco.co.jp
More informationpage 1 Introduction to Cryptography Benny Pinkas Lecture 3 November 18, 2008 Introduction to Cryptography, Benny Pinkas
Introduction to Cryptography Lecture 3 Benny Pinkas page 1 1 Pseudo-random generator Pseudo-random generator seed output s G G(s) (random, s =n) Deterministic function of s, publicly known G(s) = 2n Distinguisher
More informationClassical Encryption Techniques
Encryption CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L02, Steve/Courses/2011/S2/CSS322/Lectures/classical.tex,
More informationn-bit Output Feedback
n-bit Output Feedback Cryptography IV Encrypt Encrypt Encrypt P 1 P 2 P 3 C 1 C 2 C 3 Steven M. Bellovin September 16, 2006 1 Properties of Output Feedback Mode No error propagation Active attacker can
More informationP2_L6 Symmetric Encryption Page 1
P2_L6 Symmetric Encryption Page 1 Reference: Computer Security by Stallings and Brown, Chapter 20 Symmetric encryption algorithms are typically block ciphers that take thick size input. In this lesson,
More informationPublic Key Cryptography
Public Key Cryptography Giuseppe F. Italiano Universita` di Roma Tor Vergata italiano@disp.uniroma2.it Motivation Until early 70s, cryptography was mostly owned by government and military Symmetric cryptography
More informationPrinciples of Information Security, Fourth Edition. Chapter 8 Cryptography
Principles of Information Security, Fourth Edition Chapter 8 Cryptography Learning Objectives Upon completion of this material, you should be able to: Chronicle the most significant events and discoveries
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Public Key Cryptography Modular Arithmetic RSA
More informationOutline. Data Encryption Standard. Symmetric-Key Algorithms. Lecture 4
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 4 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org Outline Review
More informationStream ciphers. Lecturers: Mark D. Ryan and David Galindo. Cryptography Slide: 91
Stream ciphers Lecturers: Mark D. Ryan and David Galindo. Cryptography 2017. Slide: 91 Lecturers: Mark D. Ryan and David Galindo. Cryptography 2017. Slide: 92 Stream Cipher Suppose you want to encrypt
More informationClassical Cryptography
Classical Cryptography Chester Rebeiro IIT Madras STINSON : chapter 1 Ciphers Symmetric Algorithms Encryption and Decryption use the same key i.e. K E = K D Examples: Block Ciphers : DES, AES, PRESENT,
More information