Name
Abstract | ||
|---|---|---|
In this paper, we deal with efficient modular multiplication algorithms working with large integers on programmable smart-cards. The current smart-cards don't contain a library supporting modular arithmetic operations, which is needed in advanced cryptography schemes. Fortunately, the smart-cards contain a crypto co-processor providing a cryptographic support that can help with the acceleration of modular multiplication. The performance of three classical methods for modular multiplication with large integers and one method using a crypto co-processor is analyzed in this paper. The results of our implementation of modular arithmetic operations with the accelerated multiplication can be useful for the construction of advanced cryptographic schemes. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s11235-013-9804-0 | Telecommunications Systems |
Keywords | Field | DocType |
Cryptography,Modular arithmetic,Multiplication,.NET,RSA,Smart-cards | Integer,Multiplication algorithm,Modular arithmetic,Cryptography,Computer science,Arithmetic,Smart card,Kochanski multiplication,Multiplication | Journal |
Volume | Issue | ISSN |
55 | 4 | 1018-4864 |
Citations | PageRank | References |
3 | 0.45 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lukas Malina | 1 | 103 | 15.41 |
| Jan Hajny | 2 | 104 | 14.61 |