# Tag Info

5

I can't agree with bullet 3. of the question stating quantum computers are getting stronger with a good pace (82-qbit computer last year, 512-qbit computer this year), at least in a context of cryptanalysis. Even the marketing people praising the device alluded to do not pretend that it is of a kind useful for cryptanalysis: they state about it: The ...

0

I don't understand what you mean simulate, but if you need a toy example in python the code is at the end of the message. If you need to show the performance of more advanced algorithms use factor(x) in pari/gp. See here for details. import gmpy, time, random, math def genprime(bits): p=1 while(gmpy.is_prime(p)==0): p = ...

1

Firstly, I assume we are talking about classical computers Implementing a brute force attack on a RSA may not be the most sensible thing, unless of course the security parameter of your target system is small.. (160 bit numbers! ) Even then you may not want to implement a brute force here.. try using Fermat's Factoring or Pollards $\rho$ method. If you ...

3

My understanding is that the attack only works against McEliece with algebraic geometry codes. The paper by Bernstein, Lange and Peters recommends parameters for McEliece with binary Goppa codes, so the attack does not apply against those parameters.

Top 50 recent answers are included