scientific article
From MaRDI portal
Publication:3827945
zbMath0673.94024MaRDI QIDQ3827945
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regularityfinite fieldspolynomialsVLSImodularityparallel multiplierbase representationBCH/Reed-Solomon coders and decodersdata encryption systems
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ High-Speed Hardware Implementation of Rainbow Signature on FPGAs
This page was built for publication: