Add files via upload

Author: geopayme

CITATION.cff

@@ -0,0 +1,20 @@
+cff-version: 1.2.0
+message: "If you use QD-RSA in your research, please cite the following metadata."
+title: "Quantum-Disruptive RSA (QD-RSA): A Post-Quantum Cryptographic Framework"
+version: "1.1"
+doi: "10.5281/zenodo.TODO"  # Replace with real DOI once published
+date-released: 2024-05-12
+authors:
+  - family-names: Valamontes
+    given-names: Antonis
+    affiliation: Kapodistrian Academy of Science
+    orcid: https://orcid.org/0000-0002-1825-0097
+license: "Other (Open, Non-Commercial)"
+repository-code: "https://github.com/KapodistrianCrypto/QD-RSA-Challenge"
+keywords:
+  - quantum cryptography
+  - RSA
+  - post-quantum
+  - Grover
+  - Shor
+  - cryptanalysis

ISSUES.md

@@ -0,0 +1,47 @@
+# 🔓 Open Challenge: Break QD-RSA v1.1
+
+**Welcome to the official QD-RSA cryptanalysis challenge.**
+This pinned issue invites cryptographers, security researchers, and quantum computing experts to rigorously analyze and test the QD-RSA v1.1 system.
+
+## 📌 Objective
+
+We challenge the community to find any cryptographic weakness, inversion strategy, or implementation flaw in **any of the following layers**:
+
+### 🧩 1. Masking Function:
+Φₛ(x) = x · sin((π + εₛ) · x) mod n
+- Can it be approximated or reversed without knowing εₛ?
+- Are FFT or lattice-based inversion strategies effective?
+
+### 🧬 2. Trap Function:
+Ξₛ(x) = (x + r)² · cosh(γ(x + r)) · tan⁻¹(δ(x + r)) mod n
+- Can symbolic regression, surrogate modeling, or QML defeat this layer?
+
+### 🔐 3. Symbolic Hash:
+𝓘ₛ*(x) = SHA3-256 ( ∑ xᵏ / bᵏ for k = 1 to Nₛ )
+- Can Grover-enhanced attacks recover x or forge a preimage?
+- Is symbolic structure leaking through the hash?
+
+## 📥 Submission Format
+
+Please provide:
+- A description of your method
+- Code, proof sketch, or attack path
+- Runtime estimates or complexity bounds
+- Any limitations or assumptions
+
+## 💬 Guidelines
+
+- Fork this repo to submit alternate branches or experiments.
+- Tag all reports with `cryptanalysis`.
+- Discussion, reproducibility, and respectful collaboration are encouraged.
+- Credited contributions will be featured in future versions.
+
+## 🧠 Reference Materials
+
+- Cryptanalysis Challenge Brief (PDF)
+- Version Declaration v1.1
+- Reference Implementation (Python, C, C#)
+
+## 📬 Contact
+
+For confidential disclosures: [email protected]

QD_RSA_NONCOMMERCIAL_LICENSE.txt

@@ -0,0 +1,15 @@
+
+Copyright © 2024 Kapodistrian Academy of Science
+
+Permission is hereby granted to any person obtaining a copy of this cryptographic specification, associated documentation files, or reference implementation (the “Software”), to use, copy, modify, and distribute the Software for academic, educational, and research purposes, subject to the following conditions:
+
+1. The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+2. Commercial use, including but not limited to selling, licensing, sublicensing, or integrating the Software or derivatives into proprietary systems, is strictly prohibited without prior written consent from the Kapodistrian Academy of Science.
+
+3. The Software is provided “as is,” without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose, or noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages, or other liability, whether in an action of contract, tort, or otherwise, arising from, out of, or in connection with the Software or the use or other dealings in the Software.
+
+This license is modeled after Creative Commons Attribution-NonCommercial 4.0 (CC BY-NC 4.0) and is enforceable under international copyright law.
+
+For inquiries regarding commercial licensing, contact:
+[email protected]

README.md

@@ -1,2 +1,86 @@
-# QD-RSA-Challenge
-QD-RSA-Challenge
+# QD-RSA v1.1: Quantum-Disruptive RSA
+
+This repository contains the public specification, challenge brief, and reference implementation for QD-RSA v1.1—a quantum-resilient RSA enhancement.
+
+## Overview
+QD-RSA introduces three entropy-hardened symbolic transformations:
+- Φₛ(x): Session-specific sine-masked domain encoding
+- Ξₛ(x): Entropy-shifted non-convex trap function
+- 𝓘ₛ*(x): SHA3-wrapped symbolic hash
+
+## Files
+- `QD_RSA_Cryptanalysis_Challenge_Brief.pdf` – Public audit and attack challenge brief
+- `QD_RSA_v1.1_Version_Declaration.pdf` – Formal versioning declaration
+- `LICENSE.txt` – Non-commercial use terms
+- `/reference_implementation/` – Python modules for demonstration and attack testing
+
+## License
+This repository is distributed under a non-commercial academic research license.
+See LICENSE.txt for details.
+
+## Contact
+[email protected]
+
+
+# 🔓 Open Challenge: Break QD-RSA v1.1
+
+**Welcome to the official QD-RSA cryptanalysis challenge.**
+This pinned issue invites cryptographers, security researchers, and quantum computing experts to rigorously analyze and test the QD-RSA v1.1 system.
+
+## 📌 Objective
+
+We challenge the community to find any cryptographic weakness, inversion strategy, or implementation flaw in **any of the following layers**:
+
+### 🧩 1. Masking Function:
+Φₛ(x) = x · sin((π + εₛ) · x) mod n
+- Can it be approximated or reversed without knowing εₛ?
+- Are FFT or lattice-based inversion strategies effective?
+
+### 🧬 2. Trap Function:
+Ξₛ(x) = (x + r)² · cosh(γ(x + r)) · tan⁻¹(δ(x + r)) mod n
+- Can symbolic regression, surrogate modeling, or QML defeat this layer?
+
+### 🔐 3. Symbolic Hash:
+𝓘ₛ*(x) = SHA3-256 ( ∑ xᵏ / bᵏ for k = 1 to Nₛ )
+- Can Grover-enhanced attacks recover x or forge a preimage?
+- Is symbolic structure leaking through the hash?
+
+## 📥 Submission Format
+
+Please provide:
+- A description of your method
+- Code, proof sketch, or attack path
+- Runtime estimates or complexity bounds
+- Any limitations or assumptions
+
+## 💬 Guidelines
+
+- Fork this repo to submit alternate branches or experiments.
+- Tag all reports with `cryptanalysis`.
+- Discussion, reproducibility, and respectful collaboration are encouraged.
+- Credited contributions will be featured in future versions.
+
+## 🧠 Reference Materials
+
+- Cryptanalysis Challenge Brief (PDF)
+- Version Declaration v1.1
+- Reference Implementation (Python, C, C#)
+
+## 📬 Contact
+
+For confidential disclosures: [email protected]
+
+
+## 🔐 FAQ: Does QD-RSA contain any government-access mechanism or DoD backdoor?
+
+**No.** QD-RSA does not contain any mechanism that would allow the Department of Defense (DoD), any governmental body, or any privileged party to reverse, bypass, or decrypt communications without possession of the correct private key and session-specific entropy parameters.
+
+Specifically:
+
+- QD-RSA includes **no master key**, **no escrow system**, **no decryption oracle**, and **no entropy bias**.
+- All entropy values (`εₛ`, `r`) are derived per session and are non-recoverable without explicit knowledge.
+- The system is built according to open cryptographic principles and does not include any privileged override mechanism.
+
+**Design Philosophy:** QD-RSA is engineered for public, trustless, and post-quantum-resilient encryption. It is meant to secure communications globally without centralized control or built-in surveillance vectors.
+
+*Note:* National security protocols that require access to encrypted content should implement key management policies externally (e.g., through operational key escrow or secure key distribution), not by altering the QD-RSA algorithm itself.

RELEASE_NOTES.md

@@ -0,0 +1,44 @@
+# 🚀 QD-RSA v1.1 – Initial Cryptanalysis Challenge Release
+
+We are proud to announce the **v1.1 release** of **Quantum-Disruptive RSA (QD-RSA)**, a symbolic enhancement of RSA designed to resist quantum adversaries using Shor’s algorithm, Grover’s algorithm, and quantum annealing.
+
+---
+
+## 🔐 Cryptographic Fixes and Features
+
+- ✅ **Φₛ(x)**: Session-specific irrational masking
+  Φₛ(x) = x · sin((π + εₛ) · x) mod n  
+  Prevents inverse-matching and FFT attacks through session entropy.
+
+- ✅ **Ξₛ(x)**: Entropy-shifted trap function  
+  Ξₛ(x) = (x + r)² · cosh(γ(x + r)) · tan⁻¹(δ(x + r)) mod n  
+  Designed to defeat surrogate inversion via regression or QML.
+
+- ✅ **𝓘ₛ*(x)**: Post-quantum symbolic hash  
+  𝓘ₛ*(x) = SHA3-256 ( ∑ xᵏ / bᵏ for k = 1 to Nₛ )  
+  Grover-resistant via symbolic series wrapped in SHA3-256.
+
+---
+
+## 📁 What’s Included
+
+- 🧪 Reference implementation: Python, C, and C# versions
+- 🧪 Minimal tests for symbolic layer validation
+- 📄 Cryptanalysis Challenge Brief (PDF)
+- 📜 Version Declaration v1.1 (PDF)
+- ⚖️ Non-Commercial License (LICENSE.txt)
+- 🗂 .zenodo.json for Zenodo DOI automation
+
+---
+
+## 📢 Open Challenge (Pinned Issue)
+
+We're inviting the cryptographic community to break or bypass any part of the QD-RSA design under controlled assumptions.  
+See the pinned GitHub issue: “🔓 Open Challenge: Break QD-RSA v1.1”
+
+---
+
+## 📬 Contact
+
+For confidential analysis results or disclosures:  
+📧 [email protected]

reference_implementation/__init__.py

@@ -0,0 +1,8 @@
+// QD-RSA Core Placeholder in C
+#include <math.h>
+#include <stdint.h>
+
+uint64_t phi_s(uint64_t x, double eps_s, uint64_t n) {
+    double kappa_s = M_PI + eps_s;
+    return (uint64_t)(x * sin(kappa_s * x)) % n;
+}

reference_implementation/qdrsa_core.c

@@ -0,0 +1,9 @@
+// QD-RSA Core Placeholder in C#
+using System;
+
+public class QDRSA {
+    public static ulong PhiS(double x, double epsS, ulong n) {
+        double kappaS = Math.PI + epsS;
+        return (ulong)(x * Math.Sin(kappaS * x)) % n;
+    }
+}

reference_implementation/qdrsa_core.cs

@@ -0,0 +1,16 @@
+# QD-RSA Core Functions (Python)
+import math
+import hashlib
+import hmac
+
+def phi_s(x, eps_s, n):
+    kappa_s = math.pi + eps_s
+    return int(x * math.sin(kappa_s * x)) % n
+
+def xi_s(x, gamma, delta, r, n):
+    x_r = x + r
+    return int((x_r**2) * math.cosh(gamma * x_r) * math.atan(delta * x_r)) % n
+
+def i_star(x, N_s=20, b=10):
+    acc = sum((x**k) / (b**k) for k in range(1, N_s + 1))
+    return hashlib.sha3_256(str(acc).encode()).hexdigest()

reference_implementation/qdrsa_core.py

@@ -0,0 +1,18 @@
+# Basic tests for QD-RSA core
+from qdrsa_core import phi_s, xi_s, i_star
+
+def test_phi():
+    assert isinstance(phi_s(5, 0.00031415, 997), int)
+
+def test_xi():
+    assert isinstance(xi_s(7, 1.3, 0.8, 2, 997), int)
+
+def test_hash():
+    h = i_star(9)
+    assert len(h) == 64 and all(c in '0123456789abcdef' for c in h)
+
+if __name__ == "__main__":
+    test_phi()
+    test_xi()
+    test_hash()
+    print("All QD-RSA core tests passed.")