Abstract
Optimal normal bases of 𝔽3n are desirable in pairing based cryptography for the fast implementation of arithmetic in the ternary finite fields. But for the finite fields 𝔽3n optimal normal bases are not possible for every n. Therefore the low complexity normal bases are desirable in such cases. There are low complexity Gaussian normal bases which are obtained from Gauss periods. We discuss the existence of Gaussian normal bases and their dual bases for a specific class of the finite fields with characteristic 3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
