Questions tagged [elliptic-curves]

Elliptic curves are algebraic-geometric structures with applications in cryptography. Such a curve consists of the set of solutions to a cubic equation over a finite field equipped with a group operation. Questions relating to elliptic curves and derived algorithms should use this tag and might also consider more specific tags such as discrete-logarithm and ecdsa.

236 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
0
votes
1answer
124 views

ECCS: Elliptic Curve Cryptography Cramer Shoup

Introduction I know how to do Cramer-Shoup with cyclic groups. But how do I do it in elliptic curve cryptography (ECC)? Cramer-Shoup with cyclic groups Following was taken from Wikipedia: https://...
0
votes
0answers
60 views

MOV attack on ellipic curves with the correct dlog in the finite field, but wrong dlog in the EC group

I'm following this description of the MOV attack: https://people.cs.nctu.edu.tw/~rjchen/ECC2009/19_MOVattack.pdf (slide 6/8) by implementing it. However, sometimes the computed dlog $k$ (which is ...
0
votes
0answers
80 views

Partially Repeated Roots of Classical Modular Polynomial

So I was trying to compute a normalized model of elliptic curve as described here. Consider $p$= ...
0
votes
0answers
46 views

Point-halving/solving quartic equations over the elliptic curve E(Z_N)/ring Z_N where N = pq

I am wondering whether there are any results/whether there is any knowledge about the following problem: Given a univariate polynomial (say, a quartic) equation defined over $\mathbb{Z}_N$, is it ...
0
votes
0answers
41 views

Is it possible to “convert” to a curve

Assuming I have a 2 black boxes Box A: generates a private key and use it to sign whatever data I sent it (using secp256r1). It also returns the corresponding public key Box B: gets a public key, and ...
0
votes
0answers
84 views

Interactive ECDHE Authentication With Numeric Code

Trying to simplify my question, keeping only core concepts. Proposed solution: Both user devices generates ECDHE key pairs. Send pub keys to each other. Generate shared secret. Device that requests ...
0
votes
0answers
69 views

Elliptic curves over extensions of 64-bit fields

Are there any standard (or at least well-know) elliptic curves over $F_{p^4}$ where $p$ is a ~64-bit prime? I know Microsoft has FourQ curve which works over $F_{p^2}$ where $p$ is a 127-bit prime, ...
0
votes
0answers
57 views

Generate such an Elliptic Curve

I have a basic question. Is there a way to define an Elliptic Curve over (binary) Finite Field of order $q=2^m$ such that by taking the points from $(0, Y_0)$ and $(1, Y_1)$ then maps them to $(q - 1, ...
0
votes
0answers
40 views

Lifting point to quadratic twisted curve

How to lift point to it’s quadratic twisted curve? I use secp256k1. Is the diiscrete log still same? Thanks before
0
votes
0answers
81 views

BIP32 Extended Key to EC Private and Public Key Pair

We are working on an application in Android using Java. In our project, we used to generate EC key pairs (of size 384 bits) using SpongyCastle - an old Android version of Bouncy Castle. The problem ...
0
votes
0answers
92 views

Can knowing the ephemeral key recover the private key in ECDSA

If the attacker - some guy who really, really wants to steal bitcoins - somehow finds the ephemeral key used in an 256-bit ECDSA signature, can he recover the private key? If so, would knowing the ...
0
votes
0answers
49 views

Where can I find standardized implementations of lightweight cryptographic ciphers?

I am working on a project that requires encrypting messages with different ciphers. I am looking for the following ciphers: PRESENT, CLEFIA, LEA, Hill cipher, Affine cipher, Elliptic Curve ...
0
votes
0answers
85 views

Is it possible to distinguish ECC private key from the random values

I have a list of the random values (each 65 bytes long). One of the items is a private key which is used to sign the data: ...
0
votes
0answers
94 views

Modifying Elliptic Curve Parameters

For context, I was watching this bit of the video: which goes over this source code. The piece is about elliptic curve cryptography and how it works. I want to use some of this knowledge to make my ...
0
votes
0answers
58 views

The ECC private key is generated with 0x00 at the beginning.(prefix)

I created a private key using the prime256v1 curve. My purpose is to get a 32 byte private key. However, the private key is preceded by 0x00, resulting in 33 bytes. Why is this happening? The only ...
0
votes
0answers
42 views

How to get a random point of a specific EC group with cofactor Not-Equal 1?

We got a EC group generated with point G, and the cofactor of E(G) is with the similar size of the Order. Now we need a random point of E(G) and not revealing the "logarithm" of the random point, so ...
0
votes
0answers
70 views

Isogeny of elliptic curve

If we have two elliptic curves $E$ and $E'$ and the points of both elliptic curves are same. Then all the points of $E$ map to all the points of another elliptic curve $E'$. For example $E$ has ...
0
votes
0answers
45 views

Differential representation of binary curve as a public key

Given elliptic curve $E$ over binary field $k$, a public key is the pair $(x,y)$ in $E$ and $x$ and $y$ in $k$. The differential representation of $(x,y)$ is $w = x + y$. What security implications ...
0
votes
0answers
163 views

Using division polynomials to prove that EC discrete log is even

This question is related to the other question I recently asked. I'm trying to figure out if it is possible to use division polynomials to prove that knowing $A = a \cdot G$ we can prove that $a$ is ...
0
votes
0answers
199 views

Sharing secret content with multiple recipients

I have a sender and N recipients, and am thinking of using the following scheme to send secret content to those recipients. This is similar context to a group chat or email. I am no expert in crypto ...
0
votes
0answers
73 views

Algorithm to compute DLOG for elliptic curve $E(F_p)$ with order p

I was reading about elliptic curves in this pdf. Page 55 of the pdf states that if number of points on elliptic curve #$E(F_p) = p$, then there exists a p-adic logarithmic map that homomorphically ...
0
votes
0answers
139 views

NIST ECC Curves without pairings

NIST FIPS.186-4 has standardized 5 ECC curves on field $\mathbb{F}_p$ (P-192, P-224, P-256, P-384, P-521) and 10 elliptic curves on binary fields. I need to use ECC curves without pairings for my ...
0
votes
0answers
411 views

Size of group for Elliptic curves vs RSA for equal security

For my research, I would like to compare the efficiency of a scheme when instantiated with Elliptic curves and RSA. So, I would like to know a "latest" comparison (as of 2018) on what group sizes of ...
0
votes
0answers
273 views

Compact encoding of an elliptic curve point

I'm working on a project with elliptic curve cryptography (ECC), I'm using the secp256k1 library (the one that's used in bitcoin). My goal is to create the most compact platform-independent ...
0
votes
0answers
86 views

Found weil pairing. Index Calculus method on the results of weil pairing

Consider Elliptic curve with p = 59, A = 1, B= 0, P = (25,30) and Q=(35,31). So I tried to solve this using MOV attack. The torsion point for them E[5] is R(-25,30i) where is sqroot -1 Chosen two ...
0
votes
0answers
39 views

Do most TLS 1.2 implementations express curves in a canonical form when performing EC arithmetic?

Sorry if this is a silly question, but does anyone know if the cryptographic libraries which implement TLS 1.2 for Firefox, Chrome, etc. express a given curve in a canonical form (i.e. one of ...
0
votes
0answers
203 views

processing time for multiplication and exponentiation in pairing base cryptography

I'm using the Boneh-Boyen-Shacham signature scheme and want to estimate complexity in my scheme. As reported in "Scott M., Efficient Implementation of Cryptographic pairings", if we set parameters ...
0
votes
0answers
398 views

Polynomial Inversion over Galois Field

Hello guys I am looking to calculate the Inverse of a given polynomial in Galois field I have found the little Fermat's algorithm and the Itoh-Tsujii I am getting a bit confused with both algorithm ...
0
votes
1answer
127 views

ECC public key encryption without symmetric cipher

Imagine the following scenario. A process is running in background and permanently encrypting some data. An adversary has full control of the process, e.g. it can dump the process memory any time and ...
-1
votes
0answers
52 views

what it means by A dot B yields C in Elliptic Curve Cryptography?

I don't understand what the dot notation is. Is it like a multiplication operation or an addition operation or what? and how is that related to the Elliptic Curve Discrete Logarithm Problem? For ...
-1
votes
1answer
879 views

Elliptic curve discrete logarithm problem and mini example

Consider the group E23(9,17), this the group defined by the equation y2 mod 23 = x3 + 9x + 17 mod 23. What is the discrete logarithm k of Q = (4,5) to the base P = (16,5)? the solution is: 2P = (20,...
-1
votes
1answer
76 views

Simple hexadecimal to 2s complement question

From 2.5.1 in this paper, how is $p$ = FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFE FFFFFFFF 00000000 00000000 FFFFFFFF = $2^{384} − 2^{128} − 2^{96} + 2^{32} − 1$ ...
-1
votes
2answers
101 views

Table of Curve Paramters

I'm studying Elliptic Cruve Cryptograhpy. When I do a search on Google of ECC, I find some pdf where I see these curve's paramters: $q, h, r, exp1, exp2$. What are these parameters ? Are there tables (...
-2
votes
1answer
71 views

Given a point $c$ in a field $Z_p$. Can we get another value $c^{'}$ such that $\left(c^{\prime}-c\right)$ is invertible in $Z_p$?

If we have a point in a field $c$. Can we get another value $c^{'}$ such that $\left(c^{\prime}-c\right)$ is invertible in $Z_p$ ?
-2
votes
1answer
183 views

Can an elliptic curve have the form y^2 ≡ x^2 + 2x + 2 mod 17?

I'm new to cryptography and the associated level of maths. I'm practising past papers for an exam and found the question: Show that the condition 4a^3 + 27b^2 ≠ 0 mod p is fulfilled for the ...
-2
votes
1answer
97 views

if ABE scheme based on RSA generate constant secret key will get better resutls than schemes based on Elliptic curve?

We know in term of security level, ECC key is stronger than RSA , 160 bit ECC equivalent to 1024 bit key in RSA. If I can generate constant secret key based on RSA is that mean my scheme performance ...

1 2 3 4
5