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.
Author supplied keywords
Cite
CITATION STYLE
Ramesh, D. (2001). A twin algorithm for efficient generation of digital signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 267–274). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
