Factoring large composite numbers
- From: "SplinterCell" <suren.srikanthan@xxxxxxxxx>
- Date: 30 Mar 2006 17:04:59 -0800
Let us take an integer which we wish to factor: x.
Now let y = the smallest factor greater than x, where y - x is a square
number.
Let y - x = z
Then, x = (sqrt(y) - sqrt(z))(sqrt(y) + sqrt(z))
For example:
Let x = 15
Let y = 16
y - x = 1 = z
sqrt(z) = +1 or -1
x = (4 - 1)(4 + 1)
= 3 * 5
Does this hold much promise or is this a dead end?
Please be aware that I am only 15 years old, but I am extremely
interested in cryptography and factorising large numbers.
.
- Follow-Ups:
- Re: Factoring large composite numbers
- From: Unruh
- Re: Factoring large composite numbers
- From: Phil Carmody
- Re: Factoring large composite numbers
- From: Mike Amling
- In addition:
- From: SplinterCell
- Re: Factoring large composite numbers
- From: contini
- Re: Factoring large composite numbers
- Prev by Date: Re: Rotor crypto devices: if you don't have a UKW (reflector) then you need to double the number of rotors (+1 extra)...
- Next by Date: Re: Factoring large composite numbers
- Previous by thread: Integer factorization by means of the dot product of two vectors
- Next by thread: Re: Factoring large composite numbers
- Index(es):
Relevant Pages
|
