Re: JSH: Composite factorization coupling


"hagman" <google@xxxxxxxxxxxxx> wrote in message
news:1182538557.521622.55760@xxxxxxxxxxxxxxxxxxxxxxxxx
om...
On 21 Jun., 20:17, "Hopeness" <nos...@xxxxxxxxxx>
wrote:
<jst...@xxxxxxxxx> wrote in message
factorizations without trouble, but seem to bog
down if you do two
things:

1. Get two very large primes, and multiply them
together.

that is not factoring, but multiplication,
Constipated



2. Try to factor them.

"Try" ?

Don't be too harsh on him this time when (at this
tiny point)
he is quite correct.
Cryptography (internet security, banking, the
Pentagon) depends
partially on the fact that Adam can easily multiply
big primes
that Eve practovcally cannot factor apart again
(without
knowledge of the primes e.g. via rubber hose
cryptography).
So, yes, computers usually "bog down" when they are
given the
task of factoring a (not too carelessly chosen)
product of
primes.
Of course they bog down even more if they use his
method...


you are quite correct. JSH is correct in stating
"Try to factor them".

Big primes is one thing, but there are other ways,
USA Military have some
that are impossible to break, in several lifetimes.


hacking and succesful crime are more than just factoring...
.

Relevant Pages

  • Re: prime numbers?
    ... When talking about primes in reference to cryptography, ... are used when generating the public and private keys. ... Exclusive dedication to necessitious chores without interludes of ...
    (comp.security.misc)
  • Re: Bug in Sun compiler WS6U2? - Crashes during compile phase with-fast.
    ... >> Now if someone can find a fast way of factoring large prime numbers, ... I know you can't factor primes - by definition. ... course is that if there was found a way of factorising large composite ... it would be the end of cryptography. ...
    (comp.unix.solaris)
  • Re: Bug in Sun compiler WS6U2? - Crashes during compile phase with-fast.
    ... >> be a bad thing for cryptography as we know it. ... > primes virtually instantly. ... the only way to do this is to just brute force it ... to skip about 75% of the brute force divisions, ...
    (comp.unix.solaris)
  • Question from an intelligent (?) layman
    ... I understand that one element of cryptography is to publish a large ... number that is the product of two primes. ... this wrong or am I missing something? ... Al Rosenfield ...
    (sci.crypt)
  • Question from an intelligent (?) layman
    ... I understand that one element of cryptography is to publish a large ... number that is the product of two primes. ... this wrong or am I missing something? ... Al Rosenfield ...
    (sci.crypt)