scispace - formally typeset
Book ChapterDOI

Efficient Implementation of Hybrid Encryption from Coding Theory

Pierre-Louis Cayrel, +4 more
- 10 Apr 2017 - 
- pp 254-264
Reads0
Chats0
TLDR
This work presents an efficient implementation of the Hybrid Encryption scheme based on the Niederreiter PCKS proposed by E. Persichetti.
About: 
This article is published in Computer Standards & Interfaces.The article was published on 2017-04-10. It has received 5 citations till now. The article focuses on the topics: Probabilistic encryption & Random oracle.

read more

Citations
More filters
Book ChapterDOI

LEDAkem: A Post-quantum Key Encapsulation Mechanism Based on QC-LDPC Codes

Marco Baldi, +4 more
TL;DR: This work presents a new code-based key encapsulation mechanism (KEM) called LEDAkem, built on the Niederreiter cryptosystem and relies on quasi-cyclic low-density parity-check codes as secret codes, providing high decoding speeds and compact keypairs.
Posted Content

LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes

Marco Baldi, +4 more
- 26 Jan 2018 - 
TL;DR: In this article, a code-based key encapsulation mechanism (KEM) called LEDAkem is presented, which relies on quasi-cyclic low-density parity-check codes as secret codes, providing high decoding speeds and compact keypairs.
Journal ArticleDOI

A privacy-preserving code-based authentication protocol for Internet of Things

Noureddine Chikouche, +3 more
- 18 Sep 2019 - 
TL;DR: It is demonstrated that Wang et al.
Dissertation

On the Development and Standardisation of Post-Quantum Cryptography - A Synopsis of the NIST Post-Quantum Cryptography Standardisation Process, its Incentives, and Submissions

Maja Worren Legernæs
TL;DR: This paper gives an overview of the most recent developments towards post-quantum cryptography standardisation, and the motivations behind it, as well as looking into the most promising quantum-resistant cryptography families, and their mathematical construction.
Journal ArticleDOI

A code-based hybrid signcryption scheme

Martin Regan
- 01 Jan 2023 - 
TL;DR: In this paper , a code-based signcryption tag-based scheme was proposed, which uses an equivalent subcode as a public code for the receiver, making the NP-completeness of the subcode equivalence problem be one of their main security assumptions.
References
More filters
Journal ArticleDOI

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Peter W. Shor
- 01 Oct 1997 - 
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Proceedings ArticleDOI

Algorithms for quantum computation: discrete logarithms and factoring

Peter W. Shor
TL;DR: Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

A Public-Key Cryptosystem Based On Algebraic Coding Theory

Robert J. McEliece
Journal ArticleDOI

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

Ronald Cramer, +1 more
- 01 Jan 2004 - 
TL;DR: In this paper, a new public-key encryption scheme, along with several variants, is proposed and analyzed, and its variants are proved secure against adaptive chosen ciphertext attack under standard intractability assumptions.
Posted Content

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack.

Ronald Cramer, +1 more
- 01 Jan 2001 - 
TL;DR: A new public-key encryption scheme, along with several variants, is proposed and analyzed that appear to be the first public- key encryption schemes in the literature that are simultaneously practical and provably secure.