Timeline for Random numbers for Rabin-Miller primality tests
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2023 at 19:02 | comment | added | kelalaka |
Note for step 3. Make the product of the small primes and store it as constant in the library. Later when step 3 is required calculate GCD(n, productOfSmallPrimes), If one then it is not divisible any of the small primes, otherwise return step 1. This is much faster then dividing the list of small primes.
|
|
| Feb 4, 2014 at 17:57 | answer | added | Brock Hansen | timeline score: 1 | |
| Jan 30, 2014 at 19:10 | history | edited | David Szalai | CC BY-SA 3.0 |
added 15 characters in body
|
| Jan 27, 2014 at 15:12 | vote | accept | David Szalai | ||
| Jan 26, 2014 at 22:33 | history | tweeted | twitter.com/#!/StackCrypto/status/427569932717813761 | ||
| Jan 26, 2014 at 22:04 | answer | added | poncho | timeline score: 5 | |
| Jan 26, 2014 at 21:24 | history | edited | David Szalai | CC BY-SA 3.0 |
edited title
|
| Jan 26, 2014 at 21:17 | history | edited | David Szalai | CC BY-SA 3.0 |
added 6 characters in body
|
| Jan 26, 2014 at 21:05 | review | First posts | |||
| Jan 26, 2014 at 21:07 | |||||
| Jan 26, 2014 at 20:50 | history | edited | Cryptographeur | CC BY-SA 3.0 |
Some clearup
|
| Jan 26, 2014 at 20:45 | history | asked | David Szalai | CC BY-SA 3.0 |