PRESENTATION ON

Speeding up secure
web transactions
using
“Elliptical Curve Cryptography”
Project Associates:

1) Brijnandan Singh Chauhan

2) Rahul Kumar
3) Kumar Ashish
EXISTING SYSTEM : RSA
 Generate two large random primes, P and Q, of
approximately equal size such that p<>q.
 Compute N = P x Q
 Compute Z = (P-1) x (Q-1).
 Choose an integer E, 1 < E < Z, such that GCD (E, Z) = 1
 Compute the secret exponent D, such that E x D (mod Z)=1
 The public key is (N, E) and the private key is (N, D).
 Encryption :
Plaintext M <n
Ciphertext C=Me (mod N)
 Decryption
Cipertext C
PlainText M=Cd (mod N)
Existing System

 RSA : The integer factorisation process (IFP) is used in RSA, to

obtain the 2 prime factors, of the modulus number, N, a public
key. If p and q are two large random primes, then N= p*q. The
factors, p, and q, are sufficiently dispersed, eg: they should
not be twin primes, eg: (p, p+2), eg (5, 7), (11, 13), or other
close (p, p+2n) combinations, eg: (7, 11), or (5, 13) which are
sufficiently close so that guessing one, can easily lead to the
other). Above are easy, to guess such as by first obtaining the
square root of m=sqrt(N), and then scanning for primes
around this region. While N is publicly known, the difficulty or
security of the RSA lies in an intruder able to correctly guess
the prime factors, p and q, by any intelligent or trial and error
means.
DRAWBACKS

 Provides high level of security with larger

keys only.
 Memory wastage(due to larger keys).
 Power consumption is more as larger chips
are required to store a larger key.
 More power consumption leads to producing
heat in hardware system.
 Easy intrusion (as compared to ECC).
Proposed System

 Elliptic curves are also used in several integer factorization

algorithms that have applications in cryptography, such as
Lenstra elliptic curve factorization. Public-key cryptography is
based on the intractability of certain mathematical problems.
Early public-key systems, such as the RSA algorithm, are secure
assuming that it is difficult to factor a large integer composed of
two or more large prime factors. For elliptic-curve-based
protocols, it is assumed that finding the discrete logarithm of a
random elliptic curve element with respect to a publicly-known
base point is infeasible. The size of the elliptic curve determines
the difficulty of the problem. It is believed that the same level of
security afforded by an RSA-based system with a large modulus
can be achieved with a much smaller elliptic curve group. Using a
small group reduces storage and transmission requirements.
Elliptic curve cryptography (ECC) is an approach to public-key
cryptography based on the algebraic structure of elliptic curves over finite
fields.

 Elliptic curves are also used in several integer factorization

algorithms that have applications in cryptography, such as
Lenstra elliptic curve factorization. Public-key cryptography
is based on the intractability of certain mathematical
problems. Early public-key systems, such as the RSA
algorithm, are secure assuming that it is difficult to factor a
large integer composed of two or more large prime factors.
 Elliptic Curves belong to a general class of curves, called
Hyperelliptic curves, of which elliptic curves is a special case,
with genus, g=1. Hyperelliptic curves were initially
candidates, to the next progression, or generalizations, to
more secure systems.
 For elliptic-curve-based protocols, it is assumed that finding the
discrete logarithm of a random elliptic curve element with
respect to a publicly-known base point is infeasible. The size of
the elliptic curve determines the difficulty of the problem. It is
believed that the same level of security afforded by an RSA-
based system with a large modulus can be achieved with a much
smaller elliptic curve group. Using a small group reduces storage
and transmission requirements.
Elliptic Curve Cryptography (ECC) is a newer approach, with
a novelty of low key size for the user, and hard exponential
time challenge for an intruder to break into the system. In
ECC a 160 bits key, provides the same security as RSA 1024
bits key, thus lower computer power is required. The
advantage of elliptic curve cryptosystems is the absence of
subexponential time algorithms, for attack.
 ECC- A set of algorithms for key generation,
encryption and decryption (public key
encryption technique)
 ECC was introduced by Victor Miller and Neal
Koblitz in 1985
 Good alternative to other asymmetric
cryptography algorithms
 Greater security for a given key size
 Smaller key size= more compact
implementations
 Is related to discrete logarithm cryptography
 Asymmetric cryptographic systems use
• functions whose inverse is difficult to
calculate.
Ex: RSA-factoring very large numbers,
DiffieHelman Key exchange- discrete log
problem
Difficulty of forward and inverse operation against key
length
 What is ECC?
 Elliptic curve is defined by the equation
y2=x3+ax+b

Elliptic
curve
 Smaller ECC keys implies – cryptographic
operations in fewer processor cycles, faster
operations, less power consumed, lower
memory demands
 Ideal for portable devices
 Few cases wherein elliptical curve discrete
logarithm problem becomes vulnerable to
subexponential techniques.
ADVANTAGES

 Higher level of security with smaller keys.

 Reduces computation overhead and memory
usage.
 The smaller key size also makes possible much
more compact implementations for a given level
of security.
 faster cryptographic operations, running on
smaller chips or more compact software. This
means less heat production and less power
consumption.
HARDWARE SPECIFICATIONS

 Processor : Any Processor above 500 MHz.

 Ram : 128Mb.
 Hard Disk : 10 GB.
 Input device : Standard Keyboard and
Mouse.
 Output device : VGA and High Resolution
Monitor.
SOFTWARE SPECIFICATION

 Operating System : Windows Family.

 Pages developed using : Java Server Pages
and HTML.
 Techniques : Apache Tomcat Web
Server 5.0, JDK 1.5 or higher
 Web Browser : Microsoft Internet
Explorer.
 Data Bases : Oracle 10g
 Client Side Scripting : Java Script