Term Project Proposal
(ICE514 Concrete Mathematics)
Team Member (S. ID) :
Seok-Kyu, Kang(20032003)
Jeong-Kyu, Yang(20032047)

Title : Analyzing and Testing justified Prime Numbers
1. Introduction
There are number of method to make communication with each other in the real world.
Among them, there exists a lot of information exchanging which needed to be secured
from people and cryptographic techniques have been developing to meet security.
The public key cryptography, among these cryptographic methods, is starting from
the basic concept.
It is that, if there are public key (P) opening to the public and
private key (K) and a certain message (M) is encrypted into a cipher code using this
public key, somebody who only has the private key (K) can decrypt the message (M).
One of various public key cryptographies, RSA was the algorithm designed by Rivest,
Shamir, Adleman.
It is fundamentally originated from the computational problem that it
is difficult to factorize large prime numbers.
Basically, it needs two random prime
numbers in the large range and there are many algorithms introduced about that.
2. Objectives
In this project, we will understand the basic concept of a large prime number which is
needed to create keys for the public key cryptography and consider algorithms.
We
will make test tool to distinguish whether prime numbers created from the existing
algorithms is justified or not.
Our goal will finalize finding a new algorithm of generating justified prime number
which is superior to others.
3. Approach
-
Study and understand on the basic concept of generating a prime number
-
Survey and understand on the techniques of the existing algorithms
-
Survey and understand the prime number decision algorithms
-
Implementation algorithms and make test tool
-
Suggest improved a prime number algorithm
4. Schedule
Week
2th week
Objectives
Proposal submission
th
Study on the basic concept
th
4~5 week
Survey on the techniques of algorithms
7th week
Prepare and do mid presentation
2~3 week
th
8 week
Study on the prime number decision algorithms
9~11th week
Implementation algorithms and make test tool
th
12 week
th
Analyze techniques and results
13~14 week
Prepare the final report and presentation
14th week
Final report & presentation