scientific article; zbMATH DE number 177612
From MaRDI portal
Publication:4037491
Recommendations
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Designing a Rank Metric Based McEliece Cryptosystem
- Reducible rank codes and their applications to cryptography
- On the edge-independence number and edge-covering number for regular graphs
- scientific article; zbMATH DE number 2154506
Cited in
(only showing first 100 items - show all)- Attacks and counter-attacks on the GPT public key cryptosystem
- Error and erasure correcting algorithms for rank codes
- Rough ideals under relations associated to fuzzy ideals
- Fast operations on linearized polynomials and their applications in coding theory
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- Generalized Gabidulin codes over fields of any characteristic
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Some new non-additive maximum rank distance codes
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.
- On the list decodability of self-orthogonal rank-metric codes
- Column scrambler for the GPT cryptosystem
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Mathematical problems in cryptology
- Fast decoding of Gabidulin codes
- Roos bound for skew cyclic codes in Hamming and rank metric
- Codes with the rank metric and matroids
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- On decoding additive generalized twisted Gabidulin codes
- An algebraic attack on rank metric code-based cryptosystems
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Encoding and decoding of several optimal rank metric codes
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis
- An algebraic approach to the rank support learning problem
- Extending two families of maximum rank distance codes
- Non-minimum tensor rank Gabidulin codes
- Security analysis of a cryptosystem based on subspace subcodes
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Equivalence and characterizations of linear rank-metric codes based on invariants
- On the security of a Loidreau rank metric code based encryption scheme
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- Puncturing maximum rank distance codes
- Mathematical models of modified crypto-code means of information protection based on coding theory schemes
- New rank codes based encryption scheme using partial circulant matrices
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
- Asymptotic behaviour of codes in rank metric over finite fields
- Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
- Cardinal rank metric codes over Galois rings
- New MRD codes from linear cutting blocking sets
- 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
- Enhanced public key security for the McEliece cryptosystem
- Modified GPT PKC with right scrambler
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Rank subcodes in multicomponent network coding
- Information security in a random network coding network
- On transform-domain error and erasure correction by Gabidulin codes
- On the Non - Existence of Perfect Codes with Rank Distance
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Improved list-decodability of random linear binary codes
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- Rank-metric codes and their applications
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- Skew differential Goppa codes and their application to McEliece cryptosystem
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Division algebras and MRD codes from skew polynomials
- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
- Distinguishing and recovering generalized linearized Reed-Solomon codes
- McEliece-type encryption based on Gabidulin codes with no hidden structure
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
- On the security of REDOG
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- Maximum flag-rank distance codes
- On the rank decoding problem over finite principal ideal rings
- Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes
- An upper-bound on the decoding failure probability of the LRPC decoder
- Two modifications for Loidreau's code-based cryptosystem
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Injective rank metric trapdoor functions with homogeneous errors
- Exceptional scattered sequences
- Linear complete symmetric rank-distance codes
- Security assessment of the LG cryptosystem
- Towards the classification of exceptional scattered polynomials
- A geometric invariant of linear rank-metric codes
- On perfect symmetric rank-metric codes
- Low-rank parity-check codes over finite commutative rings
- Analysis of REDOG: the Pad Thai attack
- New scattered subspaces in higher dimensions
- On the generalizations of the rank metric over finite chain rings
- The blockwise rank syndrome learning problem and its applications to cryptography
- The complexity of the SupportMinors Modeling for the MinRank problem
- Key attack on the ACDGV matrix encryption scheme
- Public-key encryption from the MinRank problem
- A minrank-based encryption scheme à la Alekhnovich-Regev
- Scattered polynomials: an overview on their properties, connections and applications
- Rank-metric codes over arbitrary fields: bounds and constructions
- Analysis of layered ROLLO-I: a BII-LRPC code-based KEM
- Using cyclic \((f,\sigma )\)-codes over finite chain rings to construct \(\mathbb{Z}_p\)- and \(\mathbb{F}_q[\![t]\!]\)-lattices
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- A geometric approach to rank metric codes and a classification of constant weight codes
- Wei-type duality theorems for rank metric codes
- Construction of self-dual matrix codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037491)