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

DOI10.1007/978-3-031-29371-9_21OpenAlexW4361854651MaRDI QIDQ6134232

Yusuke Yoshida, Ichiro Iwata, 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Ternary Syndrome Decoding with large weight
• Constructions of good entanglement-assisted quantum error correcting codes
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
• Durandal: a rank metric based signature scheme
• Decoding One Out of Many
• An Efficient Attack on All Concrete KKS Proposals
• Trapdoors for hard lattices and new cryptographic constructions
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• A digital signature scheme based on random error-correcting codes
• Orthogonal Matrices Over Finite Fields

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