Skip to main content

Questions tagged [dsa]

The Digital Signature Algorithm (DSA) is a United States Federal Government standard or FIPS for digital signatures. It was proposed by the National Institute of Standards and Technology (NIST) in August 1991 for use in their Digital Signature Standard (DSS), specified in FIPS 186, adopted in 1993. A minor revision was issued in 1996 as FIPS 186-1. The standard was expanded further in 2000 as FIPS 186-2 and again in 2009 as FIPS 186-3.

2 votes
1 answer
89 views

I have a non-classical hidden number problem $y = C_i - X_i \bmod n$ where the multiplier to the secret $y$ is $1$, and $128$ most significant bits of $X_i$ are known along with complete $C_i$. ...
actgroup inc's user avatar
2 votes
1 answer
130 views

I dont know if this qualifies as a cryptographic question but the equations themselves are from cryptographic implementations. I know this: $x_i = y_i*d+z_i \,mod\, m$ $x_i$ is partially known $m$ is ...
actgroup inc's user avatar
0 votes
4 answers
222 views

I'm a new student IT. I need to understand the typical digital signatures, such as DSS, DSA or other in e-commerce.
Jean Tinialaou's user avatar
0 votes
1 answer
430 views

How feasible is it if someone is able to forge a signature for any arbitrary message hashes, given the public key of a secret key? If it is feasible, then what implications would this have? What I ...
иυэł's user avatar
0 votes
1 answer
98 views

I have two different signatures $r_1, s_1, z_1$ signed with $d_1$ and $r_2, s_2, z_2$ signed with $d_2$ also I have $d_1-d_2$, my question is there any possibility that I can recover either $d_1$ or $...
иυэł's user avatar
0 votes
0 answers
22 views

Recovery of public key is possible in ECDSA using signature and hash message but who coined it first time preferably before 2005
Uday Pratap Singh's user avatar
1 vote
0 answers
101 views

This question stems up from my recent research work, I've tried different methods. Is it possible to accurately know or get the parity (even or odd) of k (nonce) using r, s and z? If yes, please ...
иυэł's user avatar
2 votes
0 answers
82 views

I'm by no means expert in the area, so I apologize for any misunderstanding. I'm aware of the signing process, which ends up producing the values (r, s, v): r - x coordinate of k*G, where k is an ...
PropzSaladaz's user avatar
0 votes
0 answers
62 views

In a scenario where the DSA signature scheme does not use a fresh random value, say $k$, for each signature, but instead updates $k$ deterministically by multiplying the previous value by $2$, that is:...
Ampere's user avatar
  • 1
1 vote
1 answer
543 views

Simple question, given a signed message and signature, if a nonce is known, then it’s possible to recover the private key. But what about doing the reverse ? I’m meaning using the private key to ...
user2284570's user avatar
0 votes
0 answers
104 views

There are a lot of papers on how to recover a private key from a nonce leakage in an ecdsa signature given a signed message. The fewer bits are known the more signatures are required. If I don’t know ...
user2284570's user avatar
0 votes
1 answer
217 views

It’s well known that in ECDSA, if two signatures are created using the same private key and the same nonce k, the private key can be recovered due to the linear ...
user2284570's user avatar
1 vote
1 answer
152 views

In ECDSA, there are two main components: the public key p and the private key d p = d * G ...
Muhammad Ikhwan Perwira's user avatar
0 votes
0 answers
94 views

Sorry if my question is not fully related to the mailing list. I'd like to show the interoperability between openssl 3.4.1 and ...
BrunooMaartin's user avatar
4 votes
1 answer
608 views

I'm completely new to elliptic curve math and modular arithmetic but I was chewing over the signing/verification equations for ECDSA: $$ \frac{H(m) + rd}{k} = s $$ $$ \frac{H(m)}{s} \cdot G + \frac{r}{...
Drazen Bjelovuk's user avatar

15 30 50 per page
1
2 3 4 5
38