Students Name

Institution Affiliation

Course

Date
Block and Stream Ciphers

Block Cypher is a cloud-optimized framework that efficiently and at scale powers

blockchain applications. Block Cypher's web services are blockchain agnostic, which makes

developing applications that run on multiple blockchains much easier (Rueppel, 2012). On Block

Cypher’s infrastructure, you can easily create, run, and future-proof blockchain applications.

Whereas, A stream cipher is a type of symmetric key cipher that combines plaintext digits with a

stream of pseudorandom cipher digits (keystream). Each plaintext number is encrypted with the

corresponding keystream numeral in a stream cipher to create the ciphertext stream digit.

How Block and Stream Ciphers works

A block cypher encrypts data into blocks with a symmetrical key and a deterministic

algorithm. Most encryption methods, such as stream ciphers, encrypt bits one by one (stream

ciphers). A 128-bit block chip encrypts 128 bits of plaintext and converts them into 128 bits of

ciphertext. A stream cipher secures plaintext messages by encrypting them with a pseudorandom

cipher digit stream and an encryption algorithm (keystream). In stream mode, block ciphers can

function as a stream cipher by encrypting each bit of the message one by one with the

corresponding keystream digit (Rueppel, 2012).

Differences

A block cipher is different from a stream cipher because one block at a time converts

plain text into cipher text. On the other hand, the flow cipher converts plain text one byte at a

time into cipher. The ECB and CBC algorithm modes are also used for block cipher (Cipher

Block Chaining), while the CFB , OFB and the CFB algorithms in stream cipher (Cipher Code

Book) and the OFB (Output Feedback) are also used (Output Feedback) (Rueppel, 2012).
Symmetric and Asymmetric Encryption

Symmetrical encryption is a kind of encryption that only has a key to encode and decrypt

electronic data (a secret key). The key is to be shared among people who communicate with each

other via symmetrical encryption for use in the decryption process. Asymmetrical encryption is a

sort of encryption that does not include the coding and decoding key (also known by the private

key). Only the private key can decrypt a public key message (Yassein et al., 2017).

Differences

The main distinction between symmetrical and asymmetric encryption is that

symmetrical encryption uses the same encryption key, While a public encryption key is used for

asymmetric encryption and a private decryption key.

Asymmetrical encryption benefits

This type of encryption is more recent than symmetric encryption, also known as public

key encryption. As a result, there are a number of benefits to using this type of encryption,

including: Because it employs two keys, asymmetric encryption is thought to be more reliable

than symmetric encryption (Yassein et al., 2017). Although the public key used for encryption is

frequently accessible to all, the private key is not, and this encryption method is used in everyday

internet communication.

Why use symmetric encryption over asymmetric

Since the keys used in symmetric cryptography are much shorter than those used in

asymmetric cryptography, it is easier to run (in terms of both encryption and decryption).
Furthermore, the fact that only one key is used (as opposed to two in asymmetric cryptography)

speeds up the entire operation.

Implications on Keys

Finally, for symmetric encryption and decryption, the same secret key is used..

Asymmetric encryption, on the other hand, is a type of security that employs two keys for

encryption and decryption (Yassein et al., 2017). The primary advantage of asymmetric

cryptography is increased data protection. Since users are never expected to disclose or exchange

their private keys, it is the most reliable encryption method. This reduces the chances of a

cybercriminal finding a user's private key during transmission.

Factorization based encryption

Need of different algorithms

Encryption is the process by which plaintext can be converted into ciphertext and

decoded in the original letter. In data encryption and decryption, an encryption algorithm and a

key are used. Different algorithms are needed to improve protection and prevent attackers from

gaining easy access to sensitive data.

How The Algorithms work

3DES
 Triple DES uses three different keys of 56 bits each. Experts agree that a key 112-bit

strength is greater than the total key 168-bit length. Triple DES is a safe hardware crypt for

financial services and other industries even though it has progressively been removed

(Venkatraman & Overmars, 2019). The power of 3DES is more powerful than 112-bits.

Moreover, because of its limited blocking (64-bit), the 3DES cipher has a fundamental weakness

which limits its encryption of plaintext.

RSA

The asymmetrical algorithm differs from that of Triple DES when RSA uses a pair of

keys. The key must be publicly encrypted and the key decrypted with a private key. RSA

encryption creates a huge jump that takes a long time and a lot of computer power to decrypt.

The algorithm that encrypts the message must be shared with everybody, one of the apparent

weaknesses of RSA. RSA is proportional to key size and doubling key length will increase

strength tenfold, but at the expense of efficiency (Venkatraman & Overmars, 2019).

TwoFish

Twofish is a symmetrical block cipher for encrypting data by a single key and decrypting

it. Feistel is a network of Feistel and Twofish is a network of Feistel. That means that half the

text block is crossed by a F function in each round before the other half is XORed. The TwoFish

algorithm's weakness is that it has a strong software crypt rate but is not successful, whereas its

strength A symmetrical key block chipher with variable-length keys is a symmetrical key chip

forc.

Chaotic based encryption

to generate random sequences of numbers. Encryption is done with this series. The sequence of

random numbers used for decryption is highly dependent on the initial condition used to generate

this sequence (Sajasi & Moghadam, 2015).

Chaotic map/function

A chaotic map has an unpredictable conduct. You can use a discrete or continuous time

parameter to parameterize maps. In the study of dynamic systems, chaotic maps are often found.

Chaotic maps are often fractal.

How chaotic map/function is applied in cryptography

Chaos maps must be implemented in such a way that the entropy provided by the map

will create the required Confusion and diffusion in order to effectively use chaos theory in

cryptography. Chaotic systems and cryptographic primitives share similar properties, allowing

chaotic systems to be used in cryptography (Sajasi & Moghadam, 2015). It would be virtually

impossible for an adversary to find suitable and usable outputs without knowing the initial values

if chaotic parameters and cryptographic keys could be symmetrically or asymmetrically mapped

to produce suitable and usable outputs.

Why we care

Because of its applications in areas such as image encryption, hash functions, and random

number generation, chaotic-based encryption is very common in cryptography. Hundreds of new

image encryption algorithms have been proposed since the advent of chaos-based cryptography,
all with the aim of enhancing the protection of digital images. The first chaos-based random

number generators have attempted to generate random numbers directly from the logistic map.

Difference between a DH,RSA,DHE,DH Elliptical Curve Key

The difference between DH and RSA is that each party generates a public and private key

in the Diffie-Hellman method, but only the public key is exchanged while RSA allows digital

signatures, which sets it apart from the Diffie-Hellman method (Venkatraman & Overmars,

2019). Diffie Hellman is a key exchange system in which each server and client share a

password, gx and gy, with each other, where g is a group generator. Secret S = (gy)x and (gx)y

are calculated by them. Whereas, The value that the server sends to the client, gx, is now fixed in

RSA DH and stored in the certificate. As a result, no "ServerKeyExchange" message is sent.

Now, in the "ClientKeyExchange" message, the client sends its gy value, which is encrypted

using the RSA public key cryptography algorithm, whose certificate server has already sent in

the "Certificate" message.

Key length

The number of bit used in a key is defined in cryptography as the number of bits in the

cryptography key (such as a cipher). Because the safety of all algorithms is compromised by

attacks by brute forces the key length is the (i.e. a logarithmic calculation of the fastest known

attack against an algorithm). The lowest limit in the security of the Algorithm should preferably

be equal to the key length (i.e., the key length fully determines the safety of the Algorithm and

the composition of the Algorithm does not affect the inherent key length). security). Keys control

how a cipher works, and only the right key can convert encrypted text (ciphertext) to plaintext

(Venkatraman & Overmars, 2019).

In terms of speed, RSA encryption (with the public key) is significantly less expensive

(and therefore faster) than any DH operation (even with elliptic curves). With equal resistance,

RSA decryption (with the private key) takes around the same amount of time as DH key

exchange.

For security, RSA relies (more or less) on integer factorization difficulty, whereas DH

relies (more or less) on discrete logarithm difficulty. They are two separate issues. Since the

most well-known breaking algorithms for both are variations of the General Number Field Sieve,

their asymptotic complexity is the same.

As for the use, With equal resistance, RSA decryption (with the private key) takes around

the same amount of time as DH key exchange. If you use a permanent key pair, DH is a little less

costly, but if you add the expense of creating an ephemeral key pair, it's a little more expensive.

Reference

Rueppel, R. A. (2012). Analysis and design of stream ciphers. Springer Science & Business

Media.
Sajasi, S., & Moghadam, A. M. E. (2015). An adaptive image steganographic scheme based on

Noise Visibility Function and an optimal chaotic based encryption method. Applied Soft

Computing, 30, 375-389.

Yassein, M. B., Aljawarneh, S., Qawasmeh, E., Mardini, W., & Khamayseh, Y. (2017, August).

Comprehensive study of symmetric key and asymmetric key encryption algorithms.

In 2017 international conference on engineering and technology (ICET) (pp. 1-7). IEEE.

Venkatraman, S., & Overmars, A. (2019). New method of prime factorisation-based attacks on

RSA Authentication in IoT. Cryptography, 3(3), 20.