Reputation
1,388
Top tag
Next privilege 1,500 Rep.
Approve tag wiki edits
Badges
1 7 28
Newest
 Constituent
Impact
~34k people reached

Jun
24
reviewed Close what are the most common stream ciphers algorithms?
Jun
24
comment what are the most common stream ciphers algorithms?
most popular doesn't necessarily mean most implemented.
Jun
24
reviewed Close An example of Knapsack Cryptosystem cracks/attacks?
Jun
24
awarded  Constituent
Jun
24
awarded  Caucus
Jun
7
reviewed Reject AM protocol for 2 distinct objects
Jun
5
reviewed Approve How do we know a cryptographic primitive won't fail suddenly?
May
9
comment XOR = Best encryption?
Welcome to Crypto.SE. I recommend you checked out one time pad. Then, with a basic understanding on that, try searching this site for any questions that might pop up. I hope this helps.
Apr
18
reviewed Approve Proving that a plaintext is the Paillier decryption of a certain ciphertext
Apr
10
reviewed Reject Differences Between White-Box Cryptography and Code Obfuscation
Apr
5
reviewed Approve Why is diffie-hellmangroup1-sha1 used instead of diffie-hellman?
Apr
1
reviewed Reject Is there any pattern in points on EC?
Mar
11
comment Is the 1st Encrypted Block Less Secure Than Subsequent Ones?
@D.W I'm not trying to make a fuss, but I know that efforts to maintain a high standard on content can dissuade newer users from participating further. This is my main concern, and this is why I write this to you
Mar
11
comment Is the 1st Encrypted Block Less Secure Than Subsequent Ones?
@D.W The OP described the two modes of operation correctly, which suggests he has already consulted standard sources. Not everyone can figure stuff out on their own, nor can they ask good questions all the time. Your entire comment was aimed at helping the OP, but only the last two sentences do so. This question is OK.
Mar
11
awarded  Yearling
Mar
2
comment Vigenere ciphers : Need help for math analysis
Oh I see. Does it work with $k=$ homehomehome... instead?
Mar
2
comment Vigenere ciphers : Need help for math analysis
Hello Eko. I tried editing your question to texify but I don't understand what the symbol ▒ is (final equation, in the sums, after $k$). Anyway, the key $k$ is not modified during encryption/decryption; typically when you run out of characters in the key, you start over (eg. $k_i=k_{(i \mod l(k))}$, where $l(k)$ is the length of the key.) I hope this helps.
Feb
28
reviewed Approve What do you think about this message encryption?
Feb
28
reviewed Approve Differences between Work Factor and Time Complexity
Feb
20
reviewed Reject Is AES-256 weaker than 192 and 128 bit versions?