Part of the Lecture Notes in Computer Science book series (LNCS, volume 1841)
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications.
KeywordsPrime Number Knapsack Problem Discrete Logarithm Problem Legendre Symbol Integer Factorization
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1975)Google Scholar
- 5.Cohen, H.: A course in Computational Algebraic Number Theory. Springer, Berlin (1997)Google Scholar
- 8.Hoffstein, J., Lieman, D., Silverman, J.: Polynomial rings and efficient public key authentication. In: Blum, M., Lee, C.H. (eds.) Proc. the Intern. Workshop on Cryptographic Techniques and E-Commerce (CrypTEC 1999). City University of Hong Kong Press (1999) (to appear)Google Scholar
© Springer-Verlag Berlin Heidelberg 2000