Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure

A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm. The proposed algorithms are inversion free and have the capability to evaluate double or multi-exponentiation with non-fixed base numbers and exponents. They can also be...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of cryptographic engineering Jg. 2; H. 2; S. 99 - 110
Hauptverfasser: Yen, Sung-Ming, Chen, Chien-Ning, Moon, SangJae
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.09.2012
Schlagworte:
Circuits and Systems
Communications Engineering
Computer Communication Networks
Computer Science
Cryptology
Data Structures and Information Theory
Networks
Operating Systems
Regular Paper
Multi-exponentiation
Euclidean algorithm
Binary GCD algorithm
Greatest common divisor
Exponentiation
Public-key cryptography
Side-channel attack
ISSN:2190-8508, 2190-8516
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm. The proposed algorithms are inversion free and have the capability to evaluate double or multi-exponentiation with non-fixed base numbers and exponents. They can also be employed in developing side-channel countermeasures. For n -bit double and triple exponentiation, they achieve the average complexity of 1.53 n and 1.75 n multiplications (including squarings), respectively. The proposed algorithms can be very useful for the implementation of many public-key cryptosystems on small devices with limited memory space, e.g., smart cards.
AbstractList A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm. The proposed algorithms are inversion free and have the capability to evaluate double or multi-exponentiation with non-fixed base numbers and exponents. They can also be employed in developing side-channel countermeasures. For n -bit double and triple exponentiation, they achieve the average complexity of 1.53 n and 1.75 n multiplications (including squarings), respectively. The proposed algorithms can be very useful for the implementation of many public-key cryptosystems on small devices with limited memory space, e.g., smart cards.
Author Chen, Chien-Ning
Yen, Sung-Ming
Moon, SangJae
Author_xml – sequence: 1
  givenname: Sung-Ming
  surname: Yen
  fullname: Yen, Sung-Ming
  email: yensm@csie.ncu.edu.tw
  organization: Laboratory of Cryptography and Information Security, Department of Computer Science and Information Engineering, National Central University
– sequence: 2
  givenname: Chien-Ning
  surname: Chen
  fullname: Chen, Chien-Ning
  organization: Laboratory of Cryptography and Information Security, Department of Computer Science and Information Engineering, National Central University
– sequence: 3
  givenname: SangJae
  surname: Moon
  fullname: Moon, SangJae
  organization: School of Electrical Engineering and Computer Science, Kyungpook National University
BookMark eNp9kEFOwzAQRS0EEqX0AOx8AYMdO3WyRAUKUhEbWFu2M2mNEifYjgS3x1UqlqxmNPP_18y7Qud-8IDQDaO3jFJ5FxnnVU0oKwilvCDiDC0KVlNSlWx9_tfT6hKtYnSGci5oWUq-QF-vU5ccge8xR_rkdHKDx7rbD8GlQ4-NjtDgPDLO6_CDt5sHbId-nNJJ6RvsUsR6HDtn51kacHQNEHvQ3kOX9ZNPEHrQcQpwjS5a3UVYneoSfTw9vm-eye5t-7K53xFbCJpIyaRppORaSw5rzY0xtiza2jZtbYRgoBlIbqAFXtlaUNnkFdXMAmcSGuBLxOZcG4YYA7RqDK7PPyhG1RGbmrGpjE0dsSmRPcXsiVnr9xDU5zAFn8_8x_QLgp51oQ
Cites_doi 10.1049/ip-cdt:19941271
10.1016/S0065-2458(08)60610-5
10.1109/12.863044
10.1109/TIT.1985.1057074
10.1016/0196-6774(89)90036-9
10.2307/2312327
10.1016/0196-6774(81)90003-1
10.1016/0021-9991(67)90047-2
10.1145/359340.359342
10.1145/1093397.1093399
10.1007/BFb0054130
10.1007/BFb0053453
10.1007/3-540-36552-4_21
10.1007/3-540-48658-5_11
10.1007/3-540-45537-X_13
10.1007/3-540-47555-9_18
10.1007/3-540-36400-5_4
10.1007/978-3-540-45238-6_3
10.1007/11496618_11
10.1007/3-540-39200-9_26
10.1007/3-540-48405-1_25
10.1007/3-540-48059-5_25
10.1007/3-540-68697-5_9
10.1007/3-540-44709-1_25
10.1587/transfun.E93.A.1806
10.1007/0-387-34805-0_37
10.1007/11745853_21
ContentType Journal Article
Copyright Springer-Verlag 2012
Copyright_xml – notice: Springer-Verlag 2012
DBID AAYXX
CITATION
DOI 10.1007/s13389-012-0032-4
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2190-8516
EndPage 110
ExternalDocumentID 10_1007_s13389_012_0032_4
GroupedDBID -EM
0R~
0VY
203
2VQ
30V
4.4
406
408
409
96X
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
AAZMS
ABAKF
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABJNI
ABJOX
ABKCH
ABMQK
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACIWK
ACKNC
ACMLO
ACOKC
ACPIV
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGNC
AEJHL
AEJRE
AEMSY
AEOHA
AEPYU
AESKC
AETCA
AEVLU
AEXYK
AFBBN
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGMZJ
AGQEE
AGQMX
AGRTI
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKLTO
ALFXC
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMXSW
AMYLF
AMYQR
ANMIH
AUKKA
AXYYD
AYJHY
BGNMA
CSCUP
DNIVK
DPUIP
EBLON
EBS
EIOEI
EJD
ESBYG
FERAY
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FYJPI
GGCAI
GGRSB
GJIRD
GQ6
GQ8
HF~
HMJXF
HQYDN
HRMNR
HZ~
I0C
IKXTQ
IWAJR
IXD
IZIGR
J-C
JBSCW
JCJTX
JZLTJ
KOV
LLZTM
M4Y
NPVJJ
NQJWS
NU0
O9-
O93
O9J
PT4
RLLFE
ROL
RSV
S27
SCO
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
T13
TSG
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W48
WK8
Z7R
Z7X
Z83
Z88
ZMTXR
~A9
AAYXX
ABBRH
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
AYFIA
BENPR
BGLVJ
CCPQU
CITATION
HCIFZ
K7-
M7S
PHGZM
PHGZT
PQGLB
PTHSS
ID FETCH-LOGICAL-c240t-517bd773aa73e6a3bbbc52f9cdf9b441ea1e73befe38c9407d9cd0a1ce317ede3
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000218897400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2190-8508
IngestDate Sat Nov 29 03:58:04 EST 2025
Fri Feb 21 02:30:59 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Multi-exponentiation
Euclidean algorithm
Binary GCD algorithm
Greatest common divisor
Exponentiation
Public-key cryptography
Side-channel attack
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c240t-517bd773aa73e6a3bbbc52f9cdf9b441ea1e73befe38c9407d9cd0a1ce317ede3
PageCount 12
ParticipantIDs crossref_primary_10_1007_s13389_012_0032_4
springer_journals_10_1007_s13389_012_0032_4
PublicationCentury 2000
PublicationDate 20120900
2012-9-00
PublicationDateYYYYMMDD 2012-09-01
PublicationDate_xml – month: 9
  year: 2012
  text: 20120900
PublicationDecade 2010
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
PublicationTitle Journal of cryptographic engineering
PublicationTitleAbbrev J Cryptogr Eng
PublicationYear 2012
Publisher Springer-Verlag
Publisher_xml – name: Springer-Verlag
References Olivos (CR5) 1981; 2
Stein (CR10) 1967; 1
CR19
CR18
Reitwiesner (CR7) 1960; 1
CR16
Bergeron, Berstel, Brlek, Duboc (CR9) 1989; 10
CR15
CR13
CR12
CR11
CR33
CR32
CR31
CR30
Joye, Yen (CR17) 2000; 49
ElGamal (CR2) 1985; 31
CR3
CR8
Straus (CR4) 1964; 71
CR29
CR28
CR27
Yen, Laih, Lenstra (CR6) 1994; 141
CR26
Brent (CR14) 1976; 10
CR25
CR24
CR23
CR22
CR21
CR20
Rivest, Shamir, Adleman (CR1) 1978; 21
32_CR21
T. ElGamal (32_CR2) 1985; 31
32_CR22
G.W. Reitwiesner (32_CR7) 1960; 1
32_CR20
M. Joye (32_CR17) 2000; 49
F. Bergeron (32_CR9) 1989; 10
R.L. Rivest (32_CR1) 1978; 21
32_CR25
32_CR26
J. Olivos (32_CR5) 1981; 2
32_CR23
32_CR24
32_CR29
J. Stein (32_CR10) 1967; 1
32_CR27
E.G. Straus (32_CR4) 1964; 71
32_CR28
32_CR32
32_CR11
32_CR33
32_CR30
32_CR31
S.-M. Yen (32_CR6) 1994; 141
32_CR3
R.P. Brent (32_CR14) 1976; 10
32_CR15
32_CR8
32_CR12
32_CR13
32_CR18
32_CR19
32_CR16
References_xml – volume: 141
  start-page: 325
  issue: 6
  year: 1994
  end-page: 326
  ident: CR6
  article-title: Multi-exponentiation
  publication-title: IEE Proc. Comput. Digit. Tech.
  doi: 10.1049/ip-cdt:19941271
– ident: CR22
– volume: 1
  start-page: 231
  year: 1960
  end-page: 308
  ident: CR7
  article-title: Binary arithmetic
  publication-title: Adv. Comput.
  doi: 10.1016/S0065-2458(08)60610-5
– ident: CR18
– ident: CR16
– ident: CR12
– ident: CR30
– ident: CR33
– ident: CR29
– ident: CR8
– volume: 49
  start-page: 740
  issue: 7
  year: 2000
  end-page: 748
  ident: CR17
  article-title: Optimal left-to-right binary signed-digit recoding
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/12.863044
– volume: 31
  start-page: 469
  issue: 4
  year: 1985
  end-page: 472
  ident: CR2
  article-title: A public key cryptosystem and a signature scheme based on discrete logarithms
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1985.1057074
– ident: CR25
– ident: CR27
– ident: CR23
– ident: CR21
– ident: CR19
– volume: 10
  start-page: 403
  year: 1989
  end-page: 412
  ident: CR9
  article-title: Addition chains using continued fractions
  publication-title: J. Algorithm.
  doi: 10.1016/0196-6774(89)90036-9
– ident: CR3
– ident: CR15
– ident: CR31
– ident: CR13
– ident: CR11
– volume: 71
  start-page: 806
  year: 1964
  end-page: 808
  ident: CR4
  article-title: Addition chains of vectors
  publication-title: Am. Math. Mon.
  doi: 10.2307/2312327
– ident: CR32
– volume: 2
  start-page: 13
  issue: 1
  year: 1981
  end-page: 21
  ident: CR5
  article-title: On vectorial addition chains
  publication-title: J. Algorithm.
  doi: 10.1016/0196-6774(81)90003-1
– volume: 1
  start-page: 397
  issue: 3
  year: 1967
  end-page: 405
  ident: CR10
  article-title: Computational problems associated with Racah algebra
  publication-title: J. Comput. Phys.
  doi: 10.1016/0021-9991(67)90047-2
– ident: CR28
– ident: CR26
– ident: CR24
– volume: 21
  start-page: 120
  issue: 2
  year: 1978
  end-page: 126
  ident: CR1
  article-title: A method for obtaining digital signatures and public-key cryptosystem
  publication-title: Commun. ACM
  doi: 10.1145/359340.359342
– volume: 10
  start-page: 6
  issue: 2
  year: 1976
  end-page: 7
  ident: CR14
  article-title: Analysis of the binary Euclidean algorithm
  publication-title: ACM SIGSAM Bull.
  doi: 10.1145/1093397.1093399
– ident: CR20
– ident: 32_CR22
  doi: 10.1007/BFb0054130
– volume: 10
  start-page: 6
  issue: 2
  year: 1976
  ident: 32_CR14
  publication-title: ACM SIGSAM Bull.
  doi: 10.1145/1093397.1093399
– ident: 32_CR20
  doi: 10.1007/BFb0053453
– ident: 32_CR15
  doi: 10.1007/3-540-36552-4_21
– ident: 32_CR26
  doi: 10.1007/3-540-48658-5_11
– volume: 49
  start-page: 740
  issue: 7
  year: 2000
  ident: 32_CR17
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/12.863044
– ident: 32_CR18
  doi: 10.1007/3-540-45537-X_13
– ident: 32_CR27
  doi: 10.1007/3-540-47555-9_18
– volume: 141
  start-page: 325
  issue: 6
  year: 1994
  ident: 32_CR6
  publication-title: IEE Proc. Comput. Digit. Tech.
  doi: 10.1049/ip-cdt:19941271
– volume: 1
  start-page: 397
  issue: 3
  year: 1967
  ident: 32_CR10
  publication-title: J. Comput. Phys.
  doi: 10.1016/0021-9991(67)90047-2
– ident: 32_CR3
– ident: 32_CR23
– ident: 32_CR25
– ident: 32_CR29
  doi: 10.1007/3-540-36400-5_4
– volume: 21
  start-page: 120
  issue: 2
  year: 1978
  ident: 32_CR1
  publication-title: Commun. ACM
  doi: 10.1145/359340.359342
– volume: 1
  start-page: 231
  year: 1960
  ident: 32_CR7
  publication-title: Adv. Comput.
  doi: 10.1016/S0065-2458(08)60610-5
– ident: 32_CR30
  doi: 10.1007/978-3-540-45238-6_3
– volume: 31
  start-page: 469
  issue: 4
  year: 1985
  ident: 32_CR2
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1985.1057074
– ident: 32_CR16
  doi: 10.1007/11496618_11
– ident: 32_CR21
  doi: 10.1007/3-540-39200-9_26
– ident: 32_CR12
– ident: 32_CR13
  doi: 10.1007/3-540-48405-1_25
– ident: 32_CR19
– ident: 32_CR33
  doi: 10.1007/3-540-48059-5_25
– ident: 32_CR11
  doi: 10.1007/3-540-68697-5_9
– ident: 32_CR31
  doi: 10.1007/3-540-44709-1_25
– ident: 32_CR24
  doi: 10.1587/transfun.E93.A.1806
– volume: 71
  start-page: 806
  year: 1964
  ident: 32_CR4
  publication-title: Am. Math. Mon.
– volume: 2
  start-page: 13
  issue: 1
  year: 1981
  ident: 32_CR5
  publication-title: J. Algorithm.
  doi: 10.1016/0196-6774(81)90003-1
– volume: 10
  start-page: 403
  year: 1989
  ident: 32_CR9
  publication-title: J. Algorithm.
  doi: 10.1016/0196-6774(89)90036-9
– ident: 32_CR8
  doi: 10.1007/0-387-34805-0_37
– ident: 32_CR28
– ident: 32_CR32
  doi: 10.1007/11745853_21
SSID ssib033405573
ssib031263732
ssj0002140048
Score 1.8425653
Snippet A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm. The proposed algorithms are...
SourceID crossref
springer
SourceType Index Database
Publisher
StartPage 99
SubjectTerms Circuits and Systems
Communications Engineering
Computer Communication Networks
Computer Science
Cryptology
Data Structures and Information Theory
Networks
Operating Systems
Regular Paper
Title Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
URI https://link.springer.com/article/10.1007/s13389-012-0032-4
Volume 2
WOSCitedRecordID wos000218897400003&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: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 2190-8516
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002140048
  issn: 2190-8508
  databaseCode: RSV
  dateStart: 20110401
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDI5gcODCeIrxUg6cQJHWuGvaIxoMDmhC4qHdqrwKk0Y31oL4-ThZy5gEB7i2Vh-Ok8-O89mEnISZQRAOY2bQG2dh3NYs0VYwg1gvOWgQxhOFb0S_Hw8GyW3F4y7q0-51StKv1HOyG0ZT7mwPZ2iJnIXLZKXjis24EP3usTYiCHgEYk6WBAhdmSn42njhgTdb13TO06jRQ6mznT-9ZRGvFpOlHoN6zX99_QZZr1xOej6zkU2yZPMt0qzbOdBqdm-TV0_GZfZjMs7dGSI_ZlSOnsbTYfn8Qh3gGYqXlOfw0qvuBdX-KZVkbuiwLOi3nDgtx9T1A2WOX5zbEfWtKRAMZjuTO-Shd3nfvWZVRwamEflL1gmEMkKAlAJsJEEppTs8S7TJEoWOlZWBFaBsZiHWCcaKBm-1ZaAtuinWWNgljRz_YY_QWEcqVkkni13pYFAygUgpAwoXBFRQ1iKntd7TyazwRjovseyUmaIyXWlTnoYtclZrPa3mYPG79P6fpA_IGvfD5kbvkDTK6Zs9Iqv6vRwW02Nve5_kF9Le
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLZgIMGF8RTjmQMnUKS16Zr2iAZjiDEhMdBuVfMoTBrdWAvi5-NkLWMSHODapo84Tj47zmcDnHiJQhD2AqrQGqdeUJc0lJpThVgfu0wyrixRuMO73aDfD-8KHndWnnYvQ5J2pZ6R3dCbMmd7XIqa6FJvEZY8U2XHuOj3j6USMcf1GZ-RJRnzTJop9rXxgo8YtTVF5yyNGi2UMtr501fm8Wo-WGoxqFX919-vw1phcpLzqY5swIJON6FalnMgxezegldLxqX6YzxKzRkiO2YkHj6NJoP8-YUYwFMELwnL4SVXzQsi7VuKlqkigzwj32LiJB8RUw-UGn5xqofElqZAMJjuTG7DQ-uy12zToiIDlYj8OW04XCjOWRxzpv2YCSFkw01CqZJQoGGlY0dzJnSiWSBD9BUV3qrHjtRopmil2Q5UUuzDLpBA-iIQYSMJTOpgJuKQ-UIoJnBBQAElNTgt5R6Np4k3olmKZSPMCIVpUpu6kVeDs1LqUTEHs99b7_2p9TGstHu3nahz3b3Zh1XXDqEZyQOo5JM3fQjL8j0fZJMjq4efz-7Vwg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI5gIMSF8RTjmQMnULQ16Zr2iDYGiGmaeGm3qnkUJo1urAXx83HSljEJDohra6WK7dR27M9G6MSNFRhh1ycKvHHi-g1JAqk5UWDrI8ok48oChbu81_MHg6BfzDlNy2r3MiWZYxpMl6Ykq09UXJ8B3yCyMnU-lIBWUuIuoiUXAhlT03V791gqFHOox_gMOMmYa1pOsa9LGOpYFTYD6CykGryVMvP501fmbdd84tTao0713ztZR2uFK4rPc93ZQAs62UTVcswDLk79Fnq1IF2iPybjxNQWWVniaPQ0ng6z5xdsDKHC8EhYbC--bLWxtKsUlInCwyzF33LlOBtjMyeUGNxxokfYjqwAI5HfWG6jh87FfeuKFJMaiASPICNNhwvFOYsizrQXMSGEbNI4kCoOBDhcOnI0Z0LHmvkygBhSwatG5EgN7otWmu2gSgJ72EXYl57wRdCMfdNSmIkoYJ4Qign4UQCD4ho6LWUQTvKGHOGs9bJhZgjMNC1PaejW0FkpgbA4m-nv1Ht_oj5GK_12J-xe92720Sq1EjSCPECVbPqmD9GyfM-G6fTIquQn3v_epg
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=Multi-exponentiation+algorithm+based+on+binary+GCD+computation+and+its+application+to+side-channel+countermeasure&rft.jtitle=Journal+of+cryptographic+engineering&rft.au=Yen%2C+Sung-Ming&rft.au=Chen%2C+Chien-Ning&rft.au=Moon%2C+SangJae&rft.date=2012-09-01&rft.issn=2190-8508&rft.eissn=2190-8516&rft.volume=2&rft.issue=2&rft.spage=99&rft.epage=110&rft_id=info:doi/10.1007%2Fs13389-012-0032-4&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s13389_012_0032_4
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2190-8508&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2190-8508&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2190-8508&client=summon