I don't know the name of the algorithm. It's called "3.34 Algorithm Finding square roots modulo a prime p" in the "Handbook of Applied Cryptography". It's expected running time is O((lg(p))^4), so it's polynomial time and should be feasible even for larger p's.
BR JPM Am 27.04.2015 um 20:57 schrieb JF Jobidon: > Thanks a lot > Do you know the name of this algorithm ? > and is it still computable for very large p ? > Jean-François > -- > -- > You received this message because you are subscribed to the "Crypto++ > Users" Google Group. > To unsubscribe, send an email to > [email protected]. > More information about Crypto++ and this group is available at > http://www.cryptopp.com. > --- > You received this message because you are subscribed to the Google > Groups "Crypto++ Users" group. > To unsubscribe from this group and stop receiving emails from it, send > an email to [email protected] > <mailto:[email protected]>. > For more options, visit https://groups.google.com/d/optout. -- -- You received this message because you are subscribed to the "Crypto++ Users" Google Group. To unsubscribe, send an email to [email protected]. More information about Crypto++ and this group is available at http://www.cryptopp.com. --- You received this message because you are subscribed to the Google Groups "Crypto++ Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
smime.p7s
Description: S/MIME Cryptographic Signature
