Fast arithmetic for public-key algorithms in Galois fields with composite exponents

DOI10.1109/12.805153zbMath1391.94838OpenAlexW2130623996MaRDI QIDQ4571425

Peter Fleischmann, Christof Paar, Pedro Soria-Rodriguez

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5dbc9fd7e24383d753e04b6c5f99a0cc7030b9eb

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

Novel way to research nonlinear feedback shift register

This page was built for publication: Fast arithmetic for public-key algorithms in Galois fields with composite exponents