scientific article; zbMATH DE number 1759299

MaRDI QIDQ4536232zbMATH OpenFDO

Authors Huapeng Wu

Publication date 28 November 2002

zbMATH Keywords

complexitycryptographyfinite field arithmeticMontgomery multiplication algorithmbit-parallel Montgomery multiplier

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Recommendations

• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Polynomial basis multiplication over \(\text{GF}(2^m)\)
• scientific article; zbMATH DE number 5041007
• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
• GF(2/sup m/) multiplication and division over the dual basis

Cited in

(7)

• scientific article; zbMATH DE number 1689040 (Why is no real title available?)
• Montgomery multiplication over rings
• scientific article; zbMATH DE number 1962149 (Why is no real title available?)
• Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
• Programmable cellular automata based Montgomery hardware architecture
• scientific article; zbMATH DE number 1504693 (Why is no real title available?)
• Polynomial basis multiplication over \(\text{GF}(2^m)\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536232)