0
votes
1answer
67 views

How to implement the Salsa20 hash function?

I am currently implementing Salsa20 from the specification as an exercise in learning and self-flagellation. I have Sections 1-7 passing the test examples provided. I am now stuck on Section 8, The ...
0
votes
2answers
35 views

Discrepancy with reported key size for EDE ciphers in Qualys SSL Labs

The following two cipher suites were reported by Qualys SSL Labs as being 112-bit: SSL_CK_DES_192_EDE3_CBC_WITH_MD5 TLS_RSA_WITH_3DES_EDE_CBC_SHA However, all other references I can find say that ...
0
votes
1answer
87 views

Hardness of problem related to bilinear pairings

Let $e: \mathbb G_1 \times \mathbb G_1 \rightarrow \mathbb G_T$ be an efficient bilinear pairing. Note that the pairing is symmetric (i.e., Type 1). The problem is, given $g \in \mathbb G_1$ and ...
0
votes
2answers
107 views

What is a good way to demonstrate elliptic curve cryptography?

For school (high school) I am writing an essay on elliptic curve cryptography. The assignment needs to include a practical part, so I decided to write a Python class for elliptic curves. This class is ...
0
votes
2answers
97 views

Is my method symmetric encryption?

To obfuscate data I made up this method on the spot without planning since the goal wasn't real encryption. At first I though this cannot be real encryption but after revisiting the code and reading ...
0
votes
1answer
57 views

Finding discrete logarithm with baby-step-giant-step algorithm

http://en.wikipedia.org/wiki/Baby-step_giant-step I am trying to use the Baby Step Giant Step algorithm to find discrete logarithm in: $$a^x= B (mod \;p)$$ with using BSGS : $$x = im+j$$ $$a^j ...
0
votes
4answers
180 views

what is it called when encrypt('a') + encrypt('a') == encrypt('aa')?

So normally if you do encrypt('a') twice in a row you'll get the same result. But sometimes (as is the case in SSH) this is not desirable. You want encrypt('a') + encrypt('a') == encrypt('aa'). What ...
0
votes
2answers
40 views

How to use HMAC for authenticating multiple messages

The standard HMAC function, $H(K, m)$, authenticates a single message $m$. Instead, I'd like to authenticate 2 messages, like this: $$H'(K, m_1, m_2)$$ The simplest solution, $H(K, m_1||m_2)$, ...
0
votes
1answer
90 views

Prime Numbers in Discrete Log

I am implementing a security protocol based on discrete log. I came across the equation $p = kq + 1$. Understand that based on number theories that both $p$ and $q$ should be large enough to be ...
0
votes
1answer
49 views

Post-quantum hybrid encryption

Assume the following simplified protocol: seed = curve25519SharedKey(theirPublicKey, myPrivateKey) sharedKey = scrypt(seed, salt, sufficientlyHardWorkFactors...) cipherText = aes256(sharedKey, ...
0
votes
1answer
66 views

“Kernel attack” on MinRank — why do we guess $\left\lceil \frac k n \right\rceil$ vectors?

The kernel attack on MinRank is described here (page 5). My question refers to this line: Note that if $m = \left\lceil \frac k n \right\rceil$, the system essentially has only one solution ...
0
votes
2answers
179 views

What would be the best plain text Cryptography method without the use of a computer? [closed]

What would be the best Cryptography method without the use of a computer? This could be a list of the current options available, that could be used without the use of a computer ...
0
votes
1answer
62 views

Looking for a secure PRNG that I can implement in hardware

I'm trying to implement a (sort of) simple PRNG in hardware for fun. My idea would be to allow a user to enter a key using a keypad (or some dip switch settings that can be set and hidden) and to ...
0
votes
1answer
95 views

What are the potential (major) flaws in this security scheme?

It’s been a few years since I read anything involving crypto. I’ve come across this scheme and I wonder how secure it is: Alice generates an RSA keypair (we assume Alice is using proper random ...
0
votes
1answer
83 views

rotational cryptanalysis on modulo multiplication?

I saw the paper 'Rotational Cryptanalysis of ARX', it is effective against design primitives using XOR, addition, and rotation. http://www.iacr.org/archive/fse2010/61470339/61470339.pdf However ...
0
votes
2answers
98 views

Proving the semantic security of the One Time pad

Currently hearing a lecture on cryptography, and the professor gave us the definition of semantic security, which is roughly the following (formally not quite complete, but you get the idea): ...
0
votes
1answer
72 views

Polynomial Modulus

So I am studying for finals and I came across this problem and I am completely stuck. I would really appreciate someone to clarify on the steps to take to solve these problems. Let $f(x) = x^4 + x^3 ...
0
votes
1answer
137 views

Secure double encryption using CPA and CCA

Do you mind if you give me any hints, links or ideas about how to improve the security of double regular encryption and decryption, by using CPA game and CCA game, it sounds interesting question, and ...
0
votes
1answer
88 views

Is any group of bits in a SHA-1 hash more/less unique than another?

Is there any bias in certain parts of the hash? E.g., first n bits are more/less unique than the last/middle n bits? Is there ...
0
votes
1answer
43 views

can you suggest any applicayion for implementing threshold homomorphic encryption cryptosystem(Paillier cryptosystem) [closed]

I want to implement one project in multi party homomorphic encryption using paillier. Can you suggest any application for implementation.
0
votes
3answers
73 views

Repeatedly using same key on different plaintexts

Symmetric encryption: Does using the same key over and over again introduce a vulnerability? Meaning, if I transmit a different piece of plaintext encrypted with the same key every day, will an ...
0
votes
2answers
94 views

Where to store the file extension to retrieve it correctly after decryption

I am using Java to write AES-256 to encrypt various files with different extension, the problem is, where am I suppose to store the file extension so the if the data is decrypted, the file extension ...
0
votes
1answer
78 views

Inverse of a function $f_k(x) := f (x ⊕ k) ⊕ k$

$f : \{0, 1\}^4 → \{0, 1\}^4$ Given a function $f_k(x) := f (x ⊕ k) ⊕ k$, what is the inverse function $f_k^{-1}$? I could not figure out how this would be done. Thanks.
0
votes
1answer
125 views

Secure Multiparty Sum in malicious model using threshold encryption

Suppose $n$ actors each hold a plaintext $p_i$. We wish to find $\sum p_i$, without leaking any information about individual $p_i$. Any actor (or any link in the network) could be controlled by an ...
0
votes
1answer
129 views

Why sorting is needed for Meet-in-the-middle attack

The weakness of double DES, E (k1, E(k2, M)) is that Meet-in-the-middle attack is possible. When performing Meet-in-the-middle ...
0
votes
1answer
90 views

Fairness in cryptography [closed]

Two users A and B decided to share a file of same size and transfer data bit by bit. And at the end of exchange, A will have B's data and B will have A's data. Assuming, A starts to transfer the ...
0
votes
1answer
46 views

Why has SSL v3 not yet been upgraded to a higher version with stronger principles, what are the dependencies and issues to do so?

SSLv3 is almost 18 years old; why has it not been updated to a more advanced version with stronger rules and structure. What have been the issues and dependencies in doing so till now???
0
votes
1answer
47 views

What is “electronic” in electronic codebook (ECB)?

This is an honest question regarding terminology. I believe that I understand why one mode to use a block cipher is called a codebook. But I wonder why electronic as a work appears here? Is it fair ...
0
votes
1answer
99 views

Determining message given cipher-text and public key [duplicate]

Consider the following scenario: Suppose A and B have set up their RSA public keys, namely $(e_a, n)$ and $(e_b, n)$, where the n-value is the same. Also, it happens that the $\gcd (e_a, e_b) ...
0
votes
1answer
96 views

RSA: Fermat-Euler Theorem - coprimality of message and modulus [duplicate]

I understand the implication of the Fermat-Euler theorem and how it applies to RSA and the detailed explanation by user Ninefingers at What is the relation between RSA & Fermat's little ...
0
votes
1answer
39 views

Available programs that can verify the working of a simple substitution cipher

Is there any tool available that can test whether a simple substitution cipher is working. I will put my scenario in detail. Lets say I built a simple substitution cipher that maps 8 bit data to 16 ...
0
votes
1answer
105 views

Repeated XOR decryption [closed]

I have this message in Hex: ...
0
votes
1answer
74 views

In RSA, why does Alice's $N$ need to be relatively prime to Bob's $N$?

I was asked this by my professor and I didn't understand the reasoning behind it. If Alice has a the key pair $(p_a, n_a)$ and Bob has the key pair $(p_b, n_b)$, why do $n_a$ and $n_b$ have to be ...
0
votes
1answer
61 views

Complexity of preimage resistance

Why is the complexity of pre-image resistance $2$ raised to the power of $n$? I have been looking in everything lecture about pre-image resistance, but I still didn't know the answer.
0
votes
1answer
64 views

Why develop new stream ciphers when block ciphers can be trivally made into streams?

I've just been reading about a new drop-in replacement for the RC4 stream cipher, but why develop new stream ciphers when AES can be made into a stream with a little XORing?
0
votes
1answer
38 views

Direct sum of Binary numbers In Mixcolumns

I have just started learning cryptography and I am trying to make sense of the direct sum on some binary numbers. I am trying to find a column of a state space after a Mixcolumns operation has been ...
0
votes
1answer
87 views

RSA CRT modulo reduction

I am working on RSA CRT and there is a point that I don't understand : So we have $n=pq$ and $c = m^e \bmod n$ an encrypted message. To decrypt $c$ with RSA CRT, we have to compute : $d_p = d \bmod ...
0
votes
1answer
102 views

Is there any probabilistic version of RSA?

I have now studying the RSA, but I think that is it possible to have some probabilistic version like a random bit string "r" XORed with the key? Is there any probabilistic version of RSA? Thak you ...
0
votes
1answer
63 views

Prepending random data to encrypted file

If random data is prepended to a file encrypted with GNUPG's symmetric encryption, how may an attacker find out if the input file is deliberately corrupted or the passphrase is wrong? If it is not ...
0
votes
1answer
60 views

Encrypt a file for random access but only after an initial read of the whole file

I'm symmetrically encrypting a file (using a random salt and a user supplied password with PKCS5S2, i.e., nothing special) and I need to be able to access it randomly. Therefore I'm using a stream ...
0
votes
1answer
51 views

MD5 update functions

In the hashlib module in python is a function called m.update() where m is a ...
0
votes
1answer
62 views

blowfish ecb with openssl doesn't give the expected result

I do the following via the Linux CLI: ...
0
votes
1answer
48 views

HMAC_DRBG Generate Process: requesting N bytes at once different from requesting N bytes in total?

Am I correct in assuming that HMAC_DRBG would return different results if I, e.g. first request 4 bytes followed by a request of another 4 bytes instead of asking for 8 bytes at once? It seems that ...
0
votes
2answers
110 views

Database row level encryption scheme

I am wanting to secure some highly sensitive data in a database. This would mean that the data needs to be encrypted and remain secure for 100 years if it were to fall into adversary hands. I also ...
0
votes
2answers
95 views

I'm using AES-CTR as a CSPRNG - Do I need an IV?

I'm using AES128-CTR for generating pseudo-random values, which is considered secure for up to 1MB (at least from what I've read). I simply encrypt a 128-bit little-endian counter, starting from 0. ...
0
votes
1answer
147 views

How does Blowfish avoid successful cryptanalysis? [closed]

I have researched the Blowfish algorithm and am curious as to why there exists no effective cryptanalysis for this algorithm as of yet. What basic principles or features allow Blowfish to achieve ...
0
votes
1answer
106 views

A variant of Shamir secret sharing

Suppose implement the Shamir secret sharing as following: we select a degree $d$ polynomial $P$ with a zero coefficient of 0, and all other coefficents selected randomly from $Z_p$; and to this ...
0
votes
1answer
88 views

Known-plaintext attack on two-dimensional affine cipher

Problem: We have a two-dimensional affine cipher with $n = 2,\,\,\,\mathcal{P} = \mathcal{C} = {\mathbb{F}_{16}^2}$, where $\mathcal{K} = \{ A,\,\,b\} $ and $b = (0,0)$. The encryption and decryption ...
0
votes
2answers
80 views

Brute Force Attack Strategies

A Brute Force Attack obviously involves attempting to decrypt ciphertext (with the associated plaintext being known) using all possible encryption keys. Aside from attempting all possible ...
0
votes
1answer
130 views

what is the difference between IBE and ABE schemes

Can somebody explain in simple words. real life example light help and limitations of these schemes etc.

15 30 50 per page