New answers tagged finite-field
1
vote
Near Maximum Distance Separable Code
This is on topic: Near MDS codes are said to have applications in combinatorics and cryptography.
Near MDS codes are "almost MDS" in parameters and MDS codes are directly related to ...
4
votes
Accepted
Is there an algebra group (or ring) in which computing the inverse element is hard without some trapdoor information?
Trapdoor groups with infeasible inversion have been considered in several papers since the Master's thesis of Hohenberger. They were considered a hypothetical assumption for a long time, but two ...
Top 50 recent answers are included
Related Tags
finite-field × 379elliptic-curves × 109
aes × 45
group-theory × 40
discrete-logarithm × 36
modular-arithmetic × 25
algorithm-design × 17
secret-sharing × 17
diffie-hellman × 16
hash × 14
rsa × 14
s-boxes × 13
elliptic-curve-generation × 13
number-theory × 11
cryptanalysis × 10
complexity × 9
rijndael × 9
implementation × 8
prime-numbers × 8
pairings × 8
lfsr × 8
encryption × 7
block-cipher × 7
gcm × 7
prime-field × 7