Undeniable digital signature scheme based on quadratic field

Details Undeniable digital signature scheme based on quadratic field Undeniable digital signature scheme based on quadratic field

2005-12-13

2005-12-13

Barron, Jr., Gilberto (Department: 2132)

Electrical computers and digital processing systems: support

Multiple computer communication using cryptography

Particular communication authentication technique

Reexamination Certificate

active

06976169

ABSTRACT:
An efficient undeniable digital signature scheme based on a quadratic field is disclosed. Public keys (D, P, k, t) and secret keys (D1, q) are defined by generating two primes p, q (p, q>4, p=3 mod 4, √{square root over (p/3)}<q), computing D1=−p and D=D1q2, obtaining a bit length k of √{square root over (|D1|)}/4 and a bit length t of q−(D1/q) where (D1/q) denotes Kronecker symbol, and generating a kernel element P of a map from a class group Cl(D) to a class group Cl(D1). Then the signature verification is realized by first checking whether a norm N(S) of the signature S is smaller than k bits or not, and judging that the signature S is illegal when the norm N(S) is larger than k bits, or generating a challenge C when the norm N(S) is not larger than k bits, by computing the message ideal M of the message m, generating a random integer r smaller than t bits, computing H=(M/S)r, generating a random ideal B whose norm is smaller than k−1 bits, and computing the challenge C=BH, at a verifier side; then computing a response W by mapping the challenge C to the class group Cl(D1) and pulling the mapped challenge C back to the class group Cl(D) and squaring a result of mapping and pulling back, using the secret keys (D1, q), at the signer side; and then checking whether W=B2holds or not, and judging that the signature S is legal when W=B2holds or that the signature S is illegal otherwise, at the verifier side.

REFERENCES:
patent: 6131162 (2000-10-01), Yoshiura et al.
patent: 6550011 (2003-04-01), Sims, III
Huhnlein;A Cryptosystem Based On Non-Maximal Imaginary Quadratic Orders With Fast Decryption; Advances in Cryptology-Eurocrypt '98, 1998, pp. 294-307.
Menezes;Handbook of Applied Cryptography; 1997, CRC Press, Boca Raton, Florida 33431.
Buchmann;On the Complexity and Efficiency of a New Key Exchange System; Advances in Cryptology—Eurocrypt '89; 1990, pp. 597-616.
Biehl;Cryptographic Protocols Based on Discrete Logarithms in Real-Quadratic Orders; Advances in Cryptology—Crypto '94, 1994, pp. 56-60.
Rivest;Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Feb. 1978, vol. 21, #2, pp. 120-126.
Chaum;Centre for Mathematics and Computer Science, 1998, Springer-Verlag, pp. 212-214.
Gennaro;RSA-Based Undeniable Signatures; 1998, Springer-Verlag, pp. 132, 149.
Shanks;On Gauss and Composition 1, Number Theory and Applications, pp. 163-204, 1989, Kluwer Academic Publishers.
A Cryptosystem Based on Non-Maximal Imaginary Quadratic Orders with Fast Decryption; Proceedings Eurocrypt '98; Mar. 1998, pp. 294-307.
Conference on the Mathematics of Public Key Cryptography; Jun. 12, 1999, pp. 1-17.

Affiliated with

Also associated with

Rating

Undeniable digital signature scheme based on quadratic field does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Undeniable digital signature scheme based on quadratic field, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Undeniable digital signature scheme based on quadratic field will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3503237