A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)

DOI10.1016/j.camwa.2005.07.019zbMath1146.68012OpenAlexW2094860134MaRDI QIDQ2475900

Kee-Young Yoo, Jun-Cheol Jeon, Kee-Won Kim

Publication date: 11 March 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.07.019

zbMATH Keywords

exponentiationinner productspublic-key cryptosystemmodular multiplicationirreducible all one polynomial

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Bit-serial Reed - Solomon encoders