fastest calculation of largest prime factor of 512 bit number in python

Posted by miraclesoul on Stack Overflow See other posts from Stack Overflow or by miraclesoul
Published on 2010-03-08T18:12:27Z Indexed on 2010/03/08 18:51 UTC
Read the original article Hit count: 402

Filed under:
|
|

dear all,

i am simulating my crypto scheme in python, i am a new user to it.

p = 512 bit number and i need to calculate largest prime factor for it, i am looking for two things:

  1. Fastest code to process this large prime factorization
  2. Code that can take 512 bit of number as input and can handle it.

I have seen different implementations in other languages, my whole code is in python and this is last point where i am stuck. So let me know if there is any implementation in python.

Kindly explain in simple as i am new user to python

sorry for bad english.

© Stack Overflow or respective owner

Related posts about python

Related posts about prime