Skip to main content

Questions tagged [secp256k1]

This tag should be used for anything related to the secp256k1 algorithm used for Bitcoin's public key cryptography.

Filter by
Sorted by
Tagged with
0 votes
0 answers
34 views

Subtraction of inverse points in secp256k1

In pure math given: k = 10 l = -10 k + l = 0 k - l = 20 Now in secp256k1 $K = k*G$ $L = l*G$ $K+L = O$ $K-L = O$ Why do we get identity point on subtraction since: ...
dred28's user avatar
  • 13
1 vote
1 answer
75 views

Secp256k1 giving y-value for inverse of point

Given a secp256k1 point $P$ with scalar 3 where: $P = 3*G$ You get a point with co-ordinates: ...
dred28's user avatar
  • 13
0 votes
1 answer
69 views

What's wrong with BIP32 from NIST's perspective?

BIP32 is listed as Non-Approved Security Functions (see page 29 in 1). I could not find any problem with the primitives used in BIP32. HMAC-SHA512: This is a FIPS-approved algorithm (see page 25 in 1)....
user's user avatar
  • 183
1 vote
0 answers
47 views

Can the ability to sign arbitrary messages expose the private key?

Consider a system that consists of a black box (some abstraction layer with perfect sandboxing). The black box contains a private key that cannot be extracted by request, but the black box exposes an ...
The Quantum Physicist's user avatar
1 vote
1 answer
149 views

What’s the fastest known Koblitz curve addition law for FPGA that maximizes the per-LUT throughput?

The addition or multiplication laws used by large mainstream libraries achieve faster speed by using many many more operations in order to avoid larger numbers. And my problem is here: faster speeds ...
user2284570's user avatar
1 vote
2 answers
117 views

Is it safe to reuse the same scalar when doing direct scalar multiplication on Koblitz curves?

Let $s$ be a private key and $k=intAsScalar(s)$. Finding $s$ from $P_k=[k]G$ involves solving the Elliptic curves discrete logarithm problem. But what if the same $k$ is also used for performing 1 or ...
user2284570's user avatar
1 vote
1 answer
56 views

The comparison of public keys corresponding to signatures based on secp256k1

Can two signatures based on the elliptic curve secp256k1 be compared to determine if they use the same public key without recovering the public keys?
deowne chen's user avatar
-2 votes
3 answers
171 views

can we modify the prime field by increasing it in secp256k1?

If in ECDSA secp256k1 we have the prime field p=2256 - 232 - 29 - 28 - 27 - 26 - 24 - 1, can we increase it to p=2256, if we keep the double and add operations the same, the curve equation the same ...
MR Man's user avatar
  • 1
1 vote
1 answer
97 views

How to use smt solvers in order to restrict the possible key search where a portion of the private key and a portion of the public key hash is known?

I’m in the following situation : I’ve a portion/first bytes of a private secp256k1 security key such as it would take minutes to fully recover it through Pollard’s Kangaroo if I had the public key. ...
user2284570's user avatar
3 votes
1 answer
1k views

When incrementing a private key by 1, by how much is the public key Incremented?

If you have a secp256k1 keypair and you increment the private key by 1, then a faster way to compute the new public key is to perform an addition on the previous public key. But by how much? Some ...
user2284570's user avatar
0 votes
1 answer
172 views

How to know if an ECC public key is y or -y

I'm a beginner still learning how ecc works... And i think I understand that in secp256k1 public keys there is something called addictive and negative inverse for example private key:- ...
Melwyn's user avatar
  • 1
1 vote
0 answers
46 views

How to know the number of digits in the decimals place in elliptic curve division result?

$p$ - is the order of the finite field $n$ - is the order of the group. Private keys can range from $1$ (the generator point $G$) to $n - 1$. All the private keys ($Priv$) lie in certain ranges of 2. $...
Maltoon Yezi's user avatar
0 votes
1 answer
112 views

Elliptic Curve Cryptography: Point Multiplication by 3 on secp256k1 Curve

Is there a direct non-iterative formula for point multiplication by 3 in the secp256k1 elliptic curve just like point multiplication by 2 (point doubling)? If such a formula exists, could you explain ...
Favour's user avatar
  • 41
4 votes
1 answer
2k views

In Bitcoin, given half the 52-character private key in WIF format, is it possible to reconstruct the whole private key?

Given the following two preconditions: It is almost impossible to reconstruct a bitcoin private key if an attacker only has one half of the private key as well as the public key. It is almost ...
Ohumeronen's user avatar
1 vote
0 answers
64 views

Using Deterministic ECDSA (secp256k1) Signature as a Cipher Key in Symmetric Encryption

I'm exploring the security implications of utilizing a deterministic ECDSA signature as a cipher key for symmetric encryption and would appreciate insights from the community. Here's the setup I'm ...
landabaso's user avatar
  • 111
2 votes
1 answer
160 views

Loop back or cyclic nature of secp256k1 curve

I am working with point addition and scalar multiplication on the secp256k1 curve for points $(x,y)$ or public keys to derive the next public key scalar k times further from it. Actually when I use a ...
Aflatoon's user avatar
1 vote
1 answer
137 views

How can we derive G from P and N?

I would like to find the fastest way to derive G for secp256k1 and secq256k1 curves, does anyone know the method, equation? Edit: I'm interested to know how can this happen, when we use n/2 of ...
Aggregator's user avatar
0 votes
1 answer
102 views

Z-coordinate in Jacobian coordinates

secp256k1 Generator:(G_X, G_Y, 0x1), secp256k1 any public key using affine coordinates : B=(X, Y) secp256k1 any Public key using jacobian coordinates:BB=(P_X, P_Y, P_Z) (B's private key)==(BB's ...
bnsage123's user avatar
1 vote
2 answers
362 views

Performing Point Division on secp256k1 Elliptic Curve for odd Integers

I'm exploring elliptic curve cryptography, specifically on the secp256k1 curve. I've come across the concept of point division by integers using scale multiplication, my question is how can I devide a ...
Favour's user avatar
  • 41
3 votes
0 answers
192 views

EC public key with leading zeros

Let us take example of secp256k1 curve. The current known public key with most leading zero (in x cordinate) is: ...
madhurkant's user avatar
6 votes
2 answers
2k views

Are curve secp256k1 ECDSA signatures distinguishable from random data?

Are the 64-byte curve secp256k1 ECDSA signatures distinguishable from random data? I.e. Given a random private key and random data, will there be patterns? Is there a proof or reasoning for this?
fadedbee's user avatar
  • 938
0 votes
3 answers
273 views

Understanding Point Negation in secp256k1 Elliptic Curve

I'm exploring the secp256k1 elliptic curve in the context of cryptography and encountered the concept of Point negation. I would appreciate clarification on what point negation means in this context. ...
Favour's user avatar
  • 41
0 votes
1 answer
337 views

Implementing Floor Division on secp256k1 Elliptic Curve in Python

I understand that the // operator is used for floor division in regular arithmetic result = 7 // 3 # This will result in 2 but ...
Favour's user avatar
  • 41
1 vote
1 answer
376 views

Finding scalar in scalar multiplication on secp256k1 elliptic curve

In elliptic curve cryptography using the secp256k1 curve, how can I determine the number of times the base point $G$ has been multiplied to derive a new point? The formula is as follow: $k * G = Q$ ...
Aviril Smith's user avatar
2 votes
0 answers
140 views

Can lattice attack work MSB or LSB are unkown but 16 bytes of private key are known?

I have been reading about lattice attack on ECDSA when partial bits of nonce are known for amount of signatures, So i went through some source code trying to understand how it works. First of all, ...
Alexio puk2sefu's user avatar
2 votes
1 answer
397 views

Point halving formula for Koblitz curve over prime field

Consider a Koblitz elliptic curve over a prime field $\mathbb F_p$, with equation $y^2=x^3+b$, prime order $n$ close to (but different from) $p$. This includes secp256k1, secp224k1, secp192k1, ...
angelo's user avatar
  • 21
-1 votes
1 answer
292 views

How to convert (Rx1 and Ry1) to (Rx2 and Ry2)

I'm working with the secp256k1 elliptic curve and have point doubling and point addition formulas for this curve. If a point is given $Q_x$ and $Q_y$ ...
Aviril Smith's user avatar
0 votes
0 answers
70 views

Same message different nonce but similarities in r value of the signatures(r,s)

I'm studying a case where when i sign a same message with the same private key and a different nonce, i sometimes get signatures (r,s) where r values share some similarities (same numbers at the same ...
PrinceZee's user avatar
  • 101
1 vote
1 answer
638 views

How to determine the prefix of a SECP256K1 compressed public key

I need to store a public key in a variable of maximum 32 bytes. I recover the compressed key and remove its prefix, but then I have to do the opposite: I have to rebuild the compressed address from it ...
Sino's user avatar
  • 11
2 votes
2 answers
195 views

is it possible to calculate the difference between 2 public keys of secp256k1

I am inquiring about the feasibility of calculating the point difference between two distinct secp256k1 elliptic curve points. Given the nature of secp256k1, which is widely used in cryptographic ...
Melwyn's user avatar
  • 31
2 votes
1 answer
117 views

Does using only one sign of secp256k1 publc keys weaken security?

As far as I understand, compressed public keys of secp256k1 can represent points either above or below the X axis, depending on whether they begin 0x02 or 0x03. Am I correct in thinking that if you ...
fadedbee's user avatar
  • 938
1 vote
2 answers
68 views

In ECDSA over K256, Why R.x should be less than the subgroup order, not field order? But in BIP340 over K256, should be less than field order

I understand that R.x is a field element. I don't understand why in ECDSA verification ie. FIPS 186-5 section 6.4.2 step 1, we check whether r is less than subgroup order. If it has something to do ...
Atonal's user avatar
  • 155
0 votes
2 answers
191 views

Trouble detecting cyclic group order crossovers in SECP256K1

There's a problem in detecting whether the sum of public key addition has crossed the cyclic group order boundary For this example, think of public keys $Pub$ as private keys $Priv$, (private scalars),...
Maltoon Yezi's user avatar
3 votes
1 answer
272 views

Does ECDH on secp256k produce a defined shared secret for two key pairs, or is it implementation defined?

Rust and NodeJS implementations of ECDH on secp256k1 produce different shared secrets, when using identical keypairs: NodeJS: ...
fadedbee's user avatar
  • 938
1 vote
1 answer
82 views

Can anyone explain the algorithm that OpenSSL uses to add two points on an elliptic curve?

I am trying to understand how OpenSSL adds points on an elliptic curve. I have understood from here that ossl_ec_GFp_simple_add() is where the addition op works. Can anyone explain the algorithm used ...
Knm's user avatar
  • 11
2 votes
1 answer
919 views

What is the relationship between NIST and secp256k1?

While exploring secp256k1, I came across what seems like the official definition at https://www.secg.org/, specifically in https://www.secg.org/sec2-v2.pdf. In terms of authorship, the document only ...
aryzing's user avatar
  • 123
2 votes
2 answers
201 views

Can you find a secure curve defined over the scalar field of secp256k1?

Is it possible to find a secure curve which's base field is the scalar field of secp256k1? In general, can you find a secure curve defined over the scalar field of any secure curve? (For example, a ...
RobinLinus's user avatar
2 votes
0 answers
103 views

Safety of reusing same seed to derive secp256k1 keys and AES-256-GCM

The use case here is to deterministically generate a multi-use wallet from a single 12-word BIP39 mnemonic. Currently a standard process for deriving secp256k1 keypairs is implemented, e.g., using a ...
snsdgm's user avatar
  • 21
6 votes
2 answers
517 views

Method to break a baby Elliptic Curve analog to secp256k1

What would be the method of choice to compute the private key from the public key on a baby analog of secp256k1, say with $p$ and $n$ 144-bit? What would be the pros and cons of Pollard's rho and ...
shy-student's user avatar
2 votes
1 answer
349 views

A property of some Koblitz elliptic curves over a prime field

secp256k1 is an elliptic curve $E$ over a prime field $\mathbb F_p$, of equation $y^2\equiv x^3+b\pmod p$, with prime order $n$. I noticed† that the different curve $E'$ over the prime field $\mathbb ...
fgrieu's user avatar
  • 142k
2 votes
1 answer
623 views

Help with adding and multiplying points on secp256k1

I'm currently working on implementing digital signatures on the curve secp256k1 (for learning purposes only), and I'm having some trouble implementing ECDSA on curve secp256k1. As I understand it, ...
Pedro's user avatar
  • 41
-2 votes
1 answer
268 views

What is secp256k1 and can we have a post quantum cryptography with that? [closed]

Please detail secp256k1 and its role in a public key cryptography. Please explain can we use it into a post-quantum cryptography and how can we do it?
Alireza's user avatar
  • 109
1 vote
1 answer
669 views

ECDSA SECP256k1 curve - same-r-value-is-used-for-two-different-addresses

Edited: changing the notation according request by fgrieu. I have prepared 4 transactions for 2 pubkeys with the same r1 and r2. properties of secp256k1: ...
Ironic's user avatar
  • 11
1 vote
1 answer
54 views

Can a quantum attacker prove that incomplete ECDSA signatures were produced with the same key?

Assume a 256-bit ECDSA private key used with Secp256k1 and SHA-256. This key signs multiple different messages in a fully deterministic manner as described in RFC-6979, so signing the same message ...
ostrich's user avatar
  • 43
3 votes
2 answers
190 views

Given multiple incomplete ECDSA signatures, what can a quantum attacker learn in the following scenarios?

Assume a 256-bit ECDSA private key used with Secp256k1 and SHA-256. This key signs multiple different messages in a fully deterministic manner as described in RFC-6979, so signing the same message ...
ostrich's user avatar
  • 43
2 votes
0 answers
41 views

Fusion auth versus jose4j library for jwt using secp256k [closed]

I am a beginner in-terms of JWT libraries in programming. How the keypair used (secp256k1) is related with the algorithmic header used for creation of JWT? And why authfusion doesn't need an ...
Benjamin's user avatar
2 votes
1 answer
157 views

Elliptic Curve - Is it possible to know whether a particular value is the result of ECadd or ECdouble?

As we know the public key is generated from the private key and the process is point addition and point double and so on. If we see a list, it would look like a list of values coming from ECadd and ...
UnpluggedTrio's user avatar
3 votes
1 answer
476 views

Criteria for choice of prime field in secp256k1?

In secp256k1, the prime order field $\mathbb F_p$ uses $$p=2^{256}-2^{32}-977$$ This is the largest prime $p$ less than $2^{256}-2^{32}$ allowing to construct a Koblitz curve $y^2\equiv x^3+b\bmod p$ ...
fgrieu's user avatar
  • 142k
1 vote
0 answers
456 views

How to calculate points for twist?

How I can find the point to perform this twist attack - https://cryptodeep.ru/twist-attack/ English version of previous link: https://github.com/demining/Twist-Attack This video has additional ...
Matiy's user avatar
  • 29
3 votes
3 answers
2k views

How can we reverse Elliptic Curves after solving the DLP problem?

Suppose that I've solved the Discrete Logarithm problem. Can someone explain to me in terms of the example below how to arrange values of Elliptic Curve secp256k1 in a reverse form so that I can ...
UnpluggedTrio's user avatar