Abstract
The paper firstly reveals the relationship between the cryptographic function over finite field and vector function over its prime field. Then a class of functions taking all vectors as their linear structures is suggested, which are the weakest functions over finite field even if the algebraic degree is high. At last, the cryptographic properties of logical function over finite field and the corresponding vector function over its prime field are explored, including the Chrestenson spectra characteristics and correlation immunity, which is a significant criterion for cryptographic function to resist correlation attack.
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 callDisclaimer: 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.
