Full Cryptanalysis of the Chen Identification Protocol

DOI10.1007/978-3-642-25405-5_3zbMath1290.94074OpenAlexW167950393MaRDI QIDQ3102782

Julien Schrek, Gilles Zémor, Philippe Gaborit

Publication date: 25 November 2011

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25405-5_3

zbMATH Keywords

cryptanalysiszero-knowledgerank metricChen protocol

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

A rank metric code-based group signature scheme ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ MR-DSS -- smaller MinRank-based (ring-)signatures ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ A Practical Group Signature Scheme Based on Rank Metric

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of codes with maximum rank distance
• Improved identification schemes based on error-correcting codes
• New technique for decoding codes in the rank metric and its cryptography applications
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Isometries for rank distance and permutation group of gabidulin codes
• Security Bounds for the Design of Code-Based Cryptosystems
• On the inherent intractability of certain coding problems (Corresp.)
• A new identification scheme based on syndrome decoding

This page was built for publication: Full Cryptanalysis of the Chen Identification Protocol