Efficient zero-knowledge authentication based on a linear algebra problem MinRank

DOI10.1007/3-540-45682-1_24MaRDI QIDQ4474187zbMATH OpenFDO

Authors Nicolas Courtois

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2248/22480402.htm

zbMATH Keywords

entity authenticationgroup signaturesidentificationMinRank problemmultivariate cryptographyNP-complete problemsrank-distance codesring signaturessyndrome decoding (SD)zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Cryptanalysis of MinRank
• A new identification scheme based on syndrome decoding
• A new paradigm for public key identification
• Full cryptanalysis of the Chen identification protocol
• MR-DSS -- smaller MinRank-based (ring-)signatures

Cited in

(27)

• A new encryption scheme for multivariate quadratic systems
• 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
• From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
• A Variant of the F4 Algorithm
• Efficient zero-knowledge identification based on matrix completion problem
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• On the complexity of the generalized MinRank problem
• A multivariate identity-based broadcast encryption with applications to the Internet of Things
• Revisiting algebraic attacks on MinRank and on the rank decoding problem
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow
• Puncturable signature: a generic construction and instantiations
• MinRank in the head. Short signatures from zero-knowledge proofs
• Take your MEDS: digital signatures from matrix code equivalence
• MR-DSS -- smaller MinRank-based (ring-)signatures
• Algebraic relation of three MinRank algebraic modelings
• Building MPCitH-based signatures from MQ, MinRank, and rank SD
• Solving systems of algebraic equations over finite commutative rings and applications
• Dual support decomposition in the head: shorter signatures from Rank SD and MinRank
• Smaller public keys for MinRank-based schemes
• On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
• Practical and theoretical cryptanalysis of VOX
• The complexity of the SupportMinors Modeling for the MinRank problem
• On the complexity of the relative eigenvector problem
• Public-key encryption from the MinRank problem
• On the complexity, tractability and group theoretic applications of the relative eigenvector problem

This page was built for publication: Efficient zero-knowledge authentication based on a linear algebra problem MinRank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474187)