Determing if a number is Prime

Article View: sci.crypt

Article #694

#694

From: edc323usft
Date: Fri, 14 Aug 1992 01:49

7 lines
739 bytes

Mathmatics not being my strongest field, and time being of concern, I am
in need of an algorithim for determining if a number is indeed prime
(for use in a RSA encryption algorithim).  Also, if anyone has any
advise in handiling 150 - 200 digit numbers in C then I would more than
welcome some advice ...

Travis

Technical Details

Message-ID: <1992Aug14.114942.1@vx24.cc.monash.edu.au>

Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!bruce.cs.monash.edu.au!monu6!vx24.cc.monash.edu.au!edc323usft

Show Full Headers

Complete Article Headers

Newsgroups: sci.crypt
Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!bruce.cs.monash.edu.au!monu6!vx24.cc.monash.edu.au!edc323usft
From: edc323usft@vx24.cc.monash.edu.au
Subject: Determing if a number is Prime
Message-ID: <1992Aug14.114942.1@vx24.cc.monash.edu.au>
Lines: 7
Sender: news@monu6.cc.monash.edu.au (Usenet system)
Organization: Computer Centre, Monash University, Australia
Date: Fri, 14 Aug 1992 01:49:42 GMT