This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/python | |
| from OpenSSL import crypto | |
| import os | |
| import sys | |
| import datetime | |
| import whois | |
| #Variables | |
| TYPE_RSA = crypto.TYPE_RSA | |
| TYPE_DSA = crypto.TYPE_DSA |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import argparse, os, sys | |
| from Crypto.Cipher import AES | |
| from Crypto.Hash import HMAC | |
| from Crypto.Protocol.KDF import PBKDF2 | |
| # check arguments | |
| parser = argparse.ArgumentParser() | |
| parser.add_argument("file", help="the file we want to encrypt/decrypt") | |
| parser.add_argument("key", help="your key") |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** Divide : Partition the array A[low....high] into two sub-arrays | |
| * A[low....j-1] and A[j+1...high] such that each element | |
| * of A[low....j-1] is less than or equal to A[j], which | |
| * in turn is is less than or equal to A[j+1...high]. Compute | |
| * the index j as part of this partitioning procedure. | |
| * Conquer : Sort the two sub-arrays A[low....j-1] and A[j+1....high] | |
| * by recursive calls to quicksort | |
| **/ | |
| #include<stdio.h> |