A

PRESENTATION ON
CRYPTOGRA
PHY AND
ENCRYPTION
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.
Terminology

Cryptology: All-inclusive term used for the study of secure
communication over non-secure channels and related
problems.

Cryptography: The process of designing systems to realize
secure communications over non-secure channels.

Cryptoanalysis: The discipline of breaking the cryptographic
systems.

Coding Theory: Deals with representing the information
using 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.


The Aspects of Cryptography
Modern cryptography heavily depends on mathematics
and
the usage of digital systems.
It is a inter-disciplinary study of basically three fields:
Mathematics
Computer Science
Electrical Engineering
Without having a complete understanding of
cryptoanalysis(or cryptoanalytic techniques) it is
impossible to design good (secure, unbreakable)
cryptographic systems.
It makes use of other disciplines such as error-
correcting codes compression.
Overview of Cryptography
People want and need privacy and security while
communicating
In the past, cryptography was heavily used for
military 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 increased
so we need more sophisticated techniques.
Cryptography provides most of the methods and
techniques for a secure communication.

Cryptographic process
Cryptographic Methods
7
Symmetric
Same key for encryption and decryption
Key distribution problem
Asymmetric
Mathematically related key pairs for encryption and
decryption
Public and private keys
Hybrid
Combines strengths of both methods
Asymmetric distributes symmetric key
Symmetric provides bulk encryption

Encryption

Encryption is a process in which the sender
encrypts/scrambles the message in such a way
that 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 easily
understood by unauthorized people.
Decryption is the process of converting
encrypted data back into its original form, so it
can be understood.
Encryption/decryption is especially important in
wireless communications.



Private-Key Cryptography
traditional private/secret/single key cryptography
uses one key
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 receiver
forging a message & claiming is sent by sender
How it works????
Problems
Key distribution is an awkward process.
Key distribution for multiple keys can be an
hassle.
Types
Stream ciphers
Stream ciphers operate on a single bit (byte or
computer word) at a time and implement some form of
feedback mechanism so that the key is constantly
changing.
Block cipher
It encrypts one block of data at a time using the same
key on each block.
In general, the same plaintext block will always
encrypt to the same ciphertext when using the same
key in a block cipher whereas the same plaintext will
encrypt to different ciphertext in a stream cipher.
Secret key cryptography algorithms
Data Encryption Standard (DES)
DES was designed by IBM in the 1970s and adopted
by the National Bureau of Standards (NBS) [now the
National Institute for Standards and Technology
(NIST)] in 1977 for commercial and unclassified
government applications. DES is a block-cipher
employing a 56-bit key that operates on 64-bit blocks.
DES has a complex set of rules and transformations.
Secret key cryptography
algorithms
Variants of DES
Triple-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 additional
key material before encryption with DES and the output
is also bitwise XORed with another 64 bits of key
material.


Secret key cryptography
algorithms
Advanced Encryption 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 in
December 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 key
length; the latest specification allowed any
combination of keys lengths of 128, 192, or 256 bits
and blocks of length 128, 192, or 256 bits.
Secret key cryptography
algorithms
Rivest Ciphers (aka Ron'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 have
licensed 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 in
commercial cryptography products, although it can only be exported using
keys 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 2
algorithms.

Secret key cryptography
algorithms
International Data Encryption Algorithm
(IDEA)
Secret-key cryptosystem written by Xuejia Lai
and James Massey, in 1992 and patented by
Ascom. It offers strong encryption using a 128-
bit key to encrypt 64-bit blocks, which makes it
resistant to brute-force attacks.
Public-Key Cryptography
PKC depends upon the existence of so-called one-way functions, or
mathematical functions that are easy to computer whereas their
inverse function is relatively difficult to compute. Here are two simple
examples:
Multiplication vs. factorization: Suppose that I have two numbers, 9 and
16, and that I want to calculate the product; it should take almost no
time to calculate the product, 144. Suppose instead that I have a
number, 144, and I need to find which pair of integers I multiplied
together to obtain that number. I will eventually come up with the
solution but whereas calculating the product took milliseconds,
factoring will take longer because it first need to find the 8 pair of
integer factors and then determine which one is the correct pair.
Exponentiation vs. logarithms: Suppose I tell you that I want to take the
number 3 to the 6th power; again, it is easy to calculate 36=729. But if I
tell you that I have the number 729 and want you to tell me the two
integers that I used, x and y so that logx 729 = y, it will take you longer
to find all possible solutions and select the pair that I used.

Public-Key Cryptography
probably most significant advance in the 3000
year history of cryptography
employs two keys that are mathematically
related a public & a private key
asymmetric since parties are not equal
complements rather than replaces private key
crypto
How it works????
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 messages
when 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)


Uses of Key-pairs
To provide message confidentiality
To prove the authenticity of the message
originator.
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
Public key cryptography
algorithm
RSA
The first, and still most common, PKC implementation, named for the
three MIT mathematicians who developed it Ronald Rivest, Adi
Shamir, and Leonard Adleman. RSA today is used in hundreds of
software products and can be used for key exchange, digital
signatures, or encryption of small blocks of data. RSA uses a variable
size encryption block and a variable size key. The key-pair is derived
from a very large number, n, that is the product of two prime numbers
chosen according to special rules; these primes may be 100 or more
digits in length each, yielding an n with roughly twice as many digits as
the prime factors. The public key information includes n and a
derivative of one of the factors of n; an attacker cannot determine the
prime factors of n (and, therefore, the private key) from this information
alone and that is what makes the RSA algorithm so secure.
Nevertheless, if a large number is created from two prime factors that
are roughly the same size, there is no known factorization algorithm
that will solve the problem in a reasonable amount of time; a 2005 test
to factor a 200-digit number took 1.5 years and over 50 years of
compute time. Regardless, one presumed protection of RSA is that
users can easily increase the key size to always stay ahead of the
computer processing curve.
Security of Public Key Schemes
like private key schemes brute force exhaustive
search attack is always theoretically possible
but keys used are too large (>512bits)
security relies on a large enough difference in
difficulty between easy (en/decrypt) and hard
(cryptanalyse) problems
more generally the hard problem is known, but
is made hard enough to be impractical to break
requires the use of very large numbers
hence is slow compared to private key schemes
Comparison b/w public and private
key cryptographies
Public key
cryptography
Increased security and
convinience but less speed
sometimes.
Digital signatures are
facilitated
Private key
cryptography
A bit less security but speed is
generally high
Authentication is not fullproof
PUBLIC-KEY CRYPTOGRAPHY IS
NOT MEANT TO REPLACE
SECRET-KEY CRYPTOGRAPHY,
BUT RATHER TO SUPPLEMENT
IT, TO MAKE IT MORE SECURE.
C
R
Y
P
T
O
G
R
A
P
H
Y


I
N
C
L
U
D
E
S
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!!!!
THANK YOU FOR YOUR PATIENCE!!!