Abstract | ||
---|---|---|
At CT-RSA 2014 Bai and Galbraith proposed a lattice-based signature scheme optimized for short signatures and with a security reduction to hard standard lattice problems. In this work we first refine the security analysis of the original work and propose a new 128-bit secure parameter set chosen for software efficiency. Moreover, we increase the acceptance probability of the signing algorithm through an improved rejection condition on the secret keys. Our software implementation targeting Intel CPUs with AVX/AVX2 and ARM CPUs with NEON vector instructions shows that even though we do not rely on ideal lattices, we are able to achieve high performance. For this we optimize the matrix-vector operations and several other aspects of the scheme and finally compare our work with the state of the art. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-16295-9_5 | PROGRESS IN CRYPTOLOGY - LATINCRYPT 2014 |
Keywords | Field | DocType |
Signature scheme, Standard lattices, Vectorization, Ivy bridge | Lattice (order),Ivy Bridge,Computer science,Vectorization (mathematics),Lattice problem,Software,Security analysis,Software implementation,Computer engineering,Distributed computing | Conference |
Volume | ISSN | Citations |
8895 | 0302-9743 | 11 |
PageRank | References | Authors |
0.57 | 25 | 8 |
Name | Order | Citations | PageRank |
---|---|---|---|
Özgür Dagdelen | 1 | 223 | 17.06 |
Rachid El Bansarkhani | 2 | 50 | 8.01 |
Florian Göpfert | 3 | 11 | 0.57 |
Tim Güneysu | 4 | 924 | 77.37 |
Tobias Oder | 5 | 122 | 9.42 |
Thomas Pöppelmann | 6 | 357 | 17.96 |
Ana Helena Sánchez | 7 | 11 | 0.57 |
Peter Schwabe | 8 | 759 | 44.16 |