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

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

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

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

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)