354 reputation
10
bio website
location Brittany, France
age
visits member for 11 months
seen 2 days ago

Jun
18
awarded  Custodian
May
29
answered The improvement of the private key exponent in the M.Weiner Attack
May
12
awarded  Organizer
May
12
revised RSA, finding p,q
added the tag Number-theory
May
12
suggested suggested edit on RSA, finding p,q
May
12
revised RSA, finding p,q
added 7 characters in body
May
12
comment RSA, finding p,q
Before seeing your question, I was looking for the same algorithm and when I found the specification and wrote some python code to implement it and test. You'll find an improvable but working code here: gist.github.com/ddddavidee/b34c2b67757a54ce75cb
May
12
answered RSA, finding p,q
May
4
comment Why is ed25519 batch verification faster?
Did you read this blog post: blog.cr.yp.to/20140323-ecdsa.html ? There are few lines explaining how a signature works on the ECC.
Apr
25
comment State of the art RSA key generation
I know how RSA works, I asked about the secure generation of primes numbers involved in it. Imagine that I want, hypotetically, write an implementation of RSA that is secure, how must I generate $p$ and $q$?
Apr
24
comment State of the art RSA key generation
I saw you experiments in the edited answer. I think it is interesting, feel free to add them when you have more data... I'll try on my side, too.
Apr
24
awarded  Scholar
Apr
24
accepted State of the art RSA key generation
Apr
23
awarded  Student
Apr
23
comment State of the art RSA key generation
A, maybe, similar question but about a generic generation crypto.stackexchange.com/questions/1970/…
Apr
23
comment State of the art RSA key generation
If you have some refs I'd be happy if you share them: crypto.stanford.edu/~dabo/abstracts/RSAattack-survey.html
Apr
23
asked State of the art RSA key generation
Apr
9
comment Is it possible to deduce the IV from CBC ciphered data, without knowing the key?
I cannot get why it must to be unpredictable. Are there any weakness known?
Mar
29
comment How is the curve equation used in ECC?
A (relatively easy to understand) primer on elliptic curve cryptography arstechnica.com/security/2013/10/…
Mar
14
comment AES encryption takes more time to decrypt than encrypt
If you're interested in a efficient implementation and understand how one can table a lot to compute an AES encryption roud I suggest to read this paper: link.springer.com/chapter/10.1007%2F3-540-36400-5_13#page-1 (slides are available here: chesworkshop.org/ches2002/presentations/Bertoni.pdf)