home | log | search | bash | stats | wiki


Matches for from:asciilifeform, 112685 total results Sorted by newest | relevance

Wed May 18 15:55:46 UTC 2016  <asciilifeform>   it Wouldn't Do to have heathens like us ~actually read the thing~ now would it.

Wed May 18 15:53:43 UTC 2016  <asciilifeform>   jurov: extra-lulzily, the link to the actual paper is dead.

Wed May 18 15:51:39 UTC 2016  <asciilifeform>   lovely

Wed May 18 15:46:06 UTC 2016  <asciilifeform>   l0l

Tue May 17 21:30:59 UTC 2016  <asciilifeform>   surely not waste.

Tue May 17 21:27:38 UTC 2016  <asciilifeform>   funkenstein_: the otp equiv. for signature is lamport's scheme

Tue May 17 21:16:45 UTC 2016  <asciilifeform>   the difference is wholly accidental

Tue May 17 21:16:27 UTC 2016  <asciilifeform>   'the next appropriate rsa modulus after integer 0 ... FFFFFFF...'

Tue May 17 21:16:13 UTC 2016  <asciilifeform>   funkenstein_: my point was that you can also specify rsa that way:

Tue May 17 21:12:11 UTC 2016  <asciilifeform>   see 'pollard rho' algorithm as to why.

Tue May 17 21:10:55 UTC 2016  <asciilifeform>   so the classes of primes used are even narrower than supposed in the schoolbook description

Tue May 17 21:10:31 UTC 2016  <asciilifeform>   in actual implementations, there is also a series of tests for 'strong prime', and being 'first in twin pair' is actually an instant-winner, and is preferred

Tue May 17 21:07:49 UTC 2016  <asciilifeform>   why?

Tue May 17 21:06:47 UTC 2016  <asciilifeform>   funkenstein_: what's the logic here

Tue May 17 21:05:26 UTC 2016  <asciilifeform>   http://mathworld.wolfram.com/PrimeNumberTheorem.html << try this one

Tue May 17 21:05:12 UTC 2016  <asciilifeform>   ;;google prime number theorem

Tue May 17 21:04:35 UTC 2016  <asciilifeform>   and no, you don't throw it out, one is never far from a prime

Tue May 17 21:03:56 UTC 2016  <asciilifeform>   this gives you p and q.

Tue May 17 21:03:48 UTC 2016  <asciilifeform>   and then you do it again.

Tue May 17 21:03:44 UTC 2016  <asciilifeform>   (essentially, you obtain a random bit string of certain length, and find the next prime after the integer it represents which meets certain tests)

« Previous Page    Next Page »