30,898 reputation
12463
bio website
location
age
visits member for 3 years, 2 months
seen 43 mins ago

Sep
8
revised Parallel variant of Carter-Wegman MAC with incremental property
added 22 characters in body
Aug
28
revised Understanding Genkin-Pipman-Tromer's ground potential, side channel attack on RSA
added 314 characters in body
Aug
21
revised CBC-MAC key can be added to ciphertext?
added 334 characters in body
Aug
14
revised Chosen plaintext attack on textbook RSA decryption
Fixes a few things that were meant to be exponetials
Aug
8
revised Building a stream-cipher out of a hash function?
[Edit removed during grace period]
Jul
20
revised AES-CTR-256 Sub Keys With Encrypted Sub Key Index
Fixed grammar
Jul
15
revised Decrypting an encrypted text out of order
edited tags
Jun
27
revised How to convert projective to jacobian co-ordinate in ECC?
added 51 characters in body
Jun
16
revised Why is asymmetric cryptography bad for huge data?
Add a concept
Jun
11
revised Does this protocol provide Perfect Forward Secrecy / are there potential security flaws?
improved formatting -- I rejected replacing "xor" with $\oplus$ -- IMHO, xor is actually clearer
Jun
8
revised ECDSA: How to retrieve a non-random k
Slightly more explicit
Jun
5
revised Pick faster private exponent
deleted 1 character in body
Jun
5
revised Use of Different keys with PCBC
Extended explination
Jun
3
revised Montgomery Ladder vs Double-and-Add
added 112 characters in body
May
30
revised Does $i^n=j^n$ for $i, j \in GF(2^q)$ and $i \neq j$ for some $n<2^q-1$
added 4 characters in body
May
30
revised Does $i^n=j^n$ for $i, j \in GF(2^q)$ and $i \neq j$ for some $n<2^q-1$
added 3 characters in body
May
30
revised Does $i^n=j^n$ for $i, j \in GF(2^q)$ and $i \neq j$ for some $n<2^q-1$
added 335 characters in body
May
28
revised How to handle the GCD(V,P) != 1 case when doing point addition or point doubling in elliptic curve cryptography
added 328 characters in body
May
28
revised Analyzing ECB's and CBC's resistence to a known-plaintext attack
Math typo
May
27
revised How to handle the GCD(V,P) != 1 case when doing point addition or point doubling in elliptic curve cryptography
deleted 1 character in body