Pages that link to "Item:Q3417027"
From MaRDI portal
The following pages link to A redundant representation of GF(q<sup>n</sup>) for designing arithmetic circuits (Q3417027):
Displaying 3 items.
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- GF(2<sup><i>n</i></sup>) Redundant Representation Using Matrix Embedding for Irreducible Trinomials (Q3186049) (← links)
- Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity (Q5277654) (← links)