Recent Results on Modular Multiplications for Smart Cards-Reference-Cited by-同舟云学术

Recent Results on Modular Multiplications for Smart Cards

Published:2000 Issue: Volume: Page:336-352
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Dhem J. -F.,Quisquater J. -J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10721064_31

Reference21 articles.

1. Barrett, P.: Communications authentication and security using public key encryption - A design for implementation -. Master’s thesis, Oxford University (September 1984)

2. Lecture Notes in Computer Science;P. Barrett,1987

3. Brickell, E.F.: A fast modular multiplication algorithm with application to two key cryptography. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in cryptology Proc. of CRYPTO 1982, pp. 51–60. Plenum Press, New York (1983)

4. Benaloh, J., Dai, W.: Fast modular reduction. Rump Session of CRYPTO 1995, Santa Barbara, California (August 1995)

5. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE transactions on information theory 22, 644–654 (1976)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerating Finite Field Arithmetic for Homomorphic Encryption on GPUs;IEEE Micro;2023-09

2. Accelerating Polynomial Multiplication for Homomorphic Encryption on GPUs;2022 IEEE International Symposium on Secure and Private Execution Environment Design (SEED);2022-09

3. Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs;Cryptology and Network Security;2020

4. Implementation and Evaluation of Improved Gaussian Sampling for Lattice Trapdoors;Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography - WAHC '18;2018

5. Efficient Modular Reduction Algorithm Without Correction Phase;Frontiers in Algorithmics;2015