On efficient normal bases over binary fields

arXiv:2402.11544v1 Announce Type: cross
Abstract: Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic geometry and necessitates the utilization of efficient bases. The continuous increase in the power of computation, and the design of new (quantum) computers increase the threat to the security of systems and impose increasingly demanding encryption standards with huge polynomial or extension degrees. For cryptographic purposes …

applications arxiv binary code computation continuous cryptography cs.cr cs.it design error extensions foundation geometry implementation key math.it normal power public public key theory