https://github.com/x86-512/exe-quacker

A program that uses Grover's Algorithm with a simple phase oracle and Quantum superposition to crack an 8-bit encrypted exe file. This program is designed for quantum computers.
https://github.com/x86-512/exe-quacker

cracking-encrytped-files encryption grover quantum-computing

Last synced: about 1 month ago
JSON representation

A program that uses Grover's Algorithm with a simple phase oracle and Quantum superposition to crack an 8-bit encrypted exe file. This program is designed for quantum computers.

• Host: GitHub
• URL: https://github.com/x86-512/exe-quacker
• Owner: x86-512
• Created: 2024-08-14T01:05:56.000Z (4 months ago)
• Default Branch: main
• Last Pushed: 2024-09-22T14:44:56.000Z (3 months ago)
• Last Synced: 2024-11-11T17:05:11.932Z (about 1 month ago)
• Topics: cracking-encrytped-files, encryption, grover, quantum-computing
• Language: Q#
• Homepage:
• Size: 113 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Exe-Cracker-Quantum

A program that uses Grover's Algorithm with a simple phase oracle and Quantum superposition to crack an 8-bit encrypted exe file. This program is designed for quantum computers.

# The math behind the algorithm:

The number of iterations is calculated with the formula:

$N_i = \frac{\frac{\pi}{4}}{arcsin(\frac{1}{\sqrt(n)})-0.5}$ 

Where $N_i$ is the optimal number of iterations for the algorithm and N is the number of qubits that the key will be.

The reason the formula is divided instead of multiplied is because the algorithm is less accurate when multiplied.

The key is then put into superposition with the Hadamard Transform:

$H|key\rangle^{\otimes n} = \frac{1}{\sqrt(N)}\sum_{x=0}^{N-1}|x\rangle $

n is the number if qubits and N is the total possible combinations of the key. $\otimes n$ means that the tensor product will be applied to n qubits in the key. In this case, the operation is applied to the whole key.

The oracle is applied, and the Hadamard gate is applied again, and a Conditional Z shift is applied.

The overall formula for the algorithm is

$(-H^{\otimes n}O_0H^{\otimes n}O_f)^{N_i}H^{\otimes n}$

Where $O_f$ is the oracle and $O_0$ is the conditional.

# How to run:

Install python 3.10 and the requirements: `pip install -r requirements.txt`