NEW
Font size
WorksheetsVocabulary Review Unit 4
Total questions: 12
Worksheet time: 9mins
Big Data
a broad term for datasets so large or complex that traditional data processing applications are inadequate.
a predication made by Gordon Moore in 1965 that computing power will double every 1.5-2 years, it has remained more or less true ever since.
A business/corporate term for a one-page document that summarizes a large issue, topic or plan.
a technique for encryption that shifts the alphabet by some number of characters
Moore's Law
a predication made by Gordon Moore in 1965 that computing power will double every 1.5-2 years, it has remained more or less true ever since.
a broad term for datasets so large or complex that traditional data processing applications are inadequate.
the generic term for a technique (or algorithm) that performs encryption
When you attempt to decode a secret message without knowing all the specifics of the cipher, you are trying to "crack" the encryption.
Caesar Cipher
a technique for encryption that shifts the alphabet by some number of characters
the generic term for a technique (or algorithm) that performs encryption
When you attempt to decode a secret message without knowing all the specifics of the cipher, you are trying to "crack" the encryption.
a process that reverses encryption, taking a secret message and reproducing the original plain text
Cracking encryption
When you attempt to decode a secret message without knowing all the specifics of the cipher, you are trying to "crack" the encryption.
a process that reverses encryption, taking a secret message and reproducing the original plain text
a process of encoding messages to keep them secret, so only "authorized" parties can read it.
an encryption technique that maps each letter of the alphabet to a randomly chosen other letters of the alphabet.
Decryption
a process that reverses encryption, taking a secret message and reproducing the original plain text
a process of encoding messages to keep them secret, so only "authorized" parties can read it.
an encryption technique that maps each letter of the alphabet to a randomly chosen other letters of the alphabet.
a technique for encryption that shifts the alphabet by some number of characters
Encryption
a process of encoding messages to keep them secret, so only "authorized" parties can read it.
an encryption technique that maps each letter of the alphabet to a randomly chosen other letters of the alphabet.
the generic term for a technique (or algorithm) that performs encryption
a process that reverses encryption, taking a secret message and reproducing the original plain text
Random Substitution Cipher
an encryption technique that maps each letter of the alphabet to a randomly chosen other letters of the alphabet.
a technique for encryption that shifts the alphabet by some number of characters
a technique for encryption that shifts the alphabet by some number of characters
When you attempt to decode a secret message without knowing all the specifics of the cipher, you are trying to "crack" the encryption.
Computationally Hard
a "hard' problem for a computer is one in which it cannot arrive at a solution in a reasonable amount of time.
A business/corporate term for a one-page document that summarizes a large issue, topic or plan.
a broad term for datasets so large or complex that traditional data processing applications are inadequate.
a predication made by Gordon Moore in 1965 that computing power will double every 1.5-2 years, it has remained more or less true ever since.
asymmetric encryption
used in public key encryption, it is scheme in which the key to encrypt data is different from the key to decrypt.
a mathematical operation that returns the remainder after integer division. Example: 7 MOD 4 = 3
In an asymmetric encryption scheme the decryption key is kept private and never shared, so only the intended recipient has the ability to decrypt a message that has been encrypted with a public key.
Used prevalently on the web, it allows for secure messages to be sent between parties without having to agree on, or share, a secret key. It uses an asymmetric encryption scheme in which the encryption key is made public, but the decryption key is kept private.
modulo
a mathematical operation that returns the remainder after integer division. Example: 7 MOD 4 = 3
used in public key encryption, it is scheme in which the key to encrypt data is different from the key to decrypt.
In an asymmetric encryption scheme the decryption key is kept private and never shared, so only the intended recipient has the ability to decrypt a message that has been encrypted with a public key.
Used prevalently on the web, it allows for secure messages to be sent between parties without having to agree on, or share, a secret key. It uses an asymmetric encryption scheme in which the encryption key is made public, but the decryption key is kept private.
Private Key
In an asymmetric encryption scheme the decryption key is kept private and never shared, so only the intended recipient has the ability to decrypt a message that has been encrypted with a public key.
Used prevalently on the web, it allows for secure messages to be sent between parties without having to agree on, or share, a secret key. It uses an asymmetric encryption scheme in which the encryption key is made public, but the decryption key is kept private.
used in public key encryption, it is scheme in which the key to encrypt data is different from the key to decrypt.
a mathematical operation that returns the remainder after integer division. Example: 7 MOD 4 = 3
Public Key Encryption
Used prevalently on the web, it allows for secure messages to be sent between parties without having to agree on, or share, a secret key. It uses an asymmetric encryption scheme in which the encryption key is made public, but the decryption key is kept private.
In an asymmetric encryption scheme the decryption key is kept private and never shared, so only the intended recipient has the ability to decrypt a message that has been encrypted with a public key.
a mathematical operation that returns the remainder after integer division. Example: 7 MOD 4 = 3
used in public key encryption, it is scheme in which the key to encrypt data is different from the key to decrypt.
