IFRAME SYNC
IFRAME SYNC
IFRAME SYNC
IFRAME SYNC

How to determine if $n = 53467$ is prime or not using Elliptic curves? https://ift.tt/eA8V8J

I want to use Elliptic curves modulo $n$ to find out if $n$ is prime or not.

Now, I know that $n = 53467 = 127\times 421$, but how do I find this out using Elliptic curves?

I tried factorization using Lenstra factorization, but how to choose an efficient Elliptic curve to get the factors fast?



from Hot Weekly Questions - Mathematics Stack Exchange
Shinimani

Post a Comment

[blogger]

Contact Form

Name

Email *

Message *

copyrighted to mathematicianadda.com. Powered by Blogger.
Javascript DisablePlease Enable Javascript To See All Widget

Blog Archive