期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Designing Pair of Nonlinear Components of a Block Cipher over Gaussian Integers 被引量:1
1
作者 Muhammad Sajjad Tariq Shah Robinson Julian Serna 《Computers, Materials & Continua》 SCIE EI 2023年第6期5287-5305,共19页
In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the ... In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Gaussian integers(GI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.But the prime field dependent on the Elliptic curve(EC)provides one S-box at a time by fixing three parameters a,b,and p.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability. 展开更多
关键词 Gaussian integers residue class of gaussian integers block cipher S-boxes analysis of S-boxes
下载PDF
Nonlinear Components of a Block Cipher over Eisenstein Integers
2
作者 Mohammad Mazyad Hazzazi Muhammad Sajjad +2 位作者 Zaid Bassfar Tariq Shah Ashwag Albakri 《Computers, Materials & Continua》 SCIE EI 2023年第12期3659-3675,共17页
In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the poi... In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves,chaotic maps,and Gaussian integers has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Eisenstein integers(EI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.However,in the same way,by taking three fixed parameters only one S-box is obtained through a prime field-dependent Elliptic curve(EC),chaotic maps,and Gaussian integers.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability. 展开更多
关键词 Eisenstein integers residue class of Eisenstein integers block cipher S-boxes analysis of S-boxes
下载PDF
Properties of Quaternion Algebra over the Real Number Field and Z_p
3
作者 秦应兵 《Journal of Southwest Jiaotong University(English Edition)》 2010年第4期349-352,共4页
The ring of quaternion over R,denoted by R[i,j,k],is a quaternion algebra. In this paper,the roots of quadratic equation with one variable in quaternion field are investigated and it is shown that it has infinitely ma... The ring of quaternion over R,denoted by R[i,j,k],is a quaternion algebra. In this paper,the roots of quadratic equation with one variable in quaternion field are investigated and it is shown that it has infinitely many roots. Then the properties of quaternion algebra over Zp are discussed,and the order of its unit group is determined. Lastly,another ring isomorphism of M2(Zp) and the quaternion algebra over Zp when p satisfies some particular conditions are presented. 展开更多
关键词 Quaternion algebra Quadric equation with one variable Modulo p residue class ring Unit group Ring isomorphism
下载PDF
Pseudo-Randomness of Certain Sequences of k Symbols with Length pq 被引量:1
4
作者 陈智雄 杜小妮 吴晨煌 《Journal of Computer Science & Technology》 SCIE EI CSCD 2011年第2期276-282,共7页
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k sym... The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated. 展开更多
关键词 stream ciphers pseudo-random sequences well-distribution measure correlation measure discrete logarithm modulo pq residue class rings character sums
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部