Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields

DOI10.1007/978-3-031-29371-9_21MaRDI QIDQ6134232zbMATH OpenOpenAlexFDO

Authors Ichiro Iwata, Yusuke Yoshida, Keisuke Tanaka

Publication date 21 August 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-29371-9_21

zbMATH Keywords

code-based cryptographyGramiandigital signature scheme(U,U+V)-code problem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)

Cites work

• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• A digital signature scheme based on random error-correcting codes
• An efficient attack on all concrete KKS proposals
• Constructions of good entanglement-assisted quantum error correcting codes
• Decoding one out of many
• Durandal: a rank metric based signature scheme
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Orthogonal Matrices Over Finite Fields
• Ternary Syndrome Decoding with large weight
• Trapdoors for hard lattices and new cryptographic constructions
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes

This page was built for publication: Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields

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