Efficient hardware implementation of the stream cipher WG-16 with composite field arithmetic

Fan, Xinxin; Zidarič, Nuša; Aagaard, Mark; Gong, Guang

doi:10.1145/2517300.2517305

Cited by 10 publications

(12 citation statements)

References 12 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reason is that building WG-8 permutation/transformation module with an 8×8 look-up table occupies smaller area than using logic equations and multipliers. However, when the size of finite field increases, the medium and large instances of WG stream cipher family will benefit from the tower construction, thereby achieving a better performance, as illustrated in [13].…”

Section: Resultsmentioning

confidence: 99%

“…Although there is no Gaussian normal basis over F 2 8 , the above nice property of trace function still holds if we use the isomorphic tower field construction F ((2 2 ) 2 ) 2 in Section 3.4. The following proposition and two corollaries characterize the aforementioned property and the proofs are direct adaptation of those in [13].…”

Section: Properties Of the Trace Function Under The Tower Constructionmentioning

confidence: 98%

“…COROLLARY 1. [13] Given the tower construction in Section 3.4, for any elements X, U and V in F ((2 2 ) 2 ) 2 , we have Tr(X 2 ω ) = Tr(X) = 7 i=0 xi and Tr(U V ) = Tr(U 2 ω 8 V 2 ω ), where ω is an integer.…”

Section: Properties Of the Trace Function Under The Tower Constructionmentioning

confidence: 99%

“…Recently, a new efficient hardware design for WG-29 was proposed in [9], using the nice property of the trace of product of two finite field elements with type-II optimal normal basis (ONB) representations. A compact hardware implementation of large size stream cipher WG-16 using tower field constructions with excellent performance was also proposed [13]. In addition, the S-box in AES based on the tower field constructions [7] achieved quite good performance.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs

Yang

Fan

Aagaard

et al. 2013

Proceedings of the Workshop on Embedded Systems Security

Self Cite

View full text Add to dashboard Cite

WG-8 is a lightweight instance of the Welch-Gong (WG) stream cipher family, targeting for resource-constrained devices like RFID tags, smart cards, and wireless sensor nodes. Recent work has demonstrated the advantages of tower field constructions for finite field arithmetic in the AES and WG-16 ciphers. In this paper we explore three different tower field constructions for WG-8. The first tower field is tailored to FPGA cells. The second tower field uses a Type-I optimal normal basis. The third tower field exploits algebraic properties of the WG permutation and trace functions. All of the methods use a parallel LFSR to provide data rates from one to eleven bits per clock cycle. Among the three tower fields, the Type-I ONB construction offers the best trade-off in area, speed, and power consumption. However, a plain monolithic look-up table implementation with 256 entries is smaller and faster than the tower field constructions. Our analysis of the tower field options and comparisons to each other and to the monolithic look-up table will provide lessons for future work in exploring novel tower field constructions for WG and other ciphers.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Properties Of the Trace Function Under The Tower Constructionmentioning

confidence: 98%

Section: Properties Of the Trace Function Under The Tower Constructionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs

Yang

Fan

Aagaard

et al. 2013

Proceedings of the Workshop on Embedded Systems Security

Self Cite

View full text Add to dashboard Cite

show abstract

“…For mapping of GF (2 16 ) to GF (2 8 ) irreducible polynomial is used which contain constant μ. They performed the multiplication with an assumed value for the constant μ [3]. In the literature published till date, design methodologies of a Galois field multiplier and theory based on pipelining has been presented.…”

Section: Isomorphic Mapping and Inverse Isomorphic Mappingmentioning

confidence: 99%

Implementation of GF 216 Multiplier Using Combinational Gates

Bhoite¹,

Sawane²,

Shastry³

et al. 2015

Second International Conference on Advances in Computing, Control and Networking - ACCN 2015

View full text Add to dashboard Cite

This paper proposes the design and implementation of GF (2 16) multiplier using composite field arithmetic. We have introduced an irreducible polynomial X 2 +X+ξ. This irreducible polynomial is required for transforming Galois field of GF (2 16) to composite field of GF (((2 2) 2) 2) 2. Our estimation of the value of ξ and subsequently the composite field arithmetic hence forth derived achieved high speed GF (2 16) multiplier. The design being purely combinational is a clock free design. We achieved critical path delay of 11.5ns between inputs to output data path. We have used combination of ᴪ and λ as {10} 2 and {1100} 2 respectively. Due to this value of ᴪ, λ, ξ we achieved fastest implementation, at the cost of few extra gates. The design methodology includes implementation and verification on FPGA using Xilinx ISE and finally the physical layout was designed on ASIC using 90nm CMOS standard cell libraries. Our implementation result shows that without pipelining the hardware core can achieve throughput of 5.39 Mbps on FPGA and we achieved throughput of 5.43Gbps on 90nm ASIC.

show abstract

The welch-gong stream cipher - evolutionary path

Zidarič,

Mandal,

Gong

et al. 2023

Cryptogr. Commun.

View full text Add to dashboard Cite

This survey presents the rich history of the Welch-Gong (WG) Stream cipher family. It has been a long journey that lead the WG stream ciphers to become practical. The evolutionary path is a combination of mathematical endeavour and engineering striving to transfer pure mathematical functions to practical encryption algorithms for various applications. This path began as the pioneering work on WG transformation sequences with 2-level autocorrelation, leading to important breakthroughs in the early 2000’s, such as the submission of the first WG stream cipher to the eSTREAM competition in 2005 and the subsequent introduction of the WG stream cipher family WG(m, l), followed by extensive work on particular instances proposed for various (mostly lightweight) applications. A recent construction using a WG permutation is the authenticated encryption WAGE, submitted to the NIST LWC competition in 2019. The story of the WG stream cipher is by far not finished. The future opens numerous possibilities for WG stream ciphers and WAGE, with applications in both lightweight environments and in high-performance computing. We conclude the survey with new ideas and open problems.

show abstract

Efficient hardware implementation of the stream cipher WG-16 with composite field arithmetic

Cited by 10 publications

References 12 publications

Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs

Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs

Implementation of GF 216 Multiplier Using Combinational Gates

The welch-gong stream cipher - evolutionary path

Contact Info

Product

Resources

About