EdDSA for more curves

نویسندگان

  • Daniel J. Bernstein
  • Simon Josefsson
  • Tanja Lange
  • Peter Schwabe
  • Bo-Yin Yang
چکیده

• An integer n with c ≤ n ≤ b. Secret EdDSA scalars have exactly n+ 1 bits, with the top bit (the 2 position) always set and the bottom c bits always cleared. The original specification of EdDSA did not include this parameter: it implicitly took n = b−2. Choosing n sufficiently large is important for security: standard “kangaroo” attacks use approximately 1.36 √ 2n−c additions on average to determine an EdDSA secret key from an EdDSA public key.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Batch Verification of EdDSA Signatures

In AfricaCrypt 2012 and ACNS 2014, several algorithms are proposed for the batch verification of ECDSA signatures. In this paper, we make a comparative study of these methods for the Edwards curve digital signature algorithm (EdDSA). We describe the adaptation of Algorithms N, N′, S2′ and SP for EdDSA signatures. The randomization methods are also explained in detail. More precisely, we study s...

متن کامل

A Subliminal Channel in EdDSA:

Subliminal channels in digital signatures provide a very effective method to clandestinely leak information from inside a system to a third party outside. Information can be hidden in signature parameters in a way that both, network operators and legitimate receivers, would not notice any suspicious traces. Subliminal channels have previously been discovered in other signatures, such as ElGamal...

متن کامل

Breaking Ed25519 in WolfSSL

Ed25519 is an instance of the Elliptic Curve based signature scheme EdDSA that was recently introduced to solve an inconvenience of the more established ECDSA. Namely, both schemes require the generation of a random value (scalar of the ephemeral key pair) during the signature generation process and the secrecy of this random value is critical for security: knowledge of one such a random value,...

متن کامل

Attacking Deterministic Signature Schemes using Fault Attacks

Many digital signature schemes rely on random numbers that are unique and non-predictable per signature. Failures of random number generators may have catastrophic effects such as compromising private signature keys. In recent years, many widely-used cryptographic technologies adopted deterministic signature schemes because they are presumed to be safer to implement. In this paper, we analyze t...

متن کامل

qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs

qDSA is a high-speed, high-security signature scheme that facilitates implementations with a very small memory footprint, a crucial requirement for embedded systems and IoT devices, and that uses the same public keys as modern Diffie–Hellman schemes based on Montgomery curves (such as Curve25519) or Kummer surfaces. qDSA resembles an adaptation of EdDSA to the world of Kummer varieties, which a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2015  شماره 

صفحات  -

تاریخ انتشار 2015