Questions tagged [public-key]

An asymmetric cipher is an encryption scheme using a pair of keys, one to encrypt and a second to decrypt a message. This way the encrypting key need not be kept secret to ensure a private communication. Similarly in public key authentication, the verification key can be public and the signing key private.

Filter by
Sorted by
Tagged with
14
votes
7answers
3k views

Which is the simplest cryptographic algorithm which is close to commercial-level security?

An algorithm is simpler than another if It is easier to explain to a noob with basic high-school math knowledge. It is easier to securely self-implement by an intermediate programmer (Yes I know one ...
-3
votes
0answers
39 views

Brute force and DES encryption

If 10^6 computers work in parallel on a brute force attack and each computer can test 10^9 keys per second, how long will it take on average to find a DES encryption key? How long on average to find a ...
0
votes
1answer
19 views

Safety of a private key when knowing the full content of an ecrypted message in case of fixed initialization vector

When knowing the full content of the original message, will I be able to derive the private key from the encrypted message when the underlying encryption uses a fixed initialization vector? Meaning if ...
-2
votes
0answers
10 views

Verificatum:Issue in running demo [closed]

I am getting errors while running demo. When I run 'info_files'of demo,I get error as follows Generate info files... Making directories of servers.... done. Generating protocol stub file...Exception ...
1
vote
2answers
50 views

Is it safe to use RSA multiple times

Assuming I have multiple symmetric keys on specific machine(more than 10000 probably), can I use the same rsa key to encrypt all of those keys? I'm a bit concerned from a situation where multiple ...
0
votes
0answers
43 views

Is there a cryptographic scheme that achieves both confidentiality and integrity?

Suppose that Alice wants to send a relatively long message M to Bob. Also, suppose that both Alice and Bob have a set of {PK, SK} for public key cryptography. Alice proceeds to encrypt the message M ...
1
vote
1answer
87 views

How Does Prime Factorization Break ECDSA?

I have heard that ECDSA will be broken in the not-to-distant future (roughly 15-25 years) by Quantum Computers running Shor's Algorithm. However, to my understanding, the only purpose of Shor's ...
1
vote
1answer
48 views

Looking for commutative asymmetric cipher for data matching

I need some crypto operation for matching data privately between two peers (let say Alice and Bob). Alice should be able to encrypt her data with Alice and Bob public keys and pass the cipher text to ...
2
votes
1answer
99 views

Has anyone implemented a public-key encryption scheme using a universal one-way function?

There exists a function $f$ such that if one-way functions exist then $f$ is a one-way function. Such a function is called a universal one-way function. Now the public-key encryption schemes that I’...
1
vote
1answer
163 views

Cryptographic equivalent of family coat of arms

As a layman when it comes to cryptography, I have recently been asking myself if there was a cryptographic equivalent of a family code of arms. I'm thinking of something asymmetric, that is future ...
1
vote
1answer
87 views

ECIES for encrypting ECDH key exchange

I started studying Elliptic Curve Cryptography, and I do not know if I understand the difference between ECDH and ECIES (even with the other posts here on stackexchange). I'm wondering if ECIES can be ...
0
votes
1answer
48 views

Can I use the same key pair for authentication and Diffie-Hellman? [duplicate]

Assume Alice has a key pair $(A, a)$ and Bob has a key pair $(B, b)$, where $A = Ga$ and $B = Gb$. In general, the basic rule of crypto says that we should not use the same key for different ...
2
votes
2answers
827 views

End to end encrypted web chat app with stored messages in database

I am working on a web app with an integrated chat. All chats can only occur between two users - not more, not less. I am very concerned with security, so I would like to encrypt all chat messages with ...
0
votes
1answer
63 views

May an adversary be fooled by a random-looking input that in reality is fixed?

I want to prove the EUF-CMA-security of a signature scheme. It is a variation on an established scheme, therefore I would ideally like to reduce the new-scheme-security to the old-scheme-security. the ...
2
votes
3answers
183 views

Is it possible to have perfectly secure public-key cryptography with oracles?

It is a basic theorem of cryptography that it is impossible to have a perfectly secure public-key encryption scheme. That’s because the adversary can search through all possible private keys. But I’m ...
0
votes
1answer
24 views

Implementation of a decryption mixnet, and problems with the size of the key

I've been studying decryption mixnets, in the context of e-voting and stealth networks. Let's describe it in a very simplified way. The concept is pretty simple. A message M is forwarded through ...
23
votes
5answers
25k views

Why is it important that phi(n) is kept a secret, in RSA?

Why is it important that $\phi(n)$ is kept a secret, in RSA?
0
votes
1answer
36 views

Why should I export my private key instead of well known asymmetric crypto mechanism on openkeychain?

I'm trying to use password-store as password manager under linux. I created a private github repo with my gpg files in order to use it with other devices. I installed android-password-store app for ...
1
vote
0answers
49 views

Difference and relation between ed25519, x25519 and XEd25519 [duplicate]

In my Rust implementation of a messaging system, I'm using currently two cryptographic primitives: ed25519_dalek and x25519_dalek. I use ed25519_dalek for DSA, while x25519_dalek for encryption of the ...
0
votes
0answers
27 views

BIKE: Bit Flipping Key Encapsulation - Inverse encryption / decryption

I'm trying to understand white paper about BIKE Asymmetric crypt. And actually read about the inverse matrix that needs to be produced for decryption. My concern is: Can I actually encrypt data with ...
0
votes
0answers
28 views

Privacy preserving aggregation of encrypted data

I have the following problem: I have $t$ servers $S_1, S_2, S_3, \ldots, S_t$, each of them storing some $key : value$ list. They have to upload this data into a big dropbox server $D$, but in such a ...
5
votes
4answers
1k views

How do people know decryption is successful?

Decryption is simply a process of transforming one byte string into another with an input argument private_key. However, if people have no knowledge about the ...
5
votes
3answers
890 views

Asymmetric key derivation – Who derives the new pub key can't know the new private key?

I'm looking for a peer reviewed protocol or algorithm that can do this, preferentially I need something based on elliptic-curves cryptography. Alice know the main public key of Bob (B-PUB-1). Alice ...
6
votes
1answer
330 views

Zero knowledge proof for Paillier addition under multiple keys

Suppose $m_0, m_1, m_2 \in \mathbb{N}$ such that $m_0 = m_1 + m_2$, $m_i > 0$ (none of them can be 0 or lower) Under a Paillier cryptosystem, set $e_0 = E(m_0, r_0)$ for a public key $(g_0, n_0)$ ...
1
vote
1answer
58 views

Using first, say, 50 letters from a public key as user identifier?

I am making a messaging system where users are identified by their public keys. It doesn't matter which friendly username they have, so I'm not going to prompt them to choose one. Each user will ...
2
votes
1answer
68 views

How can a public-key encryption scheme be used to construct a commitment scheme in the CRS model?

For a PKE scheme $(Gen, Enc, Dec)$, the most 'obvious' idea is to commit to an encryption of a bit and in the reveal phase maybe send $r_g$, $r_e$ where $r_g$ is the randomness of $Gen$ and $r_e$ is ...
2
votes
2answers
99 views

Bitwise operation on secret values revealing the result only to the participants

Given the following situation, what sort of cryptographic construction am I looking for? Alice has a bitfield (vector, polynomial representation, etc.) Bob has a different bitfield of the same length ...
2
votes
1answer
853 views

What are the smallest possible RSA private and public keys?

I'm trying to understand what the smallest possible RSA public and private keys are. When using $p = 2, q = 3$, the encryption function doesn't encrypt. So I have to shift one prime to get $p = 3, q = ...
2
votes
1answer
54 views

Significance of y-coordinates in ECDH public key exchange

In the research paper Breaking the Bluetooth Pairing – The Fixed Coordinate Invalid Curve Attack? by Biham and Neumann, 2019, they talk about attacks in Bluetooth pairing, they state that in the ...
3
votes
0answers
31 views

Have time-release servers been implemented?

Conceivably, Alice could release a public encryption key and promise to release the private decryption key on a certain date. That way anyone could use that encryption key, combined with others from ...
3
votes
2answers
774 views

Is public key ever used to encrypt data directly?

In TLS, asymmetric encryption is used to agree on a symmetric key, which is used to encrypt/decrypt the data. I want to ask if there is any scenario or system where the public / private key is ...
0
votes
1answer
45 views

How to devise cryptographic system with data-sharing ability and password reset

I originally posted this in the security.stackexchange forums but then I was directed to this one which seems more befitting for my question. I am writing a C# .NET application. For my application the ...
0
votes
1answer
115 views

Why are ed25519 keys not recommended for encryption?

Was wondering why there is no straightforward way of using ed25519 keys for encryption. Then I found this: https://github.com/indutny/elliptic/issues/108 There it is stated that it's unlike RSA not ...
6
votes
3answers
198 views

Would asymmetric cryptography be feasible in World War II?

Assuming people in the forties would have known asymmetric cryptographic methods like RSA, would they have been able to make sensible use of them? There were no real electronic computers at the time, ...
25
votes
6answers
20k views

Why does RSA need p and q to be prime numbers?

Despite having read What makes RSA secure by using prime numbers?, I seek a clarification because I am still struggling to really grasp the underlying concepts of RSA. Specifically, why can't we ...
0
votes
1answer
333 views

Securely derive AES and ED25519 keys from a ED25519 seed

Go's ed25519 package exposes a function which allows creating a private key from a 32 byte seed. See: https://godoc.org/golang.org/x/crypto/ed25519#NewKeyFromSeed The reason I want to use this is ...
3
votes
2answers
208 views

How to define a FHE scheme whose plaintext space is infinite using boolean circuits?

There are many kinds of fully homomorphic encryption scheme by using boolean circuits. And the plaintext space $\mathcal{P} = \{ 0,1 \}$. If there is a -bit FHE scheme, we can construct a FHE scheme ...
0
votes
0answers
44 views

Is there a relation between the private keys of secp256k1 public keys of opposite parities?

From observation, 32 bit public key values of opposite parities are either both valid, or both invalid. ...
16
votes
5answers
9k views

Why does the recommended key size between symmetric and asymmetric encryption differ greatly?

In various articles it is mentioned that for secure communications, the recommended key sizes are 128-bit key size for symmetric encryption (which makes it $2^{128}$ possible keys?) and 2048-bit key ...
2
votes
2answers
37 views

How can two parties offline generate a sequence of corresponding key pairs that are still sufficiently random

I'm looking to design a protocol between two parties A and B to generate sequence of RSA private keys $p_{a_0}, p_{a_1}, ... p_{a_k}$ and a sequence of corresponding RSA public keys $P_{b_0}, P_{b_1} ...
0
votes
1answer
46 views

Choosing UWP encryption algorithms

I've just come across the large variety of encryption ciphers available in the UWP WinRT API, both symmetric and asymmetric. I'm trying to figure out which are commonly seen as the most favourable ...
1
vote
1answer
132 views

Smart's attack for secp256k1 does not work

This is the Sage code that I use, and the results I get: ...
2
votes
2answers
50 views

Does selectively generating keypairs with particular public-key hash prefix weaken the security?

I'd like to embed 8-bits of information by selecting only keypairs where a hash of the public key begins with those 8-bits. (The expected number of keypairs that will need to be generated is 256, so ...
1
vote
1answer
71 views

Find Consecutive X-Coordinate algorithm

The question is as follows: Is there an algorithm to calculate a $(x,y)$ pair which is consecutive to an existing $x$-Coordinate on an elliptic curve? Background Information for the curve: Known ...
0
votes
2answers
156 views

Computing PGP ed25519 and curve25519 keygrips?

There are public key algorithmic differences for how PGP computes fingerprints and keygrips. For the v4 protocol, fingerprints are not exclusively computed from public keys while keygrips are. RFC ...
1
vote
1answer
118 views

Is it possible to compute the y-coordinate of a point on SECP256K1, given only the x-coordinate

Given an x-coordiante of a point on the SECP256K1 curve, is it possible to calculate the corresponding y-coorindate? (Assuming the point is a verifying public key that complies with the Bitcoin ...
2
votes
2answers
366 views

Are the asymmetric roles of the two keys in the elliptical curves the same (as for RSA)? Can they be interchanged indifferently?

More precisely, and as for RSA, is it really true that it is not feasible to recirculate one of the keys knowing ONLY the other with the Elliptic Curves, as for RSA? Or does ECs work differently on ...
1
vote
1answer
115 views

How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?

Here is some information we got : We know the value of $n$, with size $1043$. We know the value of $p$ (size $20$) and $q$ (size $1023$) as the factors. $e = 65537.$ $\varphi(n)$ = $(q-1)(p-1)$ When I ...
2
votes
0answers
50 views

DES decryption of the homomorphic encryption ciphertext

I implemented an application using partial homomorphic encryption for outsourced computations. To get an efficient bandwidth, I am thinking to apply (DES) symmetric algorithm to encrypt the message ...
-1
votes
1answer
59 views

How to recover RSA messages if they are padded with spaces?

I have a message m="hunter". Let's say we pad it with 2 spaces from the left making the final message as ...

1
2 3 4 5
35