Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generalised mersenne numbers revisited
Blekinge Institute of Technology, School of Computing.
2013 (English)In: Mathematics of Computation, ISSN 0025-5718, E-ISSN 1088-6842, Vol. 82, no 284, 2389-2420 p.Article in journal (Refereed) Published
Abstract [en]

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked. Asymptotically, using a cyclic rather than a linear convolution, residue multiplication modulo a Mersenne number is twice as fast as integer multiplication; this property does not hold for prime GMNs, unless they are of Mersenne's form. In this work we exploit an alternative generalisation of Mersenne numbers for which an analogue of the above property - and hence the same efficiency ratio - holds, even at bitlengths for which schoolbook multiplication is optimal, while also maintaining very efficient reduction. Moreover, our proposed primes are abundant at any bitlength, whereas GMNs are extremely rare. Our multiplication and reduction algorithms can also be easily parallelised, making our arithmetic particularly suitable for hardware implementation. Furthermore, the field representation we propose also naturally protects against side-channel attacks, including timing attacks, simple power analysis and differential power analysis, which is essential in many cryptographic scenarios, in constrast to GMNs.

Place, publisher, year, edition, pages
American Mathematical Society , 2013. Vol. 82, no 284, 2389-2420 p.
National Category
Mathematics Computer Science
Identifiers
URN: urn:nbn:se:bth-6813DOI: 10.1090/S0025-5718-2013-02704-4ISI: 000326291500024Local ID: oai:bth.se:forskinfoE1314925BC5F6DB1C1257BE50045E272OAI: oai:DiVA.org:bth-6813DiVA: diva2:834360
Available from: 2013-12-17 Created: 2013-09-13 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Moss, Andrew
By organisation
School of Computing
In the same journal
Mathematics of Computation
MathematicsComputer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf