A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)-Reference-Cited by-同舟云学术

A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)

Published:2001 Issue: Volume: Page:202-219
ISSN:0302-9743
Container-title:Cryptographic Hardware and Embedded Systems — CHES 2001
language:
Short-container-title:

Author:

Großschädl Johann

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44709-1_18

Reference26 articles.

1. Lect Notes Comput Sci;P. Barrett,1987

2. Lect Notes Comput Sci;T. Beth,1987

3. London Mathematial Society Lecture Notes Series;I. F. Blake,1999

4. G. R. Blakley. A computer algorithm for calculating the product AB modulo M. IEEE Transactions on Computers, 32(5):497–500, May 1983.

5. E. F. Brickell. A fast modular multiplication algorithm with application to two key cryptography. In D. Chaum, R. L. Rivest, and A. T. Sherman (eds.), Advances in Cryptology: Proceedings of CRYPTO’ 82, pp. 51–60. Plenum Press, New York, NY, USA, 1982.

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

1. A Reconfigurable Implementation of Elliptic Curve Cryptography over GF ($$2^{n}$$);E-Business and Telecommunications;2020

2. Low-Power, High-Speed Unified and Scalable Word-Based Radix 8 Architecture for Montgomery Modular Multiplication in GF(P) and GF(2 n );Arabian Journal for Science and Engineering;2014-09-07

3. FPGA based unified architecture for public key and private key cryptosystems;Frontiers of Computer Science;2013-06

4. Low Cost Dual-Basis Multiplier over GF(2m) Using Multiplexer Approach;Advances in Intelligent and Soft Computing;2012

5. Time Efficient Dual-Field Unit for Cryptography-Related Processing;IFIP Advances in Information and Communication Technology;2010