Results 1 
2 of
2
The Quadratic Sieve Factoring Algorithm
, 2001
"... Mathematicians have been attempting to find better and faster ways to factor composite numbers since the beginning of time. Initially this involved dividing a number by larger and larger primes until you had the factorization. This trial division was not improved upon until Fermat applied the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Mathematicians have been attempting to find better and faster ways to factor composite numbers since the beginning of time. Initially this involved dividing a number by larger and larger primes until you had the factorization. This trial division was not improved upon until Fermat applied the
unknown title
"... Abstract — every character is represented as a number, which is either odd or even; they are to be encrypted differently. This paper describes how such an oddeven based encryption is applied, and how this approach makes a Cryptanalyst’s job much tougher. Index Terms — complexity, cryptography, numb ..."
Abstract
 Add to MetaCart
Abstract — every character is represented as a number, which is either odd or even; they are to be encrypted differently. This paper describes how such an oddeven based encryption is applied, and how this approach makes a Cryptanalyst’s job much tougher. Index Terms — complexity, cryptography, number theory, substitution