Binary | Denary |
Binary-Denary Conversion | Bit |
Decimal | Binary Number |
Denary Number | Convert |
A numbering system consisting of 10 digits (0-9). | A numbering system consisting only of 0's and 1's. |
The smallest unit of data in a computer, representing a single 0 or 1. | The process of converting a number from binary to denary, or denary to binary. |
A number expressed in the binary numbering system. | Another name for the denary numbering system. |
To change a number from one numbering system to another. | A number expressed in the denary numbering system. |
Place Value | Binary Digit |
Radix | Base 2 |
Binary | Arithmetic |
Overflow | Shift |
Another name for a bit, representing a single 0 or 1 in a binary number. | The value of a digit in a number, determined by its position. |
Another name for the binary numbering system, due to its base of 2. | Another term for the base of a numbering system. |
A branch of mathematics that deals with the properties and relationships of numbers. | A number system consisting of two digits, 0 and 1. |
To move the bits of a binary number to the left or right. | The result of an operation exceeds the range of values that can be represented with a given number of bits. |
Addition | Subtraction |
Multiplication | Division |
Binary Representation | Signed Binary Representation |
Two's Complement | Real-world Problems |
A binary arithmetic operation that finds the difference between two values by subtracting their digits. | A binary arithmetic operation that combines two values into a single value by adding their digits. |
A binary arithmetic operation that finds the quotient of two values by dividing their digits. | A binary arithmetic operation that finds the product of two values by multiplying their digits. |
A method of representing positive and negative numbers in binary form. | The representation of a number in binary (base 2) form. |
Problems that require the application of binary arithmetic and overflow concepts to solve practical issues. | A method of representing negative numbers in binary form by taking the two's complement of the positive number. |
Binary | Bit |
Byte | ASCII |
Binary Addition | Binary Conversion |
Overflow error | Logic Gates |
A single unit of binary, either a 0 or a 1. | A numbering system used in computers and digital devices that uses only two digits, 0 and 1, to represent all numbers and symbols. |
A standardized system of codes used to represent letters, numbers, and symbols in digital devices, using 7 or 8 bits. | A group of 8 bits, used to represent a single character or other data unit. |
The process of converting a number or character from decimal or text form into binary form. | The process of adding two binary numbers together, using the same rules as for decimal numbers. |
Electronic circuits that perform Boolean logic operations on binary inputs (0s and 1s) to produce binary outputs. | An error that occurs when a binary operation results in a number that is too large to be represented with the available number of bits. |
Binary Code | Binary Division |
Binary Multiplication | Binary Subtraction |
Unsigned integers | Signed integers |
Sign and magnitude | Two's complement |
The process of dividing one binary number by another, using the same rules as for decimal numbers. | A system of representing text, computer instructions, or other data using binary digits (0s and 1s). |
The process of subtracting one binary number from another, using the same rules as for decimal numbers. | The process of multiplying two binary numbers together, using the same rules as for decimal numbers. |
Numbers that can be positive, negative or zero, represented by a sequence of bits in a computer's memory with a sign bit. | Positive whole numbers represented by a sequence of bits in a computer's memory without a sign bit. |
A method of representing negative signed integers by flipping all the bits of the positive integer and adding 1. | A method of representing negative signed integers by assigning the leftmost bit as the sign bit and the remaining bits as the magnitude bits. |
Arithmetic operations | Overflow |
Bitwise operations | Bit shifting |
Sign extension | Little endian |
Big endian | Hexadecimal |
A condition that occurs when the result of an arithmetic operation is too large or too small to be represented using the limited number of bits available in the computer's memory. | Mathematical operations performed on numbers in a computer's memory, including addition, subtraction, multiplication, and division. |
Moving the bits of a binary number left or right by a certain number of positions in order to multiply or divide by a power of two. | Operations performed on the individual bits of a binary number, including bitwise AND, bitwise OR, and bitwise NOT. |
A method of storing multi-byte data in which the least significant byte is stored first. | Adding additional bits to a binary number to preserve its signed value when it is extended to a larger size. |
A base-16 numbering system used to represent binary data more compactly and human-readable. | A method of storing multi-byte data in which the most significant byte is stored first. |
Binary number system | Denary |
Binary-Denary conversion | Binary digit |
Denary digit | Binary place value |
Denary place value | Binary addition |
A numbering system that represents numbers using only ten digits, 0 to 9. | A numbering system that represents numbers using only two digits, 0 and 1. |
A digit in the binary number system, which can have a value of either 0 or 1. | The process of converting numbers between binary and denary number systems. |
The value of a binary digit based on its position in a binary number. | A digit in the denary number system, which can have a value of 0 to 9. |
The process of adding two binary numbers together. | The value of a denary digit based on its position in a denary number. |
Denary addition | Binary subtraction |
Denary subtraction | Binary conversion chart |
Hexadecimal Notation | Binary |
Decimal | Conversion |
The process of subtracting one binary number from another. | The process of adding two denary numbers together. |
A chart that helps convert binary numbers to denary numbers and vice versa. | The process of subtracting one denary number from another. |
A number system that uses only 0 and 1 to represent values. | A number system that uses 16 symbols, including 0-9 and A-F, to represent values. |
The process of changing a value from one numerical system to another. | A number system that uses 10 symbols, including 0-9, to represent values. |
Base | Nibble |
Binary-to-Hex Conversion | Hex-to-Binary Conversion |
Octal | Bit |
Sign Bit | Nibble Value |
A group of four bits. | The number system in which a value is represented. |
The process of converting a hexadecimal value to a binary value. | The process of converting a binary value to a hexadecimal value. |
The smallest unit of data in a binary value. | A number system that uses eight symbols, including 0-7, to represent values. |
The decimal value of a nibble in a hexadecimal value. | The leftmost bit in a binary value that denotes whether a number is positive or negative. |
Binary Arithmetic | Addition |
Shifts | Logical Shift |
Arithmetic Shift | Overflow |
Range | Binary Number System |
A binary arithmetic operation that involves adding two binary numbers to obtain their sum. | A method of performing arithmetic operations (such as addition, subtraction, multiplication, and division) using only two digits: 0 and 1, also known as the binary number system. |
A shift operation in binary arithmetic that does not preserve the sign of the number being shifted. | A binary arithmetic operation that involves moving all the digits of a binary number by a certain number of places to the left or right. |
The situation when the result of an arithmetic operation exceeds the range that can be represented by the number of bits available. | A shift operation in binary arithmetic that preserves the sign of the number being shifted. |
A numeral system that represents numbers using only two digits: 0 and 1. | The total number of values that can be represented by a certain number of bits. |
Bitwise Operation | Carry Bit |
Sign Bit | Two's Complement |
Character Encoding | ASCII |
Unicode | Code Point |
A bit that is generated when two binary numbers are added and the sum of their digits in a certain column exceeds 1. | An operation that acts on a binary number at the level of its individual bits. |
A method of representing negative numbers in binary by taking the complement of the positive equivalent and adding 1. | A bit in a binary number that determines whether the number is positive or negative. |
ASCII (American Standard Code for Information Interchange) is the most widely used character encoding standard. It uses 7 bits to represent each character, giving it a total of 128 characters. | Character encoding refers to the method used to represent character data in a computer. It assigns a unique code, known as a code point, to each character. |
A code point is a numerical value assigned to each character in a character encoding system. It is used to represent the character in computer memory. | Unicode is a character encoding standard that uses 16 bits to represent each character, allowing it to represent a much larger range of characters than ASCII. It is also backward-compatible with ASCII. |
Extended ASCII | UTF-8 |
UTF-16 | BOM |
Endianness | Code Page |
Escape Sequence | Hexadecimal |
UTF-8 (Unicode Transformation Format 8-bit) is a popular Unicode encoding that uses variable-length encoding, allowing it to represent any Unicode character using 1-4 bytes. | Extended ASCII is a character encoding standard that uses 8 bits to represent each character, giving it a total of 256 characters. It includes the 128 characters of ASCII and an additional 128 characters. |
BOM (byte order mark) is a special three-byte sequence that is used at the beginning of a file encoded in UTF-8 or UTF-16 to indicate the byte order of the file. | UTF-16 (Unicode Transformation Format 16-bit) is a Unicode encoding that uses 16 bits to represent each character. It can represent any Unicode character using 1 or 2 16-bit code units. |
Code page is a term used to describe a specific mapping of characters to code points in a character encoding system. | Endianness refers to the byte order of multi-byte numeric values such as integers and floating-point numbers. Big-endian byte order stores the most significant byte first, while little-endian byte order stores the least significant byte first. |
Hexadecimal is a base-16 numbering system that uses 16 distinct symbols, 0-9 and A-F, to represent numbers. It is commonly used to represent character codes and memory addresses. | An escape sequence is a combination of characters used to represent a special character or control sequence in a character string. Escape sequences typically begin with a backslash character. |
Bitmap Image | Binary Representation |
Pixel | Resolution |
Color Depth | RGB |
CMYK | Bitmap File Format |
The representation of data in terms of only two options, 1 and 0. | An image made up of pixels that is stored in a computer as a series of 1s and 0s. |
The number of pixels in an image, usually measured as width x height. | The smallest unit of a digital image that can be displayed or printed. |
A color model in which red, green, and blue light are added together in various ways to reproduce a broad array of colors. | The number of bits used to represent the color of a pixel in an image. |
A file format for storing digital images in which each pixel is represented by a fixed number of bits. | A color model used for printing, in which colors are created by combining cyan, magenta, yellow, and black ink. |
Lossless Compression | Lossy Compression |
Color Palette | Histogram |
Analog signal | Digital signal |
Sampling | Quantization |
A compression algorithm that sacrifices some quality for smaller file size. | A compression algorithm that enables the original data to be perfectly reconstructed from the compressed data. |
A chart that shows the distribution of tones in an image. | The collection of colors available for a particular image or device. |
A signal that is represented by discrete values (binary digits) and can be processed by a computer. | A continuous signal that varies over time and can take any value within a certain range. |
The process of converting the continuous amplitude values of an analog signal to discrete values (binary digits) in a digital signal. | The process of measuring the amplitude of an analog signal at regular intervals and converting it to a digital signal. |
Bit depth | Sampling rate |
Aliasing | Nyquist frequency |
Compression | File formats |
Binary representation | Benefits of binary representation |
The number of samples taken per second when converting an analog signal to a digital signal. Higher sampling rates result in more accurately represented sound. | The number of bits used to represent the amplitude values in a digital signal. Higher bit depths result in more accurately represented sound. |
The highest frequency that can be accurately represented in a digital signal at a given sampling rate. | The phenomenon where a high frequency signal is incorrectly represented as a lower frequency signal due to insufficient sampling. |
Different ways of encoding and storing digital sound files, such as MP3, WAV, and AIFF. | The process of reducing the size of a digital sound file by removing redundant information. Lossy compression reduces the file size by permanently removing data, while lossless compression reduces the file size without losing any information. |
Binary representation allows sound to be easily stored, transmitted, and processed by computers. It also allows for easy manipulation of sound, such as adding effects or editing. | The process of representing sound using binary digits (bits). This allows sound to be stored and processed by computers. |
Binary representation | Sampling frequency |
Resolution | Bit |
Byte | Limitations of binary representation |
Quantization error | Nyquist Theorem |
The number of times a signal is sampled per second. It determines the highest frequency that can be faithfully represented. | The process of representing data in a binary (base-2) numeral system. This representation uses only two digits, 0 and 1. |
Short for binary digit. The smallest unit of digital information, it can represent either 0 or 1. | The number of bits used to represent a single sample of analog data. It determines the accuracy and precision of the digital signal that is produced. |
The inability to represent infinite precision and range in digital signals due to the finite number of bits used. | A group of 8 bits. It is a common unit of measurement for digital data storage and transmission. |
States that the highest frequency that can be represented by a digital signal is half of the sampling frequency. | The difference between the actual analog signal and its digital approximation caused by the limitations of binary representation. |
Aliasing | Binary overflow |
Data compression | Lossless compression |
ASCII | Unicode |
Encoding | Character |
Occurs when the result of a binary operation exceeds the maximum value that can be represented with the available number of bits. | Occurs when the sampling frequency is too low, causing high frequency components of a signal to be improperly represented as lower frequencies. |
A data compression technique that retains all the original information of the data. | The process of reducing the number of bits used to represent data while minimizing the loss of information. |
A character encoding standard that provides a unique number for every character, no matter what platform, device, or program is used. | A character encoding standard used to represent text in computers. It uses a 7-bit binary number to represent each character. |
A unit of information that represents a letter, digit, or punctuation symbol in a writing system. | The process of converting data into a format that can be stored and transmitted. |
Binary | Bit |
ASCII Table | Unicode Table |
Extended ASCII | UTF-8 |
UTF-16 | BOM |
A fundamental unit of information that can represent two states, usually 0 and 1. | A number system that uses only two digits, 0 and 1. |
A table that lists all possible characters that can be represented using Unicode code. | A table that lists all possible characters that can be represented using ASCII code. |
A character encoding standard that uses one to four 8-bit bytes to represent a character. | A variation of ASCII that uses 8 bits, rather than 7, to represent characters. |
A sequence of bytes at the beginning of a text file, used to indicate the text encoding. | A character encoding standard that uses one or two 16-bit bytes to represent a character. |
Bitmap Image | Pixel |
Binary Representation | Resolution |
Colour Depth | DPI (Dots per inch) |
Raster Graphics | JPEG |
The smallest element of an image that can be individually processed or manipulated. | An image made up of pixels that are represented in binary format. |
The number of pixels in an image, often measured as width x height. | A digital representation of data using only two states, typically expressed as 0 or 1. |
A measure of image resolution, traditionally used to describe the quality of printed images. | The number of bits used to represent the color of a pixel in an image. |
A commonly used file format for compressed digital images, often used for photographs. | A type of digital image made up of a grid of pixels. |
PNG | GIF |
BMP | Color Palette |
Analogue signals | Binary form |
Digital form | Sampling |
A file format for digital images that supports animation and limited transparency. | A file format for digital images that supports transparency and lossless compression. |
The set of colors available for use in an image or graphics program. | A file format for digital images that is compatible with Microsoft Windows. |
Representing sound using only two possible values, 0 and 1, using a series of bits. | Continuous signals that vary in amplitude and time, used to represent sound in its natural form. |
The process of capturing snapshots of sound waves at regular intervals and converting these into digital binary signals. | Representing sound using discrete values, using a range of quantization levels, allowing for better accuracy and manipulation in processing. |
Quantization | Bit rate |
Sampling rate | Nyquist Theorem |
Aliasing | Compression |
Lossy compression | Lossless compression |
The number of bits per second that represent a sound wave in digital form. | The process of turning a continuous signal into a digital signal by attributing specific, discrete values to the amplitudes. |
The theory that the highest frequency captured during sampling cannot be more than half the sampling rate, to avoid aliasing distortions. | The number of times per second that a sound wave is sampled to be converted into binary form. |
A process of reducing the file size of digital audio through mathematical algorithms to discard components of the sound that are less noticeable to the human ear. | An undesirable effect whereby frequencies above the Nyquist limit appear as lower frequencies in the digital output. |
A type of compression method that eliminates redundant data without any permanent data loss from the original recording. | A type of compression method that permanently discards data from the original recording, resulting in a lower quality replica of the sound. |
Binary | Denary |
Multiples | Bit |
Byte | Kibibyte (KiB) |
Mebibyte (MiB) | Gibibyte (GiB) |
The decimal numerical system, which uses 10 digits (0-9) to represent all information. | The numerical system that uses only two digits, 0 and 1, to represent all information in a computer or digital device. |
The smallest unit of digital information in a computer, representing either a 0 or a 1. | A quantity that is a multiple of another quantity; e.g. 10 is a multiple of 5 because it can be divided evenly by 5. |
A unit of digital information that is equal to 1024 bytes. | A sequence of 8 bits that can represent a single character of text, a number, or a symbol. |
A unit of digital information that is equal to 1024 mebibytes, or 1,073,741,824 bytes. | A unit of digital information that is equal to 1024 kibibytes, or 1,048,576 bytes. |
Tebibyte (TiB) | Kilobyte (kB) |
Megabyte (MB) | Gigabyte (GB) |
Terabyte (TB) | Data Compression |
Lossless Compression | Lossy Compression |
A unit of digital information that is equal to 1000 bytes. | A unit of digital information that is equal to 1024 gibibytes, or 1,099,511,627,776 bytes. |
A unit of digital information that is equal to 1000 megabytes, or 1,000,000,000 bytes. | A unit of digital information that is equal to 1000 kilobytes, or 1,000,000 bytes. |
The process of reducing the size of data to save storage space and reduce transmission time while maintaining its original integrity. | A unit of digital information that is equal to 1000 gigabytes, or 1,000,000,000,000 bytes. |
A method of data compression that selectively discards some data in order to reduce the size of the file, while maintaining an acceptable level of quality. | A method of data compression that allows the original data to be fully restored from the compressed data without any loss of information. |
JPEG | MP3 |
Huffman Encoding | Run Length Encoding |
Dictionary Compression | Lempel-Ziv-Welch (LZW) Compression |
Entropy Encoding | Compression Ratio |
A lossy compression algorithm used primarily for digital audio that achieves high compression ratios with minimal loss of sound quality. | A lossy compression algorithm used primarily for digital images that achieves high compression ratios with minimal loss of image quality. |
A method of lossless compression that replaces repeated occurrences of data with a single data value and a count of the number of times it occurs. | A method of lossless compression that assigns variable length codes to symbols in a message based on their frequency of occurrence. |
A lossless compression algorithm that replaces frequently occurring patterns with a code, which is then added to a dictionary for subsequent use in compression. | A method of lossless compression that replaces repetitive data sequences with shorter codes, or references to a dictionary of previously encountered data sequences. |
The ratio of the original size of a file to its compressed size. A higher compression ratio indicates more effective compression. | A method of lossless compression that assigns codes with fewer bits to more frequent symbols and codes with more bits to less frequent symbols. |
Data Degradation | Binary |
Denary | Multiples |
Understanding | Conversion |
Units | IEC |
A system of numeric notation that has a radix of 2, using only 0s and 1s. | The loss of quality or accuracy of data as a result of compression or other forms of data manipulation. |
Numbers that are a product of a given number and an integer. | A system of numeric notation that has a radix of 10, using digits 0 through 9. |
The process of changing a number from one system of notation to another, such as from binary to denary. | Comprehension of the concept and principles behind binary and denary multiples. |
International Electrotechnical Commission, an organization that standardizes electrotechnology related activities. | Distinct quantities or values used to measure or express values of binary and denary multiples. |
Bit | Byte |
Kilobyte | Megabyte |
Gigabyte | Data Compression |
Lossless Compression | Lossy Compression |
A group of eight bits, capable of representing a single character or numerical value. | The smallest unit of data in a computer system, either 0 or 1 in binary. |
Approximately one million bytes, commonly used to measure the size of digital files. | Approximately 1000 bytes, commonly used to measure the size of digital files. |
The process of reducing the size of data so that it occupies less storage space and can be transmitted more efficiently. | Approximately one billion bytes, commonly used to measure the size of digital files. |
A compression technique that achieves higher compression ratios, but at the cost of losing some information. The decompressed data is not an exact replica of the original data. | A compression technique that allows the original data to be perfectly reconstructed from the compressed data, without any loss of information. |
Compression Ratio | Entropy Coding |
Dictionary Coding | Run Length Encoding |
Transform Coding | JPEG |
MP3 | Quantization |
A compression technique that takes advantage of the statistical patterns in the data to encode it more efficiently, by assigning shorter codes to more frequent patterns. | The ratio of the original size of data to the compressed size of data. A higher compression ratio indicates more efficient compression. |
A compression technique that replaces repeated runs of the same symbol in the data with a code that represents the symbol and the length of the run. This technique works well for data with long runs of identical symbols. | A compression technique that replaces repeated patterns in the data with shorter codes. The patterns are stored in a dictionary, which is transmitted to the decoder along with the compressed data. |
A lossy compression algorithm commonly used for compressing digital images. It uses a combination of entropy coding, transform coding, and quantization to achieve high compression ratios. | A compression technique that transforms the data into a frequency domain, where the energy of the data is concentrated in fewer frequency components. This allows for more effective compression. |
The process of approximating the continuous range of values in the data with a finite set of discrete values. This reduces the amount of information that needs to be stored or transmitted. | A lossy compression algorithm commonly used for compressing digital audio. It uses a combination of transform coding, psychoacoustic modeling, and entropy coding to achieve high compression ratios. |
Discrete Cosine Transform | File storage |
Bytes | Kilobytes |
Megabytes | Gigabytes |
Calculating file sizes | Practical problems |
The process of storing and organizing digital files on a computer system or other storage device. | A mathematical transformation used in some lossy compression algorithms to convert the data from the spatial domain to the frequency domain. It is similar to the Fourier transform, but uses only real numbers. |
A unit of measurement for digital data storage, equivalent to 1,000 bytes. | The basic unit of measurement for digital data storage, equivalent to one character of text or 8 bits. |
A unit of measurement for digital data storage, equivalent to 1,000 megabytes or 1,000,000,000 bytes. | A unit of measurement for digital data storage, equivalent to 1,000 kilobytes or 1,000,000 bytes. |
Real-world challenges or situations that require problem-solving skills and application of knowledge in a specific field or domain. | The process of determining the amount of storage space required to save a file based on its size and the unit of measurement used. |
Critical thinking | Problem-solving skills |
Binary system | Digital data |
Storage devices | Run-length encoding (RLE) |
Consecutive | Data compression |
The ability to identify, analyze, and solve problems in a systematic and effective manner. | The process of analyzing, evaluating, and synthesizing information to make informed decisions or judgments. |
Information that is represented in binary form and can be processed, stored, and transmitted using digital devices. | A system of numerical notation that uses only two digits (0 and 1) to represent all values. |
A type of lossless data compression where consecutive identical data values are replaced by a count and a single value. | Hardware components that are used to store and retrieve digital data, such as hard drives, solid-state drives, and flash drives. |
The process of reducing the amount of data required to represent a given quantity of information. | Following in order without interruption. |
Lossless | Algorithm |
Implementation | Data values |
Count | Bit |
Encoding | Compression ratio |
A step-by-step procedure for solving a problem, often expressed in computer code. | A type of data compression where the original data can be perfectly reconstructed from the compressed data without any loss of information. |
The individual pieces of data being compressed or encoded. | The process of putting a design, plan, or decision into effect. |
The smallest unit of digital information. | The number of consecutive identical data values replaced by RLE. |
The ratio of the size of the compressed data to the size of the original data. | The process of transforming information from one form to another for the purpose of efficient transmission or storage. |
Practical examples | Encryption |
Encryption algorithm | Pigpen cipher |
Caesar cipher | Vigenere cipher |
Rail fence cipher | Symmetric key cryptography |
The process of converting plaintext into ciphertext to ensure confidentiality and security of information. | Real-world scenarios where RLE can be applied, such as images with large areas of the same color. |
A substitution cipher using symbols instead of letters and numbers. | A set of steps and rules used to encrypt and decrypt data. |
A polyalphabetic cipher where a different shift is used for each letter of the plaintext message, based on a keyword. | A substitution cipher where each letter is shifted to a certain number of places down the alphabet. |
Encryption and decryption using the same key. | A transposition cipher where the plaintext is written in a diagonal pattern across a grid, then read off row by row. |
Asymmetric key cryptography | Key length |
Block cipher | Stream cipher |
Cryptanalysis | Data Encryption |
Encryption Algorithm | Symmetric Encryption |
The number of bits used in an encryption key, which affects the strength of the encryption algorithm. | Encryption and decryption using different keys – one public and one private. |
A type of encryption algorithm that works on individual bits or bytes of data, rather than block by block. | A type of encryption algorithm that works on fixed-size blocks of data. |
Data encryption is the process of converting plain text data into an unreadable format, which can only be accessed using a secret key. | The study of cryptographic systems with the aim of finding weaknesses and breaking codes. |
Symmetric encryption is a method of encryption where a single key is used to both encrypt and decrypt the data. The same key is used by both the sender and the recipient. | An encryption algorithm is a series of mathematical operations that converts plaintext into ciphertext. |
Asymmetric Encryption | Key Length |
Digital Certificate | Public Key Infrastructure |
Hash Function | Transport Layer Security |
Secure Sockets Layer | Digital Signature |
Key length refers to the number of bits used to generate a key. Longer key lengths make it more difficult to crack the encryption. | Asymmetric encryption is a method of encryption where a pair of keys is used to encrypt and decrypt data. One key is used to encrypt the data, while the other is used to decrypt the data. |
Public Key Infrastructure (PKI) is a system that enables the creation, distribution and management of digital certificates. It provides a secure way to exchange information over an insecure network. | A digital certificate is an electronic document that proves the ownership of a public key. It is used to verify the identity of the parties involved in a transaction. |
Transport Layer Security (TLS) is a protocol that provides secure communications over the internet. It uses encryption to protect data during transmission. | A hash function is a mathematical algorithm that converts data of any size into a fixed size output. The output value is called the hash, and it is unique to the input data. |
A digital signature is a mathematical technique used to verify the authenticity and integrity of a digital document or message. It provides assurance that the document or message has not been altered in transit. | Secure Sockets Layer (SSL) is a protocol that provides secure communications over the internet. It uses encryption to protect data during transmission. |
Decryption | Encryption |
Cipher | Pigpen Cipher |
Caesar Cipher | Vigenére Cipher |
Rail Fence Cipher | Substitution Cipher |
The process of converting plain text into a coded message for the purpose of keeping it secure from unauthorized access. | Decryption is the process of converting encrypted data back into plaintext using a secret key. It is the opposite of encryption. |
A simple substitution cipher that replaces letters with symbols and shapes. | An algorithm for performing encryption or decryption, typically involving a series of steps that transform plaintext into ciphertext. |
A polyalphabetic substitution cipher that uses a series of interwoven Caesar ciphers based on a keyword. | A substitution cipher that shifts letters by a fixed number of positions in the alphabet. |
A type of cipher that replaces each plaintext character with a ciphertext character based on a set of rules or algorithms. | A transposition cipher that arranges plaintext letters in a zigzag pattern before reading them off in rows. |
Polyalphabetic Cipher | Transposition Cipher |
Encryption Key | Decryption |
Encryption Algorithm | |
A type of cipher that rearranges the order of characters in the plaintext to form the ciphertext. | A cipher that uses multiple substitution alphabets to encrypt different parts of the message for added security. |
The process of converting ciphertext back into plaintext using an encryption key and algorithm. | A piece of data used in conjunction with an encryption algorithm to convert plaintext into ciphertext. |
A set of mathematical rules and procedures used to transform plaintext into ciphertext. | |