Results 31 to 40 of about 701 (185)
Parallelized Pollard's Rho algorithm for ECDLP on Graphic Cards
The recent introduction by NVidia of Compute Unified Device Architecture (CUDA) libraries for High Performance Computing on Graphic Processing Units has started the trend of video cards for resolution of many computationally hard problems in different areas like fluid dynamics, molecular dynamics, computer vi- sion and astrophysics.
CHINNICI, MARTA +3 more
openaire +2 more sources
LAMAS: Lightweight anonymous mutual authentication scheme for securing fog computing environments
Fog computing uses near-user edge devices that are usually smart devices with very limited storage and computation resources; hence, the authentication process should be lightweight to be suitable for fog computing environment.
Mariam Hamada +2 more
doaj +1 more source
Solving ECDLP via List Decoding [PDF]
We provide a new approach to the elliptic curve discrete logarithm problem (ECDLP). First, we construct Elliptic Codes (EC codes) from the ECDLP.
Fangguo Zhang, Shengli Liu
core +1 more source
Efficient and Provably Secure Certificateless Signature Schemes [PDF]
Certificateless public key cryptography solves the key escrow problem of identity-based cryptography.In common with identity-based cryptography,certificateless public key cryptography does not rely on certificate.Therefor,this paper references from the ...
TANG Yongli,WANG Feifei,YAN Xixi,LI Zichen
doaj +1 more source
Realization of coprocessor which supports counting of discrete logarithm on elliptic curves with partial knowledge [PDF]
In this paper we analyse realization of a coprocessor which supports counting of discrete logarithm on elliptic curves over the field FG(p), where p is the large prime, in FPGA. Main idea of the realization is based on using modules which are able to add
Michał Kędzierski +2 more
doaj +1 more source
Isolated elliptic curves and the MOV attack
We present a variation on the CM method that produces elliptic curves over prime fields with nearly prime order that do not admit many efficiently computable isogenies. Assuming the Bateman–Horn conjecture, we prove that elliptic curves produced this way
Scholl Travis
doaj +1 more source
An Aggregate Signature Scheme Based on a Trapdoor Hash Function for the Internet of Things
With the rapid development of the Internet of Things (IoT), it becomes challenging to ensure its security. Identity authentication and integrity verification can be achieved by secure hash functions and digital signature algorithms for IoT applications ...
Hong Shu +5 more
doaj +1 more source
The remote authentication scheme is a cryptographic protocol incorporated by user–server applications to prevent unauthorized access and security attacks.
Fairuz Shohaimay, Eddie Shahril Ismail
doaj +1 more source
Implications of the Arithmetic Ratio of Prime Numbers for RSA Security
The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm ...
Ivanov Andrey, Stoianov Nikolai
doaj +1 more source
Pairing-free certificateless blind signature scheme for smart grid
The smart grid is an emerging power system that can realize the information exchange between users and power companies in two-way communication and adjust power companies’ power supply according to the real-time power requests from smart meters on the ...
ShuangGen Liu, Yu Zhu, RuiYun Wang
doaj +1 more source

