High-Speed High-Security Signatures

From MaRDI portal
Publication:3172970


DOI10.1007/978-3-642-23951-9_9zbMath1321.94039WikidataQ56099677 ScholiaQ56099677MaRDI QIDQ3172970

Daniel J. Bernstein, Tanja Lange, Peter Schwabe, Niels Duif, Bo-Yin Yang

Publication date: 7 October 2011

Published in: Cryptographic Hardware and Embedded Systems – CHES 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23951-9_9


94A60: Cryptography

14G50: Applications to coding theory and cryptography of arithmetic geometry

94-04: Software, source code, etc. for problems pertaining to information and communication theory


Related Items

EPG-representations with Small Grid-Size, High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions, LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4, Online Template Attack on ECDSA:, Generalised Mersenne numbers revisited, On Cycles of Pairing-Friendly Elliptic Curves, Bitcoin security with a twisted Edwards curve, Fast cryptography in genus 2, Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0, An optimal representation for the trace zero subgroup, Missing a trick: Karatsuba variations, Four-dimensional Gallant-Lambert-Vanstone scalar multiplication, Signed Diffie-Hellman key exchange with tight security, Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures, High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers, The random oracle model: a twenty-year retrospective, How to (pre-)compute a ladder -- improving the performance of X25519 and X448, On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments, Signed (group) Diffie-Hellman key exchange with tight security, Efficient arithmetic in (pseudo-)Mersenne prime order fields, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model, Threshold Schnorr with stateless deterministic signing from standard assumptions, DualRing: generic construction of ring signatures with efficient instantiations, Post-quantum key-blinding for authentication in anonymity networks, The complete cost of cofactor \(h=1\), A formal security analysis of the Signal messaging protocol, Speeding-up verification of digital signatures, Kummer for genus one over prime-order fields, Simple Schnorr multi-signatures with applications to bitcoin, Point compression for the trace zero subgroup over a small degree extension field, Sandy2x: New Curve25519 Speed Records, Optimal Security Proofs for Signatures from Identification Schemes, The Simplest Protocol for Oblivious Transfer, TweetNaCl: A Crypto Library in 100 Tweets, From Identification to Signatures, Tightly: A Framework and Generic Transforms, Decaf: Eliminating Cofactors Through Point Compression