0
votes
0answers
9 views

persisting sensitive binary data encrypted (+integrity)

[#not_a_crypto_expert] rather than forming the question by the techniques I'll describe the use case: I'm persisting blocks of sensitive binary data in a remote store, the communication is secure (...
1
vote
1answer
15 views

Security of a given hash function

We have a message denoted $M$. Let us suppose that we have a collision-resistant hash function $h_0$ with output length $n$. We then consider two other independent (different) hash functions $h_1$ and ...
0
votes
0answers
10 views

Full encrypted file with partial decrypted columns

My problem statement is as such: I have a file with columns and rows, and the whole file is encrypted File will be distributed, and depending on the recipient, the recipient may only require access ...
0
votes
0answers
13 views

How to strongly reference a file that is signed twice (counter signed)

I am facing an impossible (?) problem but I'd like to find a solution that satisfies cryptographers and the users of my program. My program is able to sign a 'project' (bunch of files). For that I ...
2
votes
2answers
56 views

Is encryption possible without secure random numbers?

All cryptographic algorithms I know of that satisfy Kerckhoffs's principle rely upon secure random number generation. Assuming the existence of a 'numerical oracle' capable of perfectly predicting the ...
3
votes
2answers
34 views

Why does openssl derive IVs from a password?

From https://wiki.openssl.org/index.php/Manual:Enc(1): When a password is being specified using one of the other options, the IV is generated from this password. Why does OpenSSL do this? My ...
1
vote
0answers
27 views

ring-LWE: Minkowski Embedding , the Co-Different Ideal, etc

While (trying) to go over the reductions from approx. SVP on ideal lattices to search ring-LWE, [1] and [2], for $K = \mathbb{Q}(\zeta)$ where $\zeta$ is an abstract root of a cyclotomic polynomial, ...
0
votes
0answers
16 views

What is the most suitable task/scenario for Garbled Circuit and Fully Homomorphic Encryption?

Assuming we want to implement MPC protocol. Both FHE and Garbled Circuit(GC) can implement it. I wonder which primitive is more efficient in terms of computation time, bandwidth cost, and memory usage....
3
votes
1answer
42 views

How can I encrypt more than 128 bits of data with AES?

To my understanding a state is a $4 \times 4$ byte array used to store the plaintext. That equates to $128$ bits of data. To encrypt more than $128$ bits of data do I need to setup multiple of these ...
1
vote
1answer
49 views

Brute-force attacks practical limit

My question is about practical limit for brute force attacks. As I know 3DES with 56 bits key length can be broken via brute force. I also heard the same news about 64 bit key length (correct me if I ...
0
votes
1answer
48 views

AES - Finite Field Multiplication on 8 Bit Platform

Section 4.1.1 "Finite Field Multiplication"(page 53) of "The Design of Rijndael", it states How the equation 4.1 has been formed and transformed into equation 4.2? In section 2.1.6 "Polynomials ...
0
votes
0answers
29 views

EL Gamal Encryption in SMS/MMS?

Is ElGamal Algorithm can be used in sms/mms? If can, could you give me reference for that ? To be Truth, I want develop messaging android application for my final task and using ElGamal Algorithm, ...
0
votes
1answer
57 views

In a safe finite field elliptic curve, why is p not n?

From what I understand, in order for a curve to be safe, it would appear that $n$ being the order of the cyclic subgroup of the curve, is a prime. Also, it is the theoretical upper-bound on the number ...
-2
votes
0answers
52 views

state whether the scheme has indistinguishable encryption in the presence of an eavesdropper and whether it is CPA-secure

Let $F$ be a pseudorandom function and $G$ be a pseudorandom generator with expansion factor $\ell(n)=n+1$. For each of the following encryption schemes, state whether the scheme has indistinguishable ...
0
votes
0answers
17 views

Rabin cryptosystem [on hold]

How to implement the Rabin cryptosystem in python or java? what are all the built functions required for this? where can I get the code for it? And please suggest me a book for cryptographic functions ...

15 30 50 per page