home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!sun-barr!ames!agate!linus!linus.mitre.org!faron!bs
- From: bs@faron.mitre.org (Robert D. Silverman)
- Subject: Re: PD public key system
- Message-ID: <1992Aug16.210650.27142@linus.mitre.org>
- Sender: news@linus.mitre.org (News Service)
- Nntp-Posting-Host: faron.mitre.org
- Organization: Research Computer Facility, MITRE Corporation, Bedford, MA
- References: <1992Aug15.060903.7682@dsd.es.com> <1992Aug16.174133.20172@ole.cdac.com>
- Date: Sun, 16 Aug 1992 21:06:50 GMT
- Lines: 31
-
- In article <1992Aug16.174133.20172@ole.cdac.com> ray@ole.cdac.com (Ray Berry) writes:
- :rjones@itchy.dsd.es.com (Ray Jones - Perp) writes:
- :
- :(description deleted...)
- :
- :>Any suggestions? Is it true I can't use RSA? Is there a scheme that would
- :>work for the above and that I could also distribute?
- :
- : Some time ago Next Inc. announced their intentions to use a scheme termed
- :"elliptical descent" for public key security. I'm not qualified to comment
- :on its applicability or security - perhaps others here can do so. I don't
-
- It uses the word problem for Mordell-Weil groups. i.e. it is equivalent
- to the discrete log problem over finite fields, but instead uses groups
- defined on elliptic curves over finite fields.
-
- The difference between this and ordinary discrete logs is that this
- method does not seem to be susceptible to Coppersmith's techniques
- for fields of characteristic 2, and index calculus based attacks seem
- more difficult as well.
-
- I suggest you check the literature for references on discrete logs.
- I am at home and all of mine are at my office. In particular, pay
- close attention to papers by Dan Gordon on elliptic discrete logs and
- any by Odlyzko or Coppersmith.
-
- --
- Bob Silverman
- These are my opinions and not MITRE's.
- Mitre Corporation, Bedford, MA 01730
- "You can lead a horse's ass to knowledge, but you can't make him think"
-