49 projects tagged "encryption"
Updated 01 Mar 2012
sec-wall
| Pop | 87.56 |
|---|---|
| Vit | 1.86 |
sec-wall is a feature-packed security proxy that supports SSL/TLS, WS-Security, HTTP Auth Basic/Digest, extensible authentication schemes based on custom HTTP headers and XPath expressions, powerful URL matching/rewriting, and an optional header enrichment. It's a security wall with which you can conveniently fence otherwise defenseless backend servers.
Updated 27 Apr 2013
cyphertite
| Pop | 388.88 |
|---|---|
| Vit | 36.07 |
Cyphertite is a tar-like secure remote archiver. It deduplicates, compresses, and encrypts data prior to transmission, providing total privacy while reducing unnecessary wire traffic. It seamlessly supports IPv6 and IPv4 on a variety of platforms.
Updated 07 Feb 2013
Lifeograph
| Pop | 136.86 |
|---|---|
| Vit | 7.98 |
Lifeograph is a personal journal and note taking application. It offers all standard features expected from a diary application, along with some unique ones, in a light-weight and intuitive package.
Updated 01 Mar 2012
libchop
| Pop | 29.70 |
|---|---|
| Vit | 1.95 |
Libchop is a set of utilities and library for data backup and distributed storage. Its main application is chop-backup, an encrypted backup program that supports data integrity checks, versioning at little cost, distribution among several sites, selective sharing of stored data, adaptive compression, and more. The library itself, which chop-backup builds upon, implements storage techniques such as content-based addressing, content hash keys, Merkle trees, similarity detection, and lossless compression. It makes it easy to combine them in different ways. The ‘chop-archiver’ and ‘chop-block-server’ tools, illustrated in the manual, provide direct access to these facilities from the command line. It is written in C and has Guile (Scheme) bindings.
Updated 03 Nov 2011
gpgkeymgr
| Pop | 18.19 |
|---|---|
| Vit | 23.79 |
gpgkeymgr is a tool for cleaning up and managing your GnuPGP key ring. It removes old and unnecessary keys according to user-specified criteria. For example, you can remove all expired or revoked keys, or all keys you don't trust, and much more.
Updated 22 May 2012
0bin
| Pop | 30.59 |
|---|---|
| Vit | 19.07 |
0bin is a classic pastebin featuring client-side encryption provided by JavaScript. All pastes are encrypted before being sent to the server, and decrypted by the browser when reading them. The purpose is not so much to protect users' privacy as to prevent the service host from being forced to moderate the content by legal means.
Updated 25 Jun 2012
jQuery.pidCrypt
| Pop | 20.49 |
|---|---|
| Vit | 18.46 |
jQuery.pidCrypt uses HTML5 localStorage or sessionStorage for implementing an RSA public keyring within the browser, allowing transparent asymmetric encryption of form submissions while protecting the keys with AES symmetric encryption. It is easy to implement and has numerous configurable options for pre, post, and error-handling callbacks.
Updated 23 Jun 2012
gpgpwd
| Pop | 53.83 |
|---|---|
| Vit | 1.43 |
gpgpwd is a terminal-based password manager. It stores a list of passwords in a GnuPG-encrypted file, and allows you to easily retrieve, change, and add to that file as needed. It also generates random passwords which you can use, easily allowing you to have one "master password" (for your gpg key), with one unique and random password for each website or service you use, ensuring that your other accounts stay safe even if one password gets leaked. gpgpwd can also utilize git to allow you to easily synchronize your passwords between different machines.
Updated 28 Jul 2012
LibXOR
| Pop | 27.86 |
|---|---|
| Vit | 17.29 |
LibXOR is an Objective C library for encrypting NSStrings. It provides quick (and easy) encryption and decryption using a password, and is easy to use within a project by implementing a category of NSString.
Updated 26 Jul 2012
LibRCrypt
| Pop | 25.46 |
|---|---|
| Vit | 17.32 |
LibRCrypt is an Objective C library for complex data encryption based on Rubik's Cubes. The idea's pretty simple: If you represent data as the squares on a Rubik's Cube, you can apply transformations to the data and get back encrypted data, all of which is commutatitive. Just as a Rubik's Cube can be solved if you know all of the moves, this data can be "unwound", so to speak, if you know all of the transforms applied, but the encryption is even deeper than that. A cube can only cover (9 squares per face x 6 faces) 54 significant bits of data. Therefore, compressed data must be composed of multiple (even thousands) of Rubik's Cubes.
