A new algorithm for multiplication in finite fields
From MaRDI portal
Recommendations
Cited in
(18)- Efficient systolic multiplications in composite fields for cryptographic systems
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- On the complementary factor in a new congruence algorithm
- On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)
- Reducing the complexity of normal basis multiplication
- scientific article; zbMATH DE number 1955798 (Why is no real title available?)
- scientific article; zbMATH DE number 39192 (Why is no real title available?)
- Finite field arithmetic using quasi-normal bases
- Computational problems in the theory of finite fields
- New primitives for digital signature algorithms
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- scientific article; zbMATH DE number 2085208 (Why is no real title available?)
- scientific article; zbMATH DE number 4153897 (Why is no real title available?)
- scientific article; zbMATH DE number 1504805 (Why is no real title available?)
- Efficient multiplication in finite field extensions of degree 5
- scientific article; zbMATH DE number 1583947 (Why is no real title available?)
- New Results on the Most Significant Bit of Integer Multiplication
- New algorithms for relaxed multiplication
This page was built for publication: A new algorithm for multiplication in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035407)
