A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-85053-3_19
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

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

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2010English

Extending Scalar Multiplication Using Double Bases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Novel Architecture for Binary Multiplication

International Journal of Innovative Technology and Exploring Engineering
Mechanics of MaterialsElectronic EngineeringCivilStructural EngineeringElectricalComputer Science
2019English

Practical Fast Polynomial Multiplication

1976English

Bit-Serial Parallel Processing Systems

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1982English

Comparing the Speed of Programs for Sparse Polynomial Multiplication

ACM SIGSAM Bulletin
2003English

Improved Three-Way Split Formulas for Binary Polynomial Multiplication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Optimization Study on NTRU Polynomial Multiplication

2012English

A Hierarchical Control Architecture for Mobile Offshore Bases

Marine Structures
Mechanics of MaterialsMaterials ScienceOcean EngineeringMechanical Engineering
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy