Public-key encryption schemes | Code-based cryptography | Post-quantum cryptography

McEliece cryptosystem

In cryptography, the McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece. It was the first such scheme to use randomization in the encryption process. The algorithm has never gained much acceptance in the cryptographic community, but is a candidate for "post-quantum cryptography", as it is immune to attacks using Shor's algorithm and – more generally – measuring coset states using Fourier sampling. The algorithm is based on the hardness of decoding a general linear code (which is known to be NP-hard). For a description of the private key, an error-correcting code is selected for which an efficient decoding algorithm is known, and which is able to correct errors. The original algorithm uses binary Goppa codes (subfield codes of geometric Goppa codes of a genus-0 curve over finite fields of characteristic 2); these codes can be efficiently decoded, thanks to an algorithm due to Patterson. The public key is derived from the private key by disguising the selected code as a general linear code. For this, the code's generator matrix is perturbated by two randomly selected invertible matrices and (see below). Variants of this cryptosystem exist, using different types of codes. Most of them were proven less secure; they were broken by . McEliece with Goppa codes has resisted cryptanalysis so far. The most effective attacks known use information-set decoding algorithms. A 2008 paper describes both an attack and a fix. Another paper shows that for quantum computing, key sizes must be increased by a factor of four due to improvements in information set decoding. The McEliece cryptosystem has some advantages over, for example, RSA. The encryption and decryption are faster. For a long time, it was thought that McEliece could not be used to produce signatures. However, a signature scheme can be constructed based on the Niederreiter scheme, the dual variant of the McEliece scheme. One of the main disadvantages of McEliece is that the private and public keys are large matrices. For a standard selection of parameters, the public key is 512 kilobits long. (Wikipedia).

Video thumbnail

What Is Quantum Computing | Quantum Computing Explained | Quantum Computer | #Shorts | Simplilearn

🔥Explore Our Free Courses With Completion Certificate by SkillUp: https://www.simplilearn.com/skillup-free-online-courses?utm_campaign=QuantumComputingShorts&utm_medium=ShortsDescription&utm_source=youtube Quantum computing is a branch of computing that focuses on developing computer tech

From playlist #Shorts | #Simplilearn

Video thumbnail

Other Public Key Cryptosystems: Part 1

Fundamental concepts of Diffie-Hellman Key exchange are discussed. ElGamal Cryptosystem is presented. Elliptic curves are Analyzed.

From playlist Network Security

Video thumbnail

Kritin Lauter, Supersingular isogeny graphs in cryptography

VaNTAGe Seminar, September 20, 2022 License: CC-BY-NC-SA Some of the papers mentioned in this talk: Charles, Goren, Lauter 2007: https://doi.org/10.1007/s00145-007-9002-x Mackenzie 2008: https://doi.org/10.1126/science.319.5869.1481 Pizer 1990: https://doi.org/10.1090/S0273-0979-1990-15

From playlist New developments in isogeny-based cryptography

Video thumbnail

Seminar on Applied Geometry and Algebra (SIAM SAGA): Gretchen Matthews

Title: Multivariate Goppa Codes Speaker: Gretchen Matthews, Virginia Tech Date: Tuesday, May 10, 2022 at 11:00am Eastern Abstract: Goppa codes were introduced in 1971 by V. D. Goppa using a univariate polynomial g(x), called a generator polynomial, over a finite field. Properties of the G

From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)

Video thumbnail

Asymmetric Cryptosystems - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

Video thumbnail

Other Public Key Cryptosystems: Part 2

Fundamental concepts of Diffie-Hellman Key exchange are discussed. ElGamal Cryptosystem is presented. Elliptic curves are Analyzed.

From playlist Network Security

Video thumbnail

Alain Couvreur - Comment domestiquer les codes de Goppa sauvages?

Le schéma de McEliece est un schéma de chiffrement basé sur les codes correcteurs d'erreurs dont la sécurité repose sur la difficulté à décoder un code aléatoire. Parmi les différentes familles de codes algébriques proposées pour ce schéma, les codes de Goppa classiques sont les seuls à ré

From playlist Journées Codage et Cryptographie 2014

Video thumbnail

One Way Function - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

Video thumbnail

26C3: Yes We Cant - on kleptography and cryptovirology 5/6

Clip 5/6 Speaker: Moti Yung In this talk I will survey some of the results (with Adam Young) on Cryptovirology (the art of employing public key cryptography maliciously as part of a malware attack, such as in ransomware) and the related Kleptography (the art of embedding cryptographic

From playlist 26C3: Here be dragons day 3

Video thumbnail

Challenge Question - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

Video thumbnail

Classical Cryptosystems

Cryptography and Network Security by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in

From playlist Computer - Cryptography and Network Security

Video thumbnail

Cryptography - Seminar 1 - Foundations

This seminar series is about the mathematical foundations of cryptography. In the first seminar Eleanor McMurtry introduces cryptography and explains some of the problems that need to be solved in order to develop proper foundations. The webpage for this seminar is https://lnor.net/uc-sem

From playlist Metauni

Video thumbnail

Summary - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

Video thumbnail

Stanford Seminar - The Evolution of Public Key Cryptography

EE380: Computer Systems Colloquium Seminar The Evolution of Public Key Cryptography Speaker: Martin Hellman, Stanford EE (Emeritus) While public key cryptography is seen as revolutionary, after this talk you might wonder why it took Whit Diffie, Ralph Merkle and Hellman so long to discov

From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series

Related pages

Reed–Solomon error correction | Probabilistic encryption | Binary Goppa code | Generator matrix | Post-quantum cryptography | Randomized algorithm | Linear code | Decoding methods | Digital signature | Goppa code | Niederreiter cryptosystem | Embarrassingly parallel | Permutation matrix | Invertible matrix | Cryptography | Shor's algorithm | Quantum computing