0
votes
1answer
76 views

Is there a strong cryptographic reason for GCM's 2^39 - 256 bit limit?

In reading through the original GCM specification (McGrew & Viega '05), the composition of the 128 bit Initialization Vector as a concatenation of a 96b nonce and a 32b unsigned wrapping counter ...
3
votes
1answer
133 views

Why can't you just clone encrypted data and use it?

Let's take a contactless card for example (one for public transport lets say (i.e. MiCard)), the data is encrypted on the card and encrypted on the reader as far as I know. So how come somebody who ...
-1
votes
2answers
99 views

Reusing one-time-pad with random plaintext

I understand that by definition one-time-pad keys cannot be reused but I was thinking about the case where it is used to send random data and couldn't find anything on the subject so here is my idea: ...
-1
votes
1answer
65 views

Diffie-Hellman on infinite groups

The most common groups to be used as examples for the DH protocol are modular multiplication and elliptic curves. But I've realised that the groups doesn't need to be finite, a suitable infinite group ...
1
vote
1answer
236 views

Rock-paper-scissors over network, how to protect from cheating server?

I'm trying to design cryptographic protocol to play Rock-Paper-Scissors with two parties, neither trusting each other, nor trusting server they use for communication, so game is 'provably fair'. So ...
0
votes
3answers
232 views

Random Galois fields

Note: I have now answered this by my own research and can generate random fields up to G(2^9) in reasonable time. I would need to find more speedups for larger fields. At this time G(2^8) takes a few ...
3
votes
2answers
105 views

How does BLAKE2 ensure that hash(A) != hash(B) when B = A||0 and both A & B have the same number of blocks?

Suppose I have two arrays : A = a single byte, being zero. B = two bytes, both being zero. B = A||0 (i.e. B starts with A, and differs only by appending a zero byte) BLAKE2(A) != BLAKE2(B) Yet, ...
-1
votes
1answer
104 views

RSA: how does it work and how is it more secure than symmetric systems

Before starting the question, I know that RSA is naturally a key exchange cryptosystem rather than an antilogarithm fully implemented for encrypting and decrypting data since the length of the secret ...
0
votes
1answer
96 views

Will current encryption always remain secure? Is there mathematical proof?

Current encryption algorithms, such as AES, RSA, elliptic curve, etc. work based on known mathematical problems. I am specifically interested in the RSA. Will such security always remain secure? One ...
2
votes
3answers
168 views

Is there an oblivious decryption scheme?

Alice has $K$; Bob has $E(K, m)$; Is there such a scheme that enables Alice decrypts $E(K, m)$ without knowing $m$, and Bob gets $m$ ?
1
vote
1answer
76 views

Is it a variant of Strong RSA assumption?

Informally, the hardness of RSA/Strong RSA assumption lies in the hardness of factoring a large composite number $N$ having two large primes as its factors. If RSA modulus $N$ is a prime number, then ...
3
votes
2answers
481 views

Number of keys when using symmetric and asymmetric encryption?

Quoting part of my homework/assignment: How many keys are required for secure communication among 1000 person if: Symmetric key encryption algorithm is used? Asymmetric key encryption ...
0
votes
1answer
34 views

Cipher for human interpretation [duplicate]

Please suggest algorithms to encrypt and decrypt text messages that can be easily performed by human in a considerably short time. It doesn't have to be really secure, but sufficient to fool ...
9
votes
2answers
976 views

Is a small size block cipher usable?

Consider a block cipher with a key of size 128 bits but a small block size, say 32 bits. Is this kind of block cipher secure? I would like to know to what extent I can use a small block cipher, like ...
1
vote
1answer
157 views

Is the output of AES-CBC + MAC the same size as the input?

I use AES-CBC and HMAC-SHA256 to encrypt a text file. Will the output be larger in size than the input or will it be the same size? Is it more secure secure if the size of the output is larger?
40
votes
3answers
17k views

How should I calculate the entropy of a password?

If part of the password is a whole regular English word, does the entropy of that part depend on the number of English words in existence, the number of English words known by the choosing algorithm, ...
2
votes
1answer
42 views

Is it possible: Derived key based on variable number of private keys?

I have a MySQL database that I want to encrypt with AES_ENCRYPT() and have to provide access to a variable and possibly changing number of users. Is it possible to derive an encryption key based on a ...
0
votes
2answers
140 views

How does RSA padding work exactly?

I've read everywhere online and people say plain text RSA is very unsafe. To make it safe you pad it but no examples are shown anywhere on how to do it. It's explained that random data is added to the ...
4
votes
2answers
171 views

Finding strong primes

Wikipedia lists the following conditions for a prime to be strong: $p-1$ has large prime factors. That is, $p = a_1 q_1 + 1$ for some integer $a_1$ and large prime $q_1$. $q_1-1$ has large prime ...
-2
votes
1answer
56 views
5
votes
1answer
744 views

How to use GCM mode and associated-data properly

I'm currently migrating a project to use the bouncy castle GCM mode. I understand that using an authenticated mode removes the need for a HMAC, however I want to be sure that I'm using this mode ...
1
vote
2answers
36 views

Combined message separation

I have two ciphertexts, I suppose that its RC4 with reused key. I have XORed both ciphertexts and obtained message containing combined cleartexts. I suppose that the underlaying messages are written ...
0
votes
1answer
62 views

Converting a number to a member of a multiplicative cyclic group

I am currently trying to make an implementation of the ElGamal encryption for educational purposes. As I understand it, when using the encryption with multiplicative cyclic groups, one generates a ...
0
votes
1answer
85 views

how to represent message as an integer between $1$ and $n-1$ [closed]

I am trying to implement simple El-Gamal cryptosystem. And I can't understand how to represent message as an integer between $1$ and $n-1$. The only thing that comes to my mind is: if $n$ bit length ...
1
vote
1answer
79 views

ElGamal and Schnorr groups

As I gather, a normal practice for choosing a cyclic group for ElGamal key generation is to find a safe prime $p$ and use a multiplicative cyclic group with modulus $p$ and order $q = (p-1)/2$. ...
0
votes
0answers
21 views

Data anonymization and search with wild-cards

Broadcast encryption technique proposed by Water et al. http://www.slideserve.com/nairi/revocation-systems-with-very-small-private-keys takes a leap from earlier schemes as it provides smaller user ...
6
votes
1answer
1k views

Knowing pre-encryption data, can we find the private key CryptoLocker used?

One of our users seems to have been hit by CryptoLocker. As a result, he has a hard drive full of encrypted files. The ransom-ware claims to have used public key encryption on the files. If we know ...
0
votes
1answer
125 views

How much work is required to detect multiple collisions for a hash function?

Assume an ideal hash function of output size n bits, detecting one collision requires approximately 2^(n/2) evaluations of the ...
2
votes
0answers
61 views

Is it possible to perform one-way Diffie-Hellman MITM?

Here's something that is bugging me recently: suppose that me and my friend establish an OTR session and - as a result of that - DH key exchange is performed. My friend verifies my key, but I cannot ...
0
votes
1answer
62 views

Should the nonce passed to GCM be authenticated?

This answer recommends authenticating the IV with HMAC when using AES and then HMAC. Since AES-GCM provides authentication too, should the external nonce passed to GCM be authenticated separately ...
0
votes
1answer
99 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 ...
1
vote
3answers
218 views

RSA Key generation: How is multiplicative inverse computed?

As per Wikipedia, RSA keygen goes like this: Choose two distinct prime numbers p and q. Compute $n = pq$. Compute $\varphi(n) = (p − 1)(q − 1)$. Choose an integer e such that $1 < e < ...
0
votes
1answer
27 views

Security issues for integrating AAA and OTP services [closed]

What are the main security issues for integrating AAA and OTP services. In our organization with about 1000 clients, we want to integrate the services. What are the main security issues about the ...
0
votes
1answer
58 views

display an image encrypted with ECB [closed]

On wikipedia there is an example of a picture encrypted with ECB: http://en.wikipedia.org/wiki/Block_cipher_mode_of_operation#Electronic_codebook_.28ECB.29 I just wanted to know how an encrypted ...
0
votes
1answer
53 views

Why the data length is shifted 3-bit in MD4 Java implementation? [closed]

In RFC 1320, It is stated that "A 64-bit representation of b (the length of the message before the padding bits were added) is appended to the result of the previous step. In the unlikely event that b ...
2
votes
2answers
2k views

Is python a secure programming language for cryptography?

I know Python is a powerful programming language but is it secure for cryptography? I mean is it possible to reverse engineer the program (written in python) and discover the algorithm of cryptography ...
0
votes
0answers
70 views

chameleon signature vs regular signatures

I am trying to understand the practical usage of sanitizable signatures particularly on Chameleon Hashing and Signatures. Chameleon hash, or trapdoor function allow parties with the knowledge of the ...
0
votes
1answer
126 views

Is RC4 +XOR secure for small data?

I need to encrypt transmission between my device (with AVR processor) and base. I create packet data - it will be encrypted into string: ...
0
votes
1answer
64 views

wireless network security protocol

In network security, encryption and integrity done by the same algorithm that is AES-CCM in that MIC generated by CBC-MAC and encryption done by CTR mode. So suppose I want to do encryption with any ...
2
votes
1answer
111 views

BEAST attack confusion

I understand that BEAST is a CPA using javascript injected onto the browser's webpage. Apparently the thing that BEAST exploits is the fact that the IVs are predictable. What I'm confused about is why ...
-1
votes
1answer
103 views

HMAC-Ripemd-160 in TrueCrypt

I'm wondering if it is still secure. I know TrueCrypt closed its doors but I continue using it because the cryptoaudit didn't find any huge bugs or security issues in TrueCrypt. But I have a bad ...
0
votes
1answer
194 views

Find private exponent in RSA

The other answers for this confuse me, I know the principle of d in terms of the equation it has to satisfy. However I'm not sure how I would go about finding the private exponent without trial and ...
0
votes
2answers
103 views

Automated testing of cipher security for import/export compliance [closed]

What do we know about systems that automatically test and grade cipher security. The application in mind would be for checking for compliance with import/export regulations. I imagine a system that ...
40
votes
5answers
12k views

How big an RSA key is considered secure today?

I think 1024 bit RSA keys were considered secure ~5 years ago, but I assume that's not true anymore. Can 2048 or 4096 keys still be relied upon, or have we gained too much computing power in the ...
1
vote
1answer
188 views

Is there a kind of OS entropy pool on Windows systems? [closed]

I am wondering if Windows provides an equivalent of /dev/urandom from linux ? Or any kind of system entropy pool ?
5
votes
3answers
187 views

Hash which can be used to verify one of multiple inputs?

Is there a hash function H1 which, when given inputs a, b, etc., produces output ...
2
votes
1answer
74 views

Committing Bilinear equation in Groth-Sahai framework

Groth-Sahai framework enables us to commit to QE, MSME, PP equations. Now, is the equation below committable in GS framework? A bilinear map $e: G_1 \times G_2 \rightarrow G_T$. $g_1 \in G_1$ and ...
0
votes
0answers
121 views

Two questions on EMSA-PKCS1-v1_5

If I implement EMSA-PKCS1-v1_5 in the following two non-standard ways, what kind of things could go wrong? The padding structure will be referred as (00|01|PS|00|DER(Digest Algo)|Digest), where | is ...
1
vote
0answers
69 views

chacha20-poly1305 padding and length encoding

The AEAD construction for chacha20-poly1305 described in the IETF proposal [1] encodes message lengths into the text that is to be hashed. The newer proposal [2] goes further and pads associated data ...
0
votes
1answer
57 views

Why should I use X.509 Authentication over PKC based Authentication?

So I have two examples and I don't understand why one would be chosen over the other. Example 1. A sends EPUb[r1] to B (asks B to prove knowledge of ...

15 30 50 per page