## Quadratic orders for NESSIE - Overview and parameter sizes of three public key families (2000)

Citations: | 3 - 2 self |

### BibTeX

@TECHREPORT{Hühnlein00quadraticorders,

author = {Detlef Hühnlein},

title = {Quadratic orders for NESSIE - Overview and parameter sizes of three public key families},

institution = {},

year = {2000}

}

### OpenURL

### Abstract

. In the scope of the European project NESSIE 1 there was issued a Call for Cryptographic Primitives [NESSIE] soliciting proposals for block ciphers, stream ciphers, hash functions, pseudo-random functions and public key primitives for digital signatures, encryption and identification. Since the security of all popular puplic key cryptosystems is based on unproven assumptions and therefore nobody can guarantee that schemes based on factoring or the computation of discrete logarithms in some group, like the multiplicative group of a finite field or the jacobian of (hyper-) elliptic curves over finite fields, will stay secure forever, it is especially important to provide a variety of different primitives and groups which may be utilized if a popular class of cryptosystems gets broken. In this work we propose three different public key families based on the discrete logarithm problem in quadratic orders to be considered for NESSIE. The two families based on (maximal) real...