Efficient Rijndael encryption implementation with composite field arithmetic
From MaRDI portal
Recommendations
- Efficient hardware implementation of finite fields with applications to cryptography
- Efficient software-implementation of finite fields with applications to cryptography
- Efficient systolic multiplications in composite fields for cryptographic systems
- An efficient RSA implementation without precomputation
- Fast arithmetic for public-key algorithms in Galois fields with composite exponents
- Efficient completely non-malleable and RKA secure public key encryptions
- RSA acceleration with field programmable gate arrays
- Optimal extension fields for fast arithmetic in public-key algorithms
- Efficient cryptography on the RISC-V architecture
Cited in
(15)- Efficient cache attacks on AES, and countermeasures
- Efficient cryptography on the RISC-V architecture
- Efficient systolic multiplications in composite fields for cryptographic systems
- Higher-order masking in practice: a vector implementation of masked AES for ARM NEON
- Polynomial evaluation and side channel analysis
- A first-order leak-free masking countermeasure
- Implementation of the AES-128 on Virtex-5 FPGAs
- A Very Compact “Perfectly Masked” S-Box for AES
- Using Normal Bases for Compact Hardware Implementations of the AES S-Box
- Vortex: A New Family of One-Way Hash Functions Based on AES Rounds and Carry-Less Multiplication
- AES side-channel countermeasure using random tower field constructions
- SM4 Chaotic Masking Scheme Against Power Analysis Based on FPGA
- Engineering motif search for large motifs
- A systematic evaluation of compact hardware implementations for the Rijndael S-box
- Efficient hardware implementation of finite fields with applications to cryptography
This page was built for publication: Efficient Rijndael encryption implementation with composite field arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797794)
