An asymmetric cipher is an encryption scheme using a pair of keys, one to encrypt and a second to decrypt a message. A special class of asymmetric ciphers are public-key ciphers, in which the encrypting key need not be kept secret to ensure a private communication.

learn more… | top users | synonyms (3)

2
votes
1answer
102 views

What does signed fixed window method mean in ECC?

I am studying (sliding) window method in Elliptic Curve Cryptography (ECC) but I am confused by the term, signed fixed window method. By the way term is used in a research paper and not in the book ...
3
votes
2answers
205 views

Key space vs Cardinality of 1024-bit RSA

I have been trying to figure out the encryption key space, and cardinality of 1024-bit RSA. From my understanding, the key generated from 1024-bit will be primes greater than $2^{1023}$ but less than ...
0
votes
0answers
24 views

Does Paillier Cryptosystem work in different message space? [duplicate]

I have a question about Paillier Cryptosystem. Assuming we have $c = Enc(m) = g^m \cdot r^N \mod N^2$ as the output of encryption algorithm, where $N=p_1p_2$ and $m \in \mathbb{Z}_q \subset ...
0
votes
0answers
37 views

What crypto scheme should I use on embedded m2m system with assymetric uplink/downlink bandwidth?

I am working on implementing info security into custom m2m radiolink communication system, which has some restrictions: MCU based endpoint can transmit to gateway with packets max 16 bytes long, and ...
0
votes
0answers
35 views

Registration and log in through public key cryptography?

I read about zero knowledge proofs. Let's say you want to create an account at a website. You choose a password $p$ and from $p$ you derive deterministically a public & private key pair $(e,d)$ ...
1
vote
1answer
44 views

How do revocation certificates work in PGP?

I've already read how to build and upload them, but I'm wondering how revocation certificates work, what informations they hold and so on. Suppose my private key is compromised, but I have a ...
25
votes
7answers
20k views

How does asymmetric encryption work?

I've always been interested in encryption but I have never found a good explanation (beginners explanation) of how encryption with public key and decryption with private key works. How does it ...
2
votes
1answer
90 views

Asymmetric cipher with multiple public keys

Asymmetric cryptography is well known. You generate a private key. Using the private key you generate a public key. Then you can sign a message with the private key and check signatures using the ...
1
vote
0answers
51 views

How to securely map an element from an smaller domain to the other element in a large domain

Problem: I have a small sized domain, say s-bit. It's clear that the probability for an adversary to guess an element is $ \frac{1}{2^s}$. I need to make the probability negligible. However, I need to ...
1
vote
2answers
812 views

Multiple private keys for single public key

I am currently working in security in mobile ad-hoc networks. I have several clusters, and I want to send some data encrypted with its public key, from the cluster head to the cluster members. I ...
2
votes
2answers
129 views

How does a certificate authority issue a digital certificate?

I am new to cryptography and I want to know the details of how a Certificate Authority issues a digital certificate. From what I know (please correct me if I'm wrong at any parts of my explanation): ...
0
votes
0answers
41 views

Protocols with deliberate errors

This question is motivated by discussion cocerning “The Two Sheriffs” puzzle, see (1) and (2). Are there any public key protocols where Alice and Bob intentionally insert errors in their messages? ...
3
votes
1answer
85 views

what are the NTRU keysize and application in industry ?

I'm a student currently working on a research project on the NTRU cryptosystem, I've read some papers about this cryptosystem, and in those papers they are talking about keysize, is it the size of the ...
0
votes
1answer
49 views

Why rogued certificate from hash collision is harmful

I cannot understand why rogued certificate is thought harmful though It can be used to impersonate some website. The attacker can craft a rogued certificate with different identities and public key ...
2
votes
1answer
72 views

Retrieve value of private key after encryption with the public key

Is there a way to find an RSA private key after it is encrypted with the corresponding public key? Does there exist an algorithm to recover the private key in this special case?
11
votes
1answer
627 views

Compressing EC private keys

For reasonable security, EC private keys are typically 256-bits. Shorter EC private keys are not sufficiently secure. However, shorter symmetric keys (128-bits, for example) are comparably secure. I ...
2
votes
1answer
114 views

Attribute-based broadcast encryption with respect to ABE

What is the exact difference between attribute-based encryption (ABE) and attribute-based broadcast encryption (ABBE)? Is ABBE equivalent to broadcast encryption on top of ABE?
0
votes
1answer
103 views
0
votes
2answers
129 views

Asymmetric encryption that is secure for (almost) any foreseeable future

Recently, I've been reading a couple of papers about building cryptosystems that are secure for up to 30 years. But for some applications, this seems a bit low to me. So I am wondering if considering ...
2
votes
1answer
60 views

Algebraic cryptanalysis on public-key schemes

The book Algebraic Cryptanalysis (Bard, G.V.; Springer, 2009) speaks about transforming a symmetric scheme into a system of polynomial equations and solving these equations to break the scheme. But ...
2
votes
1answer
129 views

What use is the signature without the message under RSA?

Using RSA for signing & verification, is there a way to take a valid signature for an unknown message, and for someone else to generate a valid signature using a different key against the valid ...
0
votes
1answer
68 views

Altering the message space of Paillier

Is there any obstacle if we restrict in Paillier the plaintext values to be drawn from $\mathbb{Z}_N^*$ instead of $\mathbb{Z}_N$ as the original scheme indicates.
0
votes
1answer
966 views

How to decrypt a '.enc' file that has been encrypted with RSA using a public key? [closed]

While solving a CTF challenge online, I came across a situation where I needed to decrypt a '.enc' file that has been encrypted using someone's public key. The ...
-1
votes
1answer
329 views

Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify] [closed]

As part of an experiment, I was given a .enc RSA (encrypted) file that was most likely generated using openssl. I had the public key, I factored it, obtained the private exponent, and decrypted the ...
2
votes
2answers
337 views

Toy public/private key example open to frequency analysis?

I've been looking at an online Public Key Encryption Example (summarized below). It seems to me that choosing cyphertext = plaintext^(key) mod n would produce the ...
8
votes
3answers
1k 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 ...
1
vote
1answer
186 views

How does ECDHE_RSA key exchange mechanism work?

Using Wireshark, I found these data exchanged with google.com over TLS: Client Hello possible cipher suites and possible curve types (eg. secp256r1) sent Server Hello cipher suite selected ...
0
votes
2answers
326 views

Practical Attack on RSA

Currently I am designing an RSA based application, and I am thinking of how long should the key be in order to be secure against attacks. I know that RSA 4096 bit key can be recovered using Sound ...
4
votes
1answer
60 views

Do asymmetric signatures require constant-time verification?

To avoid a timing attack, HMAC signatures are usually compared in constant-time (every byte is compared, and the results aggregated). Is the same necessary for asymmetric signature algorithms such ...
1
vote
1answer
244 views

Deterministically generate a RSA public/private key pair from a passphrase (with sufficient entropy)?

Is it possible to deterministically generate public/private RSA key pairs from passphrases? Would giving the (key generating) algorithm data made from key-stretching the passphrase (instead of a ...
0
votes
1answer
102 views

Why not send the identity in the encrypted message?

I've recently started reading the book "Applied Cryptography" written by Bruce Schneier. Quite a few times I stumbled across protocols who send the identity outside of the encrypted message (see step ...
0
votes
1answer
62 views

RSA Decryption from samples

I am working on a project for a client which involves decryption of data which was encrypted using RSA. The system in question retains three independent copies of each data-set, but each copy is ...
3
votes
1answer
398 views

RSA key pair generation and FIPS 140-2, 186-4

I need to securely generate RSA key pair and I need to have access to private exponent in order to process it further. What's the difference in FIPS 140-2 and FIPS 186-4 in connection with RSA key ...
0
votes
2answers
86 views

What does variable-base point/scalar multiplication mean in ECC?

I am a bit confuse about the term, variable-base point/scalar multiplication, in Elliptic Curve Cryptography. What I have understood so far. It means that the base or point on EC is variable/unknown. ...
4
votes
1answer
147 views

Can the same random number be used in encryption and signing?

In several public key algorithms, the person running the algorithm must generate a random number (that's separate from the key). Can this random number be the same for an encryption and a signature? ...
1
vote
0answers
61 views

Security implications of public nonce

I'm planning to use the crypto_box() functions of Nacl (or, alternatively, the crypto_box_easy() functions of libsodium) to ...
0
votes
0answers
46 views

What work goes into creating new asymmetric cryptosystems?

It's seems to me that it is rather easy to create a symmetric encryption algorithm (though not necessarily a secure one). They're a dime a dozen. The number of asymmetric encryption algorithms ...
4
votes
2answers
137 views

Randomness re-use in LWE encryption scheme

Let me describe the scheme first, it is the scheme proposed by O. Regev when he introduced the LWE assumption. $sk = \textbf{s} \in \mathbf{Z}_q^n$ $pk = \textbf{A}\textbf{s}+\textbf{e}$ where ...
1
vote
2answers
100 views

ECDSA Public key randomness

If I have a 256bit ECDSA public key how likely is it that the same public key will be generated by another person. Will it take on average 2^256 tries to generate same public key? If I xor the first ...
1
vote
1answer
83 views

RSA Key composition

I'm trying to figure out how it is composed the RSA key. Follow what I know : For a RSA 2048, 2048 is the bit length of the module. The public key is composed by $(e,M)$ when $e$ is the public ...
1
vote
1answer
77 views

Questions about updating the secret key of RSA?

I want to update the secret key of RSA. I understand there exists a common modular attack on RSA. Precisely, if adversary knows $(e_1, m^{e_1})$ and $(e_2, m^{e_2})$, where $e_1$ and $e_2$ are the ...
4
votes
2answers
260 views

Can we say that if $P=NP$ there is no CPA secure public key encryption?

I've learned that public key encryption is based on the problem of Discrete Log (as regard to group theory) which believed to be hard. But, can we say that it doesn't matter on which problem our ...
2
votes
1answer
71 views

How to construct the blind factors in practice?

I'm Implementing a protocol that uses masking techniques (or blinding factors), so we can mask a value $y_0$ as $m_0=y_0 \cdot r_0$ where $y_0 \in \mathbb{Z}_p$ and $r_0 \stackrel {R}\leftarrow ...
-2
votes
5answers
224 views

Is symmetric encryption no longer necessary?

Here is it: Symmetric encryption is no longer necessary, because all security services can be implemented with public-key cryptography. Moreover, in public key cryptography the operations for ...
0
votes
0answers
90 views

Strategies for securing public key storage on software

I´m kind of new in this so I apologize in advance for any noob mistakes (feel free to point it out) We are developing a licensing mechanism on our software, and I would like some advice. The ...
0
votes
2answers
183 views

Client-Server application how can data be encrypted so only clients can read it

Requirements We are building a system that connects multiple clients through a restful API. It allows the creation of groups of trusted clients. We need a way to store group shared data encrypted ...
0
votes
1answer
42 views

Using Permutation polynomial to compute a MAC

Is the following MAC secure? For a block $y_i$ in a file, we defined a MAC as follows: $Mac_i:PRF(k,i) \cdot g^{y_i \cdot r_i} \bmod p$. Where $p$ is a prime number, $g \in \mathbb{G}$,$PRF(k,i)$ is ...
8
votes
2answers
752 views

Can RSA encryption produce collisions?

In RSA, a message is encrypted by $m^e \pmod N$. $N$ is the modulus, $m$ is the message and $e$ is the public exponent. (I know that $m$ should not be greater than $N$.) My question is, can $m^e$ be ...
1
vote
1answer
275 views

Can public key be recovered from ciphertext & encrypted private key?

I'd like to implement something like a write-once public/private encrypted shared secret (no better quick description for the lack of terminology knowledge). I guess, I'm trying to implement HSM. The ...
5
votes
3answers
2k views

Why should the RSA private exponent have the same size as the modulus?

Consider the generation of an RSA key pair with a given modulus size $n$ and a known, small public exponent $e$ (typically $e = 3$ or $e = 65537$). A common method is to generate two random primes ...