scientific article; zbMATH DE number 1878331

zbMath1012.94541MaRDI QIDQ4797793

M. Leone

Publication date: 9 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2162/21620160.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel multiplier

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm ⋮ Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: