Efficient Multiplication Over Extension Fields

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-31662-3_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Multiplicative Complexity of Polynomial Multiplication Over Finite Fields

1987English

Efficient Pipelining for Modular Multiplication Architectures in Prime Fields

2007English

Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

Tatra Mountains Mathematical Publications
Mathematics
2016English

Low Space Complexity Multiplication Over Binary Fields With Dickson Polynomial Representation

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2011English

On the Multiplication of Tensor Fields

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1966English

Efficient Carrier Multiplication in InP Nanoparticles

Physical Review B
2010English

An Efficient Parallel Algorithm for Matrix-Vector Multiplication

1993English

An Efficient (N, K) Information Dispersal Algorithm for High Code Rate System Over Fermat Fields

IEEE Communications Letters
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2012English

Algebras Over Infinite Fields

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1956English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy