Description: RSA algorithm and code an experimental report. Choose two primes p, q (non-significant differences between) 2. Calculate n = pq, f (n) = (p-1) (q-1) 3. Select the e, to satisfy a <e<f(n),则gcd(e,f(n))=1
4.计算d，满足de=1 mod f(n)。一般d> = [n the fourth side], (e, n) for the public key, (p, q, d) for the private key will be expressly 0,1 sequence packet, so that each of the decimal is less than n. c = [m of the e-th power] mod n, m = [c of the d-th power] mod n.
To Search:
File list (Check if you may need any files):
RSA\C\REA3.c
...\.\.SA1\des.h
...\.\....\des386.s
...\.\....\desc.c
...\.\....\global.h
...\.\....\md2.h
...\.\....\md2c.c
...\.\....\md4.h
...\.\....\md4c.c
...\.\....\md5.h
...\.\....\md5c.c
...\.\....\nn.c
...\.\....\nn.h
...\.\....\prime.c
...\.\....\prime.h
...\.\....\rsa.c
...\.\....\rsa.h
...\.\....\rsa386.s
...\.\....\rsa68k.s
...\.\....\rsaeuro.h
...\.\....\rsaref.h
...\.\....\rsasparc.s
...\.\....\r_dh.c
...\.\....\r_encode.c
...\.\....\r_enhanc.c
...\.\....\r_keygen.c
...\.\....\r_random.c
...\.\....\r_random.h
...\.\....\r_stdlib.c
...\.\....\shs.h
...\.\....\shsc.c
...\.\....\targets.mak
...\.\...2\rsa.c
...\.\....\rsa.h
...\RSA.doc
...\C\RSA1
...\.\RSA2
...\C
RSA
Download