On the concrete hardness of Learning with Errors

The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required t...

Full description

Saved in:
Bibliographic Details
Published inJournal of mathematical cryptology Vol. 9; no. 3; pp. 169 - 203
Main Authors Albrecht, Martin R., Player, Rachel, Scott, Sam
Format Journal Article
LanguageEnglish
Published Berlin De Gruyter 01.10.2015
Walter de Gruyter GmbH
Subjects
Online AccessGet full text

Cover

Loading…
Abstract The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and use a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the LWE problem.
AbstractList The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and use a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the LWE problem.
The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and use a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the LWE problem.
Author Albrecht, Martin R.
Scott, Sam
Player, Rachel
Author_xml – sequence: 1
  givenname: Martin R.
  surname: Albrecht
  fullname: Albrecht, Martin R.
  email: martin.albrecht@rhul.ac.uk
  organization: Information Security Group, Royal Holloway, University of London, UK
– sequence: 2
  givenname: Rachel
  surname: Player
  fullname: Player, Rachel
  email: rachel.player.2013@live.rhul.ac.uk
  organization: Information Security Group, Royal Holloway, University of London, UK
– sequence: 3
  givenname: Sam
  surname: Scott
  fullname: Scott, Sam
  email: sam.scott.2012@live.rhul.ac.uk
  organization: Information Security Group, Royal Holloway, University of London, UK
BookMark eNp1kc1rHDEMxU1Jofk65j7QSy_TSh5_9lZC2gYWcmnOxuPx7HqZtVPbS8h_X2-3hBKSg5AQv_eQeGfkJKboCblC-Iwc-ZftzvUUkPcAKN6RU1SC9lQrdvI8S_GBnJWyBRBSKTwlcBe7uvGdS9FlX323sXmKvpQuzd3K2xxDXHePoW66m5xTLhfk_WyX4i__9XNy__3m1_XPfnX34_b626p3jLPaU8f9DJ7p0TkhAZhUVkjLvabKScVQDtMETk04AZVqlBRBaNR6wqF1P5yT26PvlOzWPOSws_nJJBvM30XKa2NzDW7xZmxKNY9OMgFMa2Y5jtQNALQ9P-PcvD4dvR5y-r33pZpdKM4vi40-7YtBhQIURyYa-vEFuk37HNunBiUqrgcpsFH9kXI5lZL9_HwggjlkYVoW5pCFOWTR-OEF70K1NaRYsw3Lm6qvR9WjXarPk1_n_VMb_jvpNZ0eDvUHRXWeWg
CitedBy_id crossref_primary_10_1109_TPDS_2020_3021238
crossref_primary_10_1155_2020_5328059
crossref_primary_10_1016_j_tcs_2022_10_035
crossref_primary_10_1016_j_arcontrol_2023_100913
crossref_primary_10_1109_TDSC_2020_3040776
crossref_primary_10_1515_jmc_2019_0026
crossref_primary_10_1007_s10207_017_0397_6
crossref_primary_10_1109_TDSC_2020_2967740
crossref_primary_10_1109_TIFS_2024_3357240
crossref_primary_10_1016_j_compeleceng_2024_109358
crossref_primary_10_1186_s42400_024_00215_x
crossref_primary_10_1186_s12920_020_0717_y
crossref_primary_10_1109_ACCESS_2020_3045465
crossref_primary_10_1109_JIOT_2024_3494047
crossref_primary_10_1186_s12920_018_0398_y
crossref_primary_10_1007_s13389_023_00325_1
crossref_primary_10_1109_TCSI_2022_3218192
crossref_primary_10_1109_JIOT_2020_3014686
crossref_primary_10_26634_jdp_6_2_15590
crossref_primary_10_1109_TDSC_2017_2763593
crossref_primary_10_1109_TSC_2021_3111208
crossref_primary_10_1109_ACCESS_2017_2713835
crossref_primary_10_1007_s11432_020_2958_9
crossref_primary_10_1155_2018_9846168
crossref_primary_10_1007_s00145_019_09319_x
crossref_primary_10_1109_TCAD_2024_3357598
crossref_primary_10_1109_TIFS_2019_2925496
crossref_primary_10_1109_TVLSI_2024_3353374
crossref_primary_10_1007_s10623_016_0326_0
crossref_primary_10_1109_ACCESS_2024_3473903
crossref_primary_10_1007_s41870_022_00888_y
crossref_primary_10_1049_ise2_12012
crossref_primary_10_62056_ay4fbn2hd
crossref_primary_10_1049_iet_ifs_2019_0220
crossref_primary_10_1109_TC_2018_2808962
crossref_primary_10_1016_j_jksuci_2023_01_007
crossref_primary_10_1109_TSUSC_2023_3278464
crossref_primary_10_1109_TC_2018_2808527
crossref_primary_10_1109_ACCESS_2019_2925425
crossref_primary_10_1109_TIT_2019_2906233
crossref_primary_10_1016_j_jisa_2022_103386
crossref_primary_10_1186_s12864_022_08469_w
crossref_primary_10_62056_a0zogy4e
crossref_primary_10_1007_s12095_022_00607_1
crossref_primary_10_1109_TC_2018_2874479
crossref_primary_10_3390_math9080858
crossref_primary_10_62056_a69qudhdj
crossref_primary_10_1109_TIFS_2025_3542244
crossref_primary_10_1109_ACCESS_2020_2996000
crossref_primary_10_1109_TVLSI_2020_3017595
crossref_primary_10_1109_ACCESS_2020_2977607
crossref_primary_10_1007_s11432_019_9861_3
crossref_primary_10_1515_auto_2023_0082
crossref_primary_10_3390_math10050728
crossref_primary_10_1109_LCA_2024_3418448
crossref_primary_10_1016_j_tcs_2021_09_010
crossref_primary_10_3390_signals5020012
crossref_primary_10_62056_aee0wa3y6
crossref_primary_10_1186_s12920_018_0401_7
crossref_primary_10_32604_cmc_2023_033102
crossref_primary_10_62056_a09qxrxqi
crossref_primary_10_1016_j_dam_2022_04_018
crossref_primary_10_1109_TIFS_2024_3432279
crossref_primary_10_62056_a0fh89n4e
crossref_primary_10_3390_a15090333
crossref_primary_10_1007_s00145_020_09368_7
crossref_primary_10_1109_TITS_2024_3402962
crossref_primary_10_1016_j_jpdc_2018_04_014
crossref_primary_10_1016_j_cose_2023_103509
crossref_primary_10_1515_jmc_2017_0040
crossref_primary_10_3390_cryptography5040031
crossref_primary_10_3390_sym15091750
crossref_primary_10_1007_s00521_022_07202_8
crossref_primary_10_1109_TIFS_2024_3490862
crossref_primary_10_1587_transfun_E101_A_2162
crossref_primary_10_1093_comjnl_bxad093
crossref_primary_10_2478_popets_2021_0063
crossref_primary_10_3389_frqst_2023_1164428
crossref_primary_10_62056_a6ksdkp10
crossref_primary_10_1016_j_ins_2021_12_053
crossref_primary_10_1007_s12095_022_00597_0
crossref_primary_10_1145_3569420
crossref_primary_10_2139_ssrn_4595287
crossref_primary_10_1587_essfr_11_1_17
crossref_primary_10_1016_j_cels_2021_07_010
crossref_primary_10_3390_cryptography9010013
crossref_primary_10_1109_ACCESS_2023_3326237
crossref_primary_10_1109_JSYST_2020_3023808
crossref_primary_10_1515_jmc_2016_0044
crossref_primary_10_1109_ACCESS_2024_3351738
crossref_primary_10_3390_math11081784
crossref_primary_10_1109_TMC_2024_3373626
crossref_primary_10_1016_j_cosrev_2024_100689
crossref_primary_10_1109_TIFS_2023_3299172
crossref_primary_10_1155_2018_6362010
crossref_primary_10_1007_s00145_024_09530_5
crossref_primary_10_1016_j_tcs_2023_114026
crossref_primary_10_1016_j_tcs_2024_114943
crossref_primary_10_1109_TC_2022_3227874
crossref_primary_10_2478_popets_2021_0030
crossref_primary_10_62056_a01zogy4e
crossref_primary_10_1109_TDSC_2021_3105111
crossref_primary_10_1109_TIFS_2021_3114032
crossref_primary_10_1186_s13059_024_03447_9
crossref_primary_10_1109_ACCESS_2018_2884084
crossref_primary_10_1109_TETC_2020_3014636
crossref_primary_10_1016_j_tcs_2022_02_005
crossref_primary_10_3233_JIFS_221454
crossref_primary_10_1109_TIT_2020_2967047
crossref_primary_10_1145_3721487
crossref_primary_10_1109_TIFS_2023_3301740
crossref_primary_10_1007_s44007_024_00111_3
crossref_primary_10_1007_s10462_024_11076_8
crossref_primary_10_1016_j_cosrev_2024_100676
crossref_primary_10_1186_s12920_017_0276_z
crossref_primary_10_1109_ACCESS_2019_2913850
crossref_primary_10_1109_TETC_2019_2902799
crossref_primary_10_1093_comjnl_bxac141
crossref_primary_10_1109_TIFS_2019_2946097
crossref_primary_10_2478_popets_2021_0046
crossref_primary_10_1109_JPROC_2022_3205665
crossref_primary_10_1109_TC_2022_3207119
crossref_primary_10_3389_fncom_2021_799977
crossref_primary_10_1007_s11063_025_11738_w
crossref_primary_10_1186_s42400_023_00158_9
crossref_primary_10_1007_s10207_024_00823_1
crossref_primary_10_1007_s11432_020_3226_6
crossref_primary_10_1109_ACCESS_2024_3380915
crossref_primary_10_1007_s10623_021_00851_1
crossref_primary_10_1007_s10791_024_09449_2
crossref_primary_10_1007_s12095_024_00771_6
crossref_primary_10_1186_s12920_020_0722_1
crossref_primary_10_62056_av11c3w9p
crossref_primary_10_1007_s00145_023_09463_5
crossref_primary_10_1109_TIFS_2021_3090959
crossref_primary_10_1016_j_jisa_2024_103826
crossref_primary_10_1109_TSC_2023_3331000
crossref_primary_10_1587_transfun_2019CIP0027
crossref_primary_10_1007_s11704_021_1073_6
crossref_primary_10_3390_cryptography6040056
crossref_primary_10_1007_s10207_019_00456_9
crossref_primary_10_1109_TIFS_2025_3544066
crossref_primary_10_1109_TIFS_2022_3188145
crossref_primary_10_1109_TIFS_2023_3267677
crossref_primary_10_1109_MSP_2017_3151338
crossref_primary_10_1007_s11227_023_05574_9
crossref_primary_10_3390_sym15020355
crossref_primary_10_62056_anxra69p1
crossref_primary_10_1109_TDSC_2021_3139318
crossref_primary_10_1007_s10623_024_01524_5
crossref_primary_10_1587_transfun_E101_A_3
crossref_primary_10_1109_TCSII_2021_3064232
crossref_primary_10_1109_TIFS_2024_3372804
crossref_primary_10_62056_anxrxrxqi
crossref_primary_10_1109_TVLSI_2017_2697841
crossref_primary_10_1109_TDSC_2024_3363900
crossref_primary_10_1038_s41467_022_32168_5
crossref_primary_10_1186_s42400_022_00115_y
crossref_primary_10_62056_a3n5qj888
crossref_primary_10_1038_s41598_023_48475_w
crossref_primary_10_1016_j_jestch_2022_101094
crossref_primary_10_1049_ise2_12039
crossref_primary_10_1140_epjqt_s40507_021_00104_z
crossref_primary_10_1371_journal_pone_0310708
crossref_primary_10_1007_s00145_020_09366_9
crossref_primary_10_1007_s11227_022_04745_4
crossref_primary_10_1007_s11704_018_6507_4
crossref_primary_10_1109_TIFS_2023_3298258
crossref_primary_10_1109_ACCESS_2024_3511346
crossref_primary_10_2478_popets_2021_0020
crossref_primary_10_62056_aebn_4c2h
crossref_primary_10_1109_JIOT_2021_3122276
ContentType Journal Article
Copyright Copyright Walter de Gruyter GmbH Oct 2015
Copyright_xml – notice: Copyright Walter de Gruyter GmbH Oct 2015
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOA
DOI 10.1515/jmc-2015-0016
DatabaseName CrossRef
Computer and Information Systems 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
DOAJ Directory of Open Access Journals (WRLC)
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList CrossRef
Computer and Information Systems Abstracts

Computer and Information Systems Abstracts

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1862-2984
EndPage 203
ExternalDocumentID oai_doaj_org_article_b0698fbc74604994a51b2c3002298f1f
3825515541
10_1515_jmc_2015_0016
10_1515_jmc_2015_001693169
GrantInformation_xml – fundername: EPSRC
  grantid: EP/L018543/1
– fundername: EPSRC
  grantid: EP/K035584/1
– fundername: ACE-CSR PhD grant
GroupedDBID 0R~
0~D
4.4
AAFPC
AAFWJ
AAGVJ
AAONY
AAQCX
AASOL
AASQH
AAWFC
AAXCG
ABAOT
ABAQN
ABFKT
ABIQR
ABSOE
ABUVI
ABXMZ
ABYKJ
ACEFL
ACGFS
ACIWK
ACMKP
ACXLN
ACZBO
ADALX
ADGQD
ADGYE
ADJVZ
ADOZN
AEJTT
AEKEB
AEQDQ
AERZL
AEXIE
AFBAA
AFBDD
AFCXV
AFGNR
AFPKN
AFQUK
AHGSO
AIERV
AIKXB
AJATJ
AKXKS
ALMA_UNASSIGNED_HOLDINGS
AMAVY
AMVHM
AZMOX
BAKPI
BBCWN
BCIFA
BLHJL
CFGNV
CS3
EBS
EJD
GROUPED_DOAJ
HZ~
IY9
J9A
O9-
OK1
P2P
PQQKQ
QD8
RDG
SA.
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c454t-2c5ef0e49bcc6700478a67a5e928c784173dd0c8d1d0278b721069199d13691e3
IEDL.DBID DOA
ISSN 1862-2976
IngestDate Wed Aug 27 01:31:11 EDT 2025
Fri Jul 11 16:21:11 EDT 2025
Mon Jun 30 09:58:09 EDT 2025
Tue Jul 01 04:26:42 EDT 2025
Thu Apr 24 23:03:12 EDT 2025
Thu Jul 10 10:40:23 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License http://creativecommons.org/licenses/by-nc-nd/3.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c454t-2c5ef0e49bcc6700478a67a5e928c784173dd0c8d1d0278b721069199d13691e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
OpenAccessLink https://doaj.org/article/b0698fbc74604994a51b2c3002298f1f
PQID 1718593761
PQPubID 2030086
PageCount 35
ParticipantIDs doaj_primary_oai_doaj_org_article_b0698fbc74604994a51b2c3002298f1f
proquest_miscellaneous_1816085146
proquest_journals_1718593761
crossref_primary_10_1515_jmc_2015_0016
crossref_citationtrail_10_1515_jmc_2015_0016
walterdegruyter_journals_10_1515_jmc_2015_001693169
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2015-10-1
20151001
2015-10-01
PublicationDateYYYYMMDD 2015-10-01
PublicationDate_xml – month: 10
  year: 2015
  text: 2015-10-1
  day: 01
PublicationDecade 2010
PublicationPlace Berlin
PublicationPlace_xml – name: Berlin
PublicationTitle Journal of mathematical cryptology
PublicationYear 2015
Publisher De Gruyter
Walter de Gruyter GmbH
Publisher_xml – name: De Gruyter
– name: Walter de Gruyter GmbH
SSID ssj0067881
Score 2.5438673
SecondaryResourceType review_article
Snippet The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness...
SourceID doaj
proquest
crossref
walterdegruyter
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 169
SubjectTerms 11T71
94A60
Algorithms
Applied mathematics
Concretes
Cryptography
Errors
Estimates
Hardness
lattice reduction
lattice-based cryptography
Lattices
Learning
Learning with Errors
Reduction
Title On the concrete hardness of Learning with Errors
URI https://www.degruyter.com/doi/10.1515/jmc-2015-0016
https://www.proquest.com/docview/1718593761
https://www.proquest.com/docview/1816085146
https://doaj.org/article/b0698fbc74604994a51b2c3002298f1f
Volume 9
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3fS8MwEA4yX_Rh-BOnc0QQnyxrmjRtHqdsDkH3oIO9lSZNB6KddB3if-9d241NFF98KKVpKMfdJfddL_lCyCVENRZb6TtBmApHMKscyGzBl8FXmNba9dJyle-jHI7F_cSfrB31hWvCKnrgSnFd7UoVptoEQiI6F7HPtGc4xh5oZynOvhDzlslUNQdLJEnHVAvwuuNBxK3ZNSF4d1_eDLgG8x1EOxvRqCTt30CazY-yZp3Yab74LJY10jL0DPZIs8aMtFfJuk-2bHZAdh9WhKvzQ-KOMgqPFLJbgIGFpbiZCmcxOktpzaE6pfjTlfbzfJbPj8h40H--HTr1YQiOEb4oHM_4NnWtUNoY3FojgjCWQexb5YUGi4cBTxLXhAlLsJioIbMDzTGlEsbhbvkxaWSzzJ4QGmC10g08nooUT6sKeWh5DMBQATrUQrXI9VIpkamZwvHAitcIMwbQYQQ6jFCHuCJOtsjVqvt7RZHxW8cb1PCqEzJblw1g76i2d_SXvVukvbRPVA-3ecQgwvoAtCRrkYvVaxgoWP2IMztbQJ-QScSXAuTg3-y69qWfBFccrtP_kP6M7JS-V64GbJNGkS_sOaCaQnfIdm949zTqlI78BczX7i8
linkProvider Directory of Open Access Journals
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB7B9gA9VOUlFlowEuJEtHHsOPaxoJYF-jjQStys2HEWVW2Cslkh_j0zWW_U8rhwiKI4jmWNx5lvPOPPAK_RqvEyqDwpdC0TyYNJ0LNFXUZd4c65NKuHLN9TNb-Qn77mm2zCZUyrrMKiW_3s1wyps6r1K1ooG7kG0ALPLq89ji_PE4Iss2_99dVd2FII_vUEtg7mH76cbX7HivjSyetC6J5kaHwj0eYfrdwyTAN__y3QufNjCF-PfbthhY52YSfCR3awHu8HcCc0D2H7ZOReXT6C9Kxh-MjQ0UVE2AdG-6roh8bamkU61QWj9Vd22HVtt3wMF0eH5-_nSTwXIfEyl32S-TzUaZDGeU-7bGShS1WUeTCZ9hRHLERVpV5XvKK4okMnL1WGG1NxgfcgnsCkaZvwFFhBgcu0yEQtazq4SgsdRIkY0SBQdNJM4e1GKNZH0nA6u-LKkvOAMrQoQ0sypOQ4NYU3Y_Xva7aMf1V8RxIeKxHJ9VDQdgsb54x12GtdO19IRY6ZLHPuMi8IdmA5r6ewtxkfG2fe0nLUgRwxl-JTeDW-xjlDgZCyCe0K62iuCGpK7If4bVxvtPS3jhuB17P_-uol3Jufnxzb44-nn5_D_UHxhqzAPZj03SrsI7rp3Yuov78AnWTwDw
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La9wwEB7aDZTmENIX3TRJVSg91axlybJ1TNJst6-k0AZyE5YsLZTWDl4vJf8-M16v2bTppQdjLMtCjEaebzSjTwCv0arxwqs0yvIgI8m9jtCzRV1GXeHW2jgJXZbvmZpdyI-X6eXGLn5Kqyz9vFletyuG1ElZuyUtlA1cA2iBJz9-ORxfnkYEWSZXZbgPW0ppIUewdTR7_-18_TdWRJdOThci9yhB29vzbP7VyC271NH338KcO7-76PXQtQ0jNN2FnR49sqPVcD-Ce756DNtfBurVxROIzyuGjwz9XASErWe0rYr-Z6wOrGdTnTNafmWnTVM3i6dwMT39fjKL-mMRIidT2UaJS32IvdTWOdpkI7O8UFmRep3kjsKImSjL2OUlLymsaNHHi5XmWpdc4N2LZzCq6so_B5ZR3DLOEhFkoHOrcpF7USBE1IgTrdRjeLsWinE9ZzgdXfHTkO-AMjQoQ0MypNw4NYY3Q_WrFVnGvyoek4SHSsRx3RXUzdz0U8ZY7HUerMukIr9MFim3iROEOrCchzHsr8fH9BNvYTja2hQhl-JjeDW8xilDcZCi8vUS6-RcEdKU2A_xx7hutHRXx7XAa--_vnoJD76-m5rPH84-vYCHnd51OYH7MGqbpT9AbNPaw159bwAkDO81
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=On+the+concrete+hardness+of+Learning+with+Errors&rft.jtitle=Journal+of+mathematical+cryptology&rft.au=Albrecht%2C+Martin+R.&rft.au=Player%2C+Rachel&rft.au=Scott%2C+Sam&rft.date=2015-10-01&rft.pub=De+Gruyter&rft.issn=1862-2976&rft.eissn=1862-2984&rft.volume=9&rft.issue=3&rft.spage=169&rft.epage=203&rft_id=info:doi/10.1515%2Fjmc-2015-0016&rft.externalDBID=n%2Fa&rft.externalDocID=10_1515_jmc_2015_001693169
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-2976&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-2976&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-2976&client=summon