Name
Abstract | ||
|---|---|---|
This paper is concerned with an extensive form of stream cipher Trivium. Trivium is extended to a scalable form by the coupling connection of Trivium-like shift registers. The characteristic polynomial of k Trivium-like shift registers in coupling connection is proved to have a factor of (1+x)(k). So k-order primitive polynomials are defined in this paper. As the main contribution, a new stream cipher Quavium is proposed based on 4-round Trivium-like shift registers and k-order primitive polynomials. Quavium can also be used with 3 rounds. Experimental results show that Quavium is nearly as fast as Trivium and 3-round Quavium has a better performance. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.4304/jcp.7.5.1278-1283 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
stream cipher, Trivium, k-order primitive polynomials, Quavium, Trivium-like shift registers | Characteristic polynomial,Shift register,Coupling,Polynomial,Computer science,Arithmetic,Algorithm,Stream cipher,Scalability | Journal |
Volume | Issue | ISSN |
7 | 5 | 1796-203X |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yun Tian | 1 | 59 | 2.66 |
| Gong-Liang Chen | 2 | 160 | 13.54 |
| Jian-hua Li | 3 | 558 | 98.16 |