crypto finaale.ppt
-
Upload
chandni-bathla -
Category
Documents
-
view
231 -
download
0
Transcript of crypto finaale.ppt
-
8/10/2019 crypto finaale.ppt
1/31
A
PRESENTATION ON
CRYPTOGRA
PHY AND
ENCRYPTION
-
8/10/2019 crypto finaale.ppt
2/31
CRYPTO
GRAPHY
CRYPTOGRAPHY
The word CRYPTOGRAPHY is derived from Greek word,
kryptos,
which means "hidden, secret"; and , grph,meaning "I
write.It may be defined as the practice and study of hiding
information.
-
8/10/2019 crypto finaale.ppt
3/31
Terminology
Cryptology:All-inclusive term used for the study of securecommunication over non-secure channels and relatedproblems.
Cryptography: The process of designing systems to realize
secure communications over non-secure channels.
Cryptoanalysis: The discipline of breaking the cryptographicsystems.
Coding Theory: Deals with representing the informationusing codes. It covers: compression, secrecy, and error-correction.
Recently, it is predominantly associated with error-correcting
codes which ensures the correct transmissions over noisy-channels.
-
8/10/2019 crypto finaale.ppt
4/31
The Aspects of Cryptography
Modern cryptography heavily depends on mathematicsand
the usage of digital systems.
It is a inter-disciplinary study of basically three fields:MathematicsComputer ScienceElectrical Engineering
Without having a complete understanding of
cryptoanalysis(or cryptoanalytic techniques) it isimpossible to design good(secure, unbreakable)cryptographic systems.
It makes use of other disciplines such as error-
correcting codes compression.
-
8/10/2019 crypto finaale.ppt
5/31
Overview of Cryptography
People want and need privacy and security whilecommunicating
In the past, cryptography was heavily used formilitary applications to keep sensitive information
secret from enemies (adversaries).Eg: Julius Caesar used a simple shift cipher to
communicate with his generals in the battlefield.
Nowadays, with the technological progress, our
dependency on electronic systems has increasedso we need more sophisticated techniques.
Cryptography provides most of the methods andtechniques for a secure communication.
-
8/10/2019 crypto finaale.ppt
6/31
Cryptographic process
-
8/10/2019 crypto finaale.ppt
7/31
Cryptographic Methods
7
Symmetr ic
Same key for encryption and decryption
Key distribution problem
Asymmetr ic Mathematically related key pairs for encryption and
decryption
Public and private keys
Hybr id Combines strengths of both methods
Asymmetric distributes symmetric key
Symmetric provides bulk encryption
-
8/10/2019 crypto finaale.ppt
8/31
Encryption
Encryption is a process in which the senderencrypts/scrambles the message in such a waythat only the recipient will be able to decrypt/
descramble the message. Encryption is the conversion of data into a
form, called a cipher text, that cannot be easilyunderstood by unauthorized people.
Decryption is the process of convertingencrypted data back into its original form, so itcan be understood.
Encryption/decryption is especially important in
wireless communications.
-
8/10/2019 crypto finaale.ppt
9/31
Private-Key Cryptography
traditional private/secret/single keycryptographyuses onekey
shared by both sender and receiver
if this key is disclosed communications are
compromised also is symmetric, parties are equal
hence does not protect sender from receiverforging a message & claiming is sent by sender
-
8/10/2019 crypto finaale.ppt
10/31
How it works????
-
8/10/2019 crypto finaale.ppt
11/31
Problems
Key distribution is an awkward process.
Key distribution for multiple keys can be an
hassle.
-
8/10/2019 crypto finaale.ppt
12/31
Types
Stream ciphers
Stream ciphers operate on a single bit (byte orcomputer word) at a time and implement some form offeedback mechanism so that the key is constantly
changing. Block cipher
It encrypts one block of data at a time using the samekey on each block.
In general, the same plaintext block will alwaysencrypt to the same ciphertext when using the samekey in a block cipher whereas the same plaintext willencrypt to different ciphertext in a stream cipher.
-
8/10/2019 crypto finaale.ppt
13/31
Secret key cryptography algorithms
Data Encryptio n Standard (DES)
DES was designed by IBM in the 1970s and adoptedby the National Bureau of Standards (NBS) [now theNational Institute for Standards and Technology
(NIST)] in 1977 for commercial and unclassifiedgovernment applications. DES is a block-cipheremploying a 56-bit key that operates on 64-bit blocks.DES has a complex set of rules and transformations.
-
8/10/2019 crypto finaale.ppt
14/31
Secret key cryptography
algorithms
Variants of DES Trip le-DES (3DES):A variant of DES that employs up to
three 56-bit keys and makes three encryption/decryption
passes over the block. DESX:A variant devised by Ron Rivest. By combining
64 additional key bits to the plaintext prior to encryption,
effectively increases the keylength to 120 bits. Here, the
input plaintext is bitwise XORed with 64 bits of additionalkey material before encryption with DES and the output
is also bitwise XORed with another 64 bits of key
material.
-
8/10/2019 crypto finaale.ppt
15/31
Secret key cryptography
algorithms
Advanced Encrypt ion Standard (AES)
NIST develop a new secure cryptosystem for U.S.
government applications i.e. the Advanced Encryption
Standard. It became the official successor to DES inDecember 2001. AES uses an SKC scheme
called Rijndael, a block cipher designed by Belgian
cryptographers Joan Daemen and Vincent Rijmen.
The algorithm can use a variable block length and keylength; the latest specification allowed any
combination of keys lengths of 128, 192, or 256 bits
and blocks of length 128, 192, or 256 bits.
http://www.esat.kuleuven.ac.be/~rijmen/rijndael/index.htmlhttp://www.esat.kuleuven.ac.be/~rijmen/rijndael/index.html -
8/10/2019 crypto finaale.ppt
16/31
Secret key cryptography
algorithms
Rivest Ciphers (akaRon's Code)Named for Ron Rivest, a series of SKC algorithms.
RC1:Designed on paper but never implemented.
RC2:A 64-bit block cipher using variable-sized keys designed to replace
DES. It's code has not been made public although many companies havelicensed RC2 for use in their products.
RC3:Found to be breakable during development.
RC4:A stream cipher using variable-sized keys; it is widely used incommercial cryptography products, although it can only be exported usingkeys that are 40 bits or less in length, but keys this small can be broken
easily by criminals, amateurs and govts. RC5:A block-cipher supporting a variety of block sizes, key sizes, and
number of encryption passes over the data.
RC6:An improvement over RC5, RC6 was one of the AES Round 2algorithms.
-
8/10/2019 crypto finaale.ppt
17/31
Secret key cryptography
algorithms
Internat ional Data Encrypt ion A lgo ri thm
(IDEA)
Secret-key cryptosystem written by Xuejia Lai
and James Massey, in 1992 and patented byAscom. It offers strong encryption using a 128-
bit key to encrypt 64-bit blocks, which makes it
resistant to brute-force attacks.
-
8/10/2019 crypto finaale.ppt
18/31
Public-Key Cryptography
PKC depends upon the existence of so-called one-way functions, ormathematical functions that are easy to computer whereas theirinverse function is relatively difficult to compute. Here are two simpleexamples:
Multiplication vs. factorization:Suppose that I have two numbers, 9 and16, and that I want to calculate the product; it should take almost no
time to calculate the product, 144. Suppose instead that I have anumber, 144, and I need to find which pair of integers I multipliedtogether to obtain that number. I will eventually come up with thesolution but whereas calculating the product took milliseconds,factoring will take longer because it first need to find the 8 pair ofinteger factors and then determine which one is the correct pair.
Exponentiation vs. logarithms:Suppose I tell you that I want to take thenumber 3 to the 6th power; again, it is easy to calculate 36=729. But if Itell you that I have the number 729 and want you to tell me the twointegers that I used,xand yso that logx 729 = y, it will take you longerto find all possible solutions and select the pair that I used.
-
8/10/2019 crypto finaale.ppt
19/31
Public-Key Cryptography
probably most significant advance in the 3000
year history of cryptography
employs twokeys that are mathematically
relateda public & a private key
asymmetricsince parties are notequal
complements rather thanreplaces private key
crypto
-
8/10/2019 crypto finaale.ppt
20/31
How it works????
-
8/10/2019 crypto finaale.ppt
21/31
-
8/10/2019 crypto finaale.ppt
22/31
Public-Key Characteristics
Public-Key algorithms rely on two keys where:
it is computationally infeasible to find decryption key
knowing only algorithm & encryption key
it is computationally easy to en/decrypt messageswhen the relevant (en/decrypt) key is known
either of the two related keys can be used for
encryption, with the other used for decryption (for
some algorithms)
-
8/10/2019 crypto finaale.ppt
23/31
Uses of Key-pairs
To provide message confidentiality
To prove the authenticity of the message
originator.
-
8/10/2019 crypto finaale.ppt
24/31
Public-Key Applications
can classify uses into 3 categories:
encryption/decryption(provide secrecy)
digital signatures(provide authentication)
key exchange(of session keys)
some algorithms are suitable for all uses,
others are specific to one
-
8/10/2019 crypto finaale.ppt
25/31
Public key cryptography
algorithmRSAThe first, and still most common, PKC implementation, named for thethree MIT mathematicians who developed it Ronald Rivest, AdiShamir, and Leonard Adleman. RSA today is used in hundreds ofsoftware products and can be used for key exchange, digital
signatures, or encryption of small blocks of data. RSA uses a variablesize encryption block and a variable size key. The key-pair is derivedfrom a very large number, n, that is the product of two prime numberschosen according to special rules; these primes may be 100 or moredigits in length each, yielding an nwith roughly twice as many digits asthe prime factors. The public key information includes nand aderivative of one of the factors of n; an attacker cannot determine the
prime factors of n(and, therefore, the private key) from this informationalone and that is what makes the RSA algorithm so secure.Nevertheless, if a large number is created from two prime factors thatare roughly the same size, there is no known factorization algorithmthat will solve the problem in a reasonable amount of time; a 2005 testto factor a 200-digit number took 1.5 years and over 50 years ofcompute time. Regardless, one presumed protection of RSA is thatusers can easily increase the key size to always stay ahead of the
-
8/10/2019 crypto finaale.ppt
26/31
Security of Public Key Schemes
like private key schemes brute force exhaustivesearchattack is always theoretically possible
but keys used are too large (>512bits)
security relies on a large enoughdifference in
difficulty between easy(en/decrypt) and hard(cryptanalyse) problems
more generally the hardproblem is known, butis made hard enough to be impractical to break
requires the use of very large numbers
hence is slowcompared to private key schemes
-
8/10/2019 crypto finaale.ppt
27/31
Comparison b/w public and private
key cryptographies
Public keycryptography
Increased security andconvinience but less speedsometimes.
Digital signatures arefacilitated
Private keycryptography
A bit less security but speed isgenerally high
Authentication is not fullproof
-
8/10/2019 crypto finaale.ppt
28/31
PUBLIC-KEY CRYPTOGRAPHY IS
NOT MEANT TO REPLACE
SECRET-KEY CRYPTOGRAPHY,
BUT RATHER TO SUPPLEMENT
IT, TO MAKE IT MORE SECURE.
C
-
8/10/2019 crypto finaale.ppt
29/31
C
R
Y
P
T
OG
R
A
P
HY
I
NC
L
U
D
E
S
-
8/10/2019 crypto finaale.ppt
30/31
Fields of application of
cryptography
Government sector
Corporate sector
Military and other Armed Forces, etc.
Almost everyone using technology, is using
cryptography ,may be unknowingly
sometimes!!!!
-
8/10/2019 crypto finaale.ppt
31/31
THANK YOU FOR YOUR PATIENCE!!!