Results 51 to 60 of about 284,852 (62)
UEG Week 2024 Poster Presentations
United European Gastroenterology Journal, Volume 12, Issue S8, Page 665-1360, October 2024.
wiley +1 more source
The order elliptic curves over finite fields of characteristic two using the Schoof algorithm
The elliptic curve cryptosystem is a popular cryptosystem. Its safety depends on the difficulty of the elliptic curve discrete logarithm problem (ECDLP). From the viewpoint of ECDLP, it is very interesting to determine the order of elliptic curves.
openaire
Binary quadratic forms, elliptic curves and Schoof's algorithm
In this thesis, I show that the representation of prime integers by reduced binary quadratic forms of given discriminant can be obtained in polynomial complexity using Schoof's algorithm for counting the number of points of elliptic curves over finite fields.
Federico Pintore
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021
Security and efficiency for resource constrained devices using lightweight cryptography techniques is still a problem. It is important to make these devices secure from the intruders and communicate with them securely. Elliptic Curve Cryptography (ECC) comes out to be a major contender to solve this problem as it provides the security using smaller key
Ansh Tyagi+2 more
openaire +2 more sources
Security and efficiency for resource constrained devices using lightweight cryptography techniques is still a problem. It is important to make these devices secure from the intruders and communicate with them securely. Elliptic Curve Cryptography (ECC) comes out to be a major contender to solve this problem as it provides the security using smaller key
Ansh Tyagi+2 more
openaire +2 more sources
Parameters for secure elliptic curve cryptosystem -improvements on Schoof s algorithm
1998The security of elliptic curve cryptosystem depends on the choice of an elliptic curve on which cryptographic operations are performed. Schoof's algorithm is used to define a secure elliptic curve, as it can compute the number of rational points on a randomly selected elliptic curve defined over a finite field.
Jun Kogure+3 more
openaire +2 more sources
Schoofův algoritmus pro Weierstrassovy křivky
2023Schoof's algorithm is the starting point for the most efficient methods for determining the number of rational points on an elliptic curve defined over a finite field. The goal of this thesis is to introduce the subject of elliptic curves, with the emphasis on Weierstrass curves over a finite field, to describe Schoof's algorithm and its time ...
openaire +1 more source
2014
Elliptic curves have a rich mathematical history dating back to Diophantus (c. 250 C.E.), who used a form of these cubic equations to find right triangles of integer area with rational sides. In more recent times the deep mathematics of elliptic curves was used by Andrew Wiles et.
openaire +1 more source
Elliptic curves have a rich mathematical history dating back to Diophantus (c. 250 C.E.), who used a form of these cubic equations to find right triangles of integer area with rational sides. In more recent times the deep mathematics of elliptic curves was used by Andrew Wiles et.
openaire +1 more source