Article View: sci.crypt
Article #535Re: RSA Public Key Generations.
From: Mark Riordan
Date: Wed, 29 Jul 1992 21:40
Date: Wed, 29 Jul 1992 21:40
14 lines
1175 bytes
1175 bytes
avalon@coombs.anu.edu.au (Darren Reed) writes: : Hi, I've been looking at implementing RSA encrpytion and have found that : generating the initial keys is a somewhat tricky. : : If anyone can give me some clues on how to do this, it would be great : (or even where to look for some clues :). The principal challenge is in finding the two prime numbers that constitute (most of) the private key. Though there are restrictive guidelines for choosing these if you're really concerned about security, choosing random primes will work. There are plenty of "bignum" packages that will help you do that, including the widely available GNU Multiple Precision package "gmp". Look for gmp-1.2.tar.Z at your favorite FTP site.
Technical Details
Message-ID:
<1992Jul29.214014.4507@msuinfo.cl.msu.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!darwin.sura.net!jvnc.net!netnews.upenn.edu!msuinfo!scss3.cl.msu.edu!mrrReferences:
<avalon.712399566@coombs>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!darwin.sura.net!jvnc.net!netnews.upenn.edu!msuinfo!scss3.cl.msu.edu!mrr From: mrr@scss3.cl.msu.edu (Mark Riordan) Newsgroups: sci.crypt Subject: Re: RSA Public Key Generations. Message-ID: <1992Jul29.214014.4507@msuinfo.cl.msu.edu> Date: 29 Jul 92 21:40:14 GMT References: <avalon.712399566@coombs> Sender: news@msuinfo.cl.msu.edu Organization: Michigan State University Lines: 14 X-Newsreader: Tin 1.1 PL3