| US 7,469,048 B2 | ||
| Methods for point compression for jacobians of hyperelliptic curves | ||
| Kristin E. Lauter, La Jolla, Calif. (US); and Peter L. Montgomery, Bellevue, Wash. (US) | ||
| Assigned to Microsoft Corporation, Redmond, Wash. (US) | ||
| Filed on Mar. 27, 2006, as Appl. No. 11/277,604. | ||
| Application 11/277604 is a continuation of application No. 10/285198, filed on Oct. 31, 2002, granted, now 7,043,015. | ||
| Prior Publication US 2006/0177062 A1, Aug. 10, 2006 | ||
| Int. Cl. H04L 9/28 (2006.01); H04L 9/00 (2006.01); H04K 1/00 (2006.01) | ||
| U.S. Cl. 380—28 [708/203] | 19 Claims |
| 1. A method for compressing curve-based cryptography information using a computing device, the method comprising:
establishing point information suitable for identifying at least one selected point on a Jacobian of a hyperelliptic curve
using a plurality of polynomials;
representing a portion of said point information in a compressed format such that said point information can subsequently
be regenerated and said selected points determined based on said regenerated point information, wherein representing said
portion of said point information in said compressed format further includes factoring at least one of said plurality of polynomials
to produce at least one factor, said compressed format including said at least one factor; and
creating a cryptographic key using the said point information the compressed format.
|