Search Results for "a i"

Shadowsocks-libev is a lightweight secured SOCKS5 proxy for embedded devices and low-end boxes. Shadowsocks-libev is written in pure C and depends on libev. It's designed to be a lightweight implementation of shadowsocks protocol, in order to keep the resource usage as low as possible. Snap is the recommended way to install the latest binaries. You can build shadowsocks-libev and all its dependencies by script. The latest shadowsocks-libev has provided a redir mode. You can configure your...

...It allows you to surf the web privately and securely, and offers a number of useful features such as HTTP proxy support, system proxy configuration, server auto switching and plugin support. Shadowsocks is incredibly fast, as it utilizes bleeding edge techniques with Asynchronous I/O and event-driven programming. It also has a flexible industry-level encryption algorithm that supports custom algorithms. Shadowsocks for Windows requires a Microsoft .NET Framework 4.7.2 or higher, as well as Microsoft Visual C++ 2015 Redistributable (x86).

Very simple to use symmetric Java encryption utility. Please write a review. Email me with any questions or problems.

I did not see a pre-built version of this software on the original developers Github project (https://github.com/gaborbata/jpass), so I am taking it upon myself to compile the releases as they come, so that others don't have to. --Description-- JPass is a simple, small, portable password manager application with strong encryption.

Starting as a personal study project, I have decided to share this security project. For now, it is a JAVA program that can be used to encrypt and decrypt simple file content (ie files), possibly later evolving into a utility with user interface and/or a library

Secure Hash Algorithm variant of the nist maintained Secure Hash Algorithm. this is a 1024 bit digest. Comments suggestions always welcome. Rick Removed old downloads as they are long outdated. The update is the last version I worked on. Algorithm is based on the SHA2 digest. I may work on an updated version for c++11

...It produces variable length hash from a message block of the size you want. The resulting hash will be ~2x the message block in size, and should provide for at least as many bits of security as the block itself. I updated this, with a different hash than original, since I found a potential collision on some blocks, not but specific to that challenge. To further correct this, I modified the padding when it's less than the block size. I hold no guarantee of the security of this algorithm, USE AT YOUR OWN RISK. I have had no 3rd party analysis done on the algorithm to date, but research is welcome, and a challenge is even provided in CHALLENGE.txt.

whbEncrypter is a very simple variable encryption program to encrypt and decrypt a file based on a passkey provided based on the user. It uses a simple encryption algorithm that I wrote for a school project. The passkey can also be the contents of a file.

This is an experimental program that encrypt/decrypt/divide/join files. This program uses a new algorithm made by me, this algorithm is experimental and I working on it, every day this algoritm will be better.

I needed a library of functions that enabled me to perform hash functions and symmetric cryptography. I chose MD5 initially but eventually chose SHA as the hashing algorithm due to concerns regarding the \'collision resistance\' of MD5 due to weakne

...It uses the Rijndael ( block cipher algorithm AES winner ) public domain c++ class implementation written by Szymon Stefanek , and it is capable of encrypting and decrypting every kind of file ( text and binary ) i

...AES (Advanced Encryption Standard) is based on Rijndael, secret-key encryption algorithm using a block cipher with key sizes of 128, 192, or 256 bits. Simple Encrypt will take a text file, generate keys and then encrypt it. The output is the ciphertext and keys. Note: Realistically, I will keep the algorithms simple(r) by having key sizes of 32 bits! Hopefully, I'll get round to developing a reasonably efficient class for larger numbers, but until then I am restricted.