Modular exponentiation on fine-grained FPGA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 223-234

  Tiountchik, Alexander ^a   Trichina, Elena ^b  

^a INSTITUTE OF MATHEMATICS   (Belarus)

^b PACT Informationstechnologie   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INTEGRATED CIRCUIT DESIGN; MAPPING; SYSTOLIC ARRAYS;

EFFICIENT IMPLEMENTATION; FIELD PROGRAMMABLES; HARDWARE SOLUTIONS; INTERMEDIATE RESULTS; LINEAR SYSTOLIC ARRAYS; MODULAR EXPONENTIATION; MONTGOMERY MULTIPLICATION; TWO-DIMENSIONAL ARRAYS;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 84937569677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_17     Document Type: Conference Paper

References (16)

1. Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of Three Modular Re-duction Functions. 175-186
2. Buell, D. A., Arnold, J. M., and Kleinfelder W. J. (eds.): Splash 2: FPGAs in a Custom Computing Machine. IEEE Computer Society Press (1996)
3. Dusse, S. R., and Kaliski, B. S.: A Cryptographic Library for the Motorola DSP56000. In: Advances in Cryptology-EUROCRYPT'90. Lecture Notes in Computer Science, Vol. 473. Spinger-Verlag, Berlin Heidelberg New York (1990) 230-244
4. Eldridge, S. E.: A Faster Modular Multiplication Algorithm. Intern. J. Computer Math. 40 (1993) 63-68
5. Eldridge, S. E., Walter, C. D.: Hardware Implementation of Montgomery's Modular Multiplication Algorithm. IEEE Trans. on Comput. 42 (1993) 693-699
6. ElGamal, T.: A Public-Key cCryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Inform. Theory. 31 (1985) 469-472
7. Even, S.: Systolic Modular Multiplication, In: Advances in Cryptology-Crypto'90. Lecture Notes in Computer Science, Vol. 537. Spinger-Verlag (1990) 619-624
8. Fiat, A., and Shamir, A.: How to Prove Yourself, In: Advances in Cryptology-Crypto'86. Lecture Notes in Computer Science, Vol. 263. Springer-Verlag (1986) 186-194
9. Iwamura, K., Matsumoto, T., Imai, H.: Modular Exponentiation Using Montgo-mery Method and the Systolic Array, IEICE Technical Report, Vol. 92, no. 134, ISEC92-7 (1992) 49-54
10. Montgomery, P. L.: Modular Multiplication Without Trial Division. Mathematics of Computations. 44 (1985) 519-521
11. Koç, Ç. K., RSA Hardware Implementation, TR 801, RSA Laboratories, 30 pages, April 1996. http://www. ece. orst. edu/ koc/vita/v22ab. html
12. Rivest, R., Shamir, A., and Adleman, L.: A Method of Obtaining Digital Signa-tures and Public Key Cryptosystems. J. Commun. of ACM. 21 (1978) 120-126
13. Sauerbrey, J.: A Modular Exponentiation Unit Based on Systolic Arrays, In: Advances in Cryptology-AUSCRYPT'93, Lecture Notes in Computer Science, Vol. 718. Springer-Verlag (1993) 505-516
14. Shand, M., Vuillemin, J.: Fast Implementation of of RSA Cryptography. In: Proc. of the 11th IEEE Symposium on Computer Arithmetics (1993) 252-259
15. Tiountchik, A. A.: Systolic Modular Exponentiation via Montgomery Algorithm. J. Electronics Letters. 34 (1998) 874-875
16. Walter, C. D.: Systolic Modular Multiplication. IEEE Trans. on Comput. bf 42 (1993) 376-378