This page uses content from Wikipedia and is licensed under CC BY-SA.
Base64 is a group of similar binary-to-text encoding schemes that represent binary data in an ASCII string format by translating it into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding.
Each base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit base64 digits.
The particular set of 64 characters chosen to represent the 64 place-values for the base varies between implementations. The general strategy is to choose 64 characters that are both members of a subset common to most encodings, and also printable. This combination leaves the data unlikely to be modified in transit through information systems, such as email, that were traditionally not 8-bit clean. For example, MIME's Base64 implementation uses
9 for the first 62 values. Other variations share this property but differ in the symbols chosen for the last two values; an example is UTF-7.
The earliest instances of this type of encoding were created for dialup communication between systems running the same OS — e.g., uuencode for UNIX, BinHex for the TRS-80 (later adapted for the Macintosh) — and could therefore make more assumptions about what characters were safe to use. For instance, uuencode uses uppercase letters, digits, and many punctuation characters, but no lowercase.
The Base64 index table:
The example below uses ASCII text for simplicity, but this is not a typical use case, as it can already be safely transferred across all systems that can handle Base64. The more typical use is to encode binary data (such as an image); the resulting Base64 data will only contain 64 different ASCII characters, all of which can reliably be transferred across systems that may corrupt the raw source bytes.
Man is distinguished, not only by his reason, but by this singular passion from other animals, which is a lust of the mind, that by a perseverance of delight in the continued and indefatigable generation of knowledge, exceeds the short vehemence of any carnal pleasure.
TWFuIGlzIGRpc3Rpbmd1aXNoZWQsIG5vdCBvbmx5IGJ5IGhpcyByZWFzb24sIGJ1dCBieSB0aGlz IHNpbmd1bGFyIHBhc3Npb24gZnJvbSBvdGhlciBhbmltYWxzLCB3aGljaCBpcyBhIGx1c3Qgb2Yg dGhlIG1pbmQsIHRoYXQgYnkgYSBwZXJzZXZlcmFuY2Ugb2YgZGVsaWdodCBpbiB0aGUgY29udGlu dWVkIGFuZCBpbmRlZmF0aWdhYmxlIGdlbmVyYXRpb24gb2Yga25vd2xlZGdlLCBleGNlZWRzIHRo ZSBzaG9ydCB2ZWhlbWVuY2Ugb2YgYW55IGNhcm5hbCBwbGVhc3VyZS4=
In the above quote, the encoded value of Man is TWFu. Encoded in ASCII, the characters M, a, and n are stored as the bytes
110, which are the 8-bit binary values
01101110. These three values are joined together into a 24-bit string, producing
010011010110000101101110. Groups of 6 bits (6 bits have a maximum of 26 = 64 different binary values) are converted into individual numbers from left to right (in this case, there are four numbers in a 24-bit string), which are then converted into their corresponding Base64 character values.
As this example illustrates, Base64 encoding converts three octets into four encoded characters.
|Source text (ASCII)||M||a||n|
|Source octets||77 (0x4d)||97 (0x61)||110 (0x6e)|
|Encoded octets||84 (0x54)||87 (0x57)||70 (0x46)||117 (0x75)|
=' padding characters might be added to make the last encoded block contain four Base64 characters.
If there are only two significant input octets (e.g., 'Ma'), or when the last input group contains only two octets, all 16 bits will be captured in the first three Base64 digits (18 bits); the two least significant bits of the last content-bearing 6-bit block will turn out to be zero, and discarded on decoding (along with the following '
=' padding characters):
|Source text (ASCII)||M||a|
|Source octets||77 (0x4d)||97 (0x61)|
|Encoded octets||84 (0x54)||87 (0x57)||69 (0x45)||61 (0x3D)|
If there is only one significant input octet (e.g., 'M'), or when the last input group contains only one octet, all 8 bits will be captured in the first two Base64 digits (12 bits); the four least significant bits of the last content-bearing 6-bit block will turn out to be zero, and discarded on decoding (along with the following '
=' padding characters):
|Source text (ASCII)||M|
|Source octets||77 (0x4d)|
|Encoded octets||84 (0x54)||81 (0x51)||61 (0x3D)||61 (0x3D)|
The final '
==' sequence indicates that the last group contained only one byte, and '
=' indicates that it contained two bytes. The example below illustrates how truncating the input of the above quote changes the output padding:
|20||any carnal pleasure.||28||YW55IGNhcm5hbCBwbGVhc3VyZS4=||1|
|19||any carnal pleasure||28||YW55IGNhcm5hbCBwbGVhc3VyZQ==||2|
|18||any carnal pleasur||24||YW55IGNhcm5hbCBwbGVhc3Vy||0|
|17||any carnal pleasu||24||YW55IGNhcm5hbCBwbGVhc3U=||1|
|16||any carnal pleas||24||YW55IGNhcm5hbCBwbGVhcw==||2|
The same characters will be encoded differently depending on their position within the three-octet group which is encoded to produce the four characters. For example:
The ratio of output bytes to input bytes is 4:3 (33% overhead). Specifically, given an input of n bytes, the output will be bytes long, including padding characters.
In theory, the padding character is not needed for decoding, since the number of missing bytes can be calculated from the number of Base64 digits. In some implementations, the padding character is mandatory, while for others it is not used. One case in which padding characters are required is concatenating multiple Base64 encoded files.
When decoding Base64 text, four characters are typically converted back to three bytes. The only exceptions are when padding characters exist. A single '
=' indicates that the four characters will decode to only two bytes, while '
==' indicates that the four characters will decode to only a single byte. For example:
|YW55IGNhcm5hbCBwbGVhcw==||two '='s||1||any carnal pleas|
|YW55IGNhcm5hbCBwbGVhc3U=||one '='||2||any carnal pleasu|
|YW55IGNhcm5hbCBwbGVhc3Vy||no '='s||3||any carnal pleasur|
Without padding, after normal decoding of four characters to three bytes over and over again, fewer than four encoded characters may remain. In this situation only two or three characters shall remain. A single remaining encoded character is not possible (because a single base 64 character only contains 6 bits, and 8 bits are required to create a byte, so a minimum of 2 base 64 characters are required : the first character contributes 6 bits, and the second character contributes its first 2 bits) . For example:
|2||YW55IGNhcm5hbCBwbGVhcw||1||any carnal pleas|
|3||YW55IGNhcm5hbCBwbGVhc3U||2||any carnal pleasu|
|4||YW55IGNhcm5hbCBwbGVhc3Vy||3||any carnal pleasur|
Implementations may have some constraints on the alphabet used for representing some bit patterns. This notably concerns the last two characters used in the index table for index 62 and 63, and the character used for padding (which may be mandatory in some protocols, or removed in others). The table below summarizes these known variants, and link to the subsections below.
|Variant||Char for index 62||Char for index 63||pad char||Fixed encoded line-length||Maximum encoded line length||Line separators||Characters outside alphabet||Line checksum|
|Original Base64 for Privacy-Enhanced Mail (PEM) (RFC 1421, deprecated)||
||Yes (except last line)||64||CR+LF||Forbidden||none|
|Base64 transfer encoding for MIME (RFC 2045)||
||No (variable)||76||CR+LF||Accepted (discarded)||none|
|Standard 'base64' encoding for RFC 3548 or RFC 4648||
||No (unless specified by referencing document)||none (unless specified by referencing document)||none (unless specified by referencing document)||Forbidden (unless specified by referencing document)||none|
|'Radix-64' encoding for OpenPGP (RFC 4880)||
||No (variable)||76||CR+LF||Forbidden||24-bit CRC (Radix-64-encoded, including one pad character)|
|Modified Base64 encoding for UTF-7 (RFC 1642, obsoleted)||
|Modified Base64 encoding for IMAP mailbox names (RFC 3501)||
|Standard 'base64url' with URL and Filename Safe Alphabet (RFC 4648 §5 'Table 2: The "URL and Filename safe" Base 64 Alphabet')||
|Unpadded 'base64url' (e.g. RFC7515)||
||none||No (variable)||(application-dependent)||none||Forbidden||(none, or separate Luhn checksum in RFC 6920)|
|Non-standard URL-safe Modification of Base64 used in YUI Library (Y64)||
|Modified Base64 for XML name tokens (Nmtoken)||
||none||No (variable)||(XML parser-dependent)||none||Forbidden||none|
|Modified Base64 for XML identifiers (Name)||
||none||No (variable)||(XML parser-dependent)||none||Forbidden||none|
|Modified Base64 for Program identifiers (variant 1, non standard)||
|Modified Base64 for Program identifiers (variant 2, non standard)||
|Non-standard URL-safe Modification of Base64 used in Freenet||
The first known standardized use of the encoding now called MIME Base64 was in the Privacy-enhanced Electronic Mail (PEM) protocol, proposed by RFC 989 in 1987. PEM defines a "printable encoding" scheme that uses Base64 encoding to transform an arbitrary sequence of octets to a format that can be expressed in short lines of 6-bit characters, as required by transfer protocols such as SMTP.
The current version of PEM (specified in RFC 1421) uses a 64-character alphabet consisting of upper- and lower-case Roman letters (
z), the numerals (
9), and the "
+" and "
/" symbols. The "
=" symbol is also used as a special suffix code. The original specification, RFC 989, additionally used the "
*" symbol to delimit encoded but unencrypted data within the output stream.
To convert data to PEM printable encoding, the first byte is placed in the most significant eight bits of a 24-bit buffer, the next in the middle eight, and the third in the least significant eight bits. If there are fewer than three bytes left to encode (or in total), the remaining buffer bits will be zero. The buffer is then used, six bits at a time, most significant first, as indices into the string: "
ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", and the indicated character is output.
The process is repeated on the remaining data until fewer than four octets remain. If three octets remain, they are processed normally. If fewer than three octets (24 bits) are remaining to encode, the input data is right-padded with zero bits to form an integral multiple of six bits.
After encoding the non-padded data, if two octets of the 24-bit buffer are padded-zeros, two "
=" characters are appended to the output; if one octet of the 24-bit buffer is filled with padded-zeros, one "
=" character is appended. This signals the decoder that the zero bits added due to padding should be excluded from the reconstructed data. This also guarantees that the encoded output length is a multiple of 4 bytes.
PEM requires that all encoded lines consist of exactly 64 printable characters, with the exception of the last line, which may contain fewer printable characters. Lines are delimited by whitespace characters according to local (platform-specific) conventions.
The MIME (Multipurpose Internet Mail Extensions) specification lists Base64 as one of two binary-to-text encoding schemes (the other being quoted-printable). MIME's Base64 encoding is based on that of the RFC 1421 version of PEM: it uses the same 64-character alphabet and encoding mechanism as PEM, and uses the "
=" symbol for output padding in the same way, as described at RFC 2045.
MIME does not specify a fixed length for Base64-encoded lines, but it does specify a maximum line length of 76 characters. Additionally it specifies that any extra-alphabetic characters must be ignored by a compliant decoder, although most implementations use a CR/LF newline pair to delimit encoded lines.
Thus, the actual length of MIME-compliant Base64-encoded binary data is usually about 137% of the original data length, though for very short messages the overhead can be much higher due to the overhead of the headers. Very roughly, the final size of Base64-encoded binary data is equal to 1.37 times the original data size + 814 bytes (for headers). The size of the decoded data can be approximated with this formula:
bytes = (string_length(encoded_string) - 814) / 1.37
UTF-7, described first in RFC 1642, which was later superseded by RFC 2152, introduced a system called modified Base64. This data encoding scheme is used to encode UTF-16 as ASCII characters for use in 7-bit transports such as SMTP. It is a variant of the Base64 encoding used in MIME.
The "Modified Base64" alphabet consists of the MIME Base64 alphabet, but does not use the "
=" padding character. UTF-7 is intended for use in mail headers (defined in RFC 2047), and the "
=" character is reserved in that context as the escape character for "quoted-printable" encoding. Modified Base64 simply omits the padding and ends immediately after the last Base64 digit containing useful bits leaving up to three unused bits in the last Base64 digit.
OpenPGP, described in RFC 4880, describes Radix-64 encoding, also known as "ASCII armor". Radix-64 is identical to the "Base64" encoding described from MIME, with the addition of an optional 24-bit CRC. The checksum is calculated on the input data before encoding; the checksum is then encoded with the same Base64 algorithm and, prefixed by "
=" symbol as separator, appended to the encoded output data.
RFC 3548, entitled The Base16, Base32, and Base64 Data Encodings, is an informational (non-normative) memo that attempts to unify the RFC 1421 and RFC 2045 specifications of Base64 encodings, alternative-alphabet encodings, and the seldom-used Base32 and Base16 encodings.
Unless implementations are written to a specification that refers to RFC 3548 and specifically requires otherwise, RFC 3548 forbids implementations from generating messages containing characters outside the encoding alphabet or without padding, and it also declares that decoder implementations must reject data that contain characters outside the encoding alphabet.
This RFC obsoletes RFC 3548 and focuses on Base64/32/16:
Another variant called modified Base64 for filename uses '
-' instead of '
/', because Unix and Windows filenames cannot contain '
It could be recommended to use the modified Base64 for URL instead, since then the filenames could be used in URLs also.
Base64 encoding can be helpful when fairly lengthy identifying information is used in an HTTP environment. For example, a database persistence framework for Java objects might use Base64 encoding to encode a relatively large unique id (generally 128-bit UUIDs) into a string for use as an HTTP parameter in HTTP forms or HTTP GET URLs. Also, many applications need to encode binary data in a way that is convenient for inclusion in URLs, including in hidden web form fields, and Base64 is a convenient encoding to render them in a compact way.
Using standard Base64 in URL requires encoding of '
/' and '
=' characters into special percent-encoded hexadecimal sequences ('
+' becomes '
/' becomes '
%2F' and '
=' becomes '
%3D'), which makes the string unnecessarily longer.
For this reason, modified Base64 for URL variants exist (such as base64url in RFC 4648), where the '
+' and '
/' characters of standard Base64 are respectively replaced by '
-' and '
_', so that using URL encoders/decoders is no longer necessary and have no impact on the length of the encoded value, leaving the same encoded form intact for use in relational databases, web forms, and object identifiers in general. Some variants allow or require omitting the padding '
=' signs to avoid them being confused with field separators, or require that any such padding be percent-encoded. Some libraries will encode '
=' to '
There are other variants that use
._ when the Base64 variant string must be used within valid identifiers for programs.
.-for use in XML name tokens (406095413:AAEFhjC13WlPEA568vDUBJRdwzSt56tG3Xc), or even
_:for use in more restricted XML identifiers (TonyduongBot).
Base64 can be used in a variety of contexts:
<data encoding="base64">…</data>e.g. favicons in Firefox's exported bookmarks.html.
data:URIs, instead of being supplied in separate files.
" (space)) through 95 ("
_"), consecutively, making its 64-character set "
!"#$%&'()*+,-./0123456789:;<=>[email protected][\]^_". Avoiding all lower-case letters was helpful because many older printers only printed uppercase. Using consecutive ASCII characters saved computing power because it was only necessary to add 32, not do a lookup. Its use of most punctuation characters and the space character limits its usefulness.
g' and '
o'. Its 64-character set is "
/. Its 64-character set is "
./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz". Padding is not used.
/. Its 64-character set is "
JPEG contents encoded in Base64" ... />
|The Wikibook Algorithm implementation has a page on the topic of: Base64|