McEliece

swMATH2076MaRDI QIDQ14620FDOQ14620

Author name not available (Why is that?)

Described by source

• Practical Power Analysis Attacks on Software Implementations of McEliece

Cited In (only showing first 100 items - show all)

• A code-based signature scheme from the Lyubashevsky framework
• Variant of Niederreiter-based signature scheme for blockchain technology
• Moderate-density parity-check codes from projective bundles
• Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
• McEliece Cryptosystem Implementation: Theory and Practice
• Cryptographic one-way function based on boson sampling
• Masking Large Keys in Hardware: A Masked Implementation of McEliece
• An improved algorithm for learning sparse parities in the presence of noise
• Block encryption of quantum messages
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
• Performance bounds for QC-MDPC codes decoders
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
• On the design and security of Lee metric McEliece cryptosystems
• Construction of binary Hadamard codes and their \(s\)-PD sets
• Monomial codes seen as invariant subspaces
• Quantum public-key encryption schemes based on conjugate coding
• Variations of the McEliece cryptosystem
• Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography
• Improved cryptanalysis of rank metric schemes based on Gabidulin codes
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• Encryption scheme based on expanded Reed-Solomon codes
• On the dimension of the subfield subcodes of 1-point Hermitian codes
• A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes
• Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
• Mathematical problems in cryptology
• Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
• TinyKeys: a new approach to efficient multi-party computation
• On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
• On the subfield subcodes of Hermitian codes
• A rank metric code-based group signature scheme
• More constructions of lossy and correlation-secure trapdoor functions
• LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
• On the security of a Loidreau rank metric code based encryption scheme
• The rank-based cryptography library
• LESS is More: Code-Based Signatures Without Syndromes
• Statistical Decoding of Codes over $\mathbb{F}_q$
• The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
• Fast polynomial inversion for post quantum QC-MDPC cryptography
• Computational fuzzy extractors
• A reaction attack on the QC-LDPC McEliece cryptosystem
• A pseudorandom number generator based on worst-case lattice problems
• Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
• Side Channels in the McEliece PKC
• Modified GPT PKC with right scrambler
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• Inner-product functional encryption from random linear codes: trial and challenges
• Algebraic geometry codes and some applications
• Semantic Security and Indistinguishability in the Quantum World
• Efficient Compression of SIDH Public Keys
• Detection and recognition of a binary linear code
• Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes
• Invertible matrices over some quotient rings: identification, generation, and analysis
• Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\)
• Designing a Rank Metric Based McEliece Cryptosystem
• Cryptanalysis of LEDAcrypt
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• Using low-density parity-check codes to improve the McEliece cryptosystem
• A lattice-based McEliece scheme for encryption and signature
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cryptanalysis of a code-based full-time signature
• Identity based identification from algebraic coding theory
• The dual geometry of Hermitian two-point codes
• Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices
• Enumeration of inequivalent irreducible Goppa codes
• Title not available (Why is that?)
• Polynomial Time Attack on Wild McEliece over Quadratic Extensions
• Structural cryptanalysis of McEliece schemes with compact keys
• Decoding One Out of Many
• A fuzzy vault scheme
• Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
• A Distinguisher for High-Rate McEliece Cryptosystems
• On constant-time QC-MDPC decoders with negligible failure rate
• Optimized and secure implementation of ROLLO-I
• Title not available (Why is that?)
• A framework for cryptographic problems from linear algebra
• Enhanced public key security for the McEliece cryptosystem
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
• Extended multivariate public key cryptosystems with secure encryption function
• Parallel-CFS
• ECC\(^2\): error correcting code and elliptic curve based cryptosystem
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• On the decoding of binary cyclic codes with the Newton identities
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Proof of conjectures on the true dimension of some binary Goppa codes
• Cardinal rank metric codes over Galois rings
• Efficient representation of binary nonlinear codes: constructions and minimum distance computation
• Lattice polly cracker cryptosystems
• Cryptanalysis of an E0-like combiner with memory
• More on average case vs approximation complexity
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
• The non-gap sequence of a subcode of a generalized Reed-Solomon code
• On checkable codes in group algebras
• Статистические характеристики весовых спектров случайных линейных кодов над $\mathrm{GF}(p)$
• Practical cryptanalysis of ISO 9796-2 and EMV signatures
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory

This page was built for software: McEliece