Tensor-based trapdoors for CVP and their application to public key cryptography

We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which resembles to the McEliece scheme.

Metadaten
Author:Roger Fischlin, Jean-Pierre Seifert
URN:urn:nbn:de:hebis:30-12545
DOI:http://dx.doi.org/10.1007/3-540-46665-7_29
ISBN:978-3-540-66887-9
ISBN:3-540-66887-X
ISBN:978-3-540-46665-9
Editor:Michael Walker
Document Type:Preprint
Language:English
Year of Completion:2000
Year of first Publication:2000
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2005/07/20
Tag:Closest Vector Problem; Lattice Reduction; McEliece; Public Key Cryptosystem; Trapdoor
Pagenumber:18
First Page:1
Last Page:18
Note:
Erschienen in: Michael Walker (Hrsg.): Cryptography and coding. Teil: 7., Cirencester, UK, December 20 - 22, 1999, Berlin ; Heidelberg ; New York, NY : Springer, 1999, Lecture notes in computer science ; 1746, S. 244-257, ISBN: 978-3-540-66887-9, ISBN: 3-540-66887-X, ISBN: 978-3-540-46665-9, doi:10.1007/3-540-46665-7_29
Source:7th IMA International Conference "Cryptography and Coding" '99 ; Lecture Notes in Computer Science, Vol. 1746, Springer-Verl., pp. 244-257, 1999, © Springer-Verlag 1999 , http://www.mi.informatik.uni-frankfurt.de/research/papers/fischlin.cvp.1999.pdf
HeBIS PPN:225893487
Institutes:Mathematik
Informatik
Dewey Decimal Classification:510 Mathematik
Sammlungen:Universitätspublikationen
Licence (German):License Logo Veröffentlichungsvertrag für Publikationen

$Rev: 11761 $