Name
Abstract | ||
|---|---|---|
. Recently there was proposed a novel public key cryptosystem[17] based on non-maximal imaginary quadratic orders with quadraticdecryption time. This scheme was later on called NICE for New IdealCoset Encryption [6]. First implementations show that the decryption isas efficient as RSA-encryption with e = 216+ 1. It was an open questionwhether it is possible to construct comparably efficient signature schemesbased on non-maximal imaginary quadratic orders. The major drawbacksof ... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/978-3-540-46588-1_2 | Public Key Cryptography |
Keywords | Field | DocType |
efficient nice-schnorr-type signature scheme | Discrete mathematics,Finite field,Type signature,Computer science,Algorithm,Quadratic equation,Encryption,Digital signature,Coset,Public-key cryptography,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
1751 | 0302-9743 | 3-540-66967-1 |
Citations | PageRank | References |
5 | 1.06 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Detlef Hühnlein | 1 | 130 | 41.35 |
| Johannes Merkle | 2 | 75 | 12.14 |