Search Results for "ace-step"

BitCrypt is an elegant encryption that allows for the storage and transmission of information in an undetectable manner. The program processes a user-supplied text encrypting it with the Rijndael cipher and storing it in a user-selected bitmap image. This later step is called steganography, which means "to hide invisibly". If you intend to store sensitive information invisibly, you may encrypt it with BitCrypt and keep it in a picture image. Alternatively, if you intend to pass information to another party, you may encrypt it using BitCrypt and publish it as a part of a website. In this manner, another party can access it without anyone realizing that information is transmitted. ...

Help to convert text into secret codes , so that you can mail,chat and transfer text securely to prevent hacking. How to use : Step one - Open Endico 14 Step two - Decide what to do (Text Encode/Text Decode) Step three - If You Selected Text Encode -> Then Type/Copy/Open .txt file to convert. Step four - Copy the converted text into clipboard to chat,mail,print process etc. Step five - If you want to Decode the code the again follow step two. ...

...D-crypt performs a total of 18 rounds: Firstly it does a SBOX round, and a XOR keyaddition with the first 32bytes of the expanded key, Secondly it does 16 rounds of MixcColums, ShiftRows, KeyAddition (this step is determined by the tweak) and SBOX, and finally, it does an final round of SBOX followed by a final round of XOR key addition, providing key whitening. Only 32byte and key supported for now

Encryption with symmetric-key algorithm Kirmah - generate keys with exotic chars - redefine key length - key mark to ensure decryption capabilities - mix data - fast with multiprocessing - possible compression - gui on gtk3 - cli tool - python3 DEPENDENCIES : ======== python3, python-gobject, gobject-introspection, pygtk 3 modes are available to encrypt : ======== - compression (full / disabled or only final step) - random (simulate a random order - based on crypted key - to randomize data) - mix (mix data according to a generated map - based on crypted key - with addition of noise) Process is as follow : ======== encrypt : file > [ compress > ] encrypt > [randomiz data > mix data > compress > ] file.kmh decrypt: file.kmh > [ uncompress > unmix data > unrandomiz data] > decrypt > [uncompress > ] file ======== for encrypt/decrypt large binary files, use the fastest alternative : split/merge

Web AND Mobile (Apple iPhone) based, multi user, java port of the KeePass project. A free, easy to use password manager which helps you to manage your passwords in a secure way. Focused on deep encryption and ease of use.

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

It provides a common interface to different message digest algorithms, such as MD2, MD4, MD5, SHA, SHA1, SHA256, SHA384 and SHA512. Other algorithms can be added later. Also, it provides a debug capability to export the result at every step.

...BP-SeeEMV simulates the steps involved in an EMV transaction that take place in the EMV terminal and the Issuer Server (when conducted online). Module can process a transaction one step at a time in step-by-step mode or to certain break-point.