Results 11 to 20 of about 29,187 (230)
The Group Diffie-Hellman Problems [PDF]
, 2003 In this paper we study generalizations of the Diffie-Hellman problems recently used to construct cryptographic schemes for practical purposes. The Group Computational and the Group Decisional Diffie-Hellman assumptions not only enable one to construct efficient pseudo-random functions but also to naturally extend the Diffie-Hellman protocol to allow ...
Emmanuel Bresson +2 more
core +5 more sources
A simple and efficient attack on the Merkle-Hellman knapsack cryptosystem. [PDF]
PLoS ONEThe Merkle-Hellman knapsack cryptosystem was one of the two earliest public key cryptosystems, which was invented by Merkle and Hellman in 1978. One can recover the equivalent keys by using Shamir's method. The most time-consuming part of Shamir's attack
Jingguo Bi +3 more
doaj +2 more sources
The Twin Diffie-Hellman Problem and Applications [PDF]
Journal of Cryptology, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Cash (Charles David) +2 more
openaire +7 more sources
Modification of Diffie–Hellman Key Exchange Algorithm for Zero Knowledge Proof [PDF]
Engineering and Technology Journal, 2012 Networks and entity groupings requires entity authentication while preserving the privacy of the entity being authenticated. Zero-Knowledge Proof (ZKP) plays an important role in authentication without revealing secret information.
Mahmood Khalel Ibrahim
doaj +1 more source
Hellman & Sauri: Suomalainen prime-time; Hellman: Uustelevision aika
Media & Viestintä, 1988 Kauko Pietilä
doaj +1 more source
Cybernetics and Information Technologies, 2021 Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper,
Rahul Vaddadi Sai +2 more
doaj +1 more source
Orienting supersingular isogeny graphs
Journal of Mathematical Cryptology, 2020 We introduce a category of 𝓞-oriented supersingular elliptic curves and derive properties of the associated oriented and nonoriented ℓ-isogeny supersingular isogeny graphs.
Colò Leonardo, Kohel David
doaj +1 more source
, 1996 This paper consists of three parts. First, various types of Diffie-Hellman oracles for a cyclic group G and subgroups of G are defined and their equivalence is proved. In particular, the security of using a subgroup of G instead of G in the Diffie-Hellman protocol is investigated.
Ueli M. Maurer, Stefan Wolf 0001
openaire +1 more source
On-The-Fly Diffie-Hellman for IoT
2019 38th International Conference of the Chilean Computer Science Society (SCCC), 2019 6 pages, 1 figure, 1 table ...
Jaime Díaz Arancibia +2 more
openaire +2 more sources
Analisis Serangan Pihak Ketiga pada Protokol Kesepakatan Kunci Diffie-Hellman
Techne, 2016 Penemuan protokol kesepakatan kunci Diffie-Hellman merupakan salah satu tonggak penting perkembangan kriptografi dengan menggunakan algoritma kunci publik.
Banu Wirawan Yohanes
doaj +1 more source