How youssef-fd/hardware-rsa-cryptoprocessor works
This repository is an educational, synchronous VHDL RSA cryptoprocessor. After reset, the top-level controller generates a key, then accepts encryption or decryption requests and returns a result through a shared modular-exponentiation datapath. Key generation coordinates candidate generation, primality testing, and private-exponent derivation; the arithmetic path uses iterative Montgomery multiplication. The graph follows relationships documented in the README; source excerpts were unavailable, and some README-named files differ from the supplied tree, so paths use the tree’s corresponding RTL files.
Main entry points: TOP_LEVEL.vhd RSA controller · RSA_KEYGEN.vhd Key coordinator · RSA_BEHAVIOUR.vhd RSA operation wrapper · MOD_MONTGOMERY_EXP.vhd Modular exponentiator
Components 10
Control and interface
- RSA controller
hdl/TOP_LEVEL.vhd - RSA operation wrapper
hdl/RSA_BEHAVIOUR.vhd
Key generation
- Key coordinator
hdl/RSA_KEYGEN.vhd - Candidate generator
hdl/RANDOM_GEN.vhd - Primality tester
hdl/MILLER_RABIN.vhd - Private exponent solver
hdl/EXT_GCD.vhd
RSA arithmetic
- Modular exponentiator
hdl/MOD_MONTGOMERY_EXP.vhd - Montgomery multiplier
hdl/MONTGOMERY_MULT.vhd - RSA parameters
RSA_PKG.vhd
Other components
- Requester
Connections 9
- Requester → RSA controller: requests operation
README.md - RSA controller → Requester: returns result
README.md - RSA controller → Key coordinator: generates keys
README.md - RSA controller → RSA operation wrapper: launches operation
README.md - Key coordinator → Candidate generator: generates candidates
README.md - Key coordinator → Primality tester: tests candidates
README.md - Key coordinator → Private exponent solver: derives exponent
README.md - RSA operation wrapper → Modular exponentiator: starts exponentiation
README.md - Modular exponentiator → Montgomery multiplier: performs multiplication
README.md