Pages that link to "Item:Q850794"
From MaRDI portal
The following pages link to Efficient hardware implementation of finite fields with applications to cryptography (Q850794):
Displaying 18 items.
- Complexity of computation in finite fields (Q378003) (← links)
- A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials (Q604106) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- Hardware implementation of finite-field division (Q850787) (← links)
- Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware (Q1862258) (← links)
- Efficient systolic multiplications in composite fields for cryptographic systems (Q2321671) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Very Compact Hardware Implementations of the Blockcipher CLEFIA (Q2889877) (← links)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems (Q4571367) (← links)
- Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware (Q4589507) (← links)
- (Q4788568) (← links)
- (Q4797794) (← links)
- (Q4945370) (← links)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems (Q5031901) (← links)
- Efficient hardware implementations of brw polynomials and tweakable enciphering schemes (Q5274299) (← links)
- (Q5393813) (← links)
- Selected Areas in Cryptography (Q5713967) (← links)
- Revisiting homomorphic encryption schemes for finite fields (Q6157565) (← links)
