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
0
votes
0answers
31 views

Am I Doing RSA Correctly?

I am trying to figure out how to complete RSA manually. I am trying to encode a simple block message (Mi). I used CrypTool to determine the encryption. When I "manually" computed the ...
-1
votes
0answers
14 views

In the following network diagram, nodes A, B, C, and D have data to send to each other

How many keys are required such that the four nodes can communicate with each other in a bidirectional secure way using a symmetric encryption algorithm? How many keys are required if the symmetric ...
1
vote
1answer
23 views

Verify that x, y coordinates given as hex string are valid points on an Elliptic Curve [duplicate]

Given the following information: "curve": "P-256", "qx": "729C51D177EBE2079A0FB7B0B3C2145159CF81EC61960E642A1744719AA9F913", "qy": "...
15
votes
2answers
6k views

Can or can not D-Wave's quantum computers use Shor's and Grover's Algorithm to find encryption keys? Why?

I read that a company called D-Wave Systems has and is manufacturing quantum computers of 128 qubits. Can they or can they not use Shor's and Grover's algorithms for finding RSA-keys? If they can't ...
2
votes
1answer
40 views

Volume of an NTRU lattice

Let $K$ be a number field of degree $n$ and $\Lambda^q_h=\{(f,g)\in\mathcal{O}_K\text{ : }fh-g = 0\bmod q\mathcal{O}_K\}$, where $h$ is an NTRU public key. Then $\{(1,h),(0,q)\}$ generates a lattice. ...
0
votes
0answers
27 views

How does the public-key generation work in the multivariate post-quantum digital signature GeMMS?

There are a few steps in the public-key generation of GeMSS that I am trying to understand. The first is the below equations (1). What does "$\theta_i$ forms a basis for $\mathbb{F}_{2^n}$ over $\...
0
votes
0answers
17 views

Decrypt encryptedKey session key using - AES-128 - PKCS-1#rsaes-kem-kdf2-kw-aes128

I have basic knowledge about how encryption algorithms work such as RSA, AES and so on. I have an XML response encrypted with both AES and RSA. I tried using OpenSSL to decrypt with several steps but ...
1
vote
1answer
26 views

Encrypted verifiable schema with hidden content

I'm having a problem with an encryption scheme. There are two entities, $A$ and $B$. $A$ give a simple message $m \in [0,1]$ to $B$. $B$ should generate an encrypted message of $m$: $e=Enc_{pk}(m)$ ...
0
votes
0answers
101 views

Given $e$ and $d$, find $\phi(n)$

Let's say we have just RSA public and private exponents $e$ and $d$ but not the corresponding modulus $n$. Is there a method to find $\phi(n)$? This is for a CTF challenge. I am not concerned about ...
1
vote
1answer
195 views

Code used for McEliece cryptosystem

In the McEliece cryptosystem, is choice of the code known to the attacker? And if a structural attack succeeded and the attacker found the generator matrix of the code, how did the attacker decode the ...
0
votes
0answers
50 views

Do you agree or disagree with mentioned statement? [closed]

Theoretical foundations of cryptography are more interesting or relevant to cryptography than e.g. what physical theories about the “ unification of the fundamental forces” are to engineering bridges. ...
0
votes
1answer
37 views

RSA encryption key conditions

I recently read the RSA cryptosystem but now I confused in key generation phase. According to the Euler's Theorem, we have just one condition: e.d = k.ϕ(N) + 1 where: "e" is encryption ...
5
votes
2answers
249 views

Breaking RSA with Factor in Range of $\sqrt{N}$

Suppose on of the RSA prime factors $p$ is the range of $\sqrt{N}$, in particular it holds that $|p-\sqrt{N}|<\sqrt[4]{N}$ I want to show that RSA can be broken in time poly(log N) Given hint: $N = ...
1
vote
3answers
109 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 ...
4
votes
2answers
135 views

Why aren't public-private keys sufficient to build a block chain? Why do we need proof of work/stake?

Taking the simple case of Bitcoin here: If all nodes can validate published transactions by checking the signature (created using the private key of the sender) of the transaction against the public ...
0
votes
0answers
19 views

How to assert identity in a secure and non-copyable way?

Say I have the Mona Lisa, and I want to stick an RFID tag or similar mechanism on a back corner of the painting to verify this is the real Mona Lisa and any others are forgeries. What mechanism would ...
0
votes
2answers
85 views

What exactly is asymmetric about 'asymmetric cryptography'?

What exactly is asymmetric about 'asymmetric cryptography'? https://www.sysadmins.lv/blog-en/digital-signatures.aspx says: "In other words, anything that is encrypted by a public key can be ...
125
votes
6answers
88k views

Should we sign-then-encrypt, or encrypt-then-sign?

Frequently, we want to send messages that are (a) encrypted, so passive attackers can't discover the plaintext of the message, and (b) signed with a private-key digital signature, so active attackers ...
0
votes
0answers
14 views

What is the difference between openssl functions - d2i_PublicKey & d2i_PUBKEY and what scenarios decide which should be used?

What is the difference between openssl functions - d2i_PublicKey & d2i_PUBKEY and what scenarios decide which should be used?...
0
votes
0answers
28 views

How about, when using public key cryptography, one encrypts, signs, and encrypts again?

I suppose one reason for prepending the name would be that a malicious Bob could pose as Alice by encrypting the exact same message + Alice's signature using Charlie's public key, and trick Charlie ...
1
vote
3answers
1k views

Factoring an RSA modulus given high bits of a factor

I have {e,N,C} and part of p; can I get q from this example : ...
1
vote
0answers
38 views

TLS 1.3 Handshake - Usage of MAC and Digital Signature for CertificateVerify and Finished Message

I was wondering, why the TLS 1.3 handshake employs two different 'messages' that compute an authentication code over the whole handshake. As far as I understand, the CertificateVerify "message&...
3
votes
1answer
191 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 ...
1
vote
0answers
16 views

Proving the security of the public key BGV scheme

The security proof basically comes down to the following based on this paper. We want to show that two distributions are statistically indistinguishable. Say we have that $a,a′,x,x′$ are drawn from an ...
1
vote
0answers
23 views

Hashing Public Key of Lamport or Winternitz OTS

For the Lamport or Winternitz public keys, couldn't one just hash down the large public key to 256 bits in order to greatly reduce the public key size while still having basically the same security? ...
0
votes
0answers
31 views

Complete taxonomy of public-key cryptosystem primitives

This question is similar to “What primitives are needed to generically implement public-key cryptography?”, but with a more applied/contingent focus: That question asked about what's theoretically ...
0
votes
0answers
26 views

How does a forward search attack work? [duplicate]

I just came across this term “forward search attack” while reading about Interchange key and Session key. The book mentioned that using session key helps to prevent attacks such as forward search ...
1
vote
1answer
150 views

What does $\text{PK}=\text{pk}\oplus\text{H}(\text{opk})$ represent in this paper?

In Lu, Au and Zhang's 2019 paper (Linkable) Ring Signature from Hash-Then-One-Way Signature, they …extend [M. Abe, M. Ohkubo, and K. Suzuki's 2019 1-out-of-n signatures from a variety of keys] ...
0
votes
0answers
48 views

How can I enhance the security level of my RSA code?

I am trying to enhance the security level of my RSA code that I implemented in Python. I tried to add blind operation, randomized algorithm to my RSA code (separately, not together), but I am not sure ...
0
votes
2answers
195 views

What is the name of this public key encryption cryptosystem?

I have been trying to find the name of a public key encryption cryptosystem that I learnt as an introduction to cryptography some years ago but the only scheme I could find was something similar but ...
18
votes
3answers
2k views

Why does key generation take an input $1^k$, and how do I represent it in practice?

In my lecture, the lecturer said: Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public ...
0
votes
1answer
61 views

Is cypher.js secure for sensitive data? [closed]

Is this library secure? Link to github repo Here's his explanation: Cypher does not encrypt through allocation based on mapping patterns. Cypher encryption process is completely mathematical and ...
42
votes
5answers
141k views

What is the SSL private key file format?

I was researching about how to encrypt with RSA. I understood everything but not the format of the private keys. In the phpseclib (RSA in PHP), you can import your private key (private.key format) ...
0
votes
1answer
61 views

Is this protocol secure?

Before anyone freaks out, this is purely speculative and I am not developing a cryptosystem! I can't see anything wrong with this protocol, but my knowledge of cryptography is rather superficial: ...
6
votes
2answers
2k views

Do certificates need to be stored as encrypted?

The titles says most of what we're confused with. Here's some details: On an embedded device, we have a microcontroller and external flash memory. This memory can be easily read and written to in ...
3
votes
1answer
98 views

What is the simplest post-quantum asymmetric cryptographic algorithm for key exchange?

This question has been burning in the back of my head for the past few days, and a quick Google search doesn't yield any usable results. As the title suggests: What is the easiest-to-understand post-...
0
votes
1answer
93 views

Are zero knowledge proofs alternative private key encryption? [closed]

Are they the alternative to private keys. If I understand correctly, because of the increasing computational power in today's world, zero knowledge proofs are more safe than private keys ? Are these ...
1
vote
2answers
114 views

RSA algorithm implementation

$$m^{ed} \equiv m \bmod n$$ $n =pq$, so by Chinese Remainder Theorem it is equivalent to $$m^{ed} \equiv m \bmod 𝑝, m^{ed} \equiv m \bmod q$$ where $n=p\cdot q$ So how did 2 come from 1 by the ...
41
votes
12answers
11k views

Is it possible to create a “digital seal” to tell if a document has been opened?

So, in real life we have a handful of ways to leave a physical mark on a packet to know if it has been opened without authorization (eg. you can use 'opened' security tapes, or you can put a signature ...
1
vote
1answer
94 views

RSA public key identification

Consider a multi party system where public keys of all receivers are known. Server wants to send message to one of them using (textbook?) RSA. Adversary is given ciphertext and even Message to be send,...
0
votes
1answer
83 views

How many points in RSA, such that $m^e = m \bmod n$

For every RSA-cryptosystem, there exist some messages $m$, for which it holds that $m^e \equiv m \pmod n$ As to the question, how many such messages exist, this question has already been asked and ...
2
votes
1answer
116 views

Derive one public key from ECDH when the other and and the shared secret is known

Suppose we have an elliptic curve Diffie-Hellman key exchange protocol, where Bob and Alice have public keys $pk_{Alice}= [sk_{Alice}]G$ and $pk_{Bob}= [sk_{Bob}]G$ ($[.]$ elliptic curve "...
2
votes
1answer
132 views

Current situation of bilinear pairing protocols

The bilinear pairings are considered as the key enabler for many novel cryptographic protocols, such as three-party one round DH[1], shorter signatures and certificateless (ID-based) crypto[3] , which ...
0
votes
0answers
35 views

Difficult to guess the targeted receiver

The protocol is defined as : Bob want to send message to one of his friends say $k$ friends , he does not want his others friends (except one whom he want to send message ) to tell who is targeted ...
2
votes
2answers
187 views

Can an altered RSA private key still work as the original?

I am interested in understanding public-key encryption using RSA. On the Khan Academy website, I noticed an anomaly when testing out the tutorial. I created the following public/private keys: ...
0
votes
1answer
79 views

Calculate private key from public key and r [closed]

I watched this video where somebody finds bitcoin wallet private keys using only the "sigR" value and the public key using a python script named "formula". How does this work and ...
122
votes
7answers
75k 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 ...
1
vote
1answer
48 views

How do I encrypt a bunch of messages by different authors, shared with that group of people?

I'm still getting my head around public/private key cryptography, and I can't quite work out how to ask the right question to get an answer for this problem, but here goes! Alice, Bob, Carol, and ...
6
votes
1answer
441 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)$ ...
2
votes
1answer
140 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 ...

1
2 3 4 5
38