On the security of cryptographic primitives regarding technological innovations

dc.contributor.author	Geiselmann, Willi
dc.contributor.author	Steinwandt, Reiner
dc.contributor.editor	Dittrich, Klaus R.
dc.contributor.editor	König, Wolfgang
dc.contributor.editor	Oberweis, Andreas
dc.contributor.editor	Rannenberg, Kai
dc.contributor.editor	Wahlster, Wolfgang
dc.date.accessioned	2019-11-14T10:49:10Z
dc.date.available	2019-11-14T10:49:10Z
dc.date.issued	2003
dc.description.abstract	Besides exploiting structural insight into a cryptographic algorithm, cryptanalysis also tries to exploit technological innovations. Here we survey recent proposals for supporting the most time-consuming steps in the number field sieve, the best currently known (classical) algorithm for factoring large integers.	en
dc.identifier.isbn	3-88579-363-6
dc.identifier.pissn	1617-5468
dc.identifier.uri	https://dl.gi.de/handle/20.500.12116/29745
dc.language.iso	en
dc.publisher	Gesellschaft für Informatik e.V.
dc.relation.ispartof	INFORMATIK 2003 – Innovative Informatikanwendungen, Band 1, Beiträge der 33. Jahrestagung der Gesellschaft für Informatik e.V. (GI)
dc.relation.ispartofseries	Lecture Notes in Informatics (LNI) - Proceedings, Volume P-34
dc.title	On the security of cryptographic primitives regarding technological innovations	en
dc.type	Text/Conference Paper
gi.citation.endPage	102
gi.citation.publisherPlace	Bonn
gi.citation.startPage	99
gi.conference.date	29. September - 2. Oktober 2003
gi.conference.location	Frankfurt am Main
gi.conference.sessiontitle	Regular Research Papers

Dateien

1 - 1 von 1