Base 64 is an encoding scheme that converts binary data into text format so that encoded textual data can be easily transported over network un-corrupted and without any data loss. Base64 is used commonly in a number of applications including email via MIME, and storing complex data in XML.
Problem with sending normal binary data to a network is that bits can be misinterpreted by underlying protocols, produce incorrect data at receiving node and that is why we use this code.
Why base 64 ?
Resultant text after encoding our data has those characters which are widely present in many character sets so there is very less chance of data being corrupted or modified.
How to convert into base 64 format ?
The character set in base64 is
char_set = "ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz0123456789+/" // 64 characters
Lets take an example. We have to encode string “MENON” into base64 format. Lets call “MENON” as input_str, above base64 character set (“ABC..+/”) as char_set and resultant encoded string as res_str.
- Take 3 characters from input_str i.e “MEN” since each character size is 8 bits we will have(8 * 3) 24 bits with us.
- Group them in a block of 6 bits each (24 / 6 = 4 blocks). (why 6?) because 2^6 = 64 characters, with 6 bits we can represent each character in char_set.
- Convert each block of 6 bits to its corresponding decimal value. Decimal value obtained is the index of resultant encoded character in char_set.
- So for each 3 characters from input_str we will receive 4 characters in res_str.
- What if we have less than 3 characters in input_str left i.e “ON”. We have 16 bits and blocks will be 16 / 6 = 2 blocks. Rightmost 4 bits will not make a proper block (1 block = 6 bits) so we append zeros to right side of block to make it a proper block i.e 2 zeros will be appended to right. Now we have 3 proper blocks, find corresponding decimal value of each block to get index.
- Since There were less than 3 characters (“ON”) in input_str we will append “=” in res_str. e.g “ON” here 3 – 2 = 1 padding of “=” in res_str.
1. Convert “MENON” into its (8 bit) binary state format. Take each characters of the string and write its 8 – bit binary representation.
ASCII values of characters in string to be encoded
M : 77 (01001101), E : 69 (01000101), N : 78 (01001110), O : 79 (01001111), N : 78 (01001110)
resultant binary data of above string is :
01001101 01000101 01001110 01001111 01001110
2. Starting from left make blocks of 6 bits until all bits are covered
(010011) (010100) (010101) (001110) (010011) (110100) (1110)
3. If the rightmost block is less than 6 bits just append zeros to the right of that block to make it 6 bits. Here in above example we have to appended 2 zeros to make it 6.
(010011) (010100) (010101) (001110) (010011) (110100) (111000)
Notice the bold zeros.
4. Take 3 characters from input_str (“MEN”) i.e 24 bits and find corresponding decimal value (index to char_set).
INDEX --> (010011) : 19, (010100) : 20, (010101) : 21, (001110) : 14 char_set = T, char_set = U, char_set = V, char_set = O
So our input_str = “MEN” will be converted to encoded string “TUVO”.
5. Take remaining characters (“ON”). We have to pad resultant encoded string with 1 “=” as number of characters is less than 3 in input_str. (3 – 2 = 1 padding)
INDEX --> (010011) : 19 (110100) : 52 (111000) : 56 char_set = T char_set = 0 char_set = 4 So our input_str = "ON" will be converted to encoded string "T04=".
Input : MENON // string in ASCII Output :TUVOT04= // encoded string in Base 64. Input : geeksforgeeks Output : Z2Vla3Nmb3JnZWVrcw==
We can use bitwise operators to encode our string. We can take an integer “val” (usually 4 bytes on most compilers) and store all characters of input_str (3 at a time) in val. The characters from input_str will be stored in val
in form of bits. We will use (OR operator) to store the characters and (LEFT – SHIFT) by 8 so to
make room for another 8 bits. In similar fashion we will use (RIGHT – SHIFT) to retrieve bits from val 6 at a time
and find value of bits by doing & with 63 (111111) which will give us index. Then we can get our resultant character by just going to that index of char_set.
Input string is : MENON Encoded string is : TUVO04=
Time Complexity: O(2 * N) inserting bits into val + retrieving bits form val
Exercise : Implement a base 64 decoder
This article is contributed by Arshpreet Soodan. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Format String Vulnerability and Prevention with Example
- Difference between %d and %i format specifier in C language
- C program to invert (making negative) an image content in PGM format
- C program to write an image in PGM format
- C program to print characters without using format specifiers
- Format specifiers in C
- Format specifiers in different Programming Languages
- C Program to merge contents of two files into a third file
- Program to copy the contents of one array into another in the reverse order
- Dividing a Large file into Separate Modules in C/C++, Java and Python
- How to find length of a string without string.h and loop in C?
- Print substring of a given string without using any string function and loop in C
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- std::string::crbegin() and std::string::crend() in C++ with Examples
- What is the best way in C to convert a number to a string?
- Convert a floating point number to string in C
- How to split a string in C/C++, Python and Java?
- C++ string class and its applications
- Different methods to reverse a string in C/C++
- C++ String Class and its Applications | Set 2