Logarithmically finding the power cycle number of a prime of a modulus and thus breaking rsa computer cipher

• 1. 基于量子真随机数发生器的RSA密码大质数生成方法 [P] . 中国专利： CN114020241A . 2022-02-08
• 2. RSA模幂电路及RSA安全加密芯片 [P] . 中国专利： CN103164187B . 2017.03.01
• 3. A logarithmic way to find a large factor of the totient number of a modulus and thus help break the rsa cipher [P] . AU2002950500A0 . 2002-09-12

  机译： 以对数方式找到模数的最大数的因数，从而帮助打破rsa密码

• 4. An algorithm to factor a composite number of two prime numbers and thus break the rsa cipher [P] . AU2002952701A0 . 2002-11-28

  机译： 分解两个质数的复合数并由此打破rsa密码​​的算法

• 5. Prime number finding formula for use as searching program in computer, has structure common to all prime numbers, where successive application of formula on prime numbers permits to exclude products of prime numbers from set [P] . 法国专利： FR2918778A1 . 2009-01-16

  机译： 素数查找公式，用作计算机中的搜索程序，具有所有素数共有的结构，对素数连续应用公式允许从集合中排除素数的乘积

• 1. Comparative Analysis of Encryption and Decryption Techniques Using Mersenne Prime Numbers and Phony Modulus to Avoid Factorization Attack of RSA [C] . Raghunandan K.R., Ganesh Aithal, Surendra Shetty International Conference on Advanced Mechatronic Systems . 2019
• 2. Finding universals through difference: Disability theory's potential to empower composition studies. [D] . Stanton, Courtney. 2016
• 3. Prime Power Substitution Groups Whose Conjugate Cycles Are Commutative [O] . G. A. Miller 1924
• 4. Cryptanalysis on prime power RSA modulus of the form (N = p^r q) [O] . Muhammad Rezal Kamel Ariffin, Sadiq Shehu 2016

• 1. 公钥密码体制中模求幂运算的快速实现 [C] . 亢保元 ,刘欣 ,王庆菊 . 2006年全国数学技术应用科学学术论坛 . 2006
• 2. 基于FPGA的RSA密码算法的模幂模乘的快速实现 [A] . 许伟 . 2010