3
votes
Double- and -add algorithm
The points of an elliptic curve forms an abelian group under the usual point addition. In finite field case, the order is finite, i.e. the curve has finite number of points. The order can be prime or ...
3
votes
Does combining a stream cipher and block cipher produce any vulnerabilities?
With respect to confidentiality, cascading two ciphers (xChacha20 then AES-CBC in the question) with independent keys is at least as secure as either cipher against KPA and CPA attacks. That's ...
1
vote
Accepted
How to evaluate the minimum complexity of the key recovery when the success probability p is given?
For common cryptographic algorithms, there is no known lower bound to the complexity of key recovery with a given (and sizable) probability. We can't mathematically exclude the possibility of a much ...
1
vote
Does higher key sizes correspond to a higher security parameter?
This can be either a philosophical question or a empirical question, but answer to both these sides can be similar.
First, the title is correct, higher key sizes corresponds to a higher security level....
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
cryptanalysis × 1537encryption × 368
rsa × 125
aes × 121
block-cipher × 117
hash × 104
algorithm-design × 101
public-key × 100
classical-cipher × 59
des × 56
differential-analysis × 55
attack × 52
random-number-generator × 46
elliptic-curves × 44
symmetric × 43
provable-security × 43
brute-force-attack × 41
stream-cipher × 40
post-quantum-cryptography × 39
keys × 37
substitution-cipher × 36
vigenere × 36
linear-cryptanalysis × 36
one-time-pad × 35
collision-resistance × 32