Elliptic curve cryptosystem apparatus, storage medium...

Cryptography – Particular algorithmic function encoding – Public key

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S490000

Reexamination Certificate

active

07970131

ABSTRACT:
A scalar multiplication can be performed on an elliptic curve cryptosystem at a high speed. P is set as an initial value of Q[0], and 2×P is set as an initial value of Q[1]. An elliptic curve doubling ECDBL of Q[d[i]] is performed, and an arithmetic result is stored in Q[2]. An elliptic curve addition ECADD of Q[0] and Q[1] is performed, and an arithmetic result is stored in Q[1]. Q[2−d[i]] is stored in Q[0]. Q[1+d[i]] is stored in Q[1]. The elliptic curve addition ECADD and the elliptic curve doubling ECDBL are concurrently performed in the respective processors.

REFERENCES:
patent: 6038581 (2000-03-01), Aoki et al.
patent: 6738478 (2004-05-01), Vanstone et al.
patent: 6836784 (2004-12-01), Perkins
patent: 7046801 (2006-05-01), Okeya
patent: 7068785 (2006-06-01), Perkins
patent: 1160661 (2001-05-01), None
patent: 2001-290420 (2001-10-01), None
patent: 2001-337599 (2001-12-01), None
patent: WO 99/04531 (1999-01-01), None
patent: WO 99/49386 (1999-09-01), None
patent: WO 00/25204 (2000-05-01), None
Fischer et al.; Parallel Scalar Multiplication on General Elliptic Curves over FpHedged Against Non-differential Side-Channel Attacks; Jan 9, 2002.
Tetsuya Izu and Tsuyoshi Takagi, “A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks,” pp. 280-296, Feb. 2002, in: David Naccache, P. Paillie (Eds.), Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2002), Lecture Notes in Computer Science (LNCS) vol. 2274, Springer-Verlag, Feb. 2002.
Oswald et al., Random Addition-Subtraction Chains as a Countermeasure against Power Attack, 2001, 39-50.
Torii, et al., “Elliptic Curve Cryptosystems”, Jul. 1999, pp. 197-201.
U.S. Appl. No. 10/315,244, filed Dec. 10, 2002, Tetsuya Izu, (1) Fujitsu Limited Kawasaki, Japan (2) Tsuyoshi Takagi Hofheim-Wallu, Germany.
European Search Report for Appln No. EP 02 25 8503 dated Oct. 17, 2003.
EPO Office Action dated Sep. 6, 2004.
Office Action for corresponding European Application No. 02 258 503.8 dated Dec. 30, 2005.
European Patent Office; European Search Report; May 7, 2003, pp. 1-4.
Office Action for corresponding Canadian Application No. 2,414,057 dated Jan. 10, 2007.
Japanese Office Action mailed Apr. 10, 2007 for Japanese Patent Application No. 2001-376516.
Office Action dated Apr. 19, 2007 for corresponding European Patent Application No. 02 258 503.8-1229.
Restriction Office Action dated Oct. 3, 2006 issued in parent U.S. Appl. No. 10/315,244 (Issued Patent No. 7,505,587).
Office Action dated Feb. 8, 2007 issued in parent U.S. Appl. No. 10/315,244 (Issued Patent No. 7,505,587).
Office Action dated Aug. 7, 2007 issued in parent U.S. Appl. No. 10/315,244 (Issued Patent No. 7,505,587).
Advisory Action dated Jan. 22, 2008 issued in parent U.S. Appl. No. 10/315,244 (Issued Patent No. 7,505,587).
Office Action dated May 1, 2008 issued in parent U.S. Appl. No. 10/315,244 (Issued Patent No. 7,505,587).
Notice of Allowance dated Nov. 5, 2008 issued in parent U.S. Appl. No. 10/315,244 (Issued Patent No. 7,505,587).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Elliptic curve cryptosystem apparatus, storage medium... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Elliptic curve cryptosystem apparatus, storage medium..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elliptic curve cryptosystem apparatus, storage medium... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2745536

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.