Detail publikace

Efficient modular multiplication for programmable smart-cards

MALINA, L. HAJNÝ, J.

Originální název

Efficient modular multiplication for programmable smart-cards

Anglický název

Efficient modular multiplication for programmable smart-cards

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Dokumenty

BibTex


@article{BUT101933,
  author="Lukáš {Malina} and Jan {Hajný}",
  title="Efficient modular multiplication for programmable smart-cards",
  annote="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.",
  address="Springer",
  chapter="101933",
  doi="10.1007/s11235-013-9804-0",
  howpublished="print",
  institution="Springer",
  number="4",
  volume="55",
  year="2014",
  month="april",
  pages="491--498",
  publisher="Springer",
  type="journal article in Web of Science"
}