Code-Based Key Encapsulation from McEliece’s Cryptosystem
From MaRDI portal
Publication:4628516
DOI10.1007/978-3-319-72453-9_36zbMATH Open1501.94050arXiv1706.06306OpenAlexW2704359996MaRDI QIDQ4628516FDOQ4628516
Authors: Edoardo Persichetti
Publication date: 14 March 2019
Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)
Abstract: In this paper we show that it is possible to extend the framework of Persichetti's code-based framework and create a secure KEM based on the McEliece protocol. This provides greater flexibility in the application of coding theory as a basis for cryptographic purposes.
Full work available at URL: https://arxiv.org/abs/1706.06306
Recommendations
- Publication:3202943
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- McEliece Cryptosystem Implementation: Theory and Practice
- Code-based cryptography
- Code-based cryptography
- scientific article; zbMATH DE number 2154508
- Code-based public-key cryptosystems and their applications
- Toward secure implementation of McEliece decryption
- CAKE: CODE-based algorithm for key encapsulation
Cited In (5)
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack
- DAGS: reloaded revisiting dyadic key encapsulation
- Cryptanalysis of a rank-based signature with short public keys
- Two new module-code-based KEMs with rank metric
This page was built for publication: Code-Based Key Encapsulation from McEliece’s Cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628516)