{"id":30770660,"url":"https://github.com/cpscript/qrcryptography","last_synced_at":"2025-09-04T23:12:06.287Z","repository":{"id":300527432,"uuid":"1006397630","full_name":"CPScript/QRCryptography","owner":"CPScript","description":"Experimental post-quantum cryptographic framework implementing hybrid lattice-based encryption with hash based signatures. Combining Ring-LWE, standard LWE, and Merkle trees for defense against classical and quantum attacks.","archived":false,"fork":false,"pushed_at":"2025-07-04T02:34:42.000Z","size":60,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-08-30T05:57:44.361Z","etag":null,"topics":["cryptographic-research","cryptography","experimental","hash-based-signatures","python","quantum-resistant","ring-lwe"],"latest_commit_sha":null,"homepage":"","language":"Python","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/CPScript.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,"zenodo":null}},"created_at":"2025-06-22T07:09:20.000Z","updated_at":"2025-07-17T18:25:23.000Z","dependencies_parsed_at":"2025-07-04T02:21:39.957Z","dependency_job_id":"90e842d6-e279-4828-a85d-cb9c604134f1","html_url":"https://github.com/CPScript/QRCryptography","commit_stats":null,"previous_names":["cpscript/qrc","cpscript/qrcryptography"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/CPScript/QRCryptography","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CPScript%2FQRCryptography","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CPScript%2FQRCryptography/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CPScript%2FQRCryptography/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CPScript%2FQRCryptography/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/CPScript","download_url":"https://codeload.github.com/CPScript/QRCryptography/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CPScript%2FQRCryptography/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273685604,"owners_count":25149722,"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","status":"online","status_checked_at":"2025-09-04T02:00:08.968Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["cryptographic-research","cryptography","experimental","hash-based-signatures","python","quantum-resistant","ring-lwe"],"created_at":"2025-09-04T23:12:02.755Z","updated_at":"2025-09-04T23:12:06.275Z","avatar_url":"https://github.com/CPScript.png","language":"Python","readme":"\u003e QRCs is an experimental post-quantum cryptographic framework implementing hybrid lattice-based encryption with hash-based digital signatures. The system combines Ring Learning With Errors, standard Learning With Errors, and Merkle signature schemes to provide defense against both classical and quantum cryptanalytic attacks.\n\n## Architecture\n\nThe system implements a multi-layer cryptographic approach using:\n\nRing-LWE encryption for structured lattice problems\nStandard LWE encryption for unstructured lattice security  \nHash-based signatures using Merkle trees and Winternitz one-time signatures\nAdvanced Reed-Solomon error correction with Berlekamp-Massey decoding\nConstant-time operations for side-channel resistance\nMilitary-grade entropy collection from multiple hardware sources\nKey switching and bootstrapping for homomorphic operations\nAuthenticated encryption with HMAC-SHA3-512\n\n## Security Levels\n\nCLASSICAL_128 - 128-bit classical security equivalent\nCLASSICAL_192 - 192-bit classical security equivalent\nCLASSICAL_256 - 256-bit classical security equivalent\nQUANTUM_128 - 128-bit post-quantum security\nQUANTUM_192 - 192-bit post-quantum security  \nQUANTUM_256 - 256-bit post-quantum security\nFORTRESS - Maximum security configuration\n\n## Installation\n\nPython 3.8 or higher required with numpy dependency.\n\n```\npip install numpy\n```\n\nNo additional dependencies required. System uses only Python standard library and numpy.\n\n## Basic Usage\n\n```python\nfrom QRCs import QRCs, SecurityLevel\n\n# Initialize system\nsystem = QRCs(SecurityLevel.QUANTUM_256)\n\n# Generate keypair\npublic_key, private_key = system.generate_keypair()\n\n# Encrypt data\nplaintext = b\"confidential message\"\nassociated_data = b\"authentication context\"\nciphertext = system.encrypt(plaintext, public_key, associated_data)\n\n# Decrypt data\ndecrypted = system.decrypt(ciphertext, private_key, associated_data)\n\n# Digital signatures\nsignature = system.sign(plaintext, private_key)\nis_valid = system.verify(plaintext, signature, public_key)\n```\n\n## Technical Specifications\n\nRing dimension: 1024 to 4096 coefficients depending on security level\nLattice dimension: 512 to 2048 vectors\nCoefficient modulus: Multiple prime moduli up to 30 bits\nGaussian parameter: 3.2 to 6.0 standard deviation\nError correction: Reed-Solomon with 16 to 64 error correction capacity\nHash function: SHA3-512 for all cryptographic hashing\nSignature tree height: 16 to 32 levels supporting 65536 to 4 billion signatures\n\n## Performance Characteristics\n\nKey generation: 50-500ms depending on security level\nEncryption: 5-50ms per kilobyte\nDecryption: 3-30ms per kilobyte  \nSignature generation: 10-100ms\nSignature verification: 5-50ms\nMemory usage: 1-16MB depending on security parameters\n\nPerformance scales with security level. FORTRESS configuration provides maximum security at cost of reduced performance.\n\n## Implementation Details\n\nAll arithmetic operations use constant-time implementations to prevent timing attacks. Random number generation combines multiple entropy sources including hardware performance counters, system entropy pools, and cryptographic random generators.\n\nError correction uses advanced Reed-Solomon codes with polynomial-time Berlekamp-Massey algorithm for optimal error locator computation. The system can correct up to t errors per codeword where t is configurable.\n\nKey switching enables homomorphic operations while maintaining security properties. Bootstrapping allows noise reduction in ciphertext without exposing secret information.\n\n## Cryptographic Primitives\n\nRing-LWE problem hardness based on shortest vector problem in ideal lattices\nStandard LWE problem hardness based on shortest vector problem in general lattices\nHash-based signatures provide information-theoretic security\nNumber theoretic transforms enable efficient polynomial arithmetic\nDiscrete Gaussian sampling for lattice noise generation\nModular arithmetic with precomputed primitive roots\n\n## Research Applications\n\nThis implementation is suitable for:\n\nPost-quantum cryptography research\nLattice-based cryptanalysis studies\nHybrid cryptographic system analysis\nPerformance benchmarking of post-quantum algorithms\nEducational purposes in advanced cryptography\n\n## Limitations\n\nThe system has not undergone formal security analysis or peer review. Parameter selection is based on current research but may require adjustment as cryptanalytic techniques advance.\n\nSignature keys support limited number of signatures before requiring regeneration. Performance decreases significantly at maximum security levels.\n\nImplementation focuses on correctness and research utility rather than production optimization. Side-channel protections may be incomplete against sophisticated physical attacks.\n\n## Compliance\n\nThis software implements cryptographic algorithms that may be subject to export restrictions in some jurisdictions. Users are responsible for compliance with applicable laws and regulations.\n\n## Disclaimer\n\nThis software is provided for research only. No warranties are made regarding security, correctness, or fitness for any particular purpose. The implementation has not been audited or certified for production use.\n\nUsers assume all risks associated with the use of this cryptographic software. The authors disclaim all liability for any damages resulting from use of this system.\n\nThis is experimental research software and should not be used to protect sensitive or critical information without extensive additional testing and validation.\n\n## References\n\nImplementation based on current research in post-quantum cryptography including but not limited to lattice-based encryption schemes, hash-based signature systems, and error correction algorithms as published in peer-reviewed cryptographic literature.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcpscript%2Fqrcryptography","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcpscript%2Fqrcryptography","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcpscript%2Fqrcryptography/lists"}