Search Results for "character"

...This implementation operates over the finite field GF(257), allowing correct handling of all byte values (0–255) without loss, making it compatible with any type of string or binary-compatible data. Main Features Complete implementation of Shamir Secret Sharing Arithmetic over GF(257) Compatible with all character strings Robust Lagrange interpolation Safe modular inverse computation Shares encoded in hexadecimal (3 characters per byte) Clear, well-commented source code ⚠️ Disclaimer This project is intended for educational and demonstration

Naeon secures data in untrusted off-site storage through a layered approach: files are compressed, then AES-256 encrypted with a randomly generated 128-character passphrase yielding approximately 762 bits of entropy — far beyond the reach of both classical and quantum brute-force attacks. The ciphertext is obfuscated by prepending and appending random byte blocks, making the result unidentifiable as an encrypted file. The payload is then sharded into one private chunk — holding the encryption key and part of the data — and multiple equal-sized public chunks, each renamed to its SHA-512 hash and given a uniform timestamp to prevent metadata inference. ...

This project has moved to https://github.com/julesbl/ssp and is now PHP7 complient and works in composer. The objective of these routines is to supply a secure login system to be wrapped round php applications and websites so that developers do not need to write their own. These libraries have been hardened against most web type attacks. Now has internationalisation and multiple languages.

Ever wanted a random key generator? With SimpleKey, you can generate random keys up to 500 characters in length and save them to text files. These keys can be all numerical, alphanumeric, all alphabetical or the previous three plus special characters. You may use your generated key for whatever purpose. SimpleKey also includes a hash table with which to hash strings and files alike. Hash algorithms include: MD4/5, Sha, Skein, Keccak, Grostl, JH, and Blake.

...Caesar-cipher is a simple encryption algorithm, developed by Julius Caesar, to encrypt his correspondence with Cicero in the ancient world. Therefore it uses a simple character substitution method to replace a given character by another. A keyshift of thirteen is called ROT13. ROT13 can be decrypted by encrypting it again with ROT13. Even today this simple method is used by authorities to protect documents from unintentional reading. --UPDATE-- [25.01.14] Release 1.0 (final) -- Bugfixes [05.05.12] Release 0.2 -- implements polyalphabeticel substitution

HcryptoJ (Historical cryptology in Java) is a Java based programming library for implementing and analyzing historical ciphers. HcryptoJ is designed to support research and teaching in historical cryptography and computer science. Licensed under GPL.

bookHexor use the key.txt for encoding where is saved an arbitrary text, which is used as key. bookHexor read the key.txt and notice for each character, where it can be found as an index. If you encode text each of your charakters is displayed as index.