In your previous mail you wrote: > I don't think the index helps much. I suspect that SSAS could be broken in > minutes if someone did a parallel implementation on a GPU. Maybe seconds.
=> you peak 2 primes for a standard RSA public key. You fix one and you divide the modulus to get an idea of the needed value for the second to match the 48 bits, and an increment for the bits to match position. Now you scan to get a prime which will give a matching modulus, using addition for computing the next modulus. The Hadamard-De la Vallee Poussin theorem (known in English as the prime number theorem says the distribution is n/ln(n), so as bc -l returns 710 for ln(2**1024) only at most 710 additions (which are as complex as carry propagation, so count for nothing) and primality checks are needed. I don't have the number for primality check speed but my i5 laptop checks 1000 times a 1024 bit prime (which is the worst case) in 7 seconds in a shell script. Regards [email protected] -------------------------------------------------------------------- IETF IPv6 working group mailing list [email protected] Administrative Requests: https://www.ietf.org/mailman/listinfo/ipv6 --------------------------------------------------------------------
