Course Hero - Homework Help

Study documents and Expert Q&A Open

1
Search C

CUNY John Jay College of Criminal Justice 쇴

CSCI 360 쇴 csci 360 exam 1 review.pdf

csci 360 exam 1 review.pdf

Helpful 1 Unhelpful

Page 1 of 2 쇮

Review for Exam 1:

(Cryptography: CSCI 360 John Jay College, Prof. Khodjaeva)

1. Problems from homework:

• Chapter 1: 1.1, 1.5, 1.6, 1.8, 1.10, 1.12;
• Chapter 2: 2.1, 2.5, 2.7, 2.8, 2.9;
• Chapter 3: 3.1, 3.2, 3.3, 3.4, 3.7;
• Chapter 4: 4.1, 4.3, 4.4, 4.5, 4.6, 4.9;

2. Understanding the lecture.

1) Chapter 1:
Know the tree of Cryptology. Describe the difference between Cryptography and
Cryptanalysis as aspects of Cryptology. Describe and give examples of the
different types of Cryptography and Cryptanalysis.
What is Symmetric Cryptography? Basic ideas about Symmetric Key
Cryptosystem (Fig. 1.5, page 5).
Learn about Kerckhoff's Principle and why do we care about this in Cryptanalysis.
Study well about Modular Arithmetic (specifically how to add, subtract, multiply
and finding the inverses)
What is Substitution Cipher? Describe two attacks on Substitution Cipher?
Shift Cipher and Affine Cipher. Make sure you understand for both ciphers
§ encryption and decryption equations formulas
§ the key spaces
§ two attacks on both ciphers which we discussed in class
§ If I give you few letters, you should be able to encrypt and decrypt.

2) Chapter 2:
What is the stream cipher and block cipher? Describe the differences between
stream ciphers and block ciphers. Discuss the positives and negatives of using
stream ciphers. Discuss the positives and negatives of using block ciphers.
Encryption and decryption with stream ciphers
Random Number Generators (RNGs) and its branches TRNG, PRNG, CTRNG.
You should understand each of the branches and make a table with construction,
statistical properties, cryptographic properties and efficiency. Also know
examples for TRNG and PRNG which were mentioned on the slides.
What is One Time Pad (OTP)? Advantages and disadvantages about OTP.
LFSRs: make sure you understand how to construct LFSRs from the polynomial
and how to generate key steams and find the period if the seeds are given.
Understand what is primitive, irreducible and reducible polynomials (Problem
2.8).

3) Chapter 3:
DES Facts
What is Claude Shannon's idea about strong encryption algorithm? Make sure to
study the definition of Confusion and Diffusion.

View answer and explanation 쇯

ConstableGull2394 숥 Veri.ed Expert

Answer:
Know the tree of Cryptology. Describe the di7erence between Cryptography
and Cryptanalysis as aspects of Cryptology. Describe and give examples of the
di7erent types of Cryptography and Cryptanalysis.
Cryptography is the practice of communicating securely in the presence of third
parties. Cryptanalysis is the study of methods for deciphering encrypted data
without access to the secret key. Email, Xle sharing, and secure communications
are all applications that use cryptography. Cryptanalysis is used in many
applications, such as email, Xle sharing, and secure communications. Secure
communication in the presence of outside parties is practiced through the use of
cryptography. Cryptanalysis is the study of techniques for understanding
encrypted data without having the key needed to decrypt it.

Symmetric-key cryptography and public-key cryptography are the two main

subtypes of cryptography. Private-key cryptography, also referred to as symmetric-
key cryptography, is a type of message encryption and decryption that uses the
same key. A message can be encrypted using the recipient's public key and
decrypted using the recipient's private key in public-key cryptography, on the other
hand, where each user has a pair of keys, a public key and a private key. The three
main subcategories of cryptography are stream ciphers, block ciphers, and hash
functions. A type of symmetric-key cipher known as a stream cipher encrypts and
decrypts a stream of data one bit or byte at a time using the same key. A block of
data, typically 64 bits or 128 bits, is encrypted and decrypted using a block cipher,
a type of symmetric-key cipher. A speciXc class of cryptographic algorithm known
as a hash function converts a variable-length input into a Xxed-length output
known as a hash value. Cryptanalysis is the study of techniques for understanding
encrypted data without having the key needed to decrypt it. Codebreaking and
tra\c analysis are the two main subtypes of cryptanalysis. Decrypting a message
without the key is a process known as codebreaking. Tra\c analysis is the
process of extrapolating information from communication patterns without having
access to the communication's content.

What is Symmetric Cryptography? Basic ideas about Symmetric Key

Cryptosystem.
In symmetric cryptography, a message is encrypted and decrypted using the exact
same secret key. It is also referred to as secret key or private key cryptography. It
is the type of cryptography that is most commonly used.
A symmetric key cryptography system has four components-
1. Plaintext- This is the original message that needs to be encrypted.
2. Encryption algorithm- This is the mathematical function that is used to encrypt
the plaintext.
3. Secret key- This is the key that is used to encrypt and decrypt the message. It
must be kept secret and only shared with the intended recipient.
4. Ciphertext- This is the encrypted message that is produced by the encryption
algorithm.

Learn about Kerckho7's Principle and why do we care about this in

Cryptanalysis.
The Dutch cryptographer Auguste Kerckho^ initially articulated Kerckho^'s
concept, sometimes known as Kerckho^'s law, in 1883. A cryptosystem "shall be
secure even if everything about the system, save the key, is public knowledge,"
according to the concept. In other words, the secrecy of a cryptosystem's
components or how they operate shouldn't a^ect how secure it is. Because it
serves as the foundation for the one-time pad, the only cryptosystem that provides
unconditional security, the theory is also known as the "one-time pad principle."
The idea is crucial to cryptanalysis since it aids in concentrating on the key, which
is a cryptosystem's most crucial component. If a system's security is not
dependent on the secrecy of its parts, an attacker only has to focus on the key in
order to compromise the system. Instead than attempting to attack the system
directly, this is signiXcantly simpler.

Kerckho^'s concept is crucial in cryptography since it aids in the creation of

secure cryptosystems, even those that are well known. For instance, the one-time
pad is safe because the key is produced at random and only used once. An
attacker cannot guess the key even if they are aware of the algorithm used to
create it. This means that the secrecy of the key alone determines the system's
security rather than the secrecy of the algorithm.

Study well about Modular Arithmetic (speciHcally how to add, subtract,

multiply and Hnding the inverses)
Modulo is a mathematical operation that Xnds the remainder when one number is
divided by another. It is typically denoted using the percent sign (%). In modular
arithmetic, numbers "wrap around" when they reach a certain value. This value is
called the modulus. For example, in the modular arithmetic with modulus 7, the
numbers 8 and 15 both wrap around to 1.

The basic properties of modular arithmetic are closure, associativity,

commutativity, and distributivity.
Closure: If a and b are integers and m is a positive integer, then a+b and a⋅b are
also integers.
Associativity: If a, b, and c are integers and m is a positive integer, then
(a+b)⋅c=a⋅(b+c) and (a⋅b)⋅c=a⋅(b⋅c).
Commutativity: If a and b are integers and m is a positive integer, then a+b=b+a
and a⋅b=b⋅a.
Distributivity: If a, b, and c are integers and m is a positive integer, then
a⋅(b+c)=a⋅b+a⋅c.

What is Substitution Cipher? Describe two attacks on Substitution Cipher?

Shift Cipher and AKne Cipher. Make sure you understand for both ciphers
Every letter in the original message (often referred to as the plaintext) is changed
to a di^erent letter or symbol using a substitution cipher (the ciphertext). The
Caesar cipher, which was employed by Julius Caesar to encrypt his military
communications, is one of the most popular substitution ciphers. Frequency
analysis and known-plaintext attacks are the two main methods used to attack
substitution ciphers. A statistical method called frequency analysis is used to
determine which characters appear most frequently in a ciphertext. Once the most
frequent letters have been determined, they can be used in place of their plaintext
counterparts to expose the concealed message. The ciphertext and the
associated plaintext must be available for known-plaintext attacks. With the aid of
this knowledge, it is possible to spot patterns in the ciphertext that can be utilized
to unlock the message.

What is the stream cipher and block cipher?

A stream cipher is a type of cipher that encrypts data one bit or byte at a time. A
stream cipher can be used for encryption of data in real time. A block cipher is a
type of cipher that encrypts data in blocks. A block cipher can be used for the
encryption of data that is not streaming, such as a Xle.

Describe the di7erences between stream ciphers and block ciphers.

A stream cipher is a type of cipher that encrypts data one bit or byte at a time. A
block cipher is a type of cipher that encrypts data in blocks of a Xxed size. Stream
ciphers are typically faster and easier to implement than block ciphers. Block
ciphers are more secure than stream ciphers. A stream cipher can be more easily
attacked than a block cipher. A block cipher is more di\cult to attack because it is
more resistant to ciphertext only and chosen plaintext attacks.

Discuss the positives and negatives of using stream ciphers.

A stream cipher is a type of cipher that encrypts a message one bit or byte at a
time. Stream ciphers can be incredibly di\cult to break if they are used correctly,
but they can also be very vulnerable to attack if not used correctly.

Positives:
-Stream ciphers are very fast and e\cient.
-They can be very di\cult to break if used correctly.

Negatives:
-Stream ciphers can be very vulnerable to attack if not used correctly.
-They can be di\cult to implement correctly.

Discuss the positives and negatives of using block ciphers.

A block cipher is a form of symmetric-key encryption method that operates on
Xxed-length blocks of data at a time. Block ciphers are an important aspect of
modern cryptography and are used in a range of applications, including email
encryption, Xle encryption, and safeguarding wireless communications.

Positives:
-Block ciphers are very fast and e\cient.
-They are relatively simple to implement.
-Block ciphers are very versatile and can be used in a variety of applications.

Negatives:
-Block ciphers can be susceptible to chosen-plaintext attacks.
-Block ciphers can be susceptible to known-plaintext attacks.
-Block ciphers can be susceptible to chosen-ciphertext attacks.

Explain Encryption and decryption with stream ciphers

The process of converting readable data into an unreadable format is known as
encryption. A key, which is a piece of knowledge that regulates the transformation,
is used to do this. The data is encrypted using the key before being transferred to
the recipient as ciphertext. The ciphertext is subsequently converted back into its
original form by the recipient using the key to decrypt it. Data is encrypted one bit
or byte at a time using a sort of encryption method called a stream cipher.
Compared to block ciphers, which encrypt data in bigger blocks, they are often
faster and more e^ective. Applications for stream ciphers include secure device-
to-device communication and data transmission over the internet.

What is One Time Pad (OTP)? Advantages and disadvantages about OTP.
A sort of encryption that cannot be broken is a one-time pad. A random number
sequence that is as long as the message being encrypted serves as the key. The
message is encrypted using the key, which is subsequently destroyed. It is
impossible for someone without the key to read the message because it can only
be decoded with the key. A one-time pad has the beneXt of being unbreakable.
The drawback is that the key can only be used once before being destroyed. The
one-time pad would be rendered useless if the key was not destroyed because it
might then be used to decipher subsequent communications.
A One-Time Password (OTP) is a password that is valid for only one use.
Advantages:
-It is more secure than a static password because it cannot be guessed or stolen.
-It can be used to authenticate a user for a single transaction, after which it
becomes invalid.
Disadvantages:
-It can be inconvenient for the user, who must remember or store the password
somewhere securely.
-If the password is lost or stolen, it cannot be recovered.

Explain how to construct LFSRs from the polynomial and how to generate key
steams and Hnd the period if the seeds are given.
To construct an LFSR from a polynomial, one must Xrst determine the order of the
polynomial. This is done by Xnding the degree of the polynomial. The degree of a
polynomial is the highest exponent of the variable in the polynomial. For example,
the degree of the polynomial x^3 + x + 1 is 3. Once the degree of the polynomial is
known, one can determine the number of taps needed for the LFSR. The number
of taps is equal to the degree of the polynomial plus one. For example, the LFSR
for the polynomial x^3 + x + 1 would have four taps.

To generate keystreams from LFSRs, one must Xrst determine the taps of the
LFSR. The taps are the bits that are exclusive-or'ed together to generate the next
bit in the keystream. For example, the taps for the LFSR x^3 + x + 1 would be the
bits in positions 3, 2, and 0. To generate a keystream, one must start with a seed.
The seed is a string of bits that is used to initialize the LFSR. For example, the
seed for the LFSR x^3 + x + 1 could be 011. Once the seed is chosen, the LFSR is
clocked, meaning that the bits in the LFSR are shifted to the right by one position.
The bit that is shifted out of the LFSR is exclusive-or'ed with the taps, and the
result is the next bit in the keystream. This process is repeated until the keystream
is the desired length.

The period of an LFSR is the number of clock cycles it takes for the LFSR to
return to its original state. For example, the LFSR x^3 + x + 1 has a period of 7. This
means that after 7 clock cycles, the LFSR will be in the same state as it was after
the Xrst clock cycle.

Explain what is primitive, irreducible and reducible polynomials.

A primitive polynomial is a polynomial in which all the coe\cients are either 0 or 1.
An irreducible polynomial is a polynomial that cannot be factored into the product
of two non-constant polynomials. A reducible polynomial is a polynomial that can
be factored into the product of two non-constant polynomials. All primitive
polynomials are irreducible, but not all irreducible polynomials are primitive. For
example, the polynomial x4 + x + 1 is irreducible, but it is not primitive. All reducible
polynomials are not irreducible. For example, the polynomial x4 - x3 + x2 - x + 1 is
reducible, but it is not irreducible.

What is Claude Shannon's idea about strong encryption algorithm? Make sure
to study the deHnition of Confusion and Di7usion.
Shannon stated that a strong encryption method should contain both confusion
and di^usion in his article "Communication Theory of Secrecy Systems." By
obscuring the connection between the plaintext and the ciphertext, confusion can
be used to create ciphers that are challenging to crack. Di^usion is the process of
dispersing encrypted data so that it is challenging to detect patterns. According to
Shannon, a safe encryption method must contain both confusion and di^usion to
be e^ective. Later cryptographers discovered that it is feasible to design an
algorithm that only had one of these characteristics. For instance, the Advanced
Encryption Standard (AES) has both confusion and dissemination, whereas the
Data Encryption Standard (DES) only has confusion.

Step-by-Step explanation

Key references:

Ke, Y., Zhang, M. Q., Liu, J., Su, T. T., & Yang, X. Y. (2019). Generative
steganography with Kerckho^s' principle. Multimedia Tools and Applications,
78(10), 13805-13818.

Li, M., Lu, D., Xiang, Y., Zhang, Y., & Ren, H. (2019). Cryptanalysis and
improvement in a chaotic image cipher using two-round permutation and
di^usion. Nonlinear Dynamics, 96(1), 31-47.

Masood, F., Ahmad, J., Shah, S. A., Jamal, S. S., & Hussain, I. (2020). A novel
hybrid secure image encryption based on julia set of fractals and 3D Lorenz
chaotic map. Entropy, 22(3), 274.

Sajja, A., Mandrumaka, K. K., & Punnam, S. (2021). WALLACE TREE HIGH
PERFORMANCE STRATEGY FOR DATA PRIVACY EMPLOYING ELLIPTIC
CURVE CRYPTOLOGY. PalArch's Journal of Archaeology of
Egypt/Egyptology, 18(09), 561-575.

Is this answer helpful?

Help us provide students the best solution

• DES construction (i.e. Input/output size, initial key size before PC-1 and key
size, the number of rounds, number of S-boxes which are non-linear (you should
be able to show non-liniarity, Problem 2.1), inputs and outputs sizes in S-boxes)
• In each round we have diffusion layer and confusion layer. Make sure you know
which one is which.
• Big idea of DES decryption, do not go in too much details (i.e. If I give you DES
encryption, you should be able to write decryption based on encryption of DES or
vice versa. Know how DES encryption and decryption are related, you do not
need to prove what we did in class.)
• Security of the DES

4) Chapter 4:
• Define commutative groups. Are (ℤ#,∗) and (ℤ# , +) groups? Why?
• What is Finite Fields? When can we have finite fields (Hint: prime power)?
• How to construct GF( ࠵? ࠵?) and how to do operations on such field (i.e. addition,

subtraction, multiplication and division)? Note that if I ask you division I will
provide you the table with inversion, you just need to be able to read it.
• AES construction (i.e. Input size, key size, output size, the number of rounds, how
many layers in each round and brief explanation what are we doing in each layer?
Where the Cloud Shannon's principal are applicable?)
• Big idea of decryption of the AES do not go in too much detail. (i.e. If I give you
AES encryption, you should be able to write decryption base on encryption of
AES or vice versa)
• Security of the AES

View answer and explanation 쇱

TITLE

csci 360 exam 1 review.pdf

SCHOOL

CUNY John Jay College of Criminal Justice

COURSE TITLE

CSCI 360

UPLOADED BY

emojica82

PAGES

TERM

Fall 2016

Company Get Course Hero

About Us iOS

Careers Android

Leadership Chrome Extension

Sitemap Tutors

Q&A Archive

Educator Events

Study Tools Help

AI Homework Help Contact Us

Flashcards FAQ

Feedback

Legal Connect with Us

Copyright Policy College Life

Academic Integrity Facebook

Our Honor Code Twitter

Privacy Policy LinkedIn

Terms of Use YouTube

Attributions Instagram

Do Not Sell or Share My

Personal Info

Copyright © 2023. Course Hero, Inc.

Course Hero is not sponsored or endorsed by any
college or university.