Efficient modular multiplication for programmable smart-cards

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F13%3APU105360" target="_blank" >RIV/00216305:26220/13:PU105360 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/article/10.1007/s11235-013-9804-0" target="_blank" >http://link.springer.com/article/10.1007/s11235-013-9804-0</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11235-013-9804-0" target="_blank" >10.1007/s11235-013-9804-0</a>

Result language
angličtina
Original language name
Efficient modular multiplication for programmable smart-cards
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/TA02011260" target="_blank" >TA02011260: Cryptographic system for the protection of electronic identity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)