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: |
|---|
| Format: |
E-Artikel |
|---|
| Erschienen: |
Walter de Gruyter GmbH & Co. KG ; 2010 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© de Gruyter 2010 |
|---|---|
| Umfang: |
17 |
| Reproduktion: |
Walter de Gruyter Online Zeitschriften |
|---|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of mathematical cryptology - Berlin [u.a.] : de Gruyter, 2007, 4(2010), 2 vom: 23. Aug., Seite 175-191 |
| Übergeordnetes Werk: |
volume:4 ; year:2010 ; number:2 ; day:23 ; month:08 ; pages:175-191 ; extent:17 |
| Links: |
|---|
| DOI / URN: |
10.1515/jmc.2010.007 |
|---|
| Katalog-ID: |
NLEJ247109010 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ247109010 | ||
| 003 | DE-627 | ||
| 005 | 20220820030325.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 220814s2010 xx |||||o 00| ||und c | ||
| 024 | 7 | |a 10.1515/jmc.2010.007 |2 doi | |
| 028 | 5 | 2 | |a artikel_Grundlieferung.pp |
| 035 | |a (DE-627)NLEJ247109010 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 245 | 1 | 0 | |a On the asymptotic effectiveness of Weil descent attacks |
| 264 | 1 | |b Walter de Gruyter GmbH & Co. KG |c 2010 | |
| 300 | |a 17 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © de Gruyter 2010 | ||
| 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. | ||
| 533 | |f Walter de Gruyter Online Zeitschriften | ||
| 650 | 4 | |a Elliptic curve discrete logarithm problem | |
| 650 | 4 | |a Weil descent attacks | |
| 700 | 1 | |a Karabina, Koray |4 oth | |
| 700 | 1 | |a Menezes, Alfred |4 oth | |
| 700 | 1 | |a Pomerance, Carl |4 oth | |
| 700 | 1 | |a Shparlinski, Igor E. |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of mathematical cryptology |d Berlin [u.a.] : de Gruyter, 2007 |g 4(2010), 2 vom: 23. Aug., Seite 175-191 |w (DE-627)NLEJ248236156 |w (DE-600)2278189-4 |x 1862-2984 |7 nnns |
| 773 | 1 | 8 | |g volume:4 |g year:2010 |g number:2 |g day:23 |g month:08 |g pages:175-191 |g extent:17 |
| 856 | 4 | 0 | |u https://doi.org/10.1515/jmc.2010.007 |z Deutschlandweit zugänglich |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-DGR | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 4 |j 2010 |e 2 |b 23 |c 08 |h 175-191 |g 17 | ||
| matchkey_str |
article:18622984:2010----::nhaypoiefcieesfele |
|---|---|
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.1515/jmc.2010.007 doi artikel_Grundlieferung.pp (DE-627)NLEJ247109010 DE-627 ger DE-627 rakwb On the asymptotic effectiveness of Weil descent attacks Walter de Gruyter GmbH & Co. KG 2010 17 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © de Gruyter 2010 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. Walter de Gruyter Online Zeitschriften Elliptic curve discrete logarithm problem Weil descent attacks Karabina, Koray oth Menezes, Alfred oth Pomerance, Carl oth Shparlinski, Igor E. oth Enthalten in Journal of mathematical cryptology Berlin [u.a.] : de Gruyter, 2007 4(2010), 2 vom: 23. Aug., Seite 175-191 (DE-627)NLEJ248236156 (DE-600)2278189-4 1862-2984 nnns volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 https://doi.org/10.1515/jmc.2010.007 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 4 2010 2 23 08 175-191 17 |
| spelling |
10.1515/jmc.2010.007 doi artikel_Grundlieferung.pp (DE-627)NLEJ247109010 DE-627 ger DE-627 rakwb On the asymptotic effectiveness of Weil descent attacks Walter de Gruyter GmbH & Co. KG 2010 17 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © de Gruyter 2010 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. Walter de Gruyter Online Zeitschriften Elliptic curve discrete logarithm problem Weil descent attacks Karabina, Koray oth Menezes, Alfred oth Pomerance, Carl oth Shparlinski, Igor E. oth Enthalten in Journal of mathematical cryptology Berlin [u.a.] : de Gruyter, 2007 4(2010), 2 vom: 23. Aug., Seite 175-191 (DE-627)NLEJ248236156 (DE-600)2278189-4 1862-2984 nnns volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 https://doi.org/10.1515/jmc.2010.007 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 4 2010 2 23 08 175-191 17 |
| allfields_unstemmed |
10.1515/jmc.2010.007 doi artikel_Grundlieferung.pp (DE-627)NLEJ247109010 DE-627 ger DE-627 rakwb On the asymptotic effectiveness of Weil descent attacks Walter de Gruyter GmbH & Co. KG 2010 17 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © de Gruyter 2010 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. Walter de Gruyter Online Zeitschriften Elliptic curve discrete logarithm problem Weil descent attacks Karabina, Koray oth Menezes, Alfred oth Pomerance, Carl oth Shparlinski, Igor E. oth Enthalten in Journal of mathematical cryptology Berlin [u.a.] : de Gruyter, 2007 4(2010), 2 vom: 23. Aug., Seite 175-191 (DE-627)NLEJ248236156 (DE-600)2278189-4 1862-2984 nnns volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 https://doi.org/10.1515/jmc.2010.007 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 4 2010 2 23 08 175-191 17 |
| allfieldsGer |
10.1515/jmc.2010.007 doi artikel_Grundlieferung.pp (DE-627)NLEJ247109010 DE-627 ger DE-627 rakwb On the asymptotic effectiveness of Weil descent attacks Walter de Gruyter GmbH & Co. KG 2010 17 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © de Gruyter 2010 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. Walter de Gruyter Online Zeitschriften Elliptic curve discrete logarithm problem Weil descent attacks Karabina, Koray oth Menezes, Alfred oth Pomerance, Carl oth Shparlinski, Igor E. oth Enthalten in Journal of mathematical cryptology Berlin [u.a.] : de Gruyter, 2007 4(2010), 2 vom: 23. Aug., Seite 175-191 (DE-627)NLEJ248236156 (DE-600)2278189-4 1862-2984 nnns volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 https://doi.org/10.1515/jmc.2010.007 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 4 2010 2 23 08 175-191 17 |
| allfieldsSound |
10.1515/jmc.2010.007 doi artikel_Grundlieferung.pp (DE-627)NLEJ247109010 DE-627 ger DE-627 rakwb On the asymptotic effectiveness of Weil descent attacks Walter de Gruyter GmbH & Co. KG 2010 17 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © de Gruyter 2010 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. Walter de Gruyter Online Zeitschriften Elliptic curve discrete logarithm problem Weil descent attacks Karabina, Koray oth Menezes, Alfred oth Pomerance, Carl oth Shparlinski, Igor E. oth Enthalten in Journal of mathematical cryptology Berlin [u.a.] : de Gruyter, 2007 4(2010), 2 vom: 23. Aug., Seite 175-191 (DE-627)NLEJ248236156 (DE-600)2278189-4 1862-2984 nnns volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 https://doi.org/10.1515/jmc.2010.007 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 4 2010 2 23 08 175-191 17 |
| source |
Enthalten in Journal of mathematical cryptology 4(2010), 2 vom: 23. Aug., Seite 175-191 volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 |
| sourceStr |
Enthalten in Journal of mathematical cryptology 4(2010), 2 vom: 23. Aug., Seite 175-191 volume:4 year:2010 number:2 day:23 month:08 pages:175-191 extent:17 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Elliptic curve discrete logarithm problem Weil descent attacks |
| isfreeaccess_bool |
false |
| container_title |
Journal of mathematical cryptology |
| authorswithroles_txt_mv |
Karabina, Koray @@oth@@ Menezes, Alfred @@oth@@ Pomerance, Carl @@oth@@ Shparlinski, Igor E. @@oth@@ |
| publishDateDaySort_date |
2010-08-23T00:00:00Z |
| hierarchy_top_id |
NLEJ248236156 |
| id |
NLEJ247109010 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ247109010</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220820030325.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220814s2010 xx |||||o 00| ||und 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="028" ind1="5" ind2="2"><subfield code="a">artikel_Grundlieferung.pp</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ247109010</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="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="b">Walter de Gruyter GmbH & Co. KG</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17</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="500" ind1=" " ind2=" "><subfield code="a">© de Gruyter 2010</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="533" ind1=" " ind2=" "><subfield code="f">Walter de Gruyter Online Zeitschriften</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="700" ind1="1" ind2=" "><subfield code="a">Karabina, Koray</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Menezes, Alfred</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pomerance, Carl</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shparlinski, Igor E.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of mathematical cryptology</subfield><subfield code="d">Berlin [u.a.] : de Gruyter, 2007</subfield><subfield code="g">4(2010), 2 vom: 23. Aug., Seite 175-191</subfield><subfield code="w">(DE-627)NLEJ248236156</subfield><subfield code="w">(DE-600)2278189-4</subfield><subfield code="x">1862-2984</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">day:23</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:175-191</subfield><subfield code="g">extent:17</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/jmc.2010.007</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DGR</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</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="b">23</subfield><subfield code="c">08</subfield><subfield code="h">175-191</subfield><subfield code="g">17</subfield></datafield></record></collection>
|
| series2 |
Walter de Gruyter Online Zeitschriften |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ248236156 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1862-2984 |
| topic_title |
On the asymptotic effectiveness of Weil descent attacks Elliptic curve discrete logarithm problem Weil descent attacks |
| publisher |
Walter de Gruyter GmbH & Co. KG |
| publisherStr |
Walter de Gruyter GmbH & Co. KG |
| topic |
misc Elliptic curve discrete logarithm problem misc Weil descent attacks |
| spellingShingle |
misc Elliptic curve discrete logarithm problem misc Weil descent attacks On the asymptotic effectiveness of Weil descent attacks |
| topic_unstemmed |
misc Elliptic curve discrete logarithm problem misc Weil descent attacks |
| topic_browse |
misc Elliptic curve discrete logarithm problem misc Weil descent attacks |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| author2_variant |
k k kk a m am c p cp i e s ie ies |
| hierarchy_parent_title |
Journal of mathematical cryptology |
| hierarchy_parent_id |
NLEJ248236156 |
| hierarchy_top_title |
Journal of mathematical cryptology |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ248236156 (DE-600)2278189-4 |
| title |
On the asymptotic effectiveness of Weil descent attacks |
| ctrlnum |
(DE-627)NLEJ247109010 |
| title_full |
On the asymptotic effectiveness of Weil descent attacks |
| journal |
Journal of mathematical cryptology |
| journalStr |
Journal of mathematical cryptology |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2010 |
| contenttype_str_mv |
txt |
| container_start_page |
175 |
| container_volume |
4 |
| physical |
17 |
| format_se |
Elektronische Aufsätze |
| doi_str_mv |
10.1515/jmc.2010.007 |
| title_sort |
on the asymptotic effectiveness of weil descent attacks |
| 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. © de Gruyter 2010 |
| 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. © de Gruyter 2010 |
| 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. © de Gruyter 2010 |
| collection_details |
GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE |
| container_issue |
2 |
| title_short |
On the asymptotic effectiveness of Weil descent attacks |
| url |
https://doi.org/10.1515/jmc.2010.007 |
| remote_bool |
true |
| author2 |
Karabina, Koray Menezes, Alfred Pomerance, Carl Shparlinski, Igor E. |
| author2Str |
Karabina, Koray Menezes, Alfred Pomerance, Carl Shparlinski, Igor E. |
| ppnlink |
NLEJ248236156 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1515/jmc.2010.007 |
| up_date |
2024-07-06T09:58:04.396Z |
| _version_ |
1803823228541468672 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ247109010</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220820030325.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220814s2010 xx |||||o 00| ||und 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="028" ind1="5" ind2="2"><subfield code="a">artikel_Grundlieferung.pp</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ247109010</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="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="b">Walter de Gruyter GmbH & Co. KG</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17</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="500" ind1=" " ind2=" "><subfield code="a">© de Gruyter 2010</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="533" ind1=" " ind2=" "><subfield code="f">Walter de Gruyter Online Zeitschriften</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="700" ind1="1" ind2=" "><subfield code="a">Karabina, Koray</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Menezes, Alfred</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pomerance, Carl</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shparlinski, Igor E.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of mathematical cryptology</subfield><subfield code="d">Berlin [u.a.] : de Gruyter, 2007</subfield><subfield code="g">4(2010), 2 vom: 23. Aug., Seite 175-191</subfield><subfield code="w">(DE-627)NLEJ248236156</subfield><subfield code="w">(DE-600)2278189-4</subfield><subfield code="x">1862-2984</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">day:23</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:175-191</subfield><subfield code="g">extent:17</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/jmc.2010.007</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DGR</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</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="b">23</subfield><subfield code="c">08</subfield><subfield code="h">175-191</subfield><subfield code="g">17</subfield></datafield></record></collection>
|
| score |
7.4007587 |