1998
DOI: 10.1007/bfb0055261
|View full text |Cite
|
Sign up to set email alerts
|

Modular exponent realization on FPGAs

Abstract: Abstract. The article describes modular exponent calculations used widely in cryptographic key exchange protocols. The measures for hardware consumption and execution speed based on argument bit width and algorithm rank are created. The partitioning of calculations is analyzed with respect to interconnect signal numbers and added delay. The partitioned blocks are used for implementation approximations of two different multiplier architectures. Examples are provided for 3 families of FPGAs: XC4000, XC6200 and F… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1999
1999
2012
2012

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 5 publications
(2 reference statements)
0
4
0
Order By: Relevance
“…In [4] it is argued that a systolic array needs more resources than the redundant approach to store the signals between the units in the array, but it is easier to route and can therefore be faster than a redundant representation on FPGAs. Poldre et al [13] also describe both approaches but did not implement them in hardware.…”
Section: Related Workmentioning
confidence: 95%
“…In [4] it is argued that a systolic array needs more resources than the redundant approach to store the signals between the units in the array, but it is easier to route and can therefore be faster than a redundant representation on FPGAs. Poldre et al [13] also describe both approaches but did not implement them in hardware.…”
Section: Related Workmentioning
confidence: 95%
“…Considering modular exponentiation on FPGAs, more recent work include [156,21,22]. Elbirt and Paar evaluated some options in FPGA architecture suitable for PKC in [47].…”
Section: Systolic Arrays Based On Montgomery's Algorithmmentioning
confidence: 99%
“…Efficient implementation of Montgomery modular multiplication (MMM) in hardware was considered by many authors [7,13,33,22,17,24,34,27,14,25,28].…”
Section: Introductionmentioning
confidence: 99%