The following pages link to McEliece (Q14620):
Displaying 48 items.
- A Novel Niederreiter-like cryptosystem based on the (<i>u</i>|<i>u</i> + <i>υ</i>)-construction codes (Q5021116) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Cryptanalysis of ITRU (Q5025959) (← links)
- Matrix Lie group as an algebraic structure for NTRU like cryptosystem (Q5034554) (← links)
- About Low DFR for QC-MDPC Decoding (Q5041211) (← links)
- (Q5041362) (← links)
- LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
- Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security (Q5048972) (← links)
- Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes (Q5066537) (← links)
- ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES (Q5071451) (← links)
- IND-CCA2 secure McEliece-type modification in the standard model (Q5071466) (← links)
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes (Q5071487) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- (Q5110100) (← links)
- Quantum Cryptography: Key Distribution and Beyond (Q5134949) (← links)
- (Q5146141) (← links)
- (Q5147374) (← links)
- ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM (Q5151274) (← links)
- Статистические характеристики весовых спектров случайных линейных кодов над $\mathrm{GF}(p)$ (Q5152339) (← links)
- Overview of the Mceliece Cryptosystem and its Security (Q5176887) (← links)
- An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC (Q5197653) (← links)
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks (Q5199224) (← links)
- A Secure and Efficient Code-Based Signature Scheme (Q5205021) (← links)
- Hybrid Encryption from McEliece Cryptosystem with Pseudo-random Error Vector (Q5212030) (← links)
- The Use of the Direct Sum Decomposition Algorithm for Analyzing the Strength of Some Mceliece Type Cryptosystems (Q5212525) (← links)
- Error-correcting codes and post-quantum cryptography (Q5224449) (← links)
- (Q5241156) (← links)
- (Q5241158) (← links)
- An Efficient Decoding of Goppa Codes for the McEliece Cryptosystem (Q5259242) (← links)
- Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography (Q5267802) (← links)
- Deterministic root finding in finite fields (Q5270175) (← links)
- A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem (Q5280679) (← links)
- A Summary of McEliece-Type Cryptosystems and their Security (Q5295348) (← links)
- A Distinguisher for High-Rate McEliece Cryptosystems (Q5346326) (← links)
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes (Q5369878) (← links)
- Polynomial Time Attack on Wild McEliece over Quadratic Extensions (Q5418687) (← links)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036) (← links)
- Efficient Implementation of Hybrid Encryption from Coding Theory (Q5739039) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- On checkable codes in group algebras (Q5863515) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes (Q5871426) (← links)
- The security of the code-based signature scheme based on the Stern identification protocol (Q5871430) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Counting extended irreducible Goppa codes (Q5919602) (← links)
- Detection and recognition of a binary linear code (Q5939245) (← links)
