332 reputation
17
bio website inlovewithcrypto.blogspot.com
location Tehran, Iran
age 26
visits member for 1 year, 8 months
seen Oct 25 at 22:47

Cryptology student in sharif university of technology.

Me on linkedin Profile.


Oct
25
comment How Secure is a Pronounceable Password? In means of entropy
@NeilSlater That exactly is my question! How much I should make my "pronounceable" password longer to achieve the exact same security with an unpronounceable password. There should be a relationship...
Oct
25
comment How Secure is a Pronounceable Password? In means of entropy
@tylo My aim is to compare the entropy of a pronounceable password with the entropy of an unpronounceable one with the same length. For a certain purpose I might need, say, 128-bit of entropy which guarantees that exhaustive search is hard enough for my purpose, even if the generation method is known to the attacker. Pronounceable passwords are "usually" some kind of nonsense words which are so easy to memorize. Examples are "leynoberepin", "ainporietora" or "iteellyterna". (these ones are all generated by LastPass)
Oct
25
revised How Secure is a Pronounceable Password? In means of entropy
added 722 characters in body
Oct
25
accepted How Secure is a Pronounceable Password? In means of entropy
Oct
22
awarded  Yearling
Oct
22
asked How Secure is a Pronounceable Password? In means of entropy
Oct
21
comment Crypto Libraries with Pairing Based Functions for Academic and Educational Use?
Thank you @DrLecter. How can I make it more proper "as a Question"? Can going community wiki help me on finding some kind of "conventional" library for PBC? Then, how can I help in making a community wiki out of it? Thanks again!
Oct
21
asked Crypto Libraries with Pairing Based Functions for Academic and Educational Use?
Feb
21
revised Safe generator for ElGamal signature
added 16 characters in body
Feb
21
answered Safe generator for ElGamal signature
Feb
15
comment Is there a standard way to extend the output of a hash?
I strongly believe that the structure would not make a 'more secure' hash function out of an already available hash function. Think of it as this, by accessing an oracle which finds a preimage for $h(.)$ finding a preimage for $h'(.)$ can be done just using a simple efficient polynomial time algorithm.
Feb
8
awarded  Autobiographer
Feb
8
answered How to determine which type of crypto is used in a text file?
Feb
5
answered Are there groups where the computational Diffie Hellman problem is easy but the discrete log problem is hard?
Feb
4
accepted What does “Worst-case hardness” mean in lattice-based cryptography?
Feb
3
awarded  Student
Feb
2
asked What does “Worst-case hardness” mean in lattice-based cryptography?
Nov
9
comment Do any non-US ciphers exist?
I afraid I cannot give you the full papers of the conference proceedings due to copyright restrictions. But this links of "ePrint Archive" to papers authered by my classmates might be useful for you: A provable secure anonymous proxy signature scheme without random oracles, Secure Channel Coding Schemes based on Polar Codes
Oct
27
awarded  Teacher
Oct
26
comment Do any non-US ciphers exist?
The proceedings are not publicly available but you might find the abstracts of some here and If your internet connection is through a university IP address of which the university has a contract with IEEE Organization you might access the full papers.