Backtracking based integer factorisation, primality testing and square root calculation

67 %
33 %
Information about Backtracking based integer factorisation, primality testing and square...
Technology

Published on February 24, 2014

Author: csandit

Source: slideshare.net

Description

Breaking a big integer into two factors is a famous problem in the field of Mathematics and
Cryptography for years. Many crypto-systems use such a big number as their key or part of a
key with the assumption - it is too big that the fastest factorisation algorithms running on the
fastest computers would take impractically long period of time to factorise. Hence, many efforts
have been provided to break those crypto-systems by finding two factors of an integer for
decades. In this paper, a new factorisation technique is proposed which is based on the concept
of backtracking. Binary bit by bit operations are performed to find two factors of a given
integer. This proposed solution can be applied in computing square root, primality test, finding
prime factors of integer numbers etc. If the proposed solution is proven to be efficient enough, it
may break the security of many crypto-systems. Implementation and performance comparison of
the technique is kept for future research.

Add a comment

Related presentations

Related pages

BACKTRACKING BASED INTEGER FACTORISATION, PRIMALITY ...

BACKTRACKING BASED INTEGER FACTORISATION, PRIMALITY TESTING ... based on the concept of backtracking ... primality testing and square root calculation ...
Read more

BACKTRACKING BASED INTEGER FACTORISATION, PRIMALITY ...

backtracking based integer factorisation, primality testing and square root calculation
Read more

Primality Testing and Integer Factorisation

Primality Testing and Integer Factorisation ... Backtracking Based Integer Factorisation, Primality Testing and Square Root Calculation.
Read more

Backtracking Based Integer Factorisation, Primality ...

Publication ยป Backtracking Based Integer Factorisation, Primality Testing and Square Root Calculation.
Read more

Turning Euler's factoring method into a factoring ...

... Turning Euler's factoring method into a factoring ... BACKTRACKING BASED INTEGER FACTORISATION, PRIMALITY TESTING AND SQUARE ROOT CALCULATION ...
Read more

Integer factorization - Wikipedia, the free encyclopedia

Can integer factorization be done in polynomial time? ... The ease of primality testing is a crucial part of the RSA algorithm, ... Integer square root;
Read more

Shanks' square forms factorization - Wikipedia, the free ...

Shanks's square forms factorization is a method for integer factorization devised by Daniel ... Factorisation and Primality Testing. ... Integer square root;
Read more

Factoring Calculator

Factoring Calculator. ... First find the square root of n and ... the square root of 18 rounded up to the nearest integer is 5; testing the values 1 ...
Read more

February 22, 2014 - CCSIT 2014 - Program Schedule

February 22, 2014: Time: Session 1 Session ... Backtracking Based Integer Factorisation, Primality Testing and Square Root Calculation Mohammed Golam ...
Read more