Software Implementation of the NIST Ellipti Curves Over Prime Fields

نویسندگان

  • M. Brown
  • D. Hankerson
چکیده

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

ثبت نام

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

منابع مشابه

Software Implementation of the NIST Elliptic Curves Over Prime Fields

This paper presents an extensive study of the software implementation on workstations of the NIST-recommended elliptic curves over prime fields. We present the results of our implementation in C and assembler on a Pentium II 400 MHz workstation. We also provide a comparison with the NIST-recommended curves over binary fields.

متن کامل

Software Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields

This paper describes the system parameters and software implementation of a HECDSA cryptosystem based on genus-2 hyperelliptic curves over prime fields. We show how to reduce the computational complexity for special cases and compare the given cryptosystem with the well-known ECDSA cryptosystem based on elliptic curves.

متن کامل

Software Implementation of Elliptic Curve Cryptography over Binary Fields

This paper presents an extensive and careful study of the software implementation on workstations of the NIST-recommended elliptic curves over binary fields. We also present the results of our implementation in C on a Pentium II 400 MHz workstation.

متن کامل

Software Elliptic Curve Cryptography

In this thesis, we study the software implementation of the NIST-recommended elliptic curves over prime fields. Our implementation goals are to achieve a fast, small, and portable cryptographic library, which supports elliptic curve digital signature generation and verification. The implementation results are presented on a Pentium I1 448.81 MHz. We also consider the sliding window algorithm (S...

متن کامل

Distribution of elliptic twins over fixed finite fields: Numerical results

This paper presents the results of numerical experiments to determine the probability, over concrete fixed finite fields, of prime-order elliptic curves having a prime-order twist. These curves are called “elliptic twins” by [7], and are useful for a variety of cryptographic applications. Most notable is that such curves are secure against an “insecure twist” attack. This attack was introduced ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000