2
votes
1answer
51 views

Block Ciphers - Standardize plain text

I need to use AES-128 to encrypt a plain text about 720 bits. Is it correct to say that – in this case – the plain text will be divided in 5 blocks of 128, the result will be equal 640 bits, and the ...
1
vote
1answer
36 views

Can I use HKDF to improve security of HMAC used with weak hash function?

I am writing a framework which encrypts/decrypts files (or streams, in general) with symmetric key using block cipher (for example, AES). To authenticate encrypted file, I use HMAC, which is ...
1
vote
0answers
25 views

RSA Signature Forgery

We all know that x509 certificates carry a signature that represents the certificate digest encrypted by the private key of the issuer. I believe that the digest is encrypted only providing one ...
3
votes
1answer
67 views

Logjam-style attack on Factoring?

We're all aware of the Logjam attack, which is known as "FREAK on discrete logarithms". The attack works by doing a large pre-computation step, which needs only to be done once per field and then ...
0
votes
2answers
37 views

Getting the encryption/has algorithm used for modem configuration file [closed]

Hello guys I have backed up my modem configuration file and found the username and password is in clear text; the files shows the username and the password is : ...
2
votes
2answers
93 views

Do all attacks against PKCS1 v1.5 encryption require an oracle

As far as I know, all attacks against RSA PKCS1 v1.5 require an oracle; is that true? Or are there any other attacks against it which are able to break it without an oracle? Background: I need to ...
1
vote
0answers
29 views

HMAC for encrypted authentication token: recommended iteration number [duplicate]

In the web application I use 10,000+ iterations for hashing passwords stored in database (random salt and all). Password-related operations are not frequent enough to create a noticeable performance ...
1
vote
1answer
60 views

How can a lattice attack be applied to ECDSA signatures?

The aim is to check if it is possible to break the ECDSA cryptosystem under the following criteria. Suppose that each ECDSA signature is generated by using the GLV method for point multiplication ...
1
vote
1answer
54 views

Derive cipher IV and cipher Key using PBKDF2 with random salt?

It is said that cipher IV does not have to be secret and the only secret component of the encryption scheme should be a cipher key. Question: is it safe to generate IV using PBKDF2 function, which ...
2
votes
3answers
91 views

Establishing encryption key using shared secret

I need to establish some security on a network of 8 bit microcontrollers. very limited RAM, CPU and packet sizes. I have zeroed in on a shared secret based scheme. Setting up shared secret is out of ...
3
votes
0answers
33 views

El-Gamal and Lines on Planes

I've been thinking about a geometric picture for El-Gamal. The idea is to understand the set $\{(my^{x},g^x) \mid x \in Z_p\}$ (the set of encryption of $m$ for fixed $g$ and $y$) by taking the ...
-2
votes
1answer
61 views

Is algorithm with more than $2^{word size}$ words secure? [closed]

Let's say we have a feistel cipher or feistel pseudo-random permutation with 8-bit function (S-box) similar to Treyfer, but with much bigger block size like 16MB. Here is example of such pseudo-random ...
0
votes
1answer
76 views

Why is the public/private key length used in libsodium so much shorter than needed for RSA [duplicate]

Reading the libsodium source I see that is uses a key length of 32 bytes (256 bit) for private/public key encryption. For RSA private/public key encryption a key length of 2048 (or 4095) bit is ...
5
votes
1answer
410 views

Dan Boneh's Cryptography lecture - problem with 802.11b

I am going through Dan Boneh's Cyprography lectures on Coursera. In Lecture 6 https://class.coursera.org/crypto-010/lecture/6 At 7:30 minutes, he discusses the problems with 802.11b design. I ...
3
votes
2answers
101 views

AES and Homomorphic Encryption

Is it possible to do the following? Input would be to generate a new AES key, encrypt the private data with that key, encrypt the AES key with the FHE key, and send the FHE-encrypted AES key along ...
2
votes
2answers
322 views

Why is HMAC-SHA1 still considered secure?

This Q & A http://security.stackexchange.com/questions/33123/hotp-with-as-hmac-hashing-algoritme-a-hash-from-the-sha-2-family says that the security of HMAC-SHA1 does not depend on resistance to ...
1
vote
1answer
44 views

Why in Android kernel CSPRNG state is saved?

I am reading about the security internals of Android. In the book Android Security Internals, in chapter on Cryptographic Providers, there is a para stating: On Android, CSPRNG implementations are ...
0
votes
0answers
45 views

Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg.

Is there any restriction that the members to be accumulated in bilinear map (multiplicative) accumulator need to be relatively prime to P? Where P is the order of group.
1
vote
2answers
83 views

If you have a file and XOR every bit with a random bit, can you extract any information?

Say you have a file that is not random, and you XOR every bit with a random bit (not pseudo, but really random). Can someone who sees only the result extract any information from it? Obviously, it ...
3
votes
1answer
75 views

NTRU less secure than previously thought?

A new paper (https://eprint.iacr.org/2015/552.pdf) says: This makes it possible to asymptotically and heuristically break the NTRU cryptosystem in subexponential time (without contradicting its ...
4
votes
3answers
554 views

Why does an algorithm need a keyspace?

Why does an algorithm need a keyspace? I thought the person encrypting would define his/her own key.
1
vote
1answer
159 views

Discrete Logarithm (512 bits numbers) - Find exponent parameter

I'm trying to resolve a discrete logarithm equation: $$y = g^x \bmod p$$ Every parameter is a 512-bit number. I know the values for $g$, $y$ and $p$ and I need to find the $x$ value. Finally, I know ...
2
votes
2answers
67 views

cipher text only attacks on deterministic homomorphic encryption schemes

If we consider a set of numbers say a set $s=\{a,b,c,d\}$ , where $a,b,c,d>1$ and the numbers $a, b, c, d$ do not share any relation between them , i.e. for any two numbers, $n_1,n_2\in s$ the ...
3
votes
1answer
38 views

Why is the re-encryption algorithm in Universal Re-encryption for Mixnets more complicated than apparently necessary?

This is the paper. On page 6, the paper describes a variant of El Gamal and a way of re-encrypting ciphertexts. I thought an easier way to do encryption is to output $(m(g^x)^y,g^y)$, and universal ...
0
votes
1answer
63 views

what are the most common stream ciphers algorithms? [closed]

say that we have an unknown stream cipher which output bytes and which have more than 10 years of existence. What can be the most probable algorithms if we consider the most 'populars' stream cipher ...
4
votes
1answer
69 views

On Proving That a Primitive Does Not Exist

In the paper of Hsiao and Reyzin, Section $1.4$: Note that to show that no general reduction from $P$ to $Q$ exists requires proving that $Q$ does not exist Since the statement is about trying ...
1
vote
1answer
68 views

Generating PGP key *without* random generator? (using fixed input only)

I understand why in general, a strong random generator or source of entropy is used when generating PGP keys. However, I have a use case where I want to generate PGP keys deterministically, i.e. ...
0
votes
0answers
84 views

What is the danger if a non-prime is chosen for RSA? [duplicate]

I was reading this question about generating primes for RSA keys. The answers point out that most implementations of of the algorithm use probabilistic prime-ness checking algorithms. The answer by ...
1
vote
1answer
63 views

How is wpa2 authentication structured

I would like to understand the cryptography behind Wpa2. As far as I know, there are 4 messages on the 4-way handshake and three of them are values concatenated with hashes. First, I am trying to ...
2
votes
1answer
204 views

Attack for RSA 1024 bit with Low Public Exponent

I am facing a challenge at university. Our teacher give us the challenge to try to break an RSA 1024 bit. We have public modulus N and public exponent e (0x03), we don't know the padding. We have a ...
4
votes
1answer
78 views

Implementing AES MixColumns with fewest XOR gates

I'm playing with Contiki (O.S. for constrained devices such as sensors and micro-controllers) and particularly with the AES encryption in software (the one available in Contiki source code). I'm ...
0
votes
0answers
37 views

Side channel attack on FPGA AES engine

I actually don't know if this is the right place where ask, but I try. The side channel attacks aren't a negligible problem. There are several ways to protect from these attacks its own IP inside the ...
5
votes
4answers
664 views

Which symmetric cipher is best for studying? [closed]

I would like to study a modern symmetric cipher (I have never studied a cipher before) and I was wondering which would be the best cipher for studying purposes of the following: AES (Rijndael), ...
0
votes
1answer
44 views

How to determine the exponent when using RSA

Can someone please explain to me how, when using RSA, to determine the exponent to be used in encryption and decryption? I have attempted a worked example on using RSA (shown below) but I can't ever ...
2
votes
3answers
52 views

Frequency tables for HTML page source

Are there online resources with an ASCII character frequency table for HTML? There's tons of them for english, but I can't seem to find one for page source. I know that this is something that's ...
0
votes
1answer
51 views

What is more efficient, pairing based cryptography or non pairing based cryptography? [closed]

As far as I know non pairing pairing based cryptography is less time consuming than pairing based because, pairing based uses complex operations. Are there any advantages of pairing based cryptography ...
0
votes
1answer
22 views

SSH rekey security implications

When an SSH session is rekeyed due to either the time limit or data limit for rekeying having passed, does the Diffie-Hellman exchange take place within the encrypted channel provided by the existing ...
1
vote
0answers
27 views

Determine safety of exercise hash functions

There have been several attacks against hash functions such as $h_{sha1}$ and $h_{md5}$. Professor A suggests a new function $h_{666}$ with an output length of 666 bits. Professor B suggests ...
1
vote
1answer
40 views

Determine if encryption is safe against CPA

The following encryption scheme encrypts each block of length $n$ of the plaintext separately: $c_i = k_1 \oplus F(k_2 \oplus p_i)$ Where $F$ is a strong pseudo-random permutation (i.e. it is easy ...
1
vote
1answer
126 views

How broken is a xor of two multiply with carry generators?

How broken is a xor of two LCGs? How Brittle Are LCG-Cracking Techniques? Based on the above two questions, I have simply one additional question: how broken is a XOR of two 64-bit multiply with ...
10
votes
3answers
213 views

Collision or second preimage for the ChaCha core?

Daniel J. Bernstein's ChaCha core is an evolution of the Salsa20 core. Both are functions over the set of 512-bit bitstrings, partitioned as sixteen 32-bit words. Can we exhibit collisions, or ...
1
vote
1answer
72 views

Understanding Meet-in-the-Middle attack on block ciphers

I understand how to implement a Meet-in-the-Middle attack on 2DES/3DES, by computing for one half all possible keys and storing the outcome and then subsequently do the same for the other half but ...
2
votes
0answers
47 views

Worst case one way function

the worst-case one way function is defined as follows $$\forall A \exists x : pr(A(f(x))\in f^{-1}(f(x)))\neq 1$$ can you give any example of such function?
0
votes
1answer
88 views

What is Polymorphic encryption? [closed]

Well i have downloaded some cryptographic algorithm. Do there are those I didn't understand so this is my question: What is polymorphic RC4 or Polymorphic xor encryption? I heard this in malware ...
2
votes
1answer
73 views

Eavesdropping experiment with private key

I am extremely new to cryptography, still trying to learn basics. I got stuck in the following example of an eavesdropping experiment with a private key. $$\begin{array} {|r|r r r|r|} \hline C & ...
-1
votes
2answers
88 views

SQL-Like queries in CRYPTDB doesn't work [closed]

I have downloaded and built Cryptdb and it works well. Most of queries on encrypted database run without any issue but, the query with LIKE key word receives an ...
0
votes
1answer
42 views

How are subkeys, in Feistel block ciphers, derived for each round?

I'm bit confused about the subkeys that are used in Feistel ciphers. I know that all the subkeys ki are derived from the main key K, but how? Say I have a simplified Feistel block cipher of i rounds, ...
3
votes
1answer
115 views

Is secure communication without public-key crytography feasible?

We all know about public-key cryptosystems, and we know some of these are computationally secure (for the time being, of course). Are there any algorithms out there which allow safe communication ...
-1
votes
1answer
28 views

Cardinality of the key space $\{0,1\}^\ell$

Imagine we have a scheme whose key is chosen from the set $\{0,1\}^\ell$. My question is: What is the size of key space for this scheme?
1
vote
2answers
75 views

What's the GCM-SHA 256 of a TLS protocol?

If we read the Google line information about how the cypher the https communication, it reads: TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 I understand it's using ...

15 30 50 per page