Certicom Proposal to Revise SEC 1 : Elliptic Curve Cryptography
نویسنده
چکیده
The Standard for Efficient Cryptography (SEC) 1, Elliptic Curve Cryptography (ECC), Version 1.0 [23] is a freely available specification of selected ECC techniques. Because of many developments in ECC since its publication in September, 2000, SEC1 would benefit from a revision. This document summarizes Certicom’s proposed modifications to SEC 1, v. 1.0. 1 Schedule and Version Numbering The revision of SEC 1 shall be Version 2.0. A first draft of the Version 2.0 will be released for public comment around February 18, 2005, as Draft 1.5. Please direct any comments to the SECG mailing list. 2 Revisions to Core ECC Techniques The revised standard will continue to serve as consolidated specification of selected ECC techniques. The revisions primarily function to increase security, and secondarily to improve performance and maintain consistency with other parallel standards efforts. The following list summarizes the revisions to the ECC techniques: 1. Key transport mechanisms where a key agreement scheme is combined with a key wrap algorithm, for consistency with NIST SP 800-56 [18]. ∗Certicom Research
منابع مشابه
Using the Elliptic Curve Digital Signature Algorithm (ECDSA) with the MAXQ1103's Modular Arithmetic Accelerator (MAA) - AN4016
This application note describes the use and implementation of elliptic curve digital signature algorithm (ECDSA) on the MAXQ1103 microcontroller's modular arithmetic accelerator (MAA) module. Performance figures are given for a standard 160-bit curve specified in Standards for Efficient Cryptography published by Certicom®.
متن کاملTwisting an elliptic curve to speed up cryptographic algorithms
An elliptic curve y = x +ax+ b over the prime field Fp may be twisted by a change of variables into the curve y = x + a′x + b′, where a′ differs from a by a quartic residue. We show that most curves over Fp may be twisted to have a′ quite small, allowing one of the multiplications in the point doubling formula to be replaced by additions. This speeds up algorithms to solve the elliptic curve di...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملThe Certicom Challenges ECC2-X
To encourage research on the hardness of the elliptic-curve discrete-logarithm problem (ECDLP) Certicom has published a series of challenge curves and DLPs. This paper analyzes the costs of breaking the Certicom challenges over the binary fields F2131 and F2163 on a variety of platforms. We describe details of the choice of step function and distinguished points for the Koblitz and non-Koblitz ...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005