- From: "Bill Cunningham" <nospam@xxxxxxxxx>
- Date: Sat, 02 Sep 2006 07:37:53 GMT
"Richard Heathfield" <invalid@xxxxxxxxxxxxxxx> wrote in message
Bill Cunningham said:3145650264911197945231643214546547984224475345731562440994232148583334593521
Does any of these modulos or whatever integer help against
hacking with binary logic? I would think even 256 or 512 bit encryption
could eventually be cracked and isn't that what encryption is trying to
defeat? XOR NOT NAND and these circuits would open anything.
Try it, and you'll perhaps begin to see how difficult it is.
P = (C to the power S) modulo M.
I will give you P, C, and M. If you can correctly identify S - *any* value
of S that gives the right P for the given C or M - then if this were the
nasty world of espionage you would be well on the way to cracking a secret
communication between myself and my super-secret spy boss.
I don't hold out much hope for you, but feel free to give it a try.
Do you mean binary arithmetic cannot decrypt this algorithm or that it
would take an immense amount of time to do so? So much that it wouldn't be
worth it. Several generations of computers could come and go before
- Re: modulo
- From: Richard Heathfield
- Re: modulo
- Prev by Date: Re: modulo
- Next by Date: Re: modulo
- Previous by thread: Re: modulo
- Next by thread: Re: modulo