http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2009058712-A
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_60e21de07fa18fc54e2150daffc14654 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G09C1-00 |
filingDate | 2007-08-31-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_b8a7b3d476a817d16c9b2dc369831113 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ce166d53f977693e1ce47f3dd4535541 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ad15a899babefaf960ae6f44c974d9ee |
publicationDate | 2009-03-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | JP-2009058712-A |
titleOfInvention | Elliptic curve cryptographic operation apparatus, method, and program |
abstract | An elliptic curve defined on GF (p m ), which is a m-th order extension field of a finite field GF (p) having a resistance to a simple power analysis method and high speed and p is a prime number of 2 or more. A calculation technique of scalar k multiplication k × P of base point P on E / GF (p m ) is provided. A scalar k multiplication k × P of a base point P is expanded by φ using a non-negative integer expansion coefficient, and the expansion expression is obtained by binary expansion of the non-negative integer expansion coefficient. Reference points P c (j) corresponding to the respective expressions P # c (j) are obtained by referring to the pre-calculation table. In each expression P # c (j) of the above expansion formula, when the obtained reference point Pc (j) or the reference point Pc (j) is the infinity point O, an elliptic curve E / GF ( Calculation is performed by substituting a point P ′ that is not an infinite point O on p m ). [Selection figure] None |
isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2010164904-A |
priorityDate | 2007-08-31-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 16.