487 reputation
112
bio website
location Brittany, France
age
visits member for 1 year, 3 months
seen 6 hours ago

11h
comment Recover plaintext in passive attack of RSA of coprime public key
Good way to give the answer to the question.
11h
comment Operation which needs much computing power to be created, but just a little to be solved?
You could also check the different proofs of work (or similar) used in the cryptocurrencies world. It usually looks like to find a preimage for a hash function.
2d
comment Small Prime Difference in RSA
Ok, as I thought.
Oct
21
comment Crypto Libraries with Pairing Based Functions for Academic and Educational Use?
Please, do not delete the question. It contains an interesting list of libraries.
Oct
21
comment Small Prime Difference in RSA
What is the difference with the answer I put in the comment?
Oct
21
comment Small Prime Difference in RSA
If it exists $l$ such that $N + l^2$ is a square, say $t^2$, over the integers, you can factorize $N = (t-l) (t+l) $. Try to find that $l$. Call $p=t-l$ and $q=t+l$, if you compute the difference: $|p-q| = 2l$, so that give you a upper bound for your tests.
Oct
13
comment Bouncy Castle and Salsa 20
Maybe you should ask your question in the general way, without any bound to a particular library. (btw I'm not the downvoter)
Oct
13
comment Bouncy Castle and Salsa 20
The question is off topic for this site.
Oct
5
comment Why don't we use bcrypt and scrypt together?
ah, yes! you should build a dictionary to inverse it (infeasible). thank you!
Oct
5
comment Why don't we use bcrypt and scrypt together?
Wouldn't such construction vulnerable to the Meet in the Middle Attack?
Oct
3
comment RSA given q, p and e?
I suggest you using a bigint library to do the computation. Or try using Python, Pari/GP, Maple, Sage,...
Oct
1
comment Calculate the RSA private exponent from the CRT parameters
if you use a standard $e$ it is quite easy to recover the $d$ exponent. (but at the moment I dont remember if there is a direct function in OpenSSL API)
Sep
22
answered For calculating the index of coincidence for each sequence
Sep
20
awarded  Custodian
Sep
20
reviewed Satisfactory Elliptic Curve Cryptography
Sep
20
reviewed Excellent Point addition equation in projective co ordinates
Sep
20
reviewed Satisfactory MAC using a modified CBC mode of operation
Sep
20
reviewed Satisfactory ECDSA with SHA256 and sepc192r1 curve: Impossible, or how to calculate $e$?
Sep
20
reviewed Satisfactory Combining two keys
Sep
20
comment How can i calculate prime of Elliptic Curve?
As they said $p$ is chosen to fill some conditions: to be prime and to allow fast computation modulo $p$. A good explaination could be found in this post: imperialviolet.org/2010/12/04/ecc.html