Paper Info
Title
Faster Generation of NICE-Schnorr-Type Signatures
Abstract
In [7] there was proposed a Schnorr-type signature scheme based on non-maximal imaginary quadratic orders, which signature generation is - for the same conjectured level of security - about twice as fast as in the original scheme [15].In this work we will significantly improve upon this result, by speeding up the generation of NICE-Schnorr-type signatures by another factor of two. While in [7] one used the surjective homomorphism F*p驴F*p 驴 Ker(驴Cl-1) to generate signatures by two modular exponentiations, we will show that there is an efficiently computable isomorphism F*p 驴 Ker(驴Cl-1) in this case, which makes the signature generation about four times as fast as in the original Schnorr scheme [15].
Year
DOI
Venue
2001
10.1007/3-540-45353-9_1
CT-RSA
Keywords
Field
DocType
faster generation,modular exponentiation,surjective homomorphism f,conjectured level,original scheme,nice-schnorr-type signatures,original schnorr scheme,nice-schnorr-type signature,non-maximal imaginary quadratic order,computable isomorphism f,schnorr-type signature scheme,signature generation
Discrete mathematics,Computable isomorphism,Quadratic equation,Homomorphism,Modular design,Surjective function,Mathematics,Schnorr signature
Conference
Volume
ISSN
ISBN
2020
0302-9743
3-540-41898-9
Citations 
PageRank 
References 
3
0.46
9
Authors
1
Name
Order
Citations
PageRank
Detlef Hühnlein113041.35