Efficient post-quantum undeniable signature on 64-bit ARM
From MaRDI portal
Publication:1746974
DOI10.1007/978-3-319-72565-9_14zbMath1384.94071OpenAlexW2779177750MaRDI QIDQ1746974
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- Post-Quantum Security Models for Authenticated Encryption
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- A Code-Based Undeniable Signature Scheme
- New Convertible Undeniable Signature Schemes
- Mathematics of Public Key Cryptography
- Isogeny-Based Quantum-Resistant Undeniable Signatures
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Undeniable Signatures
- Universally Composable Undeniable Signature
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Montgomery inverse and its applications
- Constructing elliptic curve isogenies in quantum subexponential time
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- Identification protocols and signature schemes based on supersingular isogeny problems
This page was built for publication: Efficient post-quantum undeniable signature on 64-bit ARM
