4
votes
1answer
93 views

What problems with “random” data would cause this result from Ent?

I'm playing around with a novel kind of source of "random" data and Ent is currently giving me results like this: Entropy = 7.977080 bits per byte. Optimum compression would reduce the size of this ...
0
votes
0answers
14 views

Can XTS + checksum be used for authenticated encryption?

Is it possible to use XTS+a checksum for authenticated encryption? Specifically, it seems like a good $n$ bit checksum applied before encryption should ensure that any change to the ciphertext ...
0
votes
0answers
18 views

Is it okay to use Threefish-512 in ECB mode with Poly1305 MAC to protect some AES keys?

A person has some independent AES-GCM-SIV keys they need to protect as part of a hypothetical protocol or product, where it is publically known that it is in fact AES-GCM-SIV keys that are being ...
0
votes
1answer
31 views

Product of Vigenère ciphers is not a Vigenère cipher with length of LCM

I have always thought that using two Vigenère ciphers leads to another Vigenère cipher with key length of LCM (least common multiple) of the two previous Vigenère ciphers. But I have stumbled upon ...
3
votes
2answers
191 views

What is the difference between PBE and symmetric key encryption?

What is the difference between PBE (password based encryption) and symmetric-key algorithms? My understanding is that symmetric-key algorithms like AES and Twofish are used in PBE. Hence PBE is just ...
6
votes
1answer
43 views

Scalability of homomorphic tallying

Whenever I look at online voting schemes, the idea of homomorphic encryption being a key concept, specially in the form of homomorphic tallying, appears to be universally accepted. The accepted answer ...
6
votes
0answers
62 views

Calculation of the avalanche effect coefficient

Given a strict avalanche criterion matrix/dependence matrix for a hash function,how do I calculate the avalanche coefficient for it. I want to calculate a single parameter(value) which represents the ...
5
votes
2answers
69 views

How does the split mask countermeasure work on AES?

I am trying to understand the split mask countermeasure which is a masking method to avoid side channel attacks. Let's first describe the principle and then try to apply it to AES. I found this paper ...
0
votes
2answers
73 views

Is the Discrete logarithm problem suitable for this pairing scheme?

Let $Ans$ be the product of two pairings : $e(g,h)^{k} \times e(g,h)^{r}=Ans$ If everybody knows only $[g,h,e(g,h)^{k}]$ but $[r,Ans]$ is not known. In the discrete logarithm problem, the user knows ...
2
votes
2answers
77 views

How to make the range of modulo $p$ to $[-\frac{p}{2};\frac{p}{2}]$?

I am using NTL (A Library for doing Number Theory) to implement a FHE (Fully Homomorphic Encryption) scheme. In general, the range of modulo p is $[-\frac{p}{2};\frac{p}{2}]$ in FHE scheme. However, ...
0
votes
1answer
51 views

Is webkey a reasonably secure authentication system?

I just created Webkey in the last couple days. This should allow any website to do single-password auth with a much higher level of auth security and convenience for users (single password with ...
3
votes
1answer
45 views

What are fixed points and length extension attack in hash functions?

I was recently reading about hash functions, and I came across fixed points (one or more fixed points, interested in both) and length extensions, but I didn't exactly understand how these work. If ...
4
votes
2answers
1k views

Is there something wrong with my decryption using key=9, mod 26?

I am new to cryptography and have started looking at some basic encryption. I have the following question to answer: Decrypt the the following encrypted quotation using ...
2
votes
2answers
58 views

How to prove a symmetric encryption scheme provides perfect secrecy?

I learned in class that in order to achieve perfect secrecy, the source of the plaintext $\mathcal{P}$ needs to be independent from the source of the encryption key $\mathcal{K}$. We also learned that ...
2
votes
2answers
101 views

How do I create a secure encryption scheme using addition?

You have a 4 number long PIN code with each number ranging from 0 to 9 which you wish to encrypt. You are then given a random 4 digit number ranging from 0 to 9999, which when added to the original ...
3
votes
1answer
124 views

How to reverse engineer a cryptography algorithm if some input-output pair is known.

I am trying to reverse engineer an unknown encryption algorithm. By this, I mean I dont know what kind of algorithm is used to encrypt the words. But I know some input-output pairs. From this point ...
2
votes
1answer
68 views

Trusted Third Party Cryptanalysis Labs?

There's no doubt that third party cryptanalysis is an essential part of the crypto ecosystem. It's how we know that there's some degree of practical "goodness" to a new algorithm or protocol. Unlike ...
12
votes
2answers
1k views

Does composing multiple substitution ciphers improve security?

Will using two substitution ciphers one after the another be more secure than using single substitution cipher?
0
votes
2answers
99 views

How does SSL work on the browser

I recently bought an SSL certificate from a website and was able to make it work on my Apache server. As far as I know, it uses asymmetric keys and the private key is stored on the server while the ...
2
votes
1answer
35 views

How SAM modules secure transactions?

As you know SAM Modules are used mainly in the electronic payment industry. Due to the low security of key storing in general storage devices or MCUs, Manufacturers used SAM modules for secure storing ...
2
votes
0answers
16 views

Decoding the Playfair cipher with a crib [duplicate]

I have a Playfair cipher text and I know a portion of the text (one world). How can I decode the cipher from here? Thanks.
4
votes
1answer
324 views

For RSA keys, is the safety of a given key-length different for signing vs encryption?

I'm wondering if considerations of key-length are different when thinking about signing vs encryption. If for some reason, it was safter to use smaller keys for signing that would be interesting.
1
vote
1answer
44 views

What is the advantage of Pseudosquare?

Pseudosquares ,which are not square but Jacobi symbol are still 1, are used in some cryptographic algorithm. What is the advantage of them over the exact squares? If we used squares instead of ...
-3
votes
0answers
38 views

The state in RC4-128

I'd ask what's the state in rc4 algorithm and its size depend on what? If the plaintext 8x3 bits and key of 4x3 bits What the size of s in this case?
3
votes
0answers
30 views

Best Attack Against HFE cryptosystem

I am looking for the best know attack against HFE cryptosystem. Reading this paper DEGREE OF REGULARITY FOR HFE I found the next claim However, Faugere and Joux demonstrated that we can solve and ...
9
votes
1answer
260 views

Non-iterative cryptographic hash functions

Consider the following cryptographic hash function $H$ which maps a message $m$ of variable size to $b$ bits: $$H:\{0,1\}^{*} \mapsto \{0,1\}^b$$ $$y = H(m) = SPRP(IV||m||padding)\mid_{b}$$ , where: ...
4
votes
2answers
186 views

What is this “finite field cryptography”?

See RFC 5931 § 2.2.1 which talks about "finite field cryptography" as opposed to elliptic curve cryptography and it looks like it is describing the Diffie-Hellman protocol. But Diffie-Hellman is not a ...
-1
votes
0answers
43 views

Check if a number is Carmichael number efficiently

I am trying to implement Modified Miller-Rabin Algorithm by Shyam Narayanan (https://math.mit.edu/research/highschool/primes/materials/2014/Narayanan.pdf). The algorithm demands to check if a number ...
3
votes
2answers
154 views

How to use the Extended Euclidean algorithm to invert a finite field element?

I was doing some practice on cryptography (I'm new to this topic) and was wondering what the following question even means or what it is asking me to find. I do know how to do Extended Euclidean ...
1
vote
1answer
38 views

How would an attacker perform an exhaustive key search on a block cipher using ECB mode?

Do you always assume from Kerchoff's principle, that the attacker has access to everything but the decryption key? That is, am I to assume that to perform an exhaustive key search, the attacker has a ...
2
votes
1answer
64 views

How is it possible that $g^q \equiv 1 \pmod p$ for a generator g?

The context of this question is coming up with the parameters for the ElGamal encryption scheme. One of the requirements for the parameters for ElGamal is that we have primes $p$ and $q$ such that $p ...
0
votes
0answers
10 views

What does prevent MITM in quantum cryptography? [duplicate]

One thing I really doesn't have understand, is how MITM is prevented in quantum cryptography. Lets say Alice sends to Bob a random sequence of photons organized in a specific way (vertical, ...
4
votes
1answer
36 views

Generate a random number $r \in \{1,2, \dots , k\}$, where $k$ is not public and is distributedly held

A set of parties can securely generate a random number $r \in \{1,2,3,\dots, k\}$ when $k$ is publicly known. However, can we generate the random number $r$ if $k$ is not publicly known and is held by ...
6
votes
2answers
82 views

Purpose of DES parity bits

DES has a 64-bit key size, but only 56 of those are used during encryption. The other 8 are "parity bits". What was the intended purpose of the party bits, and why are they no longer used in modern ...
3
votes
0answers
47 views

Are there any crypography schemes which rely on Graph Isomorphism not being in P?

Are there any cryptography schemes having correctness relying on Graph Isomorphism not being in P? If I should ask this question in the CS Theory area, I will migrate it. Thanks.
3
votes
2answers
80 views

A block cipher whose key changes after each block

I have been reading about various block cipher modes of operation, and all of them seem to treat the block cipher (including it's key and key schedule) as a sort of immutable black box. I would like ...
3
votes
1answer
66 views

Why doesn't this operation reveal the voter's message?

I am working my way through this paper. I am trying to figure out the OR zero knowledge proof in figure 2. The prover is verifying that she has correctly voted, and that her input satisfies ...
4
votes
2answers
113 views

For what does “Rcon” stand for in Rijndael/AES?

How do we expand the abbreviation “Rcon” used in the Rijndael key schedule? I know what it is, I know how it works; I just do not know for what it is a shortcut for. I mean: if "Sbox" is ...
0
votes
0answers
21 views

If you receive a message with a digital signature, how do you know what verification key to use and the verification algorithm?

Really, I'm asking how do you know who sent it? My confusion has arisen from the following scenario... Problems with Signing-then-encrypting. If Alice digitally signed some data and then encrypted ...
3
votes
1answer
19 views

Reuse of TLS client key/certificate in challenge-response protocol

The situation: We have a custom PKI with clients communicating with the server over standard SSL/TLS encrypted channel. PKI uses ECC, server certificate supports ECDHE_ECDSA key exchange mechanism and ...
0
votes
1answer
15 views

CCA on PKCS#5 using error feedback

My question is about attacking PKCS#5 with CCA using the error feedback. What we learnt in class about PKCS#5: CBC requires padding to whole block boundary PKCS#5: standard padding If ...
4
votes
1answer
195 views

Discrete logarithm problem is easy in a cyclic group of order a power of two

Let $G=\langle g\rangle$ be a cyclic group of order $2^{k}$ and let $h\in G$. I have read that it is easy to find $\log _{g} h$, but I haven't been able to figure out how. Do you know why this can be ...
5
votes
2answers
84 views

What asymmetric key exchange algorithms are known besides DH?

On Wikipedia, a lot of the subjects that are said to be different key exchange methods are often just protocols that incorporate the Diffie-Hellman algorithm into them. The only other key exchange ...
1
vote
1answer
60 views

What are the possible security issues when exporting a plaintext database to a file like this?

Say I have plaintext database with key-value pairs of usernames and passwords. Then I iterate through the database, encrypt the passwords, and write the username and encrypted password pairs to file ...
1
vote
0answers
38 views

Can error correcting codes be used to guess this plaintext?

I pick a finite set of messages, perhaps the set of integers $M = \lbrace n \in \mathbf{Z} \, : \, 0 \leq n\lt10 \rbrace$, which you are then allowed to encode in any way you want (some form of error ...
0
votes
0answers
29 views

Is original DSA a TEGTSS-I scheme?

Brickell et al. define TEGTSS-I scheme in paper "Design validations for discrete logarithm based signature schemes" In this paper original DSA is generalized as DSA-I variant where $r = g^k \bmod p ...
4
votes
1answer
68 views

Password-based encryption with small typos allowed

I'm trying to write some software to encrypt and decrypt some messages with a password. I am trying to implement it using this post: How can I securely convert a "string" password to a key used in ...
0
votes
1answer
20 views

Partial-Message Collisions on Iterated Hash Functions

In Cryptography Engineering by Ferguson et al it says the following is a problem with iterated hash functions: Because hashing $m$ and $m'$ leads to the same value, $h(m||X) = h(m'||X)$... for all ...
3
votes
1answer
68 views

If we should not reuse primes in DH, shouldn't we not reuse ECDH elliptic curve properties?

An article How is NSA breaking so much crypto? describes NSA's methods for breaking encryption. If a client and server are speaking Diffie-Hellman, they first need to agree on a large prime number ...
-2
votes
0answers
41 views

How can I find a key matrix to decode a Hill Cipher?

For an assignment, I've been given a 2x2 cipher and a 3x3 cipher and I have to decode both of them. I have no key, so I really don't know where to start. Also, this is all modulo 27, because my prof ...

15 30 50 per page