Abstract
The paper describes two algorithms for personnel identification, data authentication and digital signatures. Both are based on the intractability of finding square roots over finite fields and also can be an identity-based scheme. The outstanding feature of these two algorithms is its speed. Also a concept of interlocking equations is introduced which in effect acts like a one-way function.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, Vol. 22, No.6, Nov 1976.
E.F. Brickell and K.S. McCurley, “Interactive identification and digital signatures,” AT&T Technical Journal, Nov/Dec 1991.
D. Ramesh, “Smart Cards-a smart way of achieving security,” Proceedings of Seminar on Embedded Systems for PC-Based Automation, IEI, Chennai 2001.
M. Rabin, “Digital signatures,” in Foundations of Secure Computation. New York, NY: Academic Press, 1978.
H. Ong, C.P. Schnorr and A. Shamir, “An efficient signature scheme based on quadratic equations,” Proceedings of 16th ACM Symp. On Theory of Computing, 1984.
J.M. Pollard and C.P. Schnorr, “An efficient solution of the congruence x 2+ky 2 = m (mod n)” IEEE Trans. Information Theory, vol. IT-33, no. 5 Sept 1987.
A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, Inc.
L.M. Adleman, K. Manders, and G.L. Miller, “On taking roots in finite fields,” Proc. 18th Symp. on Foundation of Computer Science, 1977.
B. Schneier, Applied Cryptography, John Wiley & Sons.
H.S. Zuckerman, An Introduction to the Theory of Numbers, 1960.
W.J. Le Veque, Topics in Number Theory, 2 Vols., 1956.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramesh, D. (2001). A Twin Algorithm for Efficient Generation of Digital Signatures. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-45311-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43010-0
Online ISBN: 978-3-540-45311-6
eBook Packages: Springer Book Archive