The following pages link to Philippe Gaborit (Q398978):
Displaying 50 items.
- (Q193608) (redirect page) (← links)
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes (Q398980) (← links)
- A code-based group signature scheme (Q510499) (← links)
- There is no Euclidean self-dual quaternary [18,9,7] code (Q622783) (← links)
- \(s\)-extremal additive \(\mathbb F_4\) codes (Q874423) (← links)
- Binary templates for comma-free DNA codes (Q876480) (← links)
- Construction of extremal Type II codes over \(\mathbb{Z}_4\). (Q1299900) (← links)
- Niemeier lattices and Type II codes over \(\mathbb{Z}_4\) (Q1301825) (← links)
- 2-modular lattices from ternary codes. (Q1396433) (← links)
- Experimental constructions of self-dual codes (Q1400981) (← links)
- Designs and self-dual codes with long shadows. (Q1427005) (← links)
- On the classification of extremal even formally self-dual codes (Q1591639) (← links)
- Quadratic double circulant codes over fields (Q1604572) (← links)
- Type II codes over \(\mathbb F_4\) (Q1609396) (← links)
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes (Q1647553) (← links)
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory (Q1673584) (← links)
- Identity-based encryption from codes with rank metric (Q1675201) (← links)
- Gabidulin matrix codes and their application to small ciphertext size cryptosystems (Q1746843) (← links)
- Linear constructions for DNA codes (Q1779298) (← links)
- Construction of new extremal unimodular lattices (Q1826971) (← links)
- Decoding binary \(R\)(2,5) by hand (Q1869245) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- Cryptanalysis of the rank preserving signature (Q2149784) (← links)
- A practicable timing attack against HQC and its countermeasure (Q2158241) (← links)
- A rank metric code-based group signature scheme (Q2163756) (← links)
- The rank-based cryptography library (Q2163759) (← links)
- A correction to a code-based blind signature scheme (Q2163765) (← links)
- Dual-Ouroboros: an improvement of the McNie scheme (Q2176294) (← links)
- Cryptanalysis of a code-based one-time signature (Q2200516) (← links)
- Durandal: a rank metric based signature scheme (Q2292713) (← links)
- Preventing timing attacks against RQC using constant time decoding of Gabidulin codes (Q2302145) (← links)
- Cryptanalysis of a rank-based signature with short public keys (Q2306903) (← links)
- Hyper-bent functions and cyclic codes (Q2368654) (← links)
- On the construction of dense lattices with a given automorphisms group (Q2372823) (← links)
- Construction of bent functions via Niho power functions (Q2497965) (← links)
- A bound for certain \(s\)-extremal lattices and codes (Q2642848) (← links)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353) (← links)
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem (Q2698342) (← links)
- (Q2717202) (← links)
- (Q2741395) (← links)
- (Q2741438) (← links)
- RankSynd a PRNG Based on Rank Metric (Q2802599) (← links)
- A Code-Based Undeniable Signature Scheme (Q2870088) (← links)
- Sealing the Leak on Classical NTRU Signatures (Q2938670) (← links)
- RankSign: An Efficient Signature Algorithm Based on the Rank Metric (Q2938678) (← links)
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes (Q2976445) (← links)
- On the Complexity of the Rank Syndrome Decoding Problem (Q2977019) (← links)
- A New Class of Codes for Boolean Masking of Cryptographic Computations (Q2989794) (← links)
- Full Cryptanalysis of the Chen Identification Protocol (Q3102782) (← links)
