FFCSA - finite field constructions, search, and algorithms

DOI10.1145/3614408.3614416MaRDI QIDQ6536551

Olexandr Konovalov, Mark D. Aagaard, Guang Gong, Aleksandar Jurišić, Nusa Zidaric

Publication date: 13 May 2024

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

zbMATH Keywords

GAPFSRcryptographic hardwareFinite field arithmeticFFCSA

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

How to use a CAS for hardware design automation

Cites Work

• Rapid hardware design for cryptographic modules with filtering structures over small finite fields
• WG: a family of stream ciphers with designed randomness properties
• Lightweight Multiplication in $$GF(2^n)$$ with Applications to MDS Matrices
• Handbook of Finite Fields
• A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
• Hardware Optimizations and Analysis for the WG-16 Cipher with Tower Field Arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: FFCSA - finite field constructions, search, and algorithms