Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Subjects: | |
| Online Access: | https://doi.org/10.5281/zenodo.17220792 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866902268859645952 |
|---|---|
| author | Tibedo, Charles |
| author_facet | Tibedo, Charles |
| contents | <p>This algorithm is capable of 'factoring' any size RSA Public Modulus N, and generating a Private Key that pairs together with the Public Key provided.</p> <p><strong>Functional README</strong></p> <ol> <li> <p>The script has two basic types of tests.</p> <ol> <li> <p>run_complete_RSA_tests()</p> </li> <li> <p>run_external_rsa_2048_test and it’s related tests:</p> <ol> <li> <p>run_external_rsa_2048_test_ModN_Test2() … Test3() …</p> </li> </ol> </li> </ol> </li> <li> <p>To simply generate a valid private ‘d’ for 2048-RSA Modulus N, run type ‘a'. This will ‘generate’ p, q, e, phi n, n, and ‘d’.</p> </li> <li> <p>To run a ‘key’ extraction given a public key that has been previously converted to decimal format for one of the pre-determined bit sizes, utilize test type ‘b’ for the appropriate bit length.</p> <ol> <li> <p>To use this test, you’ll need to hardcode the Public N for the bit size into the appropriate “rsa_2048_test_ModN_Test2()” or higher bit method in the script and ensure that it’s also defined in the test.</p> </li> </ol> </li> </ol> <p> </p> <p>It is designed to work with DECIMAL form. </p> <p>If there are questions, you may contact the author: DrCharlesTibedo@proton.me</p> <p>Thank you,</p> <p>Dr. Charles R. Tibedo</p> <p> </p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17220792 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | 2048-4096 RSA Decryption/Encryption Algorithm Tibedo, Charles Cryptography Prime numbers Combinatorics <p>This algorithm is capable of 'factoring' any size RSA Public Modulus N, and generating a Private Key that pairs together with the Public Key provided.</p> <p><strong>Functional README</strong></p> <ol> <li> <p>The script has two basic types of tests.</p> <ol> <li> <p>run_complete_RSA_tests()</p> </li> <li> <p>run_external_rsa_2048_test and it’s related tests:</p> <ol> <li> <p>run_external_rsa_2048_test_ModN_Test2() … Test3() …</p> </li> </ol> </li> </ol> </li> <li> <p>To simply generate a valid private ‘d’ for 2048-RSA Modulus N, run type ‘a'. This will ‘generate’ p, q, e, phi n, n, and ‘d’.</p> </li> <li> <p>To run a ‘key’ extraction given a public key that has been previously converted to decimal format for one of the pre-determined bit sizes, utilize test type ‘b’ for the appropriate bit length.</p> <ol> <li> <p>To use this test, you’ll need to hardcode the Public N for the bit size into the appropriate “rsa_2048_test_ModN_Test2()” or higher bit method in the script and ensure that it’s also defined in the test.</p> </li> </ol> </li> </ol> <p> </p> <p>It is designed to work with DECIMAL form. </p> <p>If there are questions, you may contact the author: DrCharlesTibedo@proton.me</p> <p>Thank you,</p> <p>Dr. Charles R. Tibedo</p> <p> </p> |
| title | 2048-4096 RSA Decryption/Encryption Algorithm |
| topic | Cryptography Prime numbers Combinatorics |
| url | https://doi.org/10.5281/zenodo.17220792 |