No article text was recorded for this version.
key size optimization
Version 1 of 19 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Key reduction of McEliece's cryptosystem using list decoding
- Blog: On McEliece-Type Cryptosystems Using Self-Dual Codes With Large Minimum Weight
- Blog: Quasi-Dyadic CFS Signatures
- Blog: On McEliece type cryptosystems using self-dual codes with large minimum weight
- Blog: LowMS: a new rank metric code-based KEM without ideal structure
- Blog: Interleaving Loidreau's Rank-Metric Cryptosystem
- Blog: On Decoding and Applications of Interleaved Goppa Codes
- Blog: Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems with Smaller Sizes
- Blog: Compact McEliece Keys from Goppa Codes
History & citation
Current · Permanent link
- This direction split from algebraic structure vulnerability (56% overlap)
- This direction split from Compact Public Keys for Post-Quantum Code-Based Cryptography (67% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_key_size_optimization_87dfd023,
title = {key size optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/key-size-optimization/rdr_87dfd0235ed64574ae415a1e1b77dc18},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_key_size_optimization_87dfd023_v1,
title = {key size optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/key-size-optimization/rdr_87dfd0235ed64574ae415a1e1b77dc18/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}