From b092ffbcbe2c9398494f7dc9db6f0796971633e0 Mon Sep 17 00:00:00 2001 From: Rob Austein Date: Sun, 13 Sep 2020 23:04:30 +0000 Subject: Import Cryptech wiki dump --- .../GitRepositories%2Fcore%2Fmath%2Fmodexp | 108 +++++++++++++++++++++ 1 file changed, 108 insertions(+) create mode 100644 raw-wiki-dump/GitRepositories%2Fcore%2Fmath%2Fmodexp (limited to 'raw-wiki-dump/GitRepositories%2Fcore%2Fmath%2Fmodexp') diff --git a/raw-wiki-dump/GitRepositories%2Fcore%2Fmath%2Fmodexp b/raw-wiki-dump/GitRepositories%2Fcore%2Fmath%2Fmodexp new file mode 100644 index 0000000..a53e484 --- /dev/null +++ b/raw-wiki-dump/GitRepositories%2Fcore%2Fmath%2Fmodexp @@ -0,0 +1,108 @@ +{{{ +#!htmlcomment + +This page is maintained automatically by a script. Don't modify this page by hand, +your changes will just be overwritten the next time the script runs. Talk to your +Friendly Neighborhood Repository Maintainer if you need to change something here. + +}}} + +{{{ +#!html +

modexp

+ +

Modular exponentiation core for implementing public key algorithms such +as RSA, DH, ElGamal etc.

+ +

The core calculates the following function:

+ +

C = M ** e mod N

+ +

M is a message with a length of n bits + e is the exponent with a length of m bits + N is the modulus with a length of n bits

+ +

The size n be one and up to and including 8192 bits in steps of 32 +bits.

+ +

The size m be one and up to and including 8192 bits in steps of 32 +bits.

+ +

The core has a 32-bit memory like interface, but provides status signals +to inform the system that a given operation has is done. Additionally, +any errors will also be asserted.

+ +

The core is written in Verilog 2001 and suitable for implementation in +FPGA and ASIC devices. No vendor specific macros are used in the code.

+ +

Implementation details

+ +

The core is iterative with 32-bit operands and not the fastest core on +the planet.

+ +

Future developments

+ + + +

FPGA-results

+ +

Altera Cyclone-V

+ + + +

Xilinx Artix-7 100T

+ + + +

Xilinx Spartan-6 LX45

+ + + +

Status

+ +

(2015-04-27)

+ +

Modexp simulation with exponent and modolus with up to 1280 bits +simulates. The auto test generation system works. Implementation in +different FPGA types and vendors works.

+ +

(2015-04-23)

+ +

The Montgomery multiplication module works. The Residue calculation +module works. Top level integration and debugging is onging. The core +does not yet work and there are dragons to be found.

+ +

(2014-12-07)

+ +

Renamed the core tom modexp from rsa to make it more clear that it +provides generic modular exponentiation, not RSA.

+ +

(2014-10-01)

+ +

Very early phase. Started to collect information and drawing some rough +ideas on paper.

+}}} + +[[RepositoryIndex(format=table,glob=core/math/modexp)]] + +|| Clone `https://git.cryptech.is/core/math/modexp.git` || -- cgit v1.2.3