Emc Corporation

David Paul Makepeace

Peter Robinson

Sean Francis Parkinson

Mark Hibberd

Jaimee Brown

Eric Young

An improved technique involves storing current and one previous version of the secret shares in their respective databases. Along these lines, authentication servers split the proactivization process into several phases, during which they communicate a failure or success to complete that phase. During one of these phases, the authentication servers delete a previous version of their secret share and label the current version as the previous version. At another phase, the authentication servers generate a new version of each secret share (via one way deterministic transform) and store that new version alongside that previous version. Accordingly, when a user submits secret shares for authentication to the authentication servers, each authentication server determines the state of the corresponding authentication server and chooses the secret share according to that state.

Multi-server fault tolerant data store update

A method, integrated circuit chip, and computer program product for cryptographically processing an input value with Elliptic Curve Cryptography (ECC) using ECC scalar multiplication are provided. The ECC scalar multiplication is performed with the use of an enhanced acceleration table (EAT). The EAT uses multiple running totals with multiples above 2. The EAT, in some embodiments, uses reference values other than 0 and 2^window size.

[object Object]

A method, integrated circuit chip, and computer program product for cryptographically processing an input value with Elliptic Curve Cryptography (ECC) using ECC scalar multiplication are provided. The ECC scalar multiplication is performed with the use of an enhanced acceleration table (EAT). The EAT uses multiple running totals, at least one of which has a multiplier above 2.

Using multiples above two with running totals in elliptic curve cryptography scalar multiplication acceleration tables

A computer program product and method are provided for optimizing the size of an Elliptic Curve Cryptography (ECC) scalar multiplication table. Steps include (a) receiving, from a user interface, a set of integer multipliers, (b) choosing a subset of a given set of target integers, the chosen subset defining an index set, such that elements of the index set generate all elements of the given set of target integers using a target generation function, and (c) modifying the index set by removing an element from the index set which is not necessary to generate an element of the given set of target integers using the target generation function. Additional steps are also included depending on the embodiment.

Size optimization for large elliptic curve cryptography scalar multiplication acceleration tables

An improved technique involves dynamic generation of at least a portion of an acceleration table for use in elliptic curve cryptography. Such dynamic generation is capable of providing savings with regard to carrying out elliptic curve cryptography without an acceleration table. Furthermore, once the portion of the acceleration table is dynamically generated and stored (e.g., in a high speed cache), the portion of the acceleration table is capable of being used on subsequent elliptic curve cryptography operations as well thus enabling the cost of dynamically generating the acceleration table to be amortized across multiple elliptic curve cryptography operations.

Growing community of inventors

Middle Park, Australia

David Paul Makepeace