32,021 reputation
12567
bio website
location
age
visits member for 3 years, 3 months
seen 17 hours ago

19h
reviewed Leave Open Minimum number of independent trials needed to detect a bias
19h
reviewed Close Can someone please explain to me what this means?
19h
reviewed Close can you suggest any applicayion for implementing threshold homomorphic encryption cryptosystem(Paillier cryptosystem)
1d
reviewed No Action Needed Email Encryption
1d
reviewed No Action Needed Computation indistinguishability questions
1d
reviewed No Action Needed Diceware word list for six dice
1d
reviewed No Action Needed Repeatedly using same key on different plaintexts
1d
awarded  Nice Answer
1d
comment Can someone please explain to me what this means?
Might I suggest you ask your professor what he meant by that?
1d
comment Cracking RSA with Small exponent 5
To expand what mikeazo said, if they did things properly, then you are unlikely to find a solution. Did you get this as homework (or from someone who indicated that things weren't done properly)? The two obvious things that they might have done wrong is selecting $p$ and $q$ extremely close (so Fermat factorization works), or selected a plaintext message $P < \sqrt[5]{N}$ (in which case computing the fifth-root of the ciphertext gives you P); have you checked both of those?
1d
reviewed Close Javascript Information Dispersal Algorithm
1d
revised Elliptical curve cryptography key generation time
deleted 1 character in body
1d
reviewed No Action Needed CoAP authentication using DTLS
1d
reviewed No Action Needed Sharing an encrypted file between a group of people
1d
reviewed Leave Open What is the difference between IND-CCA2 and NM-CCA2? And how does one imply another?
1d
reviewed Close Decrypt with only the cipher file and the key?
1d
reviewed Close Feistel network output if round function is the identity function
1d
revised Elliptical curve cryptography key generation time
added 201 characters in body
1d
answered Elliptical curve cryptography key generation time
1d
comment Elliptical curve cryptography key generation time
@ddddavidee: in this case, the naive algorithm (perform $d-1$ point additions) is so expensive that it can't even be done one.