The Hill cipher is a historic polygraphic substitution cipher invented by Lester S. Hill in 1929.

learn more… | top users | synonyms

1
vote
0answers
20 views

Hill cipher key space

Key space is the set of all possible keys that can be used to generate a key.we using the number of valid key to describe it. Q: I've given a hill cipher of block size k over alphabet of size p, ...
-1
votes
0answers
26 views

Is it possible to find an attack that can reduce the key space of the Hill cipher with $d*d$ key matrix to $26^d$ [duplicate]

Is it possible to find an attack that can reduce the key space of the Hill cipher with $d*d$ key matrix to $26^d$ instead of $26^{d^2}$?
2
votes
1answer
72 views

Hill cipher cryptanalysis - known plaintext known key size

Hello I want to know how to go about this problem I know the plaintext "abcdef" and the ciphertext. The key size is 2. I really can't figure out how to find the key for decrypting and encrypting.
1
vote
1answer
84 views

Hill cipher is not perfectly secure

I am on cryptography course and there is a homework question to show that Hill cipher doesn't have perfect security. So assume we have an cryptosystem $(P,C,K)$, where $P = C = \mathbb Z_{26}^N$ and ...
1
vote
2answers
125 views

hill cipher encryption way 1x3 plaintext matrix

Can someone help me with a Hill cipher? When do I have to use: 1x3 plain text matrix (p1, p2, p3) * 3x3 key matrix 3x3 key matrix * 3x1 plain text matrix Or they are both correct? I tried to ...
1
vote
1answer
150 views

Hill Cipher - Unknown plaintext attack, known key [duplicate]

I was wondering if I have the key and the encrypted Hill Cipher message(s). I can definitely figure out the charset involved. But the order is missing. Assuming that I use 37 modulo or higher. How ...
1
vote
2answers
270 views

Are there any hand ciphers not obsoleted by computer cryptanalysis? [duplicate]

Computerized cryptanalysis has obviously made formerly "secure" hand ciphers like Playfair, Four Square, and the Hill Cipher obsolete because they can be defeated in seconds. But is there a hand ...
3
votes
1answer
432 views

Hill-cipher, disordered alphabet

I am going to apply a simple substitution cipher to my input, then encrypt the result with a Hill cipher. How can this be broken, in a chosen-plaintext threat model? In other words, instead of the ...
4
votes
2answers
476 views

Hill cipher, unknown letter value

I've been struggling on this problem for a while now : the Hill cipher is well-known to be vulnerable to known-plaintext attack due to its linearity. Given a key matrix $K$ of size $n\times n$, one ...
4
votes
3answers
2k views

Hill Cipher known plaintext attack

I know a plaintext - ciphertext couple of length 6 for a hill cipher where its key is a [3x3] matrix. Based on what I've read and learned, to attack and crack keys of [n x n], if we know a plaintext ...
3
votes
1answer
650 views

Figuring out key in hill cipher (chosen-plaintext attack)

I have been wondering what approach to take in order to figure out what key was used to encrypt a message using the hill cipher. I know it is possible to obtain it even if it were just a ...
1
vote
1answer
768 views

Calculating the inverse modularity of the determinant for Hill cipher

I'm trying to decrypt a message encrypted with Hill Cipher, but I don't understand how to find the determinant so it solves the equation $det * 1/det = 1 mod 26$. The determinant for my key matrix is ...
0
votes
1answer
320 views

Why does my implementation of CBC mode only decrypt the first block correctly? [closed]

I have the following code that uses a CBC mode to encrypt a text by dividing it to 3-elements block. But it only works correctly on the first block which is xored with the IV. ...
1
vote
1answer
322 views

Security analysis of a “one-time pad” type hill cipher

Suppose the Hill cipher were modified to something like a one-time pad cipher, where Alice wants to send a message to Bob, and she chooses a key matrix randomly everytime a new message is sent (and ...