Re: Some questions about Strong Pseudoprimes
From: flip (flip_alpha_at_safebunch.com)
Date: 06/29/03
- Next message: David Hopwood: "Re: Key length for ARC4 and RC5 key lenght contradiction (Please, help me)"
- Previous message: Mok-Kong Shen: "Re: Release 1.1 (beta) of my AES implementation"
- In reply to: Henrik: "Some questions about Strong Pseudoprimes"
- Next in thread: Phil Carmody: "Re: Some questions about Strong Pseudoprimes"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sun, 29 Jun 2003 13:44:41 -0700
Hello,
1. yes, MRS is the same as Miller-Rabin. Selfridge was a genius at thsi
stuff is often doesn't get credit where credit is due.
If you want a wonderful and up-to-date book on the subject, you can look at
"Prime Numbers: A Computational Perspective".
If your bank account cannot support that, look at the "Handbook of Applied
Cryptography" (online).
2. "MANY" bases. See the book reference on Prime Numbers (also see the web
site on Prime Numbers).
3. See the library by Tom St. Denis for a crypto library which uses
"Yarrow" to generate crypto strength RN's. There is a new technique on
counter pane's web site www.counterpane.com with other methods. You can
also look at BBS and for a hardware solution look at COMSQIURE (spelling?).
HTH, Flip
"Henrik" <henrik-olsson@tyko.nu> wrote in message
news:dec97132.0306291127.66ceea4a@posting.google.com...
> Hi!
> I'm working on a project in school (3th grade highschool in sweden,
> which means that I am 18 years old). My task is to construct a program
> for public-encryption using RSA. I would be pleased if someone could
> answer these questions:
>
> Flip (in sci.crypt) once wrote this: "...there is not a 'single' known
> example of a composite that passes both the Miller-Rabin-Selfridge
> (MRS) and the Lucas test...". I got two questions about this:
>
> 1. Is "Miller-Rabin-Selfridge" the same as just "Miller-Rabin"?
> 2. Which bases (2,3,5...) on the Miller-Rabin test have to be used for
> this to be true?
>
> Someone later replied that there are more efficient Pseudo-prime-tests
> nowadays (he also mentioned a few, but this was some years ago). On to
> my next question:
>
> 3. Which pseudo-prime algorithm for prime-generation (fot use in
> RSA-encryption) do you think is the best to date?
>
> Thanks in advance!
>
> //Henrik Olsson
> Stockholm, Sweden
- Next message: David Hopwood: "Re: Key length for ARC4 and RC5 key lenght contradiction (Please, help me)"
- Previous message: Mok-Kong Shen: "Re: Release 1.1 (beta) of my AES implementation"
- In reply to: Henrik: "Some questions about Strong Pseudoprimes"
- Next in thread: Phil Carmody: "Re: Some questions about Strong Pseudoprimes"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|