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
1
vote
2answers
37 views

Is it fair to say that MACs use a signing algorithm?

The Wikipedia page on MAC calls the algorithm that is used to generate the MAC as a signing algorithm. Is that a fair use of that term? Can we then say that ...
7
votes
2answers
382 views

Calculating RSA Public Modulus from Private Exponent and Public Exponent

If I know the private and public exponents ($d$ and $e$) of an RSA key pair, is it possible to (efficiently) calculate the public modulus $n$?
5
votes
3answers
1k views

What is the purpose of Pseudorandom Function Families (PRFs)?

I'm currently in a course in Cryptography, and was wondering why pseudorandom function families exist at all. If there existed one pseudorandom function f(x), based on its definition, could that not ...
0
votes
0answers
24 views

How does CL signature work?

I'm studying the CL signature that how can it works. However, I cannot understand how equation (42) is calculated. What is the last three factors? The value T is as follows: $$T \leftarrow(A')^{\...
1
vote
1answer
60 views

Sensible amateur usage of web crypto API

I want to know if my usage of the web crypto API is sensible. I want to use it for symmetric and public-key encryption and decryption, and signatures, but as a non-expert I am scared by the warning on ...
0
votes
0answers
68 views

Can we defends against RSA Timing attack when we use java.math.BigInteger.modPow?

I think that Montgomery and sliding window techniques are applied within java.math.BigInteger.modPow (and more specifically ...
3
votes
2answers
70 views

How to generate Multiple Encryption Keys for use in RSA polymorphic multiplication

I am a long time scroller, first time poster in the crypto stack. I've recently been finding myself leaving the realm of mainstream/standard crypto (imo that consists of symmetric/asymmetric ...
1
vote
1answer
48 views

Creating nested messages in OpenPGP

I need to create a nested message in OpenPGP (my understanding is that the protocol itself should support it). Let's say I have Payload ("Time in Lordran is ...
4
votes
2answers
2k views

Recovering private key from Secp256k1 signatures

I've seen many answers here and many articles that says we can recover the private key from reused R signatures. But, what if the r,s signatures are different in transaction of bitcoin then is there a ...
0
votes
0answers
21 views

Could someone please explain the implementation of public-private key encryption for storing passwords?

As someone new to cryptography,I have a question about how logins work on websites. I understand mathematically how asymmetric encryption works and how https web requests work to securely send ...
0
votes
2answers
99 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 ...
0
votes
0answers
56 views

Which public-key cryptosystems are used the most?

Does anybody know if there is some kind of measure on how often public-key cryptosystems like El Gamal, RSA,... are implemented. Which ones are most common?
2
votes
1answer
284 views

Revoke a GPG key using previously generated revoke certificate after renewd (change expiration date)

I have few sub-questions Do secret keys get expired, or just the public key gets expired? Do I have to back up the master sec key each time I renew it? For an ...
0
votes
0answers
17 views

How do NTLMv2 hashed passwords work?

We have an application which embeds NTLMv2 password hashes into its configuration. In attempting to assess the security of this practice, I'm not finding much straightforward information about how an ...
1
vote
2answers
57 views

How to derive a private/public keypair from a random seed?

For RSA, my understanding is that large primes are found randomly to build a private/public keypair. If a static seed can be used in that random search process, it should be possible to derive the ...
4
votes
2answers
257 views

Key Exchange vs Key Encapsulation

From what I understand, the steps of a key exchange protocol are Alice and Bob each encrypt something using their public key and private key and send the result to each other Alice and Bob each do ...
14
votes
2answers
2k views

Can I still use insecure curves/ciphers for time relevant encryption?

Can Ciphers that are known to be insecure because their keysize is considered too small still be used in appliances that have a tight decryption timeframe? In particular I am looking at ECC2K-130. ecc-...
0
votes
1answer
43 views

What if the CSR is intercepted in transit while sending it to CA?

I was studying PKI the other day and I had a serious thinking about the following question. What is CSR? - It is a block of encoded text that is given to the CA when applying for an SSL certificate ...
0
votes
0answers
22 views

Authentication using a nonce

For an authentication problem imagine the following scenario with two devices: 1 server 1 client. The client starts a conversation with the server and sends him his public key. All public keys in ...
6
votes
2answers
294 views

Why does Encrypt-Then-Sign not yield a CCA-secure public-key encryption scheme?

In symmetric cryptography, combining an IND-CPA secure symmetric encryption scheme with a secure MAC with the encrypt-then-MAC method yields a IND-CCA secure symmetric encryption scheme. I am trying ...
3
votes
1answer
51 views

What is the exact meaning of the public key cryptosystem properties in New Directions In Cryptography by Diffie and Hellman

I'm quite new to cryptography and don't have much mathematical knowledge. I'm studying cryptography, especially public key algorithms. I have some basic knowledge of public key algorithms so I know ...
1
vote
0answers
41 views

What's happening with IEEE 1363?

IEEE 1363 (or more precisely, IEEE 1363-2000) - the IEEE Standard Specifications for Public-Key Cryptography - has been inactive for so long, that it is now with status Inactive-Reserved by IEEE, and ...
0
votes
0answers
33 views

What is the code when looking at the LPN problem?

We are given the problem in this question. We know that we have to use the algorithm $A_D$ in order to get $e_i$. Our idea is that we construct a vector $l$ of $l_i$'s by getting $n$ samples from the $...
4
votes
1answer
44 views

Can libsodium's X25519 encryption construction be generalized?

It is my understanding that libsodium's sealed_box is based on X25519, a Diffie-Hellman function: By combining the X25519 key agreement with a symmetric cipher and having a recipient derive the ...
0
votes
1answer
80 views

TLS 1.2 AES-GCM decryption problem

I'm trying to decrypt a PCAP encrypted with TLS 1.2. I have the private key and Wireshark is able to decrypt the data so what I am doing should work but there is obviously something wrong. The ...
3
votes
0answers
110 views

Solving LPN using algorithm for syndrome decoding

Given an algorithm $A_D$ which solves an instance of the decoding problem $e \in \mathbb{F}_2^n$ in time $T_D$ given a parity check matrix $H \in \mathbb{F}_2^{(n-k)\times n}$ and a syndrome $s \in \...
0
votes
0answers
45 views

How to get fixed m from different pairs of n, e and c in RSA?

In RSA cryptosystem, if I have two (or more) pairs of public key and also the corresponding ciphertexts, can I get the fixed message from them? I cannot think up any good idea for now.
6
votes
1answer
133 views

Why is recipient hashed in this Sign/Encrypt/Sign proposal?

Own research In my journey into trying to understand PGP, and public key signing and encryption as a whole, I came across this answer on CE. It is an answer to a question with the title: Should we ...
115
votes
7answers
68k views

How big an RSA key is considered secure today?

I think 1024 bit RSA keys were considered secure ~5 years ago, but I assume that's not true anymore. Can 2048 or 4096 keys still be relied upon, or have we gained too much computing power in the ...
0
votes
0answers
18 views

Can we use HMQV in an asynchronous setting?

Following the HMQV paper, to perform a key-exchange, Alice ($\hat{A}$) and Bob ($\hat{B}$) perform the following: $\hat{A}$ generates the long-term key pair ($sk_A= a$, $pk_A =g^a$) and the ephemeral ...
6
votes
2answers
544 views

Does Cramer-Shoup allow re-randomization?

Is it possible to re-randomize a ciphertext with the Cramer-Shoup System? I have some Cramer-Shoup ciphertexts and i want to re-randomize them, so they look different and are unlinkable to there ...
28
votes
2answers
28k views

Why is asymmetric cryptography bad for huge data?

I've been told that asymmetric cryptography requires that the message to be encrypted be smaller than its key length. Why is this? I know about hybrid encryption, which uses symmetric encryption to ...
0
votes
0answers
31 views

Encrypt encryted message vs DS

In digital signature The encrypted message is signed by the sender private key and verify using sender public key. The encrypted message is encrypted with another public private key pair which the ...
1
vote
1answer
46 views

Interchangeability of hash outputs

I'm looking at tweetnacl, its crypto_sign_keypair, crypto_sign, and crypto_sign_open ...
1
vote
0answers
56 views

is it possible to achieve authenticated key agreement without using PKI or pre-shared secret?

After reading different techniques to achieve authenticated key-agreement (X3DH, HMQV, Asynchronous Ratcheting tree, An efficient protocol for authenticated key agreement, I understood that all these ...
1
vote
0answers
31 views

Forging a new secret key in RLWE

In a RLWE setting where you are given a secret key $s$ and an associated public key $pk = (p_0,p_1) = (-(p_1s+e),p_1)$, is it possible/easy to forge a new secret key $s'$ such that $p_0+p_1s'$ has a ...
0
votes
0answers
57 views

Signing a secret key with ECDSA

Assume Alice and Bob both separately come into possession of the same randomly generated 256 bit secret key. Alice has Bob's public ECDSA key. Alice wants to verify that Bob has possession of the ...
0
votes
2answers
81 views

Implementing BFV Relinearization

I'm currently working on a Python implementation of the BFV[12] cryptosystem. I got to a point where key generation, encryption, addition and decryption works as expected. Where I'm struggling with ...
3
votes
1answer
155 views

How does the key agreement process take place in Virgil E3Kit SDK for end to end encryption?

I'm using Virgil E3Kit SDK to implement end-to-end encryption in my App. Their E3Kit SDK is very effective and not too hard to understand, but I still don't understand how does the key agreement ...
2
votes
0answers
95 views

Fixed point in RSA encryption

Some papers count the number of the fixed points in the RSA encryption algorithm. They're a minimum of 9 and the real number depends on the smoothness of primes $p$ and $q$. It very unlikely that a ...
15
votes
3answers
8k views

How many KDF rounds for an SSH key?

What is the best practice on choosing how many key derivation function (KDF) rounds/iterations when generating an SSH key pair with ssh-keygen? Am I correct in saying that it is unnecessary if the ...
0
votes
1answer
175 views

Asymmetric Cryptography decryption

I am new to cryptography, i know essential part of asymmetric cryptography but is it possible to decrypt 617 decimal digits (2,048 bits) with RSA ? How it can be factored?
4
votes
1answer
1k views

What's the main difference between Pohlig-Hellman and RSA?

Both Pohlig-Hellman and RSA perform encryption and decryption by exponentiation modulo some integer ($p$ prime for PH, $n$ composite for RSA). They both use a key $e$ as the exponent to encrypt a ...
2
votes
1answer
361 views

Can I use the secret part of a asymmetric encryption keypair as a symmetric encryption key?

Background I'm working on a framework for crypto-based authentication and authorization that is largely inspired by the way Keybase's Teams product works. Keybase uses the same process to generate ...
-1
votes
1answer
47 views

Bruteforce attack on a 64bit computer [duplicate]

How would I attempt to brute force a RSA encrypted message with a 64bit computer if it the memory can't put up with calculations bigger than 64bit? Without going that far to attempting to crack it, ...
21
votes
3answers
17k views

Why is the P-521 elliptic curve not in Suite B if AES-256 is?

In the NSA's document, "The Case for Elliptic Curve Cryptography" (archived), we have ...
2
votes
0answers
102 views

Verify commitment C commits to the same value that E encrypts

Given the following (using additive notation): $G$ - generator of an elliptic curve group of order $q$ $s$ - secret drawn uniformly from the distribution $1..q$ $k$ and $K$ - a private public keypair ...
62
votes
3answers
41k views

Impacts of not using RSA exponent of 65537

This RFC says the RSA Exponent should be 65537. Why is that number recommended and what are the theoretical and practical impacts & risks of making that number higher or lower? What are the ...
18
votes
2answers
1k views

Can deterministic ECDSA be protected against fault attacks?

In a paper by Barenghi and Pelosi, it was described that fault attacks could be used to derive the secret key when using deterministic ECDSA as described in RFC6979 by @Thomas_Pornin Deterministic (...
1
vote
1answer
42 views

Knowledge of discrete log is needed in the proof of Cramer-Shoup public key scheme?

In the proof of the Cramer-Shoup public key scheme [1], I understand that the adversary's view can be seen as equations such as $\log c = x_1 + w x_2, \log d = y_1 + w y_2$ and so on (equation 1 and 2 ...

1
2 3 4 5
34