scientific article; zbMATH DE number 1759299

zbMATH Open0998.68685MaRDI QIDQ4536232FDOQ4536232

Authors: Huapeng Wu 

Publication date: 28 November 2002

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• Title not available (Why is that?)
• Programmable cellular automata based Montgomery hardware architecture
• Montgomery multiplication over rings
• Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)