Efficient post-quantum undeniable signature on 64-bit ARM

DOI10.1007/978-3-319-72565-9_14zbMATH Open1384.94071OpenAlexW2779177750MaRDI QIDQ1746974FDOQ1746974

Amir Jalali, Mehran Mozaffari-Kermani, Reza Azarderakhsh

Publication date: 26 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_14

zbMATH Keywords

undeniable signatureARM assemblysupersingular isogeny-based cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Montgomery inverse and its applications
• Mathematics of public key cryptography.
• Cryptographic hash functions from expander graphs
• Constructing elliptic curve isogenies in quantum subexponential time
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Undeniable Signatures
• New Convertible Undeniable Signature Schemes
• Universally Composable Undeniable Signature
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Constructing supersingular elliptic curves
• Isogeny-Based Quantum-Resistant Undeniable Signatures
• A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
• Post-Quantum Security Models for Authenticated Encryption
• A Code-Based Undeniable Signature Scheme
• On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
• Identification protocols and signature schemes based on supersingular isogeny problems

Cited In (3)

• Verifying post-quantum signatures in 8 kB of RAM
• ARMed SPHINCS
• Quantum Cryptography: Key Distribution and Beyond

This page was built for publication: Efficient post-quantum undeniable signature on 64-bit ARM

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