High-speed high-security signatures

DOI10.1007/978-3-642-23951-9_9MaRDI QIDQ3172970zbMATH OpenOpenAlexWikidataFDO

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

Publication date 7 October 2011

Published in Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings (Search for Journal in Brave)

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

zbMATH Keywords

Edwards curvesspeedsignaturesElliptic curvesfoolproof session keyssoftware side channels

Mathematics Subject Classification ID

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)

Recommendations

• Software speed records for lattice-based signatures
• High-speed signatures from standard lattices
• Short signatures from the Weil pairing
• Public Key Cryptography - PKC 2006
• scientific article; zbMATH DE number 2081084

Cited in

(65)

• An optimal representation for the trace zero subgroup
• A performance boost for hash-based signatures
• Kummer for genus one over prime-order fields
• Kummer versus Montgomery Face-off over Prime Order Fields
• Fast cryptography in genus 2
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• DualRing: generic construction of ring signatures with efficient instantiations
• Improved straight-line extraction in the random oracle model with applications to signature aggregation
• Optimal security proofs for signatures from identification schemes
• Speeding-up verification of digital signatures
• The random oracle model: a twenty-year retrospective
• The simplest protocol for oblivious transfer
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• Software speed records for lattice-based signatures
• Fast elliptic curve cryptography in OpenSSL
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• The complete cost of cofactor \(h=1\)
• Advanced Signatures
• Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
• Signed Diffie-Hellman key exchange with tight security
• High-performance implementation of elliptic curve cryptography using vector instructions
• Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0
• Implementing CFS
• Missing a trick: Karatsuba variations
• Bitcoin security with a twisted Edwards curve
• A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)
• Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
• On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
• cMix: mixing with minimal real-time asymmetric cryptographic operations
• Point compression for the trace zero subgroup over a small degree extension field
• qDSA: small and secure digital signatures with curve-based Diffie-Hellman key pairs
• Signed (group) Diffie-Hellman key exchange with tight security
• TweetNaCl: A Crypto Library in 100 Tweets
• Cryptographic Hardware and Embedded Systems - CHES 2004
• High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
• Decaf: eliminating cofactors through point compression
• Speed optimizations in bitcoin key recovery attacks
• Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
• Provably unforgeable threshold EdDSA with an offline participant and trustless setup
• A formal security analysis of the Signal messaging protocol
• On Cycles of Pairing-Friendly Elliptic Curves
• Surnaming schemes, fast verification, and applications to SGX technology
• How to (pre-)compute a ladder -- improving the performance of X25519 and X448
• 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
• Generalised Mersenne numbers revisited
• Sandy2x: new Curve25519 speed records
• Online template attack on ECDSA: extracting keys via the other side
• LMS vs XMSS: comparison of stateful hash-based signature schemes on ARM Cortex-M4
• Post-quantum key-blinding for authentication in anonymity networks
• Protecting the most significant bits in scalar multiplication algorithms
• Simple Schnorr multi-signatures with applications to bitcoin
• EPG-representations with Small Grid-Size
• Batch binary Weierstrass
• Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
• $$\text {Muckle}+$$: End-to-End Hybrid Authenticated Key Exchanges
• Accelerating SLH-DSA by two orders of magnitude with a single hash unit
• Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption
• \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
• Half-aggregation of Schnorr signatures with tight reductions
• A holistic security analysis of Monero transactions
• Symmetric signcryption and E2EE group messaging in Keybase
• The state of the union: union-only signatures for data aggregation
• Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4

This page was built for publication: High-speed high-security signatures

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