SYNOPSIS

TITLE-SOME FACTORIZATION ALGORITHM AND THEIR APPLICATION IN

CRYPTOGRAPHY

INTRODUCTION
Factorization algorithm has a major role in the computer security and cryptography. Most
of the widely used cryptographic algorithms like ,RAS are built on the mathematical difficulty
of factorization for big prime numbers.
When we break a number into a product of many factors of other numbers, which, when
multiplied, gives the original number, it is called factorization
In mathematics, the fundamental theorem of arithmetic, also called the unique
factorization theorem and prime factorization theorem, it states that every integer greater
than 1 can be represented uniquely as a product of prime numbers, up to the order of the
factors.
Integer factorization is known to be one of the most important and useful methods in
number theory and arithmetic. It also has a very close relationship to some algorithms in
cryptography such as RSA algorithms. The RSA cryptosystem is one of the most popular and
attractive public-key cryptosystems in the world today. Its security is based on the difficulty
of integer factorization. Solving a large and sparse linear system over GF(2) is one of the most
time consuming steps in most modern integer factorization algorithms including the fastest
one, general number field sieve algorithm.
Cryptography, or cryptology is the practice and study of techniques for secure
communication in the presence of adversarial behaviour. More generally, cryptography is
about constructing and analyzing protocols that prevent third parties or the public from
reading private messages; various aspects in information security such as data confidentiality,
data integrity, authentication, and non-repudiation are central to modern cryptography.
Modern cryptography exists at the intersection of the disciplines of mathematics, computer
science, electrical engineering, communication science, and physics.

In Cryptography the techniques which are use to protect information are obtained from
mathematical concepts and a set of rule based calculations known as algorithms to convert
messages in ways that make it hard to decode it. These algorithms are used for cryptography
key generation, digital signing, verification to protect data privacy, web browsing on internet
and to protect confidential transactions such as credit card and debit card transactions.
RSA was invented by Rivest, Shamir and Adleman in year 1978 and hence name RSA
algorithm. RSA is a public-key cryptosystem that is widely used for secure data transmission.
RSA is also one of the oldest. RSA algorithm is a public key encryption technique and is
considered as the most secure way of encryption. There are two sets of keys in RSA algorithm:
private key and public key.
 In number theory, the general number field sieve (GNFS) is the most efficient classical
algorithm known for factoring integers larger than 10100.The General Number Field Sieve
(GNFS) is the fastest known method for factoring “large” integers, where large is generally
taken to mean over 110 digits. This makes it the best algorithm for attempting to unscramble
keys in the RSA public-key cryptography system, one of the most prevalent methods for
transmitting and receiving secret data. In fact, general number field sieve was used recently
to factor a 130-digit “challenge” number published by RSA, the largest number of
cryptographic significance ever factor.

OBJECTIVE
The main objective of this thesis is to study about some modern
factorization algorithm such as Fermat’s method, Pollard Rho method, Pollard P
method, Pollard (P-1) method and general number field sieve algorithm. We are
also study some cryptosystems like RSA cryptosystem, whose security are based
on factorization. Also, we are going to discuss their application in cryptography
and our goal here is to describe the basic general number field sieve algorithm,
explaining the relevant background information and theory , which will be
needed in order to understand the various stages of general number field sieve
algorithm.

Student’s Signature Mentor’s Signature