D(HE)ater is a proof of concept implementation of the D(HE)at attack (CVE-2002-20001) through which denial-of-service can be performed by enforcing the Diffie-Hellman key exchange. (read-only clone of the original GitLab project)

This repo will contain the algorithms for encryption and decryption of messages and ciphers respectively !!

VGP (Very Good Privacy) E2E Encryption Library

Communication security Project involving ciphers and Diffie Hellman key exchange Algorithms

Diffie-Hellman key exchange and Bruteforce

Algorithms studied during the Cryptography Course

Implementation of an End to end encrypted messaging system, where client to client communication is performed after triple-DES encryption, with the keys exchanged using Diffie-Hellman Key exchange algorithm. A user is also able to create multiple groups and be a part of any set of groups. Messages could be text, images, video file etc.

Diffie–Hellman Key Exchange Method (hereafter called the D-H method) allows two parties agree upon a shared secret number, a symmetric key, over an insecure communications channel

Implementation of Diffie-Hellman Key-exchange, RSA algorithm, DSS(Digital Signature Signing and Verification), Extended Euclidean Algo., Fermat's Little Theorem, Fast Modular Exponentiation

Sujet présenté lors du sfPot parisien du 17 septembre 2013 à la Pépinière 27

Project demonstrating RSA authentication, Hash key encryption, Diffie Hellman session key exchange

Collection of selected cryptographic algorithms implemented in Rust 🦀.

Implementation of the Double Ratchet Algorithm

tls connection using Ephemeral DH key exchange

A java application that lets users that are connected collaborate on a single text editor.

Implementation of Cryptographic Algorithms of course Modern Cryptography(CSC049P1M) offered in IIT Jammu.

GTU Information and Network Security ( INS ) in python .

Diffie-Hellman key exchange written in C as part of CPS713 - Applied Cryptography assignment

This Calculator helps you out in calculating the result of a [(x)^y] mod p type of function. It can be used to solve Cryptography Diffie-Hellman excercises. By the way do you prefer M&M's or Snickers? Comment and Share with your friends.

Simple tools for security.