New answers tagged algorithm-design
1
vote
Can Ed25519 signature be used as a base for ChaCha20 secret key?
So, the OP's goal here with the construction in the question is to do the following:
Prevent anyone from creating a valid container without being a writer(ie possesing the writer's secrets).*
Allow ...
8
votes
Is it possible to add arbitrary amounts of quantum resistance cheaply?
No, for the reasons indicated in the other answer to this question.
But I want to point out a partial stopgap measure when it comes to signature: using Schnorr groups with large parameter $p$ (e.g. ...
5
votes
Is it possible to add arbitrary amounts of quantum resistance cheaply?
There is no way to do this.
Under Shor's attack the Discrete Logarithm in a group of size $2^n$ has quantum complexity $\mathrm{poly}(n).$
If we consider extending the bitlength by $n^c$ bits as $O(n^...
2
votes
Do the specific powers of two $2^{23}$ and $2^{13}$ in the modulus $q = 2^{23} - 2^{13} + 1 = 8380417$ have any special purpose in its design?
Here's a few important factors for choosing the modulus:
SIS gets easy if the modulus is too big or too small. If it's too big, the corresponding lattice problems get easier. If it's too small, ...
-2
votes
What is the difference in exchanging the Enigma rotors in their slots?
I totally agree. Exchanging order of rotors DOES NOT increase the total keys. STILL it is 26 × 26 × 26 keys no matter what order of rotors is.
Top 50 recent answers are included
Related Tags
algorithm-design × 905encryption × 190
hash × 129
cryptanalysis × 104
block-cipher × 64
aes × 58
public-key × 42
signature × 41
stream-cipher × 39
symmetric × 37
rsa × 36
elliptic-curves × 35
implementation × 33
reference-request × 32
keys × 28
s-boxes × 25
random-number-generator × 23
protocol-design × 23
sha-256 × 20
finite-field × 18
collision-resistance × 17
pseudo-random-generator × 17
des × 17
terminology × 17
complexity × 16