2000 TENCON Proceedings. Intelligent Systems and Technologies for the New Millennium (Cat. No.00CH37119)
DOI: 10.1109/tencon.2000.892209
|View full text |Cite
|
Sign up to set email alerts
|

FPGA implementation of RSA public-key cryptographic coprocessor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…2) RSA: A public key encryption scheme designed on the factoring problem, RSA computes the plain-text or cipher base value to an exponent within a modulo [27], and can use Montgomery modular multiplication [28] [29]. RSA is more expensive in terms of area and performance compared to AES for FPGAs.…”
Section: F Programmed Decryption Keymentioning
confidence: 99%
“…2) RSA: A public key encryption scheme designed on the factoring problem, RSA computes the plain-text or cipher base value to an exponent within a modulo [27], and can use Montgomery modular multiplication [28] [29]. RSA is more expensive in terms of area and performance compared to AES for FPGAs.…”
Section: F Programmed Decryption Keymentioning
confidence: 99%
“…B' := B' + 1 2b. P := ( P + A ) mod n 3. return P There are basically four general approaches for computing the product P [12][13][14][15]: Multiply and then divide, Interleaving multiplication and reduction, Brickell's method and Montgomery's method. All approaches above have a common disadvantage that it doubles up the number of bits for each multiplication and hence a large register is needed to store this result.…”
Section: B Shared Key Generatormentioning
confidence: 99%