Name
Abstract | ||
|---|---|---|
QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate system us over a finite field, and it is known as an NP-Hard problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/IMIS.2012.139 | IMIS |
Keywords | Field | DocType |
multivariate quadratic system,efficient implementation,stream cipher,non-linear multivariate system,provable security,computational hardness assumption,multivariate cryptography,multivariate polynomial system,np-hard problem,quad stream cipher,reduced computational cost,parallel algorithms,np hard problem,computational complexity,gpgpu,polynomials,finite field,kernel,cryptography,encryption | Computational hardness assumption,Multivariate cryptography,Cryptography,Parallel algorithm,Computer science,Parallel computing,Stream cipher,General-purpose computing on graphics processing units,Computational complexity theory,Provable security | Conference |
Citations | PageRank | References |
2 | 0.41 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Satoshi Tanaka | 1 | 12 | 3.93 |
| Takashi Nishide | 2 | 357 | 27.86 |
| Kouichi Sakurai | 3 | 1514 | 213.71 |