7
votes
3answers
176 views

Encryption-then-encode or encode-then-encryption?

I have this question in which I m struggling. I have read in many sites about encrypt-then-mac etc. If the confidentiality for transmission is needed, discuss the feature for the order of encryption ...
1
vote
2answers
56 views

AES encryption for pairwise identifiers

I'd like to map a random ID of 16 bytes (sourceID) to another random ID of 16 bytes (targetID). The operation should: only be reversible by me be deterministic There are about 1 million source ...
3
votes
2answers
3k views

How to calculate the maximum output size for data encrypted with a RSA Private Key?

I have an an encryption algorithm I am working with that looks like this: prv_key_enc(sha1_hash(data)) Where, the RSA parameters are: RSA/ECB/PKCS1Padding 1024 ...
3
votes
1answer
51 views

Is a hash function used to expand the key after ECC shared secret is complete?

I am trying not to solicit opinions, but I have not been able to find a reference to the question at hand. I have designed an ECC engine in silicon that handles any curve in the form of $y^2 = [ax^3 +...
2
votes
2answers
57 views

Security (CPA?,CCA?) in Authenticated identity-based encryption

When I read authenticated identity-based encryption by Ben Lynn, encryption works to send data from user A to user B where: $$a=e(d_{A},B)$$ $$s=H_{3}(Msg,K)$$ $$C=<s,\gamma \oplus H_{2}(a,s),H_{4(...
1
vote
0answers
63 views

Homomorphic encryption over finite fields

I'm curious on the following question: let $\mathbb{F}_{2^n}$ be a finite field which is an extension of $\mathbb{F}_2$ with order of $n$, is there an encoding scheme $e:=\mathbb{F}_{2^n}\rightarrow \...
0
votes
1answer
44 views

How was the AES MixColumns matrix constructed?

How was the constant matrix in AES MixColumns constructed? \begin{bmatrix} 02 & 03 & 01 & 01 \\ 01 & 02 & 03 & 01 \\ 01 & 01 & 02 & 03 \\ 03 & 01 & 01 &...
2
votes
0answers
25 views

LENGTH Parameter in the EEA2 AES-128 of LTE

In the EEA2 option for encryption in LTE the AES-128 algorithm is mechanized. There, the nonce used in the CTR Mode is a 128-bit value. The first 64-bits are covered by a COUNTER, a BEARER, a ...
0
votes
1answer
39 views

Hash Function representation in identity-based encryption

Some describe as $H:F_{q}\times G_{2}\rightarrow \{0,1\}^{n}$.Some describe as $H:\{0,1\}^{*}\times\{0,1\}^{*}\rightarrow F_{q}$. What is the meaning of product function? what kind of operation does ...
2
votes
2answers
479 views

What is the motivation behind Key-policy Attribute-based Encryption?

What is Attribute Based Encryption? has a nice explanation what both forms (Ciphertext-policy Attribute-based Encryption and Key-policy Attribute-based Encryption) are. My question is: what is the ...
-1
votes
0answers
48 views

Computational Cost : Scalar Multiplication vs exponentiation in elliptic curve

$Pub=\gamma P$ and $Pub=P^{\gamma}$ where $P \in G_{1}$ and $\gamma \in Z_{p}$ Which one has less computational cost?
3
votes
1answer
59 views

What would currently make the strongest https connection?

when you look at the encryption websites use you will see that there is alot of diversity, some use 256 bit keys some do not, some use DHE-RSA some ECDHE some use sha 256 some sha1, but my question is,...
2
votes
2answers
85 views

Fixed primes in discrete logarithm

The discrete logarithm problem is to find $z$ when the inputs are $g,h,p$ where $g^z\bmod p$. Supposing if you fix $p$ then does the problem become any easier to attacks and is there a $(\log p)^c$ ...
3
votes
1answer
82 views

Why does 3DES need private key to decrypt?

I create two files, my.cer and my.pem ( include certificate and private key), I encrypt a file with my.cer, I use openssl smime -encrypt command. When decrypting data, it needs my.pem. I think 3DES ...
3
votes
2answers
58 views

Output of a Linear Shift Register given Plaintext and intial state

Given an initial state $S_0 = (0101)$ and plaintext $P = 1010101011$ I need to find the ciphertext. The method to solve this was not taught in my coursework, and the information I have found online ...
4
votes
2answers
41 views

Why is synthetic IV (SIV) mode considered deterministic authenticated encryption (DAE)?

I was just going over my (old) notes from Coursera's Cryptography I course, and I was puzzled by the description of SIV as providing deterministic authenticated encryption (DAE). The general SIV ...
0
votes
3answers
150 views

Is it possible to brute-force a hash algorithm of 32 bits

I have a 30000 user passwords and usernames stored in a table on a database in which the passwords are stored as hash where ,I need to guess the passwords for all users and I have the hash function ...
8
votes
1answer
1k views

Is MD5 second-preimage resistant when used only on FIXED length messages?

I fully realize that MD5 should not be used in any new project, but in my particular situation I have severe CPU performance issues, so MD5 is convenient. I have read a lot about MD5 security for this ...
8
votes
2answers
3k views

Accelerating SHA-1

I have a program where computing SHA-1 is the bottleneck. This is using OpenSSL 1.0.0e on a 2.6Ghz 16-core Opteron where I get about 325MiB/s throughput. (SHA1 here is via Andy Polyakov's x86-64 ...
2
votes
1answer
53 views

Is PKCS7 a signature format or a certificate format?

I always though PKCS7 was a signature format. However, on the net I find several references to PKCS7 being a certificate format - for example, this talks about PKCS7 certificate: Extract raw ...
4
votes
1answer
58 views

Can the attack in https://eprint.iacr.org/2008/469.pdf be parallelized?

Can this attack be parallelized? It is a $2^{57}$ complexity collision attack on SHA-1 based on disturbance vectors. If it is practical it is easy on a GPU ($\approx1.1$ GPU-days). If it is ...
3
votes
1answer
58 views

Does encryption of data/information take place in peer to peer networks like Gnutella, Bittorrent?

Do peer to peer networks like Gnutella, Bittorrent have any encryption system to secure the users privacy or encrypt the file/data being shared? Elaborate please.
-3
votes
1answer
59 views

bruteforce on aes 256 cbc mode

i have a series of encrypted text , they encrypted by aes 256 bit cbc mode for every encrypted text there is an iv that i have them also and i know its algorithm is aes 256 bit cbc mode i can ...
1
vote
1answer
28 views

Some terms related to secret sharing: Optimality, What does it mean?

In any secret sharing scheme we have to develop step by step. After constructing such scheme we need to reduce share size. Why? e.g. Robust secret sharing scheme is modified Shamir secret sharing ...
11
votes
1answer
1k views

Password hashing security of argon2 versus bcrypt/PBKDF2?

I wonder if it can be approximated how much of a security margin the new argon2 hash, winner of the password hashing competition, can give over bcrypt or PBKDF2, for an attacker using large GPU ...
8
votes
3answers
632 views

Advantages/disadvantages of using symmetric encryption function as hash function?

Next to the traditional MD5 and SHA-1, other hashing algorithms exist based on symmetric encryption algorithms. An example is the Matyas–Meyer–Oseas construction. What are the advantages/...
4
votes
1answer
125 views

ElGamal Signatures

I know various applications of RSA signatures. I wonder, is there any real-world applications of ElGamal signatures and encryption?
2
votes
0answers
39 views

Is the ring learning with errors problem still hard if the errors are drawn from some subspace?

Let $R=\mathbb{Z}_p[x]/x^n+1$ be the ring used in normal RLWE, which is linear space over $\mathbb{Z}_p$ with dimension of $n$, let $S$ be a linear subspace of $R$ which described by linear ...
6
votes
0answers
56 views

Name of an archaic type of RSA padding (0BBBBBBB…)

In some legacy code, I encountered RSA signature padding in the following format (hexadecimal): 0B BB BB BB BB BB BB ... BB BB <hash> Is there a name for ...
3
votes
1answer
62 views

identifying presence of encryption of zero in additive homomorphic encryption

Lets say the server has corpus of ciphertext contains $enc(a),enc(b),enc(c), \dotsc enc(x)$. The encryption function is an additive homomorphic scheme (like Paillier). The server knows only the public ...
1
vote
0answers
44 views

How can I obtain the raw decimal value of an RSA key's modulus?

So maybe I'm thinking about this too hard, or maybe I'm missing a piece of information. We'll use Google for this example. Say I wanted to obtain the modulus of Google's current public key. Well I ...
2
votes
1answer
65 views

Why is Diffie-Hellman used instead of just RSA in key-exchange (TLS, IKE)?

Why should a key exchange protocol (such as in TLS or IKE) use Diffie Hellman? Why not just use RSA? For example: Alice picks a random session key, signs it, encrypts it with Bob's public key, and ...
3
votes
2answers
146 views

Should I add randomness at the end before AES?

Seen AES, changing a character drastically affects the encrypted text. I want to make it harder to decrypt AES I send. So, it seems this can be done by adding some special code and some random bytes <...
4
votes
3answers
208 views

paradox on fully homomorphic equality checking

Imagine, a client encrypts a corpus of data (say documents of text) with the public key of a Fully Homomorphic Encryption scheme (FHE) and outsources the data to an untrusted server.Now the client ...
1
vote
3answers
65 views

Is PGP's way of maintaining email security optimal? [duplicate]

I read a book called "computer networking: A top-down approach". It talked about how PGP creates an email message between Alice and Bob to maintain confidentiality, integrity, and authenticity. Let me ...
5
votes
2answers
100 views

Zero-knowledge proof system which is not proof of knowledge?

I have learned that a zero-knowledge (ZK) proof system can be constructed by making use of the three-color problem. In this particular case, the proof system also happens to be proof of knowledge (POK)...
3
votes
1answer
67 views

Using Pollard's lambda in a key-recovery attack on DH

I've become interested in writing an exploit for the OpenSSL vulnerability here (CVE-2016-0701). Running through the bullets describing the attack, I can follow up to the last bullet point. Reviewing ...
1
vote
0answers
31 views

What is the right tool to MPC linear equations system

Given two parties who have private inputes Player 1 - $X_1,...X_n$ Player 2 - $Y_1,...Y_n$ We want to compute a solution to a linear system equation: $f_1(X_1,...X_n,...Y_1,...Y_n) +h_1(X_1,......
2
votes
0answers
11 views

Can you extract the encryption key of a computer with full disk encryption via malware? [migrated]

I recently discovered the subject of cold boot attacks which are able to extract the encryption key of the ram memory after the computer has shut down. and from what I understand is that law ...
0
votes
1answer
55 views

Sum of digits flaw name request

Let's say I am making an encryption algorithm, and in the algorithm in have the following step: "multiply the integer from the previous step by 9 and take the sum of the digits of the resulting number....
0
votes
1answer
68 views

Key exchange problem

I've found the following problem in one of my courses. Any tips on how to solve this would be appreciated! Alice has the key pair $(pka,ska)$. Bob has the pair keys $(pkb,skb)$. They want to ...
2
votes
1answer
76 views

How can I generate cryptographic-quality 1/f noise, aka “pink noise”?

Can anyone suggest how I'd generate cryptographic quality 1/f noise: aka 'pink noise', where the PSD follows 1/f. I'd be happy to derive the pink noise from white noise (e.g. /dev/urandom), but I ...
0
votes
1answer
18 views

linear cryptanalysis: how are the subkey bits removed from the linear approximation?

I'm currently reading the tutorial on linear/differential crypta here: https://www.engr.mun.ca/~howard/PAPERS/ldc_tutorial.pdf End of page 14/Beginning of page 15: all the bits from the subkeys are ...
3
votes
4answers
122 views

If I am about to generate one-time pad, where should I generate my pads from?

If I want to generate a few one-time pads, is it OK to just read required number of bytes from /dev/urandom without weakening information-theoretical security?
5
votes
1answer
69 views

Equality checking using additive homomorphic encryption

Given two ciphertexts $c_1 = enc(p_1)$ and $c_2= enc(p_2)$ using any additive homomorphic encryption scheme (or specifically Paillier). Can we find out whether the underlying plaintexts $p_1,p_2$ ...
2
votes
1answer
52 views

Application level encryption and key renewal

I had posted this question on stackoverflow and been asked to move it to crypto. What is your view on this? What is the doability? I have a question related to encrypting data in the database, at the ...
2
votes
1answer
88 views

Is this a proper key-exchange implementation?

I've been trying to implement Diffie Hellman key exchange so far from my own understandings (I know I could just stick with SSL/TLS, but I want to understand it in depth more), so I created this basic ...
2
votes
1answer
60 views

How to prove a lemma that is based on phi-hiding assumption?

Assume that the $\phi$-hiding assumption is true, i.e. that for a composite number $m$, a PPT adversary A cannot distinguish between a prime $p_0$ that divides $\phi(m)$ and another prime $p_1$ that ...
8
votes
3answers
267 views

How secure is AES-256, but with an effective key length of 56-bits?

I need to encrypt a few drives using Kaspersky Total Security. I however noted something peculiar, Kaspersky's description of their cipher is: Data will be protected using AES-256 encryption ...
2
votes
1answer
89 views

Reversing a known encryption algorithm (4-byte repeating key XOR)

I've been practicing for an upcoming CTF competition, and I've finally reached the cryptography stage. I'm a complete newbie in this field (my knowledge is essentially that bcrypt is awesome and md5 ...

15 30 50 per page