-
Notifications
You must be signed in to change notification settings - Fork 188
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Primes generation and checking with num-bigint #31
Comments
Nothing in the crate, and I'm not aware of anything published elsewhere. I do have a generic Miller-Rabin implementation that I use for Project Euler problems, but I'm not sure it's good enough to share. :) |
Does it look fast enough for RSA-like crypto needs? For now i use OpenSSL, but consider switching to some rust-native solution to simplify cross-platforms builds and deployment. |
I'm not confident enough to answer that... Tell you what, I'll see if I can clean that up as an example program, at least, and we can go from there. |
If you interested in we can benchmark it over OpenSSL together. My BN wrapper over OpenSSL is placed here https://github.com/hyperledger/indy-crypto/blob/master/libindy-crypto/src/bn/openssl.rs I am interesting in performance of calls:
|
See #33 -- but I'll save you some suspense, it's definitely not as fast as OpenSSL. Make sure you at least run it with optimization though, e.g. |
Thanks for this work. I will check on my side this week. |
I have done some work on this, you can find more details about it here: #33 (comment) |
Although it's an old question, but I'm building a crate ( |
Hi,
Is there any solution for generation of primes, safe primes and prime checking with num-bigint?
The text was updated successfully, but these errors were encountered: