3,774 reputation
1621
bio website
location United States
age
visits member for 3 years, 1 month
seen 14 mins ago

8h
comment Efficient proof of knowledge using Wegman-Carter hash
No; I just mean that a similar analysis may work. $\;$
9h
comment Efficient proof of knowledge using Wegman-Carter hash
I suspect that working with polynomials will have similar properties to working with integers. $\hspace{.94 in}$
2d
comment Designing hash function in space-efficient identity based encryption
@poncho : $\:$ It would probably be important that the sampling of values $\hspace{2 in}$ with a Jacobi symbol of 1 be oblivious. $\;\;\;\;$
Nov
20
revised Cryptographic Operations and Security
improved grammar
Nov
19
answered Availability of a simple limited PRNG algorithm
Nov
19
comment Availability of a simple limited PRNG algorithm
Yes, there are at least 5 such PRNGs. $\;$
Nov
19
comment DHE key exchange. Is it really secure?
What "prefix" does Alice send to Bob? $\;$
Nov
19
revised Is it possible to determine a PGP public key from encrypted data?
inserted excerpts
Nov
18
reviewed Reviewed What does $\Pi$ represent in cryptography?
Nov
18
comment What does $\Pi$ represent in cryptography?
It can be "notation for the Encryption scheme in use", but isn't here. $\;$
Nov
18
comment Decrypting A Cipher Text without knowing the key or plaintext
While this link may answer the question, it is better to include the essential parts of the answer here and provide the link for reference. Link-only answers can become invalid if the linked page changes.
Nov
18
revised How can I start the following crypto project?
fixed title's grammar
Nov
17
revised What does $\Pi$ represent in cryptography?
improved grammar
Nov
17
comment number theory and cryptographic hardness assumptions
There is no question in your post. $\;$
Nov
17
comment plaintext distribution ,perfect secrecy cryptosystem
However, "a perfect secrecy cryptosystem with specific plaintext probability distribution" would obviously be defined differently. $\;$
Nov
17
comment Secure Multiparty Sum in malicious model using threshold encryption
The NIZK protocols need to be simulation-extractable, rather than just plain NIZK. $\:$ The threshold decryption needs to be simulatable (I don't know whether or not most threshold PKE schemes provide that).
Nov
17
comment fully homomorphic encryption (FHE)
I think this is unusual because, for some circuits $g$, it will require far more homomorphic operations than handling gates with known outputs separately. $\:$ I'm not aware of any non-public-key candidates for FHE. $\;\;\;\;$
Nov
17
comment Show CBC-MAC construction isn't secure
No, it's a proof command. $\;$
Nov
17
comment Collision resistant hash functions
What have you tried? $\;$
Nov
17
comment Show CBC-MAC construction isn't secure
There is no question in your post. $\;$