Certicom Research; Standards for efficient cryptography, SEC 1: Elliptic curve cryptography, version 1.0; 2000; URL http://www.secg.org/download/aid-385/sec1_ final.pdf. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Elliptic Curve Cryptography on Smart Cards - Pietiläinen (2000) (85 citations) (Correct)
....on elliptic curve cryptography. In particular, it speci es signature schemes, encryption schemes, and key agreement schemes. Standards for E cient Cryptography: SEC 2: Recommended Elliptic Curve Domain Parameters, lists example elliptic curve domain parameters at commonly required security levels [11, 12, 13]. FSTC. FSTC, Financial Services Technology Consortium, is concerned with electronic payment systems and other nancial services. This innovative, allelectronic payment and deposit gathering instrument can be initiated from a variety of devices such as personal computers, screen phones, ATMs, or ....
Certicom Corp. Standards for E cient Cryptography, SEC 1: Elliptic Curve Cryptography, September 1999. http://www.secg.org/drafts.htm.
Ciphers with Arbitrary Finite Domains - Black, Rogaway (2000) (7 citations) (Correct)
....unlikely event that a point is in ZN but not in Z N . We may also use our methods to encipher points from an elliptic curve group (EC group) There are well known compact representations of the points in EC groups, and these representations form our starting point. For example, one nds in [5] simple algorithms to compress the representation of a point in an EC group. Consider the EC group G over the eld F q where q is either a power of two or a prime. Then any point (x; y) 2 G may be represented as a member of F q together with a single bit. Let s consider rst the case where q = 2 ....
....of a point in an EC group. Consider the EC group G over the eld F q where q is either a power of two or a prime. Then any point (x; y) 2 G may be represented as a member of F q together with a single bit. Let s consider rst the case where q = 2 m with m 0. The Hasse theorem (see [5], page 8) guarantees at least d(r) r 1 2 p r points in G. Since it is possible to represent any point in G with m 1 bits and it is also possible to eciently test for membership in G, we could use the cycle walking construction over a 2 m 1 bit cipher. The expected number of invocations of ....
[Article contains additional citation context not shown here]
Certicom Research. Standards for ecient cryptography, SEC1: Elliptic curve cryptography, version 1, Sept. 2000. Available on-line at www.secg.org.
A simple, practical, secure, deniable protocol for - Key-Exchange Mark Wooding (Correct)
No context found.
Certicom Research; Standards for efficient cryptography, SEC 1: Elliptic curve cryptography, version 1.0; 2000; URL http://www.secg.org/download/aid-385/sec1_ final.pdf.
Extracting Bits from Coordinates of a Point of an Elliptic Curve - Gürel (2005) (1 citation) (Correct)
No context found.
Certicom Corp. SEC 1: Elliptic curve cryptography. Technical report, Standards for E#cient Cryptography Group, 2000. Available at http://www.secg.org/collateral/sec1_final.pdf.
Fast Authenticated Key Establishment Protocols for .. - Huang, Cukier.. (2003) (1 citation) (Correct)
No context found.
Certicom Research, Standard for efficient cryptography, SEC 1: Elliptic Curve Cryptography. Version 1.0, September 20, 2000. Certicom Corporation. URL: www.secg.org.
Merl -- A Mitsubishi Electric Research Laboratory - Http Www Merl (2003) (Correct)
No context found.
Certicom Research, Standard for efficient cryptography, SEC 1: Elliptic Curve Cryptography. Version 1.0, September 20, 2000.
Design and Analysis of Secure Encryption Schemes - Abdalla (2001) (Correct)
No context found.
Certicom research, standards for e#cient cryptography group (SECG) --- sec 1: Elliptic curve cryptography. http://www.secg.org/secg_docs.htm, September 20, 2000. Version 1.0.
Platform Independent Elliptic Curve Cryptography over F_p - Henhapl (2002) (1 citation) (Correct)
No context found.
CERTICOM RESEARCH. SEC 2: Elliptic curve cryptography. http: //www.secg.org, September 20 2000.
Platform Independent Elliptic Curve Cryptography over F_p - Henhapl (2002) (1 citation) (Correct)
No context found.
CERTICOM RESEARCH. SEC 1: Elliptic curve cryptography. http: //www.secg.org, September 20 2000.
Energy/Security Scalable Mobile Cryptosystem - Huang, Kobayashi, Liu, Gu, Zhang (2004) (Correct)
No context found.
Certicom Research, Standard for efficient cryptography, SEC 1: Elliptic Curve Cryptography. Version 1.0, September 20, 2000.
Fast Authenticated Key Establishment Protocols for .. - Huang, Cukier.. (2003) (1 citation) (Correct)
No context found.
Certicom Research, Standard for efficient cryptography, SEC 1: Elliptic Curve Cryptography. Version 1.0, September 20, 2000. Certicom Corporation. URL: www.secg.org.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC