Reputation
5,701
Next tag badge:
64/100 score
17/20 answers
Badges
1 11 33
Newest
 Custodian
Impact
~109k people reached

Jul
14
comment Does CCA security imply authenticated encryption?
@K.G. The usual definition of malleability is that there exists a known function for transforming cipher texts into something that decrypts to related plain texts. Modifying an AE-scheme to return psuedo random plain text instead of an error doesn't qualify.
Jul
14
revised Does CCA security imply authenticated encryption?
added 1129 characters in body
Jul
13
revised Effective security of block cipher – equal the key size, or half the key size?
added 534 characters in body
Jul
13
revised Effective security of block cipher – equal the key size, or half the key size?
added 3 characters in body
Jul
13
answered Effective security of block cipher – equal the key size, or half the key size?
Jul
13
answered Does CCA security imply authenticated encryption?
Jul
13
comment Does CCA security imply authenticated encryption?
IND-CCA2 is equivalent to NM-CCA2.
Jul
11
answered In RSA, why does $p$ have to be bigger than $q$ where $n=p \times q$?
Jul
9
revised Deterministic Rand function for Winternitz One Time Signatures
added 22 characters in body
Jul
8
revised Deterministic Rand function for Winternitz One Time Signatures
added 1686 characters in body
Jul
7
revised Deterministic Rand function for Winternitz One Time Signatures
added 258 characters in body
Jul
7
asked Deterministic Rand function for Winternitz One Time Signatures
Jul
2
awarded  Curious
Jun
25
comment How come Shamir Secret Sharing uses Lagrange interpolation?
Technically, your question captures that $O(n^2) = O(kn^2 + r)$ for constant parameters $k, r$. The formula in my answer requires only about half as many multiplications, as if you were to calculate the coefficients of $P(x)$ instead of the the value of $P(0)$ directly. Newton's formula calculates the coefficients faster than Lagrange's formula, but it doesn't necessarily calculate the value of $P(0)$ faster.
Jun
25
comment How come Shamir Secret Sharing uses Lagrange interpolation?
Thanks, I improved it a bit further, to make it a bit a clearer exactly which calculations are made.
Jun
25
revised How come Shamir Secret Sharing uses Lagrange interpolation?
deleted 8 characters in body
Jun
24
revised How come Shamir Secret Sharing uses Lagrange interpolation?
added 403 characters in body
Jun
24
answered How come Shamir Secret Sharing uses Lagrange interpolation?
Jun
17
comment Is HMAC needed for a SHA-3 based MAC?
@figlesquidge Security is a relative notion. The question you link to in your comment, as well as the accepted answer to that question, explains in detail to what extent HMAC-SHA3 would be more secure than using in SHA3 in its built in MAC mode.
Jun
11
answered Does this protocol provide Perfect Forward Secrecy / are there potential security flaws?