Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Generalised mersenne numbers revisited
Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
2013 (Engelska)Ingår i: Mathematics of Computation, ISSN 0025-5718, E-ISSN 1088-6842, Vol. 82, nr 284, s. 2389-2420Artikel i tidskrift (Refereegranskat) 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.

Ort, förlag, år, upplaga, sidor
American Mathematical Society , 2013. Vol. 82, nr 284, s. 2389-2420
Nationell ämneskategori
Matematik Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:bth-6813DOI: 10.1090/S0025-5718-2013-02704-4ISI: 000326291500024Lokalt ID: oai:bth.se:forskinfoE1314925BC5F6DB1C1257BE50045E272OAI: oai:DiVA.org:bth-6813DiVA, id: diva2:834360
Tillgänglig från: 2013-12-17 Skapad: 2013-09-13 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Moss, Andrew

Sök vidare i DiVA

Av författaren/redaktören
Moss, Andrew
Av organisationen
Sektionen för datavetenskap och kommunikation
I samma tidskrift
Mathematics of Computation
MatematikDatavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 46 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf