On the asymptotic effectiveness of Weil descent attacks

In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possibl...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Karabina Koray [verfasserIn] Menezes Alfred [verfasserIn] Pomerance Carl [verfasserIn] Shparlinski Igor E. [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2010

Schlagwörter:	elliptic curve discrete logarithm problem weil descent attacks

Übergeordnetes Werk:	In: Journal of Mathematical Cryptology - De Gruyter, 2020, 4(2010), 2, Seite 175-191
Übergeordnetes Werk:	volume:4 ; year:2010 ; number:2 ; pages:175-191

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc Journal toc

DOI / URN:	10.1515/jmc.2010.007

Katalog-ID:	DOAJ085477877

Internformat


LEADER	01000naa a22002652 4500
001	DOAJ085477877
003	DE-627
005	20230311035312.0
007	cr uuu---uuuuu
008	230311s2010 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1515/jmc.2010.007 \|2 doi
035			\|a (DE-627)DOAJ085477877
035			\|a (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QA1-939
100	0		\|a Karabina Koray \|e verfasserin \|4 aut
245	1	0	\|a On the asymptotic effectiveness of Weil descent attacks
264		1	\|c 2010
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.
650		4	\|a elliptic curve discrete logarithm problem
650		4	\|a weil descent attacks
653		0	\|a Mathematics
700	0		\|a Menezes Alfred \|e verfasserin \|4 aut
700	0		\|a Pomerance Carl \|e verfasserin \|4 aut
700	0		\|a Shparlinski Igor E. \|e verfasserin \|4 aut
773	0	8	\|i In \|t Journal of Mathematical Cryptology \|d De Gruyter, 2020 \|g 4(2010), 2, Seite 175-191 \|w (DE-627)527640387 \|w (DE-600)2278189-4 \|x 18622984 \|7 nnns
773	1	8	\|g volume:4 \|g year:2010 \|g number:2 \|g pages:175-191
856	4	0	\|u https://doi.org/10.1515/jmc.2010.007 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 \|z kostenfrei
856	4	0	\|u https://doi.org/10.1515/jmc.2010.007 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1862-2976 \|y Journal toc \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1862-2984 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_120
912			\|a GBV_ILN_121
912			\|a GBV_ILN_151
912			\|a GBV_ILN_152
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_187
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_250
912			\|a GBV_ILN_281
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_374
912			\|a GBV_ILN_602
912			\|a GBV_ILN_647
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2891
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 4 \|j 2010 \|e 2 \|h 175-191

Indexfelder

author_variant	k k kk m a ma p c pc s i e sie
matchkey_str	article:18622984:2010----::nhaypoiefcieesfele
hierarchy_sort_str	2010
callnumber-subject-code	QA
publishDate	2010
allfields	10.1515/jmc.2010.007 doi (DE-627)DOAJ085477877 (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19 DE-627 ger DE-627 rakwb eng QA1-939 Karabina Koray verfasserin aut On the asymptotic effectiveness of Weil descent attacks 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead. elliptic curve discrete logarithm problem weil descent attacks Mathematics Menezes Alfred verfasserin aut Pomerance Carl verfasserin aut Shparlinski Igor E. verfasserin aut In Journal of Mathematical Cryptology De Gruyter, 2020 4(2010), 2, Seite 175-191 (DE-627)527640387 (DE-600)2278189-4 18622984 nnns volume:4 year:2010 number:2 pages:175-191 https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 kostenfrei https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/toc/1862-2976 Journal toc kostenfrei https://doaj.org/toc/1862-2984 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_121 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_187 GBV_ILN_213 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_374 GBV_ILN_602 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2190 GBV_ILN_2891 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2010 2 175-191
spelling	10.1515/jmc.2010.007 doi (DE-627)DOAJ085477877 (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19 DE-627 ger DE-627 rakwb eng QA1-939 Karabina Koray verfasserin aut On the asymptotic effectiveness of Weil descent attacks 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead. elliptic curve discrete logarithm problem weil descent attacks Mathematics Menezes Alfred verfasserin aut Pomerance Carl verfasserin aut Shparlinski Igor E. verfasserin aut In Journal of Mathematical Cryptology De Gruyter, 2020 4(2010), 2, Seite 175-191 (DE-627)527640387 (DE-600)2278189-4 18622984 nnns volume:4 year:2010 number:2 pages:175-191 https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 kostenfrei https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/toc/1862-2976 Journal toc kostenfrei https://doaj.org/toc/1862-2984 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_121 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_187 GBV_ILN_213 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_374 GBV_ILN_602 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2190 GBV_ILN_2891 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2010 2 175-191
allfields_unstemmed	10.1515/jmc.2010.007 doi (DE-627)DOAJ085477877 (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19 DE-627 ger DE-627 rakwb eng QA1-939 Karabina Koray verfasserin aut On the asymptotic effectiveness of Weil descent attacks 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead. elliptic curve discrete logarithm problem weil descent attacks Mathematics Menezes Alfred verfasserin aut Pomerance Carl verfasserin aut Shparlinski Igor E. verfasserin aut In Journal of Mathematical Cryptology De Gruyter, 2020 4(2010), 2, Seite 175-191 (DE-627)527640387 (DE-600)2278189-4 18622984 nnns volume:4 year:2010 number:2 pages:175-191 https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 kostenfrei https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/toc/1862-2976 Journal toc kostenfrei https://doaj.org/toc/1862-2984 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_121 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_187 GBV_ILN_213 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_374 GBV_ILN_602 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2190 GBV_ILN_2891 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2010 2 175-191
allfieldsGer	10.1515/jmc.2010.007 doi (DE-627)DOAJ085477877 (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19 DE-627 ger DE-627 rakwb eng QA1-939 Karabina Koray verfasserin aut On the asymptotic effectiveness of Weil descent attacks 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead. elliptic curve discrete logarithm problem weil descent attacks Mathematics Menezes Alfred verfasserin aut Pomerance Carl verfasserin aut Shparlinski Igor E. verfasserin aut In Journal of Mathematical Cryptology De Gruyter, 2020 4(2010), 2, Seite 175-191 (DE-627)527640387 (DE-600)2278189-4 18622984 nnns volume:4 year:2010 number:2 pages:175-191 https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 kostenfrei https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/toc/1862-2976 Journal toc kostenfrei https://doaj.org/toc/1862-2984 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_121 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_187 GBV_ILN_213 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_374 GBV_ILN_602 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2190 GBV_ILN_2891 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2010 2 175-191
allfieldsSound	10.1515/jmc.2010.007 doi (DE-627)DOAJ085477877 (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19 DE-627 ger DE-627 rakwb eng QA1-939 Karabina Koray verfasserin aut On the asymptotic effectiveness of Weil descent attacks 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead. elliptic curve discrete logarithm problem weil descent attacks Mathematics Menezes Alfred verfasserin aut Pomerance Carl verfasserin aut Shparlinski Igor E. verfasserin aut In Journal of Mathematical Cryptology De Gruyter, 2020 4(2010), 2, Seite 175-191 (DE-627)527640387 (DE-600)2278189-4 18622984 nnns volume:4 year:2010 number:2 pages:175-191 https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 kostenfrei https://doi.org/10.1515/jmc.2010.007 kostenfrei https://doaj.org/toc/1862-2976 Journal toc kostenfrei https://doaj.org/toc/1862-2984 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_121 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_187 GBV_ILN_213 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_374 GBV_ILN_602 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2190 GBV_ILN_2891 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2010 2 175-191
language	English
source	In Journal of Mathematical Cryptology 4(2010), 2, Seite 175-191 volume:4 year:2010 number:2 pages:175-191
sourceStr	In Journal of Mathematical Cryptology 4(2010), 2, Seite 175-191 volume:4 year:2010 number:2 pages:175-191
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	elliptic curve discrete logarithm problem weil descent attacks Mathematics
isfreeaccess_bool	true
container_title	Journal of Mathematical Cryptology
authorswithroles_txt_mv	Karabina Koray @@aut@@ Menezes Alfred @@aut@@ Pomerance Carl @@aut@@ Shparlinski Igor E. @@aut@@
publishDateDaySort_date	2010-01-01T00:00:00Z
hierarchy_top_id	527640387
id	DOAJ085477877
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ085477877</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230311035312.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230311s2010 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/jmc.2010.007</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ085477877</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Karabina Koray</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the asymptotic effectiveness of Weil descent attacks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">elliptic curve discrete logarithm problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">weil descent attacks</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Menezes Alfred</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Pomerance Carl</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shparlinski Igor E.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Mathematical Cryptology</subfield><subfield code="d">De Gruyter, 2020</subfield><subfield code="g">4(2010), 2, Seite 175-191</subfield><subfield code="w">(DE-627)527640387</subfield><subfield code="w">(DE-600)2278189-4</subfield><subfield code="x">18622984</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:175-191</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/jmc.2010.007</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/jmc.2010.007</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1862-2976</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1862-2984</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_121</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_374</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2891</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2010</subfield><subfield code="e">2</subfield><subfield code="h">175-191</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Karabina Koray
spellingShingle	Karabina Koray misc QA1-939 misc elliptic curve discrete logarithm problem misc weil descent attacks misc Mathematics On the asymptotic effectiveness of Weil descent attacks
authorStr	Karabina Koray
ppnlink_with_tag_str_mv	@@773@@(DE-627)527640387
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	QA1-939
illustrated	Not Illustrated
issn	18622984
topic_title	QA1-939 On the asymptotic effectiveness of Weil descent attacks elliptic curve discrete logarithm problem weil descent attacks
topic	misc QA1-939 misc elliptic curve discrete logarithm problem misc weil descent attacks misc Mathematics
topic_unstemmed	misc QA1-939 misc elliptic curve discrete logarithm problem misc weil descent attacks misc Mathematics
topic_browse	misc QA1-939 misc elliptic curve discrete logarithm problem misc weil descent attacks misc Mathematics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of Mathematical Cryptology
hierarchy_parent_id	527640387
hierarchy_top_title	Journal of Mathematical Cryptology
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)527640387 (DE-600)2278189-4
title	On the asymptotic effectiveness of Weil descent attacks
ctrlnum	(DE-627)DOAJ085477877 (DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19
title_full	On the asymptotic effectiveness of Weil descent attacks
author_sort	Karabina Koray
journal	Journal of Mathematical Cryptology
journalStr	Journal of Mathematical Cryptology
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2010
contenttype_str_mv	txt
container_start_page	175
author_browse	Karabina Koray Menezes Alfred Pomerance Carl Shparlinski Igor E.
container_volume	4
class	QA1-939
format_se	Elektronische Aufsätze
author-letter	Karabina Koray
doi_str_mv	10.1515/jmc.2010.007
author2-role	verfasserin
title_sort	on the asymptotic effectiveness of weil descent attacks
callnumber	QA1-939
title_auth	On the asymptotic effectiveness of Weil descent attacks
abstract	In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.
abstractGer	In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.
abstract_unstemmed	In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_121 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_187 GBV_ILN_213 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_374 GBV_ILN_602 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2190 GBV_ILN_2891 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	2
title_short	On the asymptotic effectiveness of Weil descent attacks
url	https://doi.org/10.1515/jmc.2010.007 https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19 https://doaj.org/toc/1862-2976 https://doaj.org/toc/1862-2984
remote_bool	true
author2	Menezes Alfred Pomerance Carl Shparlinski Igor E.
author2Str	Menezes Alfred Pomerance Carl Shparlinski Igor E.
ppnlink	527640387
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1515/jmc.2010.007
callnumber-a	QA1-939
up_date	2024-07-03T14:58:38.010Z
_version_	1803570347260248064
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ085477877</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230311035312.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230311s2010 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/jmc.2010.007</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ085477877</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJf725ea9803fa4d25aea41f73dc139c19</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Karabina Koray</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the asymptotic effectiveness of Weil descent attacks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">elliptic curve discrete logarithm problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">weil descent attacks</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Menezes Alfred</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Pomerance Carl</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shparlinski Igor E.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Mathematical Cryptology</subfield><subfield code="d">De Gruyter, 2020</subfield><subfield code="g">4(2010), 2, Seite 175-191</subfield><subfield code="w">(DE-627)527640387</subfield><subfield code="w">(DE-600)2278189-4</subfield><subfield code="x">18622984</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:175-191</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/jmc.2010.007</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/f725ea9803fa4d25aea41f73dc139c19</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/jmc.2010.007</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1862-2976</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1862-2984</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_121</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_374</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2891</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2010</subfield><subfield code="e">2</subfield><subfield code="h">175-191</subfield></datafield></record></collection>
score	7.399768

Nicht das Richtige dabei?

Schreiben Sie uns!

On the asymptotic effectiveness of Weil descent attacks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?