Results 11 to 20 of about 21,677 (136)
Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform. [PDF]
Sensors (Basel), 2020 Gulen U, Baktir S.
europepmc +2 more sources
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem [PDF]
, 2018 In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm.
Mahalanobis, Ayan, Mallick, Vivek
core +2 more sources
Review on DNA Cryptography [PDF]
, 2019 Cryptography is the science that secures data and communication over the network by applying mathematics and logic to design strong encryption methods.
Mondal, Mandrita, Ray, Kumar S.
core +3 more sources
Model Proyeksi (X/Z2, Y/Z2) pada Kurva Hesian secara Paralel Menggunakan Mekanisme Kriptografi Kurva Eliptik [PDF]
, 2012 MODEL PROYEKSI (X/Z2, Y/Z2) PADA KURVA HESIAN SECARA PARALEL MENGGUNAKAN MEKANISME KRIPTOGRAFI KURVA ELIPTIKABSTRAK Suatu kunci publik, Elliptic Curve Cryptography (ECC) dikenal sebagai algoritma yang paling aman yang digunakan untuk memproteksi ...
Weku, W. (Winsy)
core
Isogenies of Elliptic Curves: A Computational Approach [PDF]
, 2009 Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the reducibility of ...
Shumow, Daniel
core +2 more sources
Internet security for mobile computing [PDF]
, 2017 Mobile devices are now the most dominant computer platform. Every time a mobile web application accesses the internet, the end user’s data is susceptible to malicious attacks.
Davis, Vincent Anthony
core +1 more source
Secure Elliptic Curves in Cryptography [PDF]
, 2017 Elliptic Curve Cryptography (ECC) is a branch of public-key cryptography based on the arithmetic of elliptic curves. In the short life of ECC, most standards have proposed curves defined over prime finite fields using the short Weierstrass form. However, some researchers have started to propose as a more secure alternative the use of Edwards and ...
Gayoso Martínez, Victor +2 more
openaire +2 more sources
Decrypting the Link Between Elliptic Primes and Twin Primes [PDF]
, 2017 From Caesar’s cipher to Germany’s enigma machine to modern day cryptosytems, cryptography spans throughout history. Methods of encryption have evolved over hundreds of years and continue to evolve as computational efficiency increases.
Babinkostova, Liljana, (Mentor) +8 more
core +1 more source
Refinements of Miller's Algorithm over Weierstrass Curves Revisited
, 2011 In 1986 Victor Miller described an algorithm for computing the Weil pairing in his unpublished manuscript. This algorithm has then become the core of all pairing-based cryptosystems. Many improvements of the algorithm have been presented.
Le, Duc-Phong, Liu, Chao-Liang
core +1 more source
Discrete logarithms in curves over finite fields [PDF]
, 2007 A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite ...
Andreas Enge +4 more
core +5 more sources