home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!wupost!gumby!yale!cs.yale.edu!news-mail-gateway!daemon
- From: WHMurray@DOCKMASTER.NCSC.MIL
- Subject: Factoring Large Primes,
- Message-ID: <921120035959.191409@DOCKMASTER.NCSC.MIL>
- Sender: WHMurray.ISSA@DOCKMASTER.NCSC.MIL
- Organization: Yale CS Mail/News Gateway
- Date: Fri, 20 Nov 1992 03:59:00 GMT
- Lines: 25
-
-
- >2.) I am playing around with understanding RSA. Pretty simple.
- > (IMHO someone, someday, will find a fast way to factor huge primes)
-
- I already know how to factor huge primes. Factoring huge primes is
- trivial. By definition, primes no matter how large, only have two
- factors. I even know, by definition, what the factors are. It is
- factoring other large numbers that is difficult. It is particularly
- difficult if the large numbers only have a limited number of factors.
-
- Indeed, the community is already good at factoring the product of large
- primes. However, it is very expensive. The difficulty is a function of
- the size of the number. It is not important that it always be as difficult
- as it is today. It is only important that we know how expensive it is.
-
- If you are suggesting that we will ever have a method of factoring the
- product of large primes that is independent of the size of the number,
- that is a question of a different order. It belongs on the same list as
- the question of whether we will ever be able to travel faster than light.
- In both cases, the available evidence is against it, but we can always
- hope.
-
- William Hugh Murray, Executive Consultant, Information System Security
- 49 Locust Avenue, Suite 104; New Canaan, Connecticut 06840
- 1-0-ATT-0-700-WMURRAY; WHMurray at DOCKMASTER.NCSC.MIL
-