scientific article; zbMATH DE number 1796971

MaRDI QIDQ4551365zbMATH OpenFDO

Authors Hyun-Sung Kim, Kee-Young Yoo

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080262

zbMATH Keywords

exponentiation architecturemultipliersquarer

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Recommendations

• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
• Computational Science and Its Applications – ICCSA 2004
• Fast Exponentiaion over GF(2m) Based on Cellular Automata
• Linear systolic multiplier/squarer for fast exponentiation
• scientific article; zbMATH DE number 17852

Cited in

(11)

• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
• AOP arithmetic architectures over GF(2\(^m\))
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
• Linear systolic multiplier/squarer for fast exponentiation
• Algorithm for squaring in GF(2m) in standard basis
• Fast Exponentiaion over GF(2m) Based on Cellular Automata
• Efficient Exponentiation in GF(p m ) Using the Frobenius Map
• Architectures for exponentiation in GF(2n)
• scientific article; zbMATH DE number 17852 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004
• Scalable and systolic architecture for computing double exponentiation 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 Q4551365)