2
votes
3answers
645 views

Does keeping a public key private or using multiple encryption help?

I recently had a discussion with a friend of mine about cryptography. As we are both no experts, I thought that I could better resolve are dispute here. My friend said that when he used public key ...
0
votes
0answers
14 views

Does the user need to know how the decryption scheme works in identity-based broadcast encryption [duplicate]

For example, in Delerablee's identity-based broadcast encryption scheme, decryption scheme is defined as $E(C_1,h^P)$ $E(\mathcal{SK}_{id},C_2)$. Are the users allowed to know how decryption works? (...
1
vote
2answers
155 views

Factoring large $N$ given oracle to find square roots modulo $N$

When $p$ and $q$ are distinct odd primes and $N = pq$, the points in $\mathbb Z_N^\ast$ have either zero or four square roots. A quarter of the points have four square roots; the rest have no square ...
1
vote
0answers
18 views

Finding missing probabilities for formal proofs

In formal proofs, you often need to use probabilities to show that the Advantage of an algorithm is negligible. In proofs by contradiction, these probabilities are often tied to probabilities of other,...
0
votes
1answer
38 views

ElGamal scheme signature: if private key a mod p is equal to private sig. key k mod p-1, can an attacker notice and determine the value of a?

If someone is signing a document using the ElGamal signature scheme, and if the random involved in the signature $k \mod (p-1)$ is equal to $a$ (the private key), can an attacker notice? If so can he ...
0
votes
0answers
20 views

Do users need to know decryption scheme in Identity-based broadcast encryption?

I have a question related to identity-based broadcast encryption: For decryption, there are different decryption schemes. Does the user need to know that scheme, or does the system firmly define the ...
2
votes
2answers
122 views

Shannon theorem of perfect secrecy

From the class: Shannon Theorem: For a perfect encryption scheme, the number of keys is at least the size of the message space (number of messages that have a non-zero probability). Proof: ...
5
votes
1answer
81 views

Does concatenation of two pair computational indistinguishable distributions still indistinguishable?

Let $X,X',Y,Y'$ be some distribution ensembles such that $X\sim X'$ and $Y\sim Y'$, where $\sim$ means computational indistinguishable. Define $(X,Y)$ be the distribution ensemble over $\{0,1\}^{2n}$ ...
2
votes
0answers
79 views

Bitwise method of generating r for RSA-KEM

It seems that RSA-KEM has a very troublesome method of generating the secret $r$. It seems that the random value needs to be in the range $0 \le r \le {n - 1}$. Now most cryptographic environments ...
1
vote
1answer
39 views

Do any Identity-based Encryption Systems support messaging between domains?

Identity Based Encryption is covered under RFC 5091 (specifying the algorithm), 5408 (specifying data structures), and 5409 (using IBE with Cryptographic Message Syntax). However, every IBE ...
3
votes
4answers
915 views

Do any non-US ciphers exist?

Plenty of ciphers come out of the USA from government research or selection competitions. AES and DES are examples. Are there any public ciphers produced by other states, China or Iran for example? ...
5
votes
1answer
228 views

Why $e>n^{3/2}$ prevents Wiener's attack

Here's the Wiener's attack as I understand it. Suppose $n=pq$ with $q < p < 2q$, and $d < n^{1/4}/3$ where $ed=k\phi(n)+1$ and $e < \phi(n)$. $$\begin{align*} n-\phi(n) &=n-(p-1)(q-1)...
1
vote
1answer
233 views

HMAC Secure Key Exchange?

Within RFC 2104 section 3 there is discussion around keys (below). How are these keys agreed upon/distributed? Practically speaking is asymmetric crypto a requirement to "bootstrap" and distribute ...
-1
votes
2answers
56 views

elliptic curve point doubling in Jacobian coordinates

I am writing an application that uses Elliptic curve Diffie–Hellman for authentication. I found two formulas for point doubling in Jacobian coordinates. 1st) \begin{equation} X_1 = (3x^2 + aZ^4)^2 -...
4
votes
3answers
3k views

Is it safer to encrypt twice with RSA?

I wonder if it's safer to encrypt a plain text with RSA twice than it is to encrypt it just once. It should make a big difference if you assume that the two private keys are different, and that the ...
1
vote
1answer
102 views

DES: Computing the output of S-Box 1?

If the 48-bit input to the S-box is 0xAAAAAAAAAAAA, what are the first four bits emitted by S-box 1? Answer: 0110 I know that an S-Box takes n inputs and give m outputs and that n != m, but I really ...
4
votes
0answers
57 views

Authenticated encryption with Enc-Sign-Mac

I've given a CPA secure private key encryption scheme, an unforgeable private key MAC scheme and an unforgeable public key signature scheme. I want to combine them to protect confidentiality, ...
3
votes
1answer
198 views

How to perform decryption in this single-bit PKE scheme?

Consider a cyclic group $G$ of order $q$, and let $g$ be a generator for $G$. Assume $(G, q, g)$ is public. Consider the following 1-bit public-key encryption scheme. To $generate (pk,sk)$: $x \...
1
vote
1answer
76 views

multiplicative inverse in galois field $2^8$

I am trying to compute the multiplicative inverse in galois field $2^8$.The question is to find the multiplicative inverse of the polynomial $x^5+x^4+x^3$ in galois field $2^8$ with the irreducible ...
1
vote
1answer
60 views

Proof of Knowledge/Data Integrity using Hash Function

Objective: A verifier wants to ensure that a block of data M is also known to a prover. The protocol should exchange little information and should not leak information about the value of M. Proposed ...
0
votes
3answers
147 views

Key length requirement in a simple XOR implementation

I don't have much previous experience at all with cryptography, this is pretty much the first time I've tried anything similar. I'm trying to implement an extremely simple XOR encryption system in ...
0
votes
0answers
62 views

Lightest symmetric, fixed key, “Format preserving Encryption” algorithm?

message m = 49 bit string key k = any format but fixed Ciphertexts should be 49 bits long. Are there several "Format Preserving Encryption" algorithms? I want an algorithm that is as light as ...
1
vote
1answer
56 views

How succeptible to accidental collision is the construct sha256(uuid4 + now) in Python?

I need 32 byte pseudorandom sequences that denote unique filenames and am currently using this Python code: ...
0
votes
1answer
40 views

Can I open a file in plaintext (already decrypt) but the cipher doesn't change?

I want to create an app that encrypts a file and saves it to the Dropbox. Thus, I open and edit this file, I want the file is already decrypted, but the encrypted file that stored in Dropbox still in ...
-2
votes
3answers
152 views

OTP - Reuse key BUT add IV, is it secure enough?

I have already asked a similar question and now I can continue to this question about adding a "extra key" = IV. My last question was about reusing key in OTP (One-Time-Pad). Now this question is ...
0
votes
0answers
22 views

Value of security through amiguity?

Let's say that you have a symmetric cipher which takes in an 8 bit plain text value and a key, and generates cipher text which can be decoded using the key to get the original plain text value. Since ...
3
votes
1answer
38 views

Is this session start protocol secure?

I am working on a password manager application that saves the user's passwords in a remote server. I need to use AES in CTR mode to encrypt the passwords before sending them to the server. The client ...
3
votes
1answer
93 views

Authenticated encryption with Signatures

I've given a CPA secure private key encryption scheme (wich gets to a CCA secure scheme or better to an authenticated encryption scheme, when i combine it with a given MAC) and a unforgeable public ...
1
vote
1answer
40 views

How many bits of plaintext are required to verify a stream cipher key?

If a stream cipher has an $n$-bit internal state, how many bits of known plaintext are required to confirm that particular key is the key? I believe that the answer is at least $n$-bit's of plaintext....
22
votes
2answers
4k views

How were the DES S-box values determined?

It seems like the S-boxes in DES have essentially random values. How were these chosen?
4
votes
1answer
364 views

What is considered a “weak key” in AES?

I need to construct an AES key from an array of bytes (in Java), but I first I have to check if the key created from these bytes would be weak. Java can check for weakness for DES, but not for AES. ...
1
vote
1answer
75 views

Historical algorithm which is frequency analysis resilient

Long ago, I've read an article on wikipedia which describe a cipher algorithm, used by kgb (if I remember well) with the property that all ciphered letters has the same (or nearly) probability to ...
10
votes
4answers
376 views

Can double-encrypting be easier to break then either algorithm on its own?

As was pointed out in Martin Bonner's comment I cannot prove this, but it seems intuitively impossible. An encryption function is supposed to obscure the plaintext to the point where no information ...
1
vote
1answer
78 views

Attack on key exchange with authentication

Suppose the honest parties - Alice and Bob - exchange public key in person/via telephone so that attacker can only eavesdrop on the line. Alice has hashed the public key using a collision resistance ...
13
votes
3answers
358 views

Why is Poly1305 popular given its 'sudden death' properties?

ECDSA has the undesirable property that if a key pair reuses a nonce in a signing operation, the cryptosystem experiences catastrophic failure in the form of private key leakage. I've heard this ...
1
vote
1answer
49 views

ChaCha20 core vs ideal unkeyed PRP

I know that the ChaCha20 core (without the initial constant) is not an ideal PRP and must not be used as such. I also know that $\text{ChaChaCore}(0) = 0$. Are there any other differences?
2
votes
1answer
69 views

What is the most common encoding of messages to polynomials?

How polynomial based encryption schemes such as NTRU encode messages in to polynomials? Is there a generic conversion?
4
votes
1answer
68 views

Small subgroup attack on Diffie-Hellman key exchange

Alice and Bob are using DHKE in the group $\mathbb{Z}_p^ * $, where $p = 1031 = 2 \cdot 5 \cdot 103 + 1$. Their generator $g = 2$, which generates a multiplicative group of order $515$ in $\mathbb{Z}_{...
1
vote
2answers
78 views

Role of Fermat's little theorem in the proof of correctness of ElGamal signature

In the Wikipedia article about the ElGamal signature scheme it is written, that Fermat's little theorem is used in the following proof of correctness: From the signature generation in ElGamal we can ...
1
vote
1answer
101 views

Given the first half of a SHA-1 hash, can you predict the second half?

I know this applies to secure ciphers, but does this also apply to hashes?
4
votes
1answer
97 views

Exposed raw RSA private key operation

Assume that there is a smartcard or other hardware token that exposes the raw RSA private key operation (modular exponentiation, with or without CRT parameters). Is there any possibility that raw RSA ...
1
vote
1answer
135 views

What is the difference between discrete logarithm and logarithm? [closed]

Why discrete logarithm? Is discrete logarithm is part of logarithm? I do not understand the difference between these two concepts.
1
vote
0answers
39 views

Parallel hashing function that always gives the same hash despite a variable number of cpus

The title pretty much sums it up :) I'm looking for a hashing algorithm that does not need to be cryptographically secure beyond reducing the number of accidental collisions. There is no need to ...
0
votes
1answer
33 views

Aggregation signature and verification

I'm not even sure of the appropriate terminology to use to describe my problem so bear with me if the explanation is not exactly formal. Imagine I have a simple digital calculator, with a screen and ...
1
vote
1answer
25 views

Question about entity authentication

Say party A wants to make sure they are communicating with party B, and not an eavesdropper E. Then they will use an authentication scheme to do this. But what if there is an eavesdropper on the line,...
5
votes
0answers
112 views

Homomorphic system that allows Hamming distance computation?

How can I work out Hamming distance between two binary vectors securely? I would like to know how I can apply homomorphic techniques here.
0
votes
1answer
33 views

Are chosen-prefix collisions for SHA-1 a major threat?

GPG signing of Git commit tags relies on the collision resistance of SHA-1, which is weak. However, the attacker does not get to choose the prefix. How much does this translate to an actual ...
-2
votes
1answer
32 views

SHA encyption (help me) [closed]

OK, so I am a real noob at cryptography stuff and I have a set of files. One is a string that I am trying to decrypt, and the other has this SHA: 4534e95cb5f001719a6119a092459dc826965d60 Can I use ...
2
votes
0answers
38 views

RC6-like key schedule with 16-bit S-boxes

I am trying to figure out an encryption algorithm whose key schedule function seems to be similar to RC6. However, it seems to be creating S-Boxes using 16-bit integers instead of 32-bit ones. I have ...
8
votes
3answers
186 views

The internals of bcrypt

I'm attempting to get a better understanding of cryptography and have run into some questions about bcrypt. Bcrypt relies on the blowfish cipher, which is a reversible method of encryption. But ...

15 30 50 per page