High-Speed High-Security Signatures
From MaRDI portal
Publication:3172970
DOI10.1007/978-3-642-23951-9_9zbMath1321.94039OpenAlexW2115148615WikidataQ56099677 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
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Threshold Schnorr with stateless deterministic signing from standard assumptions, DualRing: generic construction of ring signatures with efficient instantiations, Fast cryptography in genus 2, Kummer versus Montgomery Face-off over Prime Order Fields, Signed Diffie-Hellman key exchange with tight security, Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures, LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4, Online Template Attack on ECDSA:, Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves, A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA), Decaf: Eliminating Cofactors Through Point Compression, Post-quantum key-blinding for authentication in anonymity networks, Generalised Mersenne numbers revisited, The complete cost of cofactor \(h=1\), The Simplest Protocol for Oblivious Transfer, TweetNaCl: A Crypto Library in 100 Tweets, High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers, The random oracle model: a twenty-year retrospective, Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA, From Identification to Signatures, Tightly: A Framework and Generic Transforms, All shall FA-LLL: breaking CT-RSA 2022 and CHES 2022 infective countermeasures with lattice-based fault attacks, Provably unforgeable threshold EdDSA with an offline participant and trustless setup, Half-aggregation of Schnorr signatures with tight reductions, Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0, Protecting the most significant bits in scalar multiplication algorithms, Improved straight-line extraction in the random oracle model with applications to signature aggregation, Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4, The state of the union: union-only signatures for data aggregation, Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions, A formal security analysis of the Signal messaging protocol, Speeding-up verification of digital signatures, EPG-representations with Small Grid-Size, How to (pre-)compute a ladder -- improving the performance of X25519 and X448, Missing a trick: Karatsuba variations, An optimal representation for the trace zero subgroup, On Cycles of Pairing-Friendly Elliptic Curves, High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions, Sandy2x: New Curve25519 Speed Records, On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments, Four-dimensional Gallant-Lambert-Vanstone scalar multiplication, Kummer for genus one over prime-order fields, Optimal Security Proofs for Signatures from Identification Schemes, Simple Schnorr multi-signatures with applications to bitcoin, Signed (group) Diffie-Hellman key exchange with tight security, Efficient arithmetic in (pseudo-)Mersenne prime order fields, Point compression for the trace zero subgroup over a small degree extension field, Bitcoin security with a twisted Edwards curve, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
