Parallel cryptographic arithmetic using a redundant Montgomery representation

We describe how using a redundant Montgomery representation allows for high-performance SIMD-based implementations of RSA and elliptic curve cryptography. This is in addition to the known benefits of immunity from timing attacks afforded by the use of such a representation. We present some prelimina...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers Vol. 53; no. 11; pp. 1474 - 1482
Main Authors: Page, D., Smart, N.P.
Format: Journal Article
Language:English
Published: New York IEEE 01.11.2004
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
algorithm design and analysis
Computer instructions
Index Terms- Public key cryptosystems
parallel and vector implementations
Parallel processing
performance measures
Pipeline arithmetic
Public key cryptography
ISSN:0018-9340, 1557-9956
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We describe how using a redundant Montgomery representation allows for high-performance SIMD-based implementations of RSA and elliptic curve cryptography. This is in addition to the known benefits of immunity from timing attacks afforded by the use of such a representation. We present some preliminary implementation timings using the SSE2 instruction set on a Pentium 4 processor and show that an SIMD parallel implementation of RSA can be around twice as fast as traditional sequential code. This is especially useful given the larger 2,048 bit RSA keys which are now being proposed for standard security levels. Finally, we remark on other application areas that improve the security of our work in the context of side-channel analysis while maintaining high performance.
AbstractList We describe how using a redundant Montgomery representation allows for high-performance SIMD-based implementations of RSA and elliptic curve cryptography. This is in addition to the known benefits of immunity from timing attacks afforded by the use of such a representation. We present some preliminary implementation timings using the SSE2 instruction set on a Pentium 4 processor and show that an SIMD parallel implementation of RSA can be around twice as fast as traditional sequential code. This is especially useful given the larger 2,048 bit RSA keys which are now being proposed for standard security levels. Finally, we remark on other application areas that improve the security of our work in the context of side-channel analysis while maintaining high performance.
Author Page, D.
Smart, N.P.
Author_xml – sequence: 1
  givenname: D.
  surname: Page
  fullname: Page, D.
  organization: Dept. of Comput. Sci., Bristol Univ., UK
– sequence: 2
  givenname: N.P.
  surname: Smart
  fullname: Smart, N.P.
  organization: Dept. of Comput. Sci., Bristol Univ., UK
BookMark eNp1kL1v2zAQxYkiAWo7nTp2ETp0CeTciaZIjoWRpAUctIM7CxR1chjIpEpSg__7KHCBAAY63Qd-7-HuLdmVD54Y-4ywRgR9t9-uK4DNGgE-sAUKIUutRX3FFgCoSs038JEtU3oBgLoCvWBPv000w0BDYeNpzOEQzfjsbGGiy89HynM7JecPhSkidZPvjM_FU_D5EI4UT_NyjJTIZ5Nd8DfsujdDok__6or9ebjfb3-Uu1-PP7ffd6XlUuSy6y3WvewrrTvsOSixAVVLVQNCW7VCdVaArpXR1FrdUiuV7EGiRWFbrjRfsW9n3zGGvxOl3BxdsjQMxlOYUlPNjshFNYNfL8CXMEU_39YotUFEIXGGbs-QjSGlSH0zRnc08dQgNG-5Nvtt85brPMNM4wVt3fn7HI0b_qP5ctY4Inp357yWteSvXDmFhg
CODEN ITCOB4
CitedBy_id crossref_primary_10_3390_jlpea3040300
crossref_primary_10_1007_s13389_021_00256_9
crossref_primary_10_3390_jlpea5030183
crossref_primary_10_1016_j_compeleceng_2011_01_002
crossref_primary_10_1080_09720529_2019_1582864
crossref_primary_10_1007_s13369_017_2797_3
crossref_primary_10_1016_j_mejo_2012_12_001
Cites_doi 10.1007/3-540-46877-3_21
10.1007/s001459900021
10.1007/978-3-540-45238-6_2
10.1017/CBO9781107360211
10.1007/3-540-68697-5_9
10.1145/777412.777458
10.1007/3-540-45353-9_3
10.1049/el:19991230
10.1007/3-540-48059-5_9
10.1007/3-540-48059-5_25
10.1007/3-540-45353-9_15
10.1109/40.502403
10.1007/3-540-44499-8_23
10.1090/s0025-5718-1985-0777282-x
10.1007/3-540-45439-X_16
10.1109/ICME.2002.1035526
10.1007/3-540-48405-1_25
10.1006/jagm.1997.0913
10.1007/3-540-36159-6_19
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004
DBID RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TC.2004.100
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9956
EndPage 1482
ExternalDocumentID 2428113001
10_1109_TC_2004_100
1336767
Genre orig-research
GroupedDBID --Z
-DZ
-~X
.55
.DC
0R~
29I
3EH
3O-
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
ACNCT
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
MVM
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RXW
RZB
TAE
TN5
TWZ
UHB
UKR
UPT
VH1
X7M
XJT
XOL
XZL
YXB
YYQ
YZZ
ZCG
AAYXX
ABUFD
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c375t-dfc16f7f299d1f30854086786010b2b58dc50968a9ebc9beb787f071c15cb3893
IEDL.DBID RIE
ISICitedReferencesCount 16
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000223872800010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9340
IngestDate Sun Nov 09 10:38:44 EST 2025
Fri Jul 25 08:43:47 EDT 2025
Tue Nov 18 21:20:28 EST 2025
Sat Nov 29 08:06:47 EST 2025
Wed Aug 27 02:49:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 11
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c375t-dfc16f7f299d1f30854086786010b2b58dc50968a9ebc9beb787f071c15cb3893
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 884111571
PQPubID 85452
PageCount 9
ParticipantIDs proquest_journals_884111571
crossref_citationtrail_10_1109_TC_2004_100
ieee_primary_1336767
crossref_primary_10_1109_TC_2004_100
proquest_miscellaneous_28541352
PublicationCentury 2000
PublicationDate 2004-Nov.
2004-11-00
20041101
PublicationDateYYYYMMDD 2004-11-01
PublicationDate_xml – month: 11
  year: 2004
  text: 2004-Nov.
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on computers
PublicationTitleAbbrev TC
PublicationYear 2004
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
Clapp (ref8)
ref30
ref11
ref17
ref19
Agrawal (ref2)
ref18
Acar (ref1) 1997
Warren (ref31) 2002
Crandall (ref10) 1999
Okeya (ref26)
Lucier (ref23) 2002
ref25
Boneh (ref7)
ref20
ref22
Menezes (ref24) 1997
ref28
Gueron (ref14)
ref27
ref29
ref9
ref4
ref3
ref6
ref5
(ref16) 2000
Lipmaa (ref21) 1998
References_xml – start-page: 248
  year: 1998
  ident: ref21
  article-title: IDEA: A Cipher for Multimedia Architectures?”
  publication-title: Selected Areas in Cryptography (SAC)
– volume-title: Hacker’s Delight
  year: 2002
  ident: ref31
– start-page: 29
  volume-title: Proc. Cryptographic Hardware and Embedded Systems (CHES)
  ident: ref2
  article-title: The EM Side-Channel(s)
– ident: ref11
  doi: 10.1007/3-540-46877-3_21
– ident: ref12
  doi: 10.1007/s001459900021
– ident: ref3
  doi: 10.1007/978-3-540-45238-6_2
– ident: ref6
  doi: 10.1017/CBO9781107360211
– ident: ref19
  doi: 10.1007/3-540-68697-5_9
– ident: ref5
  doi: 10.1145/777412.777458
– ident: ref27
  doi: 10.1007/3-540-45353-9_3
– ident: ref28
  doi: 10.1049/el:19991230
– volume-title: Handbook of Applied Cryptography
  year: 1997
  ident: ref24
– start-page: 46
  volume-title: Proc. Cryptographic Hardware and Embedded Systems (CHES)
  ident: ref14
  article-title: Enhanced Montgomery Multiplication
– year: 2002
  ident: ref23
  article-title: Cryptography, Finite Fields, and AltiVec
– volume-title: Intel technical report
  year: 2000
  ident: ref16
  article-title: Using Streaming SIMD Extensions (SSE2) to Perform Big Multiplications
– ident: ref29
  doi: 10.1007/3-540-48059-5_9
– ident: ref9
  doi: 10.1007/3-540-48059-5_25
– ident: ref30
  doi: 10.1007/3-540-45353-9_15
– ident: ref18
  doi: 10.1109/40.502403
– ident: ref15
  doi: 10.1007/3-540-44499-8_23
– ident: ref25
  doi: 10.1090/s0025-5718-1985-0777282-x
– ident: ref4
  doi: 10.1007/3-540-45439-X_16
– start-page: 178
  volume-title: Proc. Progress in Cryptology (INDOCRYPT)
  ident: ref26
  article-title: Power Analysis Breaks Elliptic Curve Cryptosystems Even Secure against the Timing Attack
– volume-title: Proc. Second AES Candidate Conf.
  ident: ref8
  article-title: Instruction-Level Parallelism in AES Candidates
– ident: ref22
  doi: 10.1109/ICME.2002.1035526
– ident: ref20
  doi: 10.1007/3-540-48405-1_25
– volume-title: Proc. 12th Usenix Security Symp.
  ident: ref7
  article-title: Remote Timing Attacks Are Feasible
– ident: ref13
  doi: 10.1006/jagm.1997.0913
– ident: ref17
  doi: 10.1007/3-540-36159-6_19
– year: 1997
  ident: ref1
  article-title: High-Speed Algorithms & Architectures for Number-Theoretic Cryptosystems
  publication-title: PhD thesis, Dept. of Electrical & Computer Eng., Oregon State Univ.
– year: 1999
  ident: ref10
  article-title: Vector Implementation of Multiprecision Arithmetic
SSID ssj0006209
Score 1.8673829
Snippet We describe how using a redundant Montgomery representation allows for high-performance SIMD-based implementations of RSA and elliptic curve cryptography. This...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1474
SubjectTerms algorithm design and analysis
Computer instructions
Index Terms- Public key cryptosystems
parallel and vector implementations
Parallel processing
performance measures
Pipeline arithmetic
Public key cryptography
Title Parallel cryptographic arithmetic using a redundant Montgomery representation
URI https://ieeexplore.ieee.org/document/1336767
https://www.proquest.com/docview/884111571
https://www.proquest.com/docview/28541352
Volume 53
WOSCitedRecordID wos000223872800010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library
  customDbUrl:
  eissn: 1557-9956
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006209
  issn: 0018-9340
  databaseCode: RIE
  dateStart: 19680101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED21FQMMFCiIUj48dEIE6ubTI6qoGKDqUCS2yHZsqETTKk2R-u_xOUkB0YUtUqwoOvvO7-x77wC6UcL62teRI7TrOyZKckcEVDmUc8FUGPhMWp3Zp3A0il5f2bgGNxsujFLKFp-pW3y0d_nJXK7wqOzO5FOoL1aHehgGBVdrE3WDqpyDGgd2vV7JxaM9djcZ2DwQCwJ-7T62ncqfGGw3lmHzf790APslgCT3xYwfQk2lR9CsmjOQ0lePYO-H0mALnsc8w64pH0Rm60Ve6FRPJTGZcv4-QyIjwQr4N8JJppBYZgxOjL_nb_OZytbEal9WPKX0GF6GD5PBo1N2UnCkG_q5k2hJAx1qs_ckVLsGZnkmlQkjzMZEX_hRIlEGJuJMCcmEEsaNtQEfkvpSIKQ5gUY6T9UpEM0SgyoMyOtz5vl9yZnQXEq3J3yZBDppw3Vl4ViWMuPY7eIjtulGj8WTAfa-9FAtuQ3dzeBFoa6xfVgLLf89pDB6GzrV1MWl5y3jKPIoCgjRNlxt3hqXwXsQnqr5ahkjaZQa4Hm2_bMd2C3UHPGc5RwaebZSF7AjP_PpMru0q-4LzP7XpA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB58gXrwLa7PHDyJ1aZt2uYoi6K4Lh5W8FaSNFkF7Uq3K_jvzaTtqujFW6GhlElm8k0y3zcAx2nOA8NM6kkTMs9GSeHJmGqPCiG5TmLGldOZ7SX9fvr4yO9n4HTKhdFau-IzfYaP7i4_H6kJHpWd23wK9cVmYZ5FUeDXbK1p3I3bgg5qXTiM_IaNR31-Pui6TBBLAn7sP66hyq8o7LaWq9X__dQarDQQklzUc74OM7rYgNW2PQNpvHUDlr9pDW7C3b0osW_KC1Hlx1tVK1U_K2Jz5erpFamMBGvgh0SQUiO1zJqcWI-vhqNXXX4Qp37ZMpWKLXi4uhx0r72ml4KnwoRVXm4UjU1i7O6TUxNaoBXZZCZJMR-TgWRprlAIJhVcS8WlltaRjYUfijIlEdRsw1wxKvQOEMNziysszAsEj1igBJdGKBX6kqk8NnkHTloLZ6oRGsd-Fy-ZSzh8ng262P0yQr3kDhxPB7_V-hp_D9tEy38NqY3egb126rLG98ZZmkYUJYRoB46mb63T4E2IKPRoMs6QNkot9Nz9-7NHsHg9uOtlvZv-7R4s1dqOeOqyD3NVOdEHsKDeq-dxeehW4CcpLtrr
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+cryptographic+arithmetic+using+a+redundant+Montgomery+representation&rft.jtitle=IEEE+transactions+on+computers&rft.au=Page%2C+D.&rft.au=Smart%2C+N.P.&rft.date=2004-11-01&rft.issn=0018-9340&rft.volume=53&rft.issue=11&rft.spage=1474&rft.epage=1482&rft_id=info:doi/10.1109%2FTC.2004.100&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TC_2004_100
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon