А можно более подробно про уникальный алгоритм? Как он работает? Какая формула? В чем защита?
Если с английским хорошо то как то так (это описание алгоритмов хэширования которые используются):
Some information about hashing functions in qubit algorithm
1) Luffa
Luffa is a new family of hash functions submitted to NIST for their cryptographic hash algorithm competition.
Luffa is a variant of a sponge function proposed by Bertoni et al., whose security is based only on the randomness of the underlying permutation. Different from the original sponge, Luffa uses plural permutations in parallel and a stronger messsage injection function.
2) CubeHash
CubeHash is a cryptographic hash function submitted to the NIST hash function competition by Daniel J. Bernstein. CubaHash has a 128 byte state, uses wide pipe construction, and is ARX based. Message blocks are XORed into the initial bits of a 128-byte state, which then goes through an r-round bijective transformation between blocks. The initial NIST proposal ("Cubehash8/1") required about 200 cycles per byte. After clarifications from NIST, the author changed the proposal to Cubehash16/32, which "is approximately 16 times faster than CubeHash8/1, easily catching up to both SHA-256 and SHA-512 on the reference platform" while still maintaining a "comfortable security margin".
CubeHash advanced to the second round of the competition, but was not chosen as one of the 5 finalists.
3) SHAvite
SHAvite-3 is a secure and efficient hash function design by Eli Biham and Orr Dunkelman. SHAvite-3 is based on the HAIFA construction and the AES building blocks. SHAvite-3 uses a well understood set of primitives such as a Feistel block cipher which iterates a round function based on the AES round. SHAvite-3's compression functions are secure against cryptanalysis, while the selected mode of iteration offers maximal security against black box attacks on the hash function. SHAvite-3 is both fast and resource-efficient, making it suitable for a wide range of environments, ranging from 8-bit platforms to 64-bit platforms (and beyond).
4) SIMD
SIMD is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is one of fourteen entries to be accepted into round two of the competition, but was not shortlisted for the third and final round.
The designer states that the "most important component of SIMD is its message expansion, which is designed to give a high minimal distance". The algorithm's speed is claimed to be 11-13 cycles per byte.
5) Echo
ECHO, a cryptographic hash function designed for the NIST SHA-3 competition, offers:
- a simple and clean design,
- a high and well-understood security margin,
- support of the Intel AES instructions set, and
- a fully flexible design to support different properties with the same primitive.
