Efficient systolic multiplications in composite fields for cryptographic systems
From MaRDI portal
Publication:2321671
Recommendations
- Fast arithmetic for public-key algorithms in Galois fields with composite exponents
- Fast scalar multiplications on hyperelliptic curve cryptosystems
- Efficient Rijndael encryption implementation with composite field arithmetic
- scientific article; zbMATH DE number 2118995
- Efficient computation of singular moduli with application in cryptography
- Progress in Cryptology - INDOCRYPT 2003
- Efficient hardware implementation of finite fields with applications to cryptography
- Efficient scalar multiplication for elliptic curves over binary fields
Cites work
- A compact Rijndael hardware architecture with S-Box optimization
- A new algorithm for multiplication in finite fields
- A Very Compact S-Box for AES
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Comb Architectures for Finite Field Multiplication in F(2ᵐ)
- Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields
- Decoding of Reed Solomon codes beyond the error-correction bound
- Efficient software implementation for finite field multiplication in normal basis
- Good error-correcting codes based on very sparse matrices
- High-speed hardware implementation of Rainbow signature on FPGAs
- scientific article; zbMATH DE number 17850 (Why is no real title available?)
- Look-up table based large finite field multiplication in memory constrained cryptosystems. (Extended abstract)
- Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- Neural networks for solving systems of linear equations and related problems
- Selecting parameters for the Rainbow signature scheme
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
Cited in
(3)
This page was built for publication: Efficient systolic multiplications in composite fields for cryptographic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321671)