请求提出意见和帮助我研究方向。
23 views
Skip to first unread message
Twilight-Dream Sparkle-Magic
Apr 27, 2023, 10:10:35 AM4/27/23
to QUSAR 【抗量子计算机破解的数字签名算法研究小组】
Abstract
This paper presents a new symmetric encryption-decryption algorithm, ”OaldresPuzzle_Cryptic”, designed to resist the impact of future quantum computers on data security. The algorithm will utilize and implement various techniques, including a cryptographically secure pseudo-random number generator based on a chaos-theoretic system that simulates the trajectory of a two-segment pendulum; 1 independently designed and implemented nonlinear feedback shift register with mild chaotic properties; 1 linear feedback shift register with a sequence period length of 2 to the 128th power, 2 pairs of static byte substitution boxes for simulating A high-strength nonlinear granularity function generated by computational and integrable primitive polynomials in Galois finite fields; 2 dynamic byte substitution boxes; and the use of a line-number data structure with nonlinear feedback shift registers to further disrupt the regularity of the generated key data; a structure mimicking the ZUC sequence cipher design, and the use of dynamic byte substitution boxes to make each generated key unpredictable. In addition, linear algebra operations such as affine transformations, Kronecker products, dot products, solution transpositions and accompanying matrices, as well as matrix addition, subtraction and multiplication are used. Boolean operations AND, OR, NOT, XOR, XNOR are used; these operations together form the subkey generation module of this algorithm and the subkey generation module used in each round of the round function. The subkey data generated by the above two modules are used by the one-way functions designed in coordination with the Lai-Massey Scheme, which together construct an abstract and computationally indistinguishable secure pseudo-random function.
The Algorithm OaldresPuzzle_Cryptic Technical Details Paper
This paper presents a new symmetric encryption-decryption algorithm, ”OaldresPuzzle_Cryptic”, designed to resist the impact of future quantum computers on data security. The algorithm will utilize and implement various techniques, including a cryptographically secure pseudo-random number generator based on a chaos-theoretic system that simulates the trajectory of a two-segment pendulum; 1 independently designed and implemented nonlinear feedback shift register with mild chaotic properties; 1 linear feedback shift register with a sequence period length of 2 to the 128th power, 2 pairs of static byte substitution boxes for simulating A high-strength nonlinear granularity function generated by computational and integrable primitive polynomials in Galois finite fields; 2 dynamic byte substitution boxes; and the use of a line-number data structure with nonlinear feedback shift registers to further disrupt the regularity of the generated key data; a structure mimicking the ZUC sequence cipher design, and the use of dynamic byte substitution boxes to make each generated key unpredictable. In addition, linear algebra operations such as affine transformations, Kronecker products, dot products, solution transpositions and accompanying matrices, as well as matrix addition, subtraction and multiplication are used. Boolean operations AND, OR, NOT, XOR, XNOR are used; these operations together form the subkey generation module of this algorithm and the subkey generation module used in each round of the round function. The subkey data generated by the above two modules are used by the one-way functions designed in coordination with the Lai-Massey Scheme, which together construct an abstract and computationally indistinguishable secure pseudo-random function.
The Algorithm OaldresPuzzle_Cryptic Technical Details Paper
Reply all
Reply to author
Forward
0 new messages