| Claus-Peter Schnorr. Efficient signature generation by smart cards. Journal of Cryptography, 4:161-- 174, 1991. |
....of a signature requires the performance of some exponentiation. Since exponentiation is a costly operation, the design of efficient digital signature schemes (from both the generation and verification points of view) was the subject of investigation by several researchers (see, for example, [13, 18, 9, 6]) The efficiency of the system is of paramount importance when the number of verifications is considerably large (e.g. when a bank issues a large number of electronic coins and the customer wishes to verify the correctness of the coins) 1.1 Relevant Work In our schemes, verification of a ....
C. Schnorr, "Efficient Signature Generation by Smart Cards," Journal of Cryptology, vol. 4, no. 3, pp. 161--174, 1991.
....the public key and the master key grow linearly with t (yet they are independent of N ) Thus, while practical for small values of t, it does not completely solve the problem for t N . We defer such a solution to the following section. Our scheme builds on the Okamoto Schnorr signature scheme [24, 29] which we review here. Let p; q be primes such that p = 2q 1 and let G be the subgroup of Z p of order q. Fix generators g; h 2 G. A public key is generated by choosing x; y 2R Z q and setting v = g . To sign message M , a user chooses random r 1 ; r 2 2 Z q and computes w = g . ....
C.P. Schnorr. Efficient Signature Generation by Smart Cards. J. Crypto 4(3): 161--174 (1991).
....by exhaustive trial. This again motivates the use of prime order subgroups (5) 5 Restricting Computations to Prime order Subgroups To meet he objective of improved running time through use of short exponents, the recommended alt ernative is t o employ an idea used in Schnorr s signature scheme [18] and in DSA [19] to guarant ee that computations are carried out in a large subgroup of cardinality q 2 where q is prime (a prime order subgroup) For t bit s of security, set u = 2t (e.g. u = 160 is used in DSA) If Z; is a generator, and q divides p 1, then 3 = g( generat, esa subgroup ....
G.P. Schnorr, "Efficient signature generation by smart cards", J. Cryptology vol.4 (1991), pp.161-174.
No context found.
Claus-Peter Schnorr. Efficient signature generation by smart cards. Journal of Cryptography, 4:161-- 174, 1991.
No context found.
Claus P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161--174, 1991.
No context found.
C. Schnorr, Efficient Signature Generation by Smart Cards, Journal of Cryptology, Vol. 4, pp. 161-174, 1991.
No context found.
C.-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161--174, 1991. 17
No context found.
C.P. Schnorr, "Efficient signature generation by smart cards", J. Cryptology vol.4 (1991), pp.161-174.
No context found.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, In Journal of Cryptology, vol. 4, pp. 161--174, 1991.
No context found.
C.P. Schnorr. Efficient Signature Generation by Smart Cards. J. Crypto 4(3): 161--174 (1991).
No context found.
C.-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 4(3):161--174, 1991.
No context found.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, J. Cryptology, 4(3), 1991, 161-174
No context found.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, J. Cryptology, 4(3), 1991, 161-174
No context found.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, In Journal of Cryptology, vol. 4, pp. 161--174, 1991.
No context found.
C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161--174, 1991.
No context found.
C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, Vol. 4, pp. 161--174 (1991).
No context found.
C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161--174, 1991.
No context found.
C.P. Schnorr, Efficient signature generation by smart cards, to appear in Journal of Cryptology.
No context found.
C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4, 1991, 161--174.
No context found.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, In Journal of Cryptology, vol. 4, pp. 161--174, 1991.
No context found.
C.P. Schnorr. Efficient Signature Generation by Smart Cards. J. Crypto 4(3): 161--174 (1991).
No context found.
C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161--174, 1991.
No context found.
C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptography, 1991, 4(3): 161-174.
No context found.
C. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, vol. 4, pages 161-174, 1991.
No context found.
C.P. Schnorr. Efficient Signature Generation by Smart Cards. Jour. of Cryptology Vol. 4 (3), pages 161-174, 1991.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC