|
|
||||||
|
|||||||
|
Research Systems & Architecture Bio & Medical |
PrimitivesThe Primitive algorithms are the basic building blocks of cryptography. Almost every modern cryptographic system encorporates at least one of these. To access these in CREAT click on "Modules" then "Primitives".
GCDEuclidean algorithm is used to compute the greatest common divisor without having to factor the two numbers. 987452343 = 27 * 36572309 and 567 = 27 * 21 CRTCRT uses extended Euclidean algorithm to calculate results.
X1 = 78 when X1 mod 15 = 3 and X1 mod 19 = 2 FactorizationImplement Pollard's rho algorithm.
455459 = 743 * 613 Prime TestImplement strong pseudoprime test. 455459 is not prime Random Number Generatorimplement X9.17 pseudorandom generation.
Secure Hash FunctionImplement SHA1 protocol.
| ||||||
