Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems

DOI10.33048/DAIO.2024.31.772MaRDI QIDQ6648344

Ekaterina Sergeevna Malygina, Alexander Shaporenko, Aleksandr Olegovich Bakharev, Aleksandr Kutsenko, Nikita Sergeevich Kolesnikov, Irina Sergeevna Khil'chuk, Natalia Tokareva, S. A. Novoselov

Publication date: 4 December 2024

Published in: Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

zbMATH Keywords

isogenyelliptic curveerror-correcting codepost-quantum cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Isogeny (14K02) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards practical key exchange from ordinary isogeny graphs
• Secure integration of asymmetric and symmetric encryption schemes
• Hash functions from superspecial genus-2 curves using Richelot isogenies
• Orienting supersingular isogeny graphs
• Optimal strategies for CSIDH
• Tighter proofs of CCA security in the quantum random oracle model
• Genus two isogeny cryptography
• Analysis of Information Set Decoding for a Sub-linear Error Weight
• The number of curves of genus two with elliptic differentials.
• A new paradigm for public key identification
• Descent via (3,3)-isogeny on Jacobians of genus 2 curves
• On the inherent intractability of certain coding problems (Corresp.)
• Is code equivalence easy to decide?
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Large torsion subgroups of split Jacobians of curves of genus two or three
• QC-MDPC Decoders with Several Shades of Gray
• On the Security of OSIDH
• Computing isogenies between Jacobians of curves of genus 2 and 3
• Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Efficient Encryption From Random Quasi-Cyclic Codes
• Constructing elliptic curve isogenies in quantum subexponential time
• Cryptanalysis of the Sidelnikov Cryptosystem

This page was built for publication: Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems

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