AOP arithmetic architectures over GF(2ᵐ)

DOI10.1016/J.AMC.2003.09.002zbMATH Open1065.94007OpenAlexW2001337102MaRDI QIDQ1888264FDOQ1888264

Authors: Hyun-Sung Kim, Kee-Young Yoo 

Publication date: 23 November 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.09.002

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• Computational Science – ICCS 2005
• scientific article; zbMATH DE number 1962149
• Semi-systolic Modular Multiplier over GF(2m)
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm

zbMATH Keywords

CryptographyAll one polynomialBit serial architectureStandard basis representation

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05) Mathematical problems of computer architecture (68M07)

Cites Work

• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Title not available (Why is that?)
• Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
• Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials
• Title not available (Why is that?)

Cited In (3)

• A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
• Computational Science and Its Applications – ICCSA 2004
• Title not available (Why is that?)

This page was built for publication: AOP arithmetic architectures over GF(2\(^m\))

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