Cryptography Utilities

Cryptography Libraries

  • Cryptographic Libraries
    List of full-featured, source-available cryptographic libraries by Adam Shostack.
  • See Java APIs
  • Crypto++ Library
    Crypto++ Library is a Free C++ Class Library of Cryptographic Schemes. Written by Wei Dai. Alternative location.
    Crypto++ Reference Manual. Crypto++ Faq-O-Matic. Crypto++ SourceForge Project: source code and FAQ.
    Crypto++ Library 5.0.4 [ftp] (Windows DLL, MSVC 6.0, FIPS 140-2 L1 conformance).
  • Cryptlib Security Software Development Toolkit
    Cryptlib is a powerful security toolkit which allows even inexperienced crypto programmers to easily add encryption and authentication services to their software.
    By Peter Gutmann, New Zealand. Alternate site:
    Included are implementations of the most popular encryption and authentication algorithms: AES, Blowfish, CAST, DES, Triple DES, IDEA, RC2/4/5, Safer, and Skipjack conventional encryption; MD2/4/5, RIPEMD-160 and SHA hash algorithms; HMAC with MD5/SHA/RIPEMD-160, and MDC-2 MAC algorithms; and Diffie-Hellman, DSA, Elgamal, and RSA public-key encryption. Cryptlib has full X.509 certificate handling, with additional support for SET, Microsoft AuthentiCode, Identrus, S/MIME, SSL and PKCS #7 certificates. Cryptlib can also make use of the crypto capabilities of external crypto devices such as hardware security modules (HSMs), Fortezza cards, PKCS #11 devices, and smart cards.
    Cryptlib is supplied as source code for Unix (static and shared libraries), DOS, Windows 3.x, Windows 95/98/ME, Windows NT/2000/XP, OS/2, BeOS, Macintosh, and the Tandem environment; and also as 16- and 32-bit Windows DLL's. cryptlib is also available as an ActiveX control for Windows, and adaptations exist for VM/CMS and MVS mainframe environments.
    Cryptlib can be used without charge for evaluation, freeware and shareware applications and for research purposes and non-revenue-generating personal uses. All commercial use of Cryptlib (revenue-generating purpose in a company or in an application product) requires a commercial software license of Cryptlib.
    Multiprecision Integer and Rational Arithmetic C/C++ Library (MIRACL).
    MIRACL is a Big Number Library which implements all of the primitives necessary to design Cryptography into your real-world application. C library with C++ wrapper provided. Full support for Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), SHA hashes.
    MIRACL is FREE for non-profit making, educational, or any non-commercial use. Any commercial use of MIRACL requires a license from Shamus Software Ltd.
  • Delphi Cryptography and Multiple-Precision Arithmetic
    By efg's Reference Library.
  • Network Security Services (NSS)
    By Network Security Services (NSS) is a set of libraries designed to support cross-platform development of security-enabled server applications. Applications built with NSS can support SSL v2 and v3, TLS, PKCS #5, PKCS #7, PKCS #11, PKCS #12, S/MIME, X.509 v3 certificates, and other security standards.
    If you want add support for SSL, S/MIME, or other Internet security standards to your application, you can use Network Security Services (NSS) to implement all your security features. NSS provides a complete open-source implementation of the crypto libraries used by Netscape, Sun, and other companies in a variety of products. NSS is open-source licensed under Mozilla Public License (MPL) and the GNU General Public License (GPL).
  • LibTomCrypt
    LibTomCrypt is a fairly comprehensive, modular and portable cryptographic toolkit that provides developers with a vast range of well known cryptographic algorithms: Block Ciphers with various Chaining Modes, One-Way Hash Functions, Pseudo-Random Number Generators, Public Key. LibTomCrypt is free for all purposes under the TDCAL license.


Prime Numbers

  • The Prime Pages
    Prime numbers research, records and resources. By Chris Caldwell, since 1994. URL
  • Number Theory - Prime Numbers
    Wolfram MathWorld, created, developed and nurtured by Eric Weisstein and Wolfram Research. Primality Testing and many other topics.
  • Wikipedia: AKS primality test
    From Wikipedia, the free encyclopedia. The AKS primality test (also known as Agrawal-Kayal-Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by three Indian Institute of Technology Kanpur computer scientists, Manindra Agrawal, Neeraj Kayal, and Nitin Saxena on August 6, 2002 in a paper titled PRIMES is in P. The authors received many accolades, including the 2006 G�del Prize and the 2006 Fulkerson Prize for this work. The algorithm determines whether a number is prime or composite within polynomial time, and was soon improved by others. In 2005, Carl Pomerance and H. W. Lenstra, Jr. demonstrated a variant of AKS which brings a marked improvement over the initial algorithm computational complexity.
  • PRIMES is in P
    Prof. Manindra Agarwal and two of his students, Nitin Saxena and Neeraj Kayal (CSE/IITK, India), have discovered a polynomial time deterministic algorithm to test if an input number is prime or not. Lots of people over (literally!) centuries have been looking for a polynomial time test for primality, and this result is a major breakthrough, likened by some to the P-time solution to Linear Programming announced in the 70s.
    One of the main features of this result is that the proof is concise, clever and elegant, and relies on very innovative and insightful use of results from number theory.
    Download full paper (original, 9 pp., PDF, 2002-08-06), PRIMES is in P, v6 (latest version, 9 pp., PDF). Also available on Scribd (doc 11108887).
    PRIMES is in P little FAQ.
    Primality Test, MathWorld News.