What is Babble Bubble?

Bubble Babble is a method of coding where binary information is represented as a pseudo-word made of alternating vowels and consonants. It is mostly used to represent cryptographic fingerprints. The Bubble Babble method, created by Anti Huma, makes people easier to remember and easily repeat important information. The coding also has built -in error correction and redundancy, allowing any errors in transcription. Sometimes it is necessary to verbally verify the key via the phone or via another system. These public keys and values ​​of hash of important certificates are called fingerprints or fingerprints. These types of prints are necessary in verifying sensitive data for security reasons. They are usually represented as long chains of hexadecimal numerals. For example, the numbers rings reliably over the phone. Huma has created a code to solve this problem to easily represent forgotten binary data into the more unforgettable pseudo-Slov. The term itself is a pun on the classic VIDeohry Bobble. When hexadecimal digits are coded using a bubble coding method, generated words resemble gibberish or gibberish.

It is also useful in situations where valid encryption keys were lost or otherwise unavailable. In this case, it is necessary to verify the key fingerprint to verify the memory of the user's original key. Fingerprints coded using bubble gibber coding are often evoked than their hexadecimal versions. This makes the difference in critical situations instead of having to receive fingerprints without verifying it in any way.

To detect transmission or invalid encoding errors, bumetod BBle Babble census contains a check function. Brands that represent the start and end of a particular number chain are also included in the encoding. For each two bytes in the input sequence, the output is as a dash and five characters. OneThis method is that it does not increase the length of the coded information.

Pseudo-Slovy are made using vowels and consonants in a certain way-numbers between zero and five are mapped by vowels such as 0-A, 1-E, 2-I and so on. The integers between zero and 16 are mapped as 0-B, 1-C, 2-D, etc. In the consonant table. Each vowel in the resulting pseudo-word carries 0.58 bits of redundancy. Information on the inspection would be around 4,640 bits for a string of 1,000 words, which is useful for detecting errors such as inverted bits.