摘要：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.
