2
votes
1answer
118 views

Why is this cryptosystem insecure?

Can someone help me see the flaw in this cryptosystem? Note: This is homework and it is due today at 1:30pm. An answer before that is not expected; I'd just like to understand what the flaw is. ...
13
votes
2answers
834 views

Attacks of the MAC construction $\mathcal{H}(m||k)$ for common hashes $\mathcal{H}$?

Consider a common practically-collision-resistant hash function $\mathcal{H}$ (e.g. SHA-1, SHA-256, SHA-512, RIPEMD-160), perhaps based on the Merkle–Damgård construction as are the first three. We ...
0
votes
1answer
52 views

TLS - self encrypting to avoid tls setup, secure?

I am in doubt : of course one can create a tl connection between a client and a server. But what if the client sends self encrypted with, say, blowfish, data to the server? The goal is that the ...
1
vote
1answer
91 views

Random Permutation polynomial

I need to know, please: (1) Is there anyway to pick uniformly at random permutation polynomial in a field of prime order? (2) Are there many permutation polynomials in a field? (3) In a finite ...
1
vote
0answers
29 views

Pros and cons between HOTP and TOTP [duplicate]

I'm reading the RFC6238 (TOTP) and RFC4226 (HOTP) standards and can't get which one is to prefer? I've searched around a bit and it seems like TOTP is the one that is most used, but some argue that ...
1
vote
0answers
34 views

Why HMAC=H(message|key) is unsafe? [duplicate]

As mentioned in wikipedia, HMAC=H(message|key) is not safe, but I don't know the reason. Anyone can tell me why? or give me an example? Thank you in advance.
0
votes
0answers
31 views

openssl - Recommended way to encrypt and sign S/MIME messages using openssl

OpenSSL has two command line tools, cms and smime, that can encrypt and sign S/MIME messages. Both can specify ciphers and ...
0
votes
0answers
49 views

Validity of ElGamal signature variation

I'm trying to solve excersise 7.6 from Hoffstein - Introduction to Mathematical Cryptography page 459 (http://goo.gl/oRyInT) Let $p$ be a prime and let $i$ and $j$ be integers with $gcd(j, p − 1) = ...
0
votes
1answer
72 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
0answers
47 views

Test framework for hash functions for collision resistance?

I have two questions about the assessment of collision resistance in hash functions. Given a hash-function what would be the next step to inquiry about it's collision resistance / probability of ...
-1
votes
1answer
82 views

What does $\mathbb Z_p^*$ contain?

I have a prime $p = 7$ and was tasked to select a random value in $\mathbb Z_p^*$ in my signature scheme. What does the full range of $\mathbb Z_p^*$ contain in this case? Is it $\{0...7\}$ or ...
0
votes
1answer
261 views

How can we prove that two discrete logarithms are equal?

Suppose there are two elements $a = g^x$ and $b = h^x$, where $g$ and $h$ are generators in $Z^*_p$ and $p$ is a large prime. How can we prove that $a$ and $b$ have the same discrete logarithms with ...
1
vote
0answers
85 views

Opinion on my idea for storing credit cards securely

I've been thinking of ways to store credit cards securely, I thought of this: Take the users credit card info Put the card info in a standard format "Full Name/Card Num/Security Num/Expiry ...
0
votes
0answers
62 views

How can I calculate the size of an encryption key?

I have encryption algorithm that has two variables are used as encryption key. How can I calculate the size of the encryption key. I will show an example of what the variables can be: ...
-1
votes
1answer
102 views

what is SALSA20 Nonce and its requirements [duplicate]

what is the source of nonce in SALSA20 algorithm. basically who provides the value of nonce in SALSA20 algorithm
2
votes
0answers
146 views

As a cryptographer, what are the things I should care about in my implementation of pairing functions?

As a beginner in cryptography, I do not know anything about different pairing types more than their names. So far, I know these names: Ate pairing, tate pairing, eta pairing, and r-ate pairing. I am ...
0
votes
1answer
76 views

Storing salts and iteration number?

I have a function that derives two sub-keys from one passphrase using PBKDF2 one which is used as a encryption key the other for HMAC generation, because these two sub-keys will need to be regenerated ...
2
votes
0answers
86 views

Does the SSH protocol preserve integrity if an endpoint is cloned?

I am trying to find out if the SSH protocol preserves integrity of the transferred data in the following scenario: The SSH client is running on a virtual machine, at some point in the middle of the ...
0
votes
0answers
103 views

How can I prove CPA secure by using a new scheme gen,enc,dec from GEN,ENC,DEC?

Given public key encryption scheme $(gen; enc; dec)$, we now construct a new scheme $(Gen; Enc; Dec)$ as follows: The key generation algorithm $Gen$ is the same as $gen$. Each ciphertext for a ...
2
votes
2answers
206 views

Need 32-bit mixing function that has perfect avalanche between octets

for my hobby tinkering project, I need a mixing function that takes 32-bit input and has 32-bit output (and will, most likely, run in a 32-bit C environment) and the following property (independent of ...
0
votes
0answers
28 views

Do OpenPGP SmartCards have the same or better security than an air-gapped machine?

Are OpenPGP SmartCards, such as the OpenPGP SmartCard V2, suitable enough to have secure communications? Meaning, if I connect my smart card to my Mac which is connected to the internet and always ...
0
votes
1answer
120 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) ...
3
votes
3answers
1k views

How do public key rings work in cryptographic applications?

I am wondering if there are any links to articles or resources available online, or explanations that you can give, that would help me to understand the concept of a public key ring, and why I might ...
0
votes
1answer
123 views

Why is there an extra block when encrypting?

I am passing input data 20 bytes long and java AES-CBC returns 48 bytes instead of 32 which is what I think it should output because of padding. My key is 16 bytes long. ...
24
votes
2answers
1k views

What security authorities and standards reject $e=3$ in RSA, when, and with what rationale?

In RSA, some security authorities and/or standards allow the public exponent $e=3$, others require or recommend $e>2^{16}$ (or perhaps some other minimum). I gathered the following: PKCS#1 allows ...
8
votes
2answers
224 views

How Secure is a Pronounceable Password? In means of entropy

There are some strong studies which support the use of pronounceable passwords and multiple tools which provide generation of such passwords. According to this question the entropy of a password ...
0
votes
2answers
137 views

Is it possible to decrypt the entire message with one half of the key in this example?

In this scheme, a 256 bit key is split into two 128 bit sub-keys. Message blocks are 256 bits and are also split into two sub-blocks. Before encryption, each sub-block is xor'd with it's partner and ...
0
votes
0answers
23 views

The number of surviving key after “Meet in the middle stage” in 3-subset MITM attack

In 3-subset Meet in the middle attack, how can we calculate the number of surviving key after meet in the middle stage? and how can we calculate the complexity of Key testing stage? I have read about ...
2
votes
3answers
158 views

Is it true the longer the key length is the more secure the encryption?

Then why don't we use xxxxxxx bits encryption? what stopping us from using a very lengthy key? I am referring to the encryption we use with SSL
0
votes
4answers
120 views

Why do we need to compute message digest of a message first while signing it?

Why it is more efficient to compute a message digest of message and digitally sign it then, rather than sign the message directly?
1
vote
1answer
84 views

What is the value of Q such that Q|P-1 where P is a prime number?

For my crypto assignment, I'm asked to enter a prime P and generate Q such that Q|P-1 Can anyone guide me what is Q|P-1?
0
votes
0answers
120 views

recommendation to see documentaries about history of cryptography

Can anybody recommend any good documentaries which go into some history about cryptography and state of cryptography as of date ? I am not asking for favorites or subjective good documentaries but ...
5
votes
4answers
244 views

Can we give access to controlled functionality in Fully homomorphic encryption schemes?

Homomorphic encryption schemes are PKE schemes with an additional special method Evaluate. Evaluate method takes input any function (as boolean circuit) and encrypted inputs of the function and ...
5
votes
2answers
415 views

Is RSA encryption of a cryptographic hash with a private key the same as signature generation?

It is often said that RSA encryption with a private key is the same as signing (signature generation). Will RSA encryption with a private key over a cryptographic hash give the same result as ...
4
votes
5answers
1k views

Crypto-Compression Algorithms?

I was wondering, whether there exist such algorithms/enciphering procedures which both compress and encrypt the input data. That means, for starters, the output will be both smaller in size and ...
3
votes
1answer
198 views

Are there some problems to use pseudo-random number generator in Smart Card?

A Smart Card is a kind of secure device, with limited storage capacity and computational resource. If we use a Pseudo-Random Number Generator to generate random numbers in a Smart Card, then is there ...
0
votes
1answer
50 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
152 views
0
votes
1answer
64 views

Davies-Meyer Hash Function

So the Davies-Meyer Hash Function is: Hi = Hi−1 ⊕ exi (Hi−1) Say I pick H0 = 1110 0011 And the message x1 = "5" or "0000 0101" Is this the correct way to compute H1? H1 = 1110 0011 ⊕ (0000 0101 ⊕ ...
0
votes
0answers
138 views

Franklin-Reiter related message attack m2 = a(m1)+b

As shown in their paper, https://www.cs.unc.edu/~reiter/papers/1996/Eurocrypt.pdf, if one is given an equation relating the two messages m1 and m2 as well as other information one can crack both the ...
5
votes
2answers
622 views

What does “circuits” mean in Cryptography?

I am not a hardcore cryptographer so this might be a really stupid question. I am looking through some papers in homomorphic encryption and discovered they describe computation as "circuits", why do ...
1
vote
3answers
124 views

Linear transformation proof

Ok, so I have this question and I honestly have no idea how to prove it. I know that the function is linear and I know it works for every possible combination, I just don't know how to prove it in an ...
0
votes
0answers
97 views

Is it possible to add OpenSSL engine for a block algorithm with different input and output block size?

I need to add a new symmetric cryptography algorithm to OpenSSL, and I thought that the best way to do it is via its engine API. This algorithm will later be used by an application via the OpenSSL ...
2
votes
0answers
71 views

Homomorphic proxy re-signature

Alice has a value $a$ and she signs it using her secret key $d_1$ as: $s_1 = (r_1 * g^a)^{d_1} \bmod p$, and Bob has a value $b$ and he signs it using his secret key $d_2$ as: $s_2 = (r_2 * g^b)^{d_2} ...
3
votes
2answers
393 views

Proving that a function is not invert-able (one way function)

I am having problems with proving if the one-way function (http://crypto.stackexchange.com/tags/one-way-function/info) is hard to invert or not. $2^\sqrt {m} $ one-way function $ f: \{0, 1\}^{2m} ...
0
votes
1answer
218 views

Cracking secret key of a MD5 hash?

I have a MD5 hash which is obtained by hashing certain strings appended by a pipe character ( | ). (I know the values of these) A secret key is added as a suffix to this (I don't know the secret key). ...
11
votes
3answers
6k views

How does one calculate a primitive root for Diffie-Hellman?

In the Diffie-Hellman key exchange, one of the steps involves calculating a primitive root of a prime number $p$. How would one go about doing so, considering that $p$ could be very large? Is there ...
8
votes
3answers
2k views

Is a die implemented in a physics engine truly random?

So, a fair die throw is really random, not pseudo. So, would a RNG implemented as the result of a die throw in a physics engine (say, Newton, Havok, Nvidia's PhysX) be regarded as both ...
1
vote
0answers
187 views

Brute Force AES Calculations

I have an encryption service in which the user decides the length and the type of key, so I would like to build a tool that educates the user on the brute force times for the key they created if using ...

15 30 50 per page