Optimal tower fields
From MaRDI portal
Publication:3417057
DOI10.1109/TC.2004.83zbMath1231.68034MaRDI QIDQ3417057
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
complexityelliptic curve cryptographyefficient finite field operationsoptimal tower fields (OTF)tower field representation
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (3)
Complexity of computation in finite fields ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
This page was built for publication: Optimal tower fields
