Badge
| Scholar | Asked a question and accepted an answer. |
This badge has been awarded 689 times. Recently awarded to: |
nov 8 at 21:43
How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
— Saf
154
oct 30 at 22:04
Would this simple encrypted chat program be feasible using One Time Pads?
— zuallauz
1025
oct 28 at 2:04
Is there an algorithm for factoring N, which is just as simple as this one, but faster?
— Sam Kennedy
404
oct 22 at 14:20
Encryption algorithm which produces comparable results for substrings
— Narendra
1083
oct 17 at 14:09
Can Elgamal be made additively homomorphic and how could it be used for E-voting?
— nazmul
84
oct 9 at 18:32
Correct method to encrypt data so that it can be decrypted only by Alice and Bob
— Juha
233
oct 4 at 11:33
Is it possible to obtain AES-128 key from a known ciphertext-plaintext pair?
— Denis Bezrukov
132
oct 4 at 3:53
Is there any recent cryptographic algorithm especially designed for low-level processors?
— vsz
1434
sep 21 at 19:09
Is it considered insecure in an HOTP implementation to publicly provide the next counter?
— Devin
1134
sep 19 at 15:18
Shortcuts / practicality of brute forcing block cipher (AES) + ECB with known plaintext
— Konrads
1133
sep 14 at 8:41
(post deleted or otherwise unavailable)
— adlwalrus
1011
sep 10 at 0:22
Is there another resource for Carter-Wegman-style message authentication?
— Matt Groff
1133
sep 8 at 1:33
Are picture files “random enough” to be usable as a one-time pad?
— youjustreadthis
254