{"id":21638902,"url":"https://github.com/theodoreai/crypto-system","last_synced_at":"2025-03-19T01:48:02.447Z","repository":{"id":143478324,"uuid":"599393236","full_name":"TheodoreAI/crypto-system","owner":"TheodoreAI","description":"The following is a crypto system library that is written in C++ and it implements the RSA system.","archived":false,"fork":false,"pushed_at":"2023-02-11T01:26:49.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-01T02:49:07.731Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/TheodoreAI.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-02-09T03:15:39.000Z","updated_at":"2023-02-11T01:26:53.000Z","dependencies_parsed_at":null,"dependency_job_id":"57784c81-910d-4cac-abc8-8b9eea37d80a","html_url":"https://github.com/TheodoreAI/crypto-system","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheodoreAI%2Fcrypto-system","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheodoreAI%2Fcrypto-system/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheodoreAI%2Fcrypto-system/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheodoreAI%2Fcrypto-system/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TheodoreAI","download_url":"https://codeload.github.com/TheodoreAI/crypto-system/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244338994,"owners_count":20437167,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-25T04:12:19.564Z","updated_at":"2025-03-19T01:48:02.418Z","avatar_url":"https://github.com/TheodoreAI.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# C++ RSA Library\n\n#### Mateo Estrada Jorge\n#### Feb 08, 2023\n\n- Crypto system for a non-production level system. The following would need a good pseudorandom generator and could be implemented as an API/service to generate public/private keys. \n\n### The system is written for RSA:\n- It is a public-key cryptosystem that is widely used for secure data transmission.\n- The security of RSA is based on the mathematical problem of factorization, i.e., it is hard to factorize a large composite number into its prime factors.\n- Key Generation: Select two large prime numbers, p and q, and compute n = p * q. Compute φ(n) = (p - 1) * (q - 1) and select a public key exponent, e, such that 1 \u003c e \u003c φ(n) and e is coprime to φ(n). Compute a private key exponent, d, such that d * e ≡ 1 (mod φ(n)).\n- Encryption: Given a message m and a public key (n, e), the encryption is computed as c ≡ m^e (mod n).\n- Decryption: Given a ciphertext c and a private key d, the decryption is computed as m ≡ c^d (mod n).\n- Complexity: The encryption and decryption operations in RSA are both exponential in the number of bits in the key size, making it relatively slow for larger key sizes.\n\n# Basic Requirements:\n1. Key Generation: The library should have a function for generating RSA key pairs, including both public and private keys.\n2. Key Storage: The library should have the ability to securely store the generated keys, either on disk or in memory.\n3. Key Encryption: The library should have the ability to encrypt messages using the public key.\n4. Key Decryption: The library should have the ability to decrypt messages using the private key.\n5. Key Size: The library should support key sizes ranging from 512 to 4096 bits.\n6. Modulus Generation: The library should have a function for generating a modulus that meets the required security standards.\n7. Prime number generation was done with a pseudorandom prime generator with values \u003c 1000.\n8. Encryped messages are output in encrypted.txt file\n9. Decrypted messages are output in decrypted.txt file\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheodoreai%2Fcrypto-system","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheodoreai%2Fcrypto-system","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheodoreai%2Fcrypto-system/lists"}