期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
k-Order Fibonacci Polynomials on AES-Like Cryptology
1
作者 mustafa asci Suleyman Aydinyuz 《Computer Modeling in Engineering & Sciences》 SCIE EI 2022年第4期277-293,共17页
The Advanced Encryption Standard(AES)is the most widely used symmetric cipher today.AES has an important place in cryptology.Finite field,also known as Galois Fields,are cornerstones for understanding any cryptography... The Advanced Encryption Standard(AES)is the most widely used symmetric cipher today.AES has an important place in cryptology.Finite field,also known as Galois Fields,are cornerstones for understanding any cryptography.This encryption method on AES is a method that uses polynomials on Galois fields.In this paper,we generalize the AES-like cryptology on 2×2 matrices.We redefine the elements of k-order Fibonacci polynomials sequences using a certain irreducible polynomial in our cryptology algorithm.So,this cryptology algorithm is called AES-like cryptology on the k-order Fibonacci polynomial matrix. 展开更多
关键词 Fibonacci numbers Fibonacci polynomials k-order Fibonacci polynomials Fibonacci matrix k-order Fibonacci polynomial matrix Galois field
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部