A New Low Complexity Parallel Multiplier for a Class of Finite Fields

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44709-1_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Digit-Level Serial-In Parallel-Out Multiplier Using Redundant Representation for a Class of Finite Fields

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
HardwareElectronic EngineeringElectricalArchitectureSoftware
2017English

A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2010English

A Class of High-Precision Finite Difference Parallel Algorithms for Convection Equations

Journal of Convergence Information Technology
2011English

A Parallel Permutation Multiplier for a PGM Crypto-Chip

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

A Novel Low-Complexity Method for Parallel Multiplierless Implementation of Digital FIR Filters

English

Distributed Point Objects. A New Concept for Parallel Finite Elements

English

Multiplicative Complexity of Polynomial Multiplication Over Finite Fields

1987English

A Low-Complexity Parallel-Friendly Rate Control Algorithm for Ultra-Low Delay High Definition Video Coding

2013English

An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

BioMed Research International
ImmunologyMolecular BiologyBiochemistryMicrobiology MedicineGenetics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy