Search Results for "16"

An asynchronous Text to Morse Converter and Morse training software for Arduino Uno, based on interrupts and Timer1. And because it doesn't use that evil delay() function, this solution morselizes random letters or whatever it receives through its serial() interface, in a non blocking manner. https://github.com/vicival/morselizer

...Simply put, SHA is a checksum that change when a single bit change. When you send a message with a password field, the resulting password checksum is cut at 128 bit which means 16 characters bytes KEY is entered into AES 128 bit encryption and decryption scheme. The resulting ciphertext is sent to the server while the server relay it to the connected peers. Those connected peers need to have the same password in order to read the message. The server is a multiplex and stand alone detached (no controlling terminal) process on the background that does nothing but to relay messages.

AUM is an extremely fast, small-state, cryptographically secure pseudo-random number generator and stream cipher. AUM exhibits uniform distribution, mixes rapidly, has no detected bias, and comes in three variants: AUM16, with an internal state array of 16+4 32-bit words; AUM32, with an internal state of 32+4 words; and AUM64 with a 64+4-word state. The former permit seeding with a key of up to 512 or 1024 bits, the latter with a 2048-bit key.

...MOTE exhibits uniform distribution, mixes extremely rapidly, has no detected bias, and comes in three variants: MOTE8, with an internal state array of 8+4 32-bit words; MOTE16, with an internal state of 16+4 words; and MOTE32 with a 32+4-word state. The former permit seeding with a key of up to 256 or 512 bits, the latter with a 1024-bit key. Reduced to essentials, MOTE is only 5 lines of code: Ten arithmetic and bitwise operations in all. It's called MOTE because a PRNG can't be made much smaller (or faster) without introducing bias or severely reducing avalanche. ...

BEDBUG is a small, fast, cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It exhibits uniform distribution, mixes rapidly (with worst-case avalanche better than 16-bits), has no detected bias, and comes in three variants: BEDBUG128, with an internal state array of 128+3 32-bit words; BEDBUG256, with an internal state of 256+3 words; and BEDBUG512 with a 512+3-word state. The former permit seeding with a key of up to 4096 or 8192 bits, the latter with a 16384-bit key. The BEDBUG generator itself is a mere 5 lines of code: Three rotations; two pseudo-random lookups. ...

When you synchronize 2 file repositories with rsync, then you want to use fsize to show you if both sides show up with the same amount of files and with the same file sizes. Using du always counts files and directories (option -sb), which can result in different sizes. A directory node may use 12 KB on the rsync source and 16 KB on the rsync destination.

Python module for creating functions computing the Cyclic Redundancy Check (CRC). Any generating polynomial producing 8, 16, 24, 32, or 64 bit CRCs is allowed. Generated functions can be used in Python or C/C++ source code can be generated.

OpenTCP is a highly robust and portable implementation of the TCP/IP and Internet application-layer protocols intended for those who want to implement TCP/IP functionality in truly resource constrained environments (8/16-bit MCUs).