Compositeness and primality testing factoring

Roberto M. Avanzi, Henri Cohen

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


Primality and factoring are essential in many aspects of public-key cryptography. RSA is still the most widely used public-key cryptosystem, and its fundamental idea is based on the difficulty of factoring compared to the simplicity of primality testing. In addition, in ECC and HECC we need to work in groups whose order is either prime or a small factor times a large prime, so once again primality is essential.

Original languageEnglish
Title of host publicationHandbook of Elliptic and Hyperelliptic Curve Cryptography
PublisherCRC Press
Number of pages24
ISBN (Electronic)9781420034981
ISBN (Print)1584885181, 9781584885184
StatePublished - 1 Jan 2005
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2006 Taylor & Francis Group, LLC.

ASJC Scopus subject areas

  • General Mathematics
  • General Computer Science


Dive into the research topics of 'Compositeness and primality testing factoring'. Together they form a unique fingerprint.

Cite this