An efficient solution of the congruence x2+ky2=m (modn)
IEEE Transactions on Information Theory
Handbook of Applied Cryptography
Handbook of Applied Cryptography
An efficient signature scheme based on quadratic equations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On taking roots in finite fields
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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.