0
votes
0answers
37 views

1-out-of-2 OT from Random 1-out-of-2 OT

Last week I came upon this problem in my h.w.: Let $OT^m$ denote 1-out-of-2 oblivious transfer of $m$ bit inputs. Let $RandOT^m$ denote the following primitive: The sender’s input ...
0
votes
1answer
42 views

Homomorphic multiplication by a scalar

Few homomorphic encryption schemes like Paillier , Ring-LWE support homomorphic multiplication operation by a scalar apart from additive homomorphic property. Loosely they could be defined as below ...
0
votes
0answers
77 views

Deoxys: disadvantages vs. AES?

The CAESAR candidate Deoxys is based on a tweakable block cipher that seems to be a strict improvement over AES, in that it is a tweakable cipher resistant to related-key attack. The mode proposed ...
0
votes
2answers
130 views

Where is the mistake in my RSA by-hand calculation?

Like several previous askers, I seem to have made a mistake in my RSA calculation, but despite going back over it three times, I cannot spot it. I picked 1000003 and 6000011 as my primes, ...
2
votes
1answer
63 views

Why is DSA falling out of favor?

Windows abandoned DSA rather than extend it to support > 1024 bits; but otherwise I cannot find a reason why DSA would be less desirable. I see in SSH the disabling it by default with a completely ...
0
votes
0answers
17 views

Is AES-256 bit encryption secure against this kind of attack? [duplicate]

Recently I came across this article. http://www.cs.tau.ac.il/~tromer/acoustic/ Could this put all computers at risk for decryption?
1
vote
1answer
41 views

Can I get successful signature verification with just altering message and signature?

Assuming I can modify a message and also modify the verification signature, and I also have the public-key but not the private-key. Can I create a message that can be verified with a signature that I ...
1
vote
0answers
25 views

Determining an encryption key when ciphertext and algorithm are known

I would like to know how I can tell that I have successfully performed an exhaustive search attack on an encrypted message. Here are the conditions: key is 40 bit I am aware of the cipher text and ...
0
votes
0answers
15 views

What are the advatages or disadvatages of using seperate chaining over linear or quadratic probing?

I was looking through different hash methods the other day and was curious as to what the advantages or disadvantages of using separate chaining over linear or quadratic probing. I know that with ...
4
votes
2answers
659 views

Is this simple PRNG secure?

$G$ is a PRNG used in a stream cipher and defined in the following way: G receives $s_0$ as an input, which is a random string drawn from a uniform distribution. The output of step $i$ is $s_i = ...
0
votes
1answer
43 views

CPA on theoretical OTP with CBC mode

Body of question Note: this is THEORETICAL exercise. I understand OTP and CBC does not get along. I have to find a CPA on CBC enc-mode using OTP as the encryption algorithm, s.t a new key is ...
9
votes
1answer
251 views

Algorithm for Boneh and Durfee attack on RSA

I am trying to understand various attacks on RSA and I believe that they only way to fully understand the algorithm is to implement it. I am trying to implement the code in this paper (pdf) (Private ...
2
votes
1answer
79 views

Is it possible to combine two hash functions in such a way that cracking the constructed hash would require cracking the constituent hashes? [duplicate]

Suppose A is some arbitrary hash function, for example BCrypt or MD5. And B be some other arbitrary hash function, maybe SHA256 or SCrypt. Let ...
3
votes
0answers
82 views

Elgamal with secret key equal to zero possible?

From various sources (e.g. this paper, page 3), the key generation algorithm of Elgamal samples the secret key $x$ from $\mathbb{Z}_q$, which is identifiable to $\{0, 1, 2, \dots, q-1\}$. My ...
0
votes
0answers
31 views

What happens if someone implements tree-base signature scheme incorrectly?

I'm learning about signature schemes and read about Merkele's tree-base signature scheme. There are paragraphs about how the key and signings are generated. Using so-called tree structure and pseudo ...
0
votes
1answer
37 views

How to find the time complexity of modular multiplication? [duplicate]

There are two number of length m bits. How do I prove that the complexity of modular multiplication of these two numbers is $O(m^2)$.
4
votes
1answer
91 views

What is the private key in RSA?

I'm new to cryptography and I have a doubt: I read some pages a bit different definition for the RSA private key: In 1 - (n, d) In 2 - ...
0
votes
1answer
53 views

How do attacks on WEP work?

There is an abundance of tools and tutorials on how to break WEP encryption. However, I fail to find a nice resource that gives a clear break-down of why the attacks are possible. For example, I know ...
3
votes
1answer
67 views

How are boolean functions used in cryptography?

I recently started becoming interested in Boolean functions. Because they are defined as $f: \{0, 1\}^n \rightarrow \{0, 1\}$, or in other words only over $\{0, 1\}$, I guessed they can somehow be ...
0
votes
1answer
53 views

Symmetric cipher speed (AES vs Camellia vs Twofish)

If I have understand correct, Twofish is more secure (harder to break) than AES and Camellia, but Twofish is slower than AES and Camellia. But how can I mesure the speed difference between AES vs ...
11
votes
2answers
1k views

RSA encryption using multiplication

Generally in RSA we encrypt as $m^e \pmod n$. Will RSA work if we replace the power by normal multiplication? $E = (m \times e) \mod n$ and decryption as $c \times d \mod n$. What will be $d$ ...
1
vote
1answer
44 views

Can we do modulus switching for number theoretic encryption?

Can we do modulus switching for number theoretic encryption such as Paillier or ElGamal?
0
votes
0answers
69 views

Why are hash functions like SpookyHash and MurmurHash so highly collision resistant?

Why are hash functions like SpookyHash and MurmurHash so highly collision resistant? I tried to test these hash functions using a few billion input messages and I found that there is no hash value ...
5
votes
5answers
333 views

To what extent is WhatsApp's statement on secure messaging realistic?

As those of you who use WhatsApp Messenger probably know, with their recent update chats and calls are now encrypted. Here's what WhatsApp claims: Messages you send to this chat and calls are now ...
1
vote
1answer
72 views

What would happen to AES if we replaced MixColumns with ShiftColumns?

I have this as a question in an assignment and I guess I don't fully understand the steps. I understand that if we omit MixColumns, then every byte of the ...
1
vote
1answer
45 views

How is decryption done in AES CTR mode?

Since AES CTR mode uses a unique IV and counter to produce the key to XOR with the plain text to get the ciphertext, the question is so as to how decryption is done. Since AES CTR produces a ...
3
votes
1answer
61 views

Is the use of a 4-round Blake2b permutation in OPP justified?

The MEM-AEAD construction uses a 4-round Blake2b permutation in masked Even-Mansour mode as a (tweakable) block cipher. 4 rounds of the Blake2b permutation are already broken to my knowledge. Why ...
0
votes
1answer
93 views

Is this cascading encryption, and is my security weakened as a result?

I'm trying to understand what is, and what is not, considered cascading encryption. All of the posts and conversations I've read over the past few days discourage the practice, including this article. ...
0
votes
0answers
11 views

Are there any free to use video and audio chat programs that offer end-to-end encryption that do not let the service know of the content? [migrated]

Skype is compromised, FaceTime is compromised, and I believe Ovoo is compromised. Does anyone know of any genuinely free (not free-to-try or in-app purchase-type applications) that offer end-to-end ...
1
vote
1answer
62 views

How secure is the OTR protocol?

I am using Adium and wondering how secure it is. I believe it uses AES-256 (I do not understand what that means) by default. It also requests that users exchange fingerprints with each other before ...
0
votes
1answer
34 views

How robust is my coded output?

I create codes and ciphers and as a hobby and I was wondering if there was any outfit that would 'test' your output to see how resilient it is. Is there a group anywhere that will accept code, try to ...
4
votes
1answer
99 views

Backdoor in NIST elliptic curves

Let $E$ be an elliptic curve defined over a finite field $F_q$ with prime order $n$ and $P,Q \in E$ and $k$ be private key such that $kP=Q$. Since $n$ is prime, $E$ is isomorphic to $Z_n$. Suppose ...
0
votes
0answers
8 views

Deciphering and encrypting using Vigenére square for kids?

Is Vigenére cipher the most basic form of enrypting or is there another simpler way? I'd like to expose my niece to it.
0
votes
1answer
51 views

Best known attack

I always have listened the term best known attack but I have doubts respect to this term, becase there are several kinds of attacks for example structural attacks, inversion attacks. It is possible to ...
2
votes
1answer
63 views

Understanding the Hidden Subgroup Problem specific to Integer Factorization

I've been reading about the Hidden Subgroup Problem (HSP), specifically trying to understand how it is related to the integer factorization problem. I've read What exactly is the impact of the hidden ...
1
vote
1answer
24 views

Question about Cipher Block Chaining(CBC)

I'm studying at the moment the CBC Encryption method,and I was asked in an excercise how many bits would be wrong after decryption if during the transmission 2 bits are interchanged. My guess is that ...
0
votes
2answers
347 views

mode of operation in cryptography

We need to choose a mode of operation for a Telnet like application where the average message size is between 7 and 1024 bytes. What is the best mode of operation in this case? a. CBC b. CFB c. ...
-4
votes
0answers
12 views

Breaking El Gamal defined over Sn

How can we break EL-GAMAL Encryption defined over Sn the permutation group ? Kindly give the efficient algorithm for it.
1
vote
1answer
15 views

One time Key Encapsulation Mechanism?

For KEM's, do you only exchange a private key once via the public key encryption and then do all further encryption with this private key, or is a fresh private key sent out with each message? The ...
0
votes
2answers
74 views

Length of encryption password aes-256-cbc

I'm encrypting a file with sensitive information with cat secret | openssl aes-256-cbc -a -salt > secret.enc I am choosing a random encryption password with ...
0
votes
0answers
27 views

Security of $(k, 2k)$-bit generator for small seeds

Here is the problem I am working on for context. I have $\epsilon \le 1 - 2^{-k}$ and $\epsilon$ approaches 1 as $k \to \infty$ but I'm stuck on part c). The $f$ is secure iff there does not ...
0
votes
0answers
18 views

Why does DSA require that a new $k$ be chosen and the algorithm restarted if $s=0$?

DSA is an algorithm used to generate a digital signature, which consists of a pair of values $(r,s)$. The algorithm computes $r$ first and then $s$. However, if we calculate $s=0$, it says to restart ...
0
votes
0answers
56 views

Smart Card choice for PKI implementation

I'm seeking to implement a national digital signature standard on a smart card. I feel like this is a good place to ask if anybody is acquainted with a hardware supplier offering smart cards that ...
1
vote
0answers
36 views

How to use OpenSSL command line utility to encrypt data with encrypted key from public key?

I may not be asking the right question. I am fairly new to data encryption. I am currently being sent encrypted data that's stored as follows: [ [keysize] [key encrypted with public key] [ivsize] ...
1
vote
0answers
61 views

What functional encryption scheme can be used to compute a linear function?

I am looking for a functional encryption scheme that can compute a linear function. I do not need to work with attributes. All I want is to compute the result of a function $y = a*x+b$, where $x$ is ...
3
votes
1answer
56 views

Do you need a HMAC if decryption attempts are severely limited?

I am considering an application where data bandwidth is extremely limited, and considering removing message authentication codes from encrypted transmissions. The encryption method is currently ...
11
votes
2answers
96 views

Practical differences between circuits and turing machines for cryptography

In formal cryptography, we model algorithms (mostly our adversaries) as (Probabilistic) Turing Machines or as boolean circuits. In our lecture on formal cryptography, we learned that circuits are more ...
4
votes
0answers
72 views

Is correlation in vector distributions “dangerous”?

Consider the two vector distributions $\xi,\chi$ described below, each one outputting integer vectors of length $n$ with coefficients in $\{0,\dots,n\}$. Distribution $\xi$ samples each coefficient ...
5
votes
1answer
107 views

Key size for HMAC-SHA256 [duplicate]

After reading a bunch of past stack exchange posts like this one and RFCs 5869, 2104, and 4868 I felt comfortable that a 32-byte key was sufficient for HMAC-SHA256. However, I am implementing my code ...
3
votes
0answers
37 views

EC Schnorr signature: multiple standard?

I 'm working on some EC-Schnorr signature code. Reading various papers on that, it's seems EC-Schnorr is not standardized as well as ECDSA. For example, I found two main differences in two main ...

15 30 50 per page