Reputation
37,600
Next tag badge:
99/100 score
25/20 answers
Badges
1 35 80
Newest
 Nice Answer
Impact
~552k people reached

7h
revised One-one correspondance complete function
Tried to be less obscure
2d
revised Adding tweak to a block cipher
added 84 characters in body
Jun
20
revised Stateless hash based public key cryptography?
added 32 characters in body
Jun
17
revised Establish Trust By Signing Random Seed
added 705 characters in body
Jun
14
revised Why does UMAC encrypt the output of universal hash function?
deleted 1 character in body
Jun
3
revised How is information disclosed by modular multiplication?
English...
Jun
1
revised Interesting malleability property of Goldwasser-Micali PKC
added 85 characters in body
May
31
revised Can AES in CBC mode be parallelized?
edited tags
May
29
revised Authenticating small packets
Highlighted what wasn't secure
May
29
revised About Primitive roots mod n in Diffie-Hellman
It's \sqrt{k}, not 2^k
May
25
revised How to calculate RSA CRT parameters from public key and private exponent
added 157 characters in body
May
22
revised Break El-Gamal Algorithm by knowing the value of the random k
edited body
May
20
revised Would this method deliver a perfectly non-malleable encryption for at least two blocks?
added 330 characters in body
May
19
revised Post-quantum authenticated encryption
added 101 characters in body
May
19
revised Post-quantum authenticated encryption
added 238 characters in body
May
17
revised On composition of encryption schemes
added 392 characters in body
May
16
revised Elliptic curve brute forcing
edited body
May
14
revised
The problem of determining whether a given boolean expression is either true or false is trivial;
May
11
revised Computing p and q from private key
added 3 characters in body
May
8
revised Does the Paillier system remain secure if it is used to encrypt only binary values, i.e. {0, 1}?
The title question and the question in the text were opposites of each other; made it more explicit which the "No" referred to