Randomized sparse formats for efficient and secure...

Details Randomized sparse formats for efficient and secure... Randomized sparse formats for efficient and secure...

2005-12-28

2010-02-16

Arani, Taghi T (Department: 2438)

Cryptography

Particular algorithmic function encoding

C713S174000, C713S189000

Reexamination Certificate

active

07664258

ABSTRACT:
Techniques are described that facilitate cryptographic operations, such as data encryption, signing and others, encryption using a computerized method for multiplying a scalar by a point. In one implementation, a set of random integers is selected, wherein the set comprises at least one integer selected randomly. A string is configured, based in part on the set of random integers. Output in the form of a product of the scalar and the point is then calculated, based on the string.

REFERENCES:
patent: 4969189 (1990-11-01), Ohta et al.
patent: 6141420 (2000-10-01), Vanstone et al.
patent: 6307935 (2001-10-01), Crandall et al.
patent: 6904526 (2005-06-01), Hongwei
patent: 2002/0076044 (2002-06-01), Pires
patent: 2002/0178371 (2002-11-01), Kaminaga et al.
patent: 2003/0081769 (2003-05-01), Hamilton
patent: 2003/0123668 (2003-07-01), Lambert et al.
Avoine et al.,; “Advances in Alternative Non-Adjacent Form Representations”; The 5th International Conference on Cryptology in India—Indocrypt 2004, Dec. 20-22, 2004; 1 page.

Affiliated with

Also associated with

Rating

Randomized sparse formats for efficient and secure... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Randomized sparse formats for efficient and secure..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized sparse formats for efficient and secure... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4212040