A new identification algorithm

DOI10.1007/BFB0032363MaRDI QIDQ5235427zbMATH OpenOpenAlexFDO

Authors Kefei Chen

Publication date 10 October 2019

Published in Cryptography: Policy and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0032363

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 789825
• On the Non - Existence of Perfect Codes with Rank Distance
• New technique for decoding codes in the rank metric and its cryptography applications
• Publication:4886141
• Theory of codes with maximum rank distance

Cites work

• A new identification scheme based on syndrome decoding
• On the inherent intractability of certain coding problems (Corresp.)
• Theory of codes with maximum rank distance

Cited in

(7)

• A gapless code-based hash proof system based on RQC and its applications
• scientific article; zbMATH DE number 5864477 (Why is no real title available?)
• A New Human Identification Protocol and Coppersmith’s Baby-Step Giant-Step Algorithm
• A NEW BATCH IDENTIFICATION SCHEME
• scientific article; zbMATH DE number 4112523 (Why is no real title available?)
• MRD hashing
• A direct electrifying algorithm for backbone identification

This page was built for publication: A new identification algorithm

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