Reputation
18,660
Next tag badge:
284/400 score
76/80 answers
Badges
2 29 81
Newest
 Nice Answer
Impact
~463k people reached

Dec
3
revised practical use of homomorphic encryption
added 28 characters in body
Dec
3
comment practical use of homomorphic encryption
Not sure why people voted to close as "opinion-based", there is a clear winner between RSA and ElGamal for most realistic applications.
Dec
3
comment Existential Forgery on textbook RSA signatures
BTW, this would be very easy to verify on a computer.
Dec
3
comment Existential Forgery on textbook RSA signatures
If by division you mean multiplication by the modulo inverse, then yes, it will work.
Nov
30
comment Encrypt algorithm
Theoretically, yes. Practically, only on small algorithms. The term you are looking for is called private function evaluation.
Nov
26
comment Cracking RSA with Small exponent 5
I'm going to close as unclear until you can add more detail. See Poncho's comment for specifically what you should add.
Nov
26
comment Is the Vigenère Cryptosystem malleable?
What research have you done? Also, can you give your (mathematical) description of vigenere?
Nov
25
comment Cracking RSA with Small exponent 5
n is 1024 bits. If n was generated properly, you won't be factoring it any time soon.
Nov
25
revised Real life systems that use concepts of crypto computing
added 1 character in body
Nov
24
comment Cracking plain RSA by factoring the modulus n
Since we don't really do code review here or help debug, I haven't looked at your code really. I can give a suggestion, however. Take a look at this answer on a previous question.
Nov
24
comment Recovering El Gamal secret key from signatures
With how small the parameters are, just use brute force.
Nov
24
comment Building a pad for OTP on-the-fly with Diffie-Hellman
OTP does not necessarily require an offline key exchange.
Nov
23
comment Private Information Retrieval--Is it still theoretical?
Here is a library.
Nov
23
comment Private Information Retrieval--Is it still theoretical?
Possible duplicate of crypto.stackexchange.com/questions/20389/…
Nov
22
comment Real life systems that use concepts of crypto computing
List questions are often closed as off-topic here. There have been some exceptions. I'll let the community decide on this one.
Nov
22
comment Real life systems that use concepts of crypto computing
Making this CW so that others can edit and add additional information more freely.
Nov
22
answered Real life systems that use concepts of crypto computing
Nov
21
comment Python. RSA common modulus attack problem
I am familiar with python and can give you a few pointers. First, with pow, pow supports a third parameter to compute modular exponentiation. So doing pow(a,b,n) computes, $a^b\bmod{n}$. For computing inverses, I typically use pycrypto (Crypto.Util.number.inverse).
Nov
20
comment Are all binary-additive stream ciphers reciprocal?
The inverse of XOR is XOR, so yes.
Nov
20
comment Is there a Javascript and Java implementation of a good CSPRNG
Why do they have to be the same algorithm? Could you run node.js on the server side? I think your question would be better off on a different site. This site is more about theoretical aspects of crypto. StackOverflow or IT Security could be better sites. If you want me to migrate the question, let me know.