Results 171 to 180 of about 6,041 (213)
Some of the next articles are maybe not open access.

diffi

Proceedings of the ACM Symposium on Document Engineering 2018, 2018
diffi (diff improved) is a comparison tool whose primary goal is to describe the differences between the content of two documents regardless of their formats. diffi examines the stacks of abstraction levels of the two documents to be compared, finds which levels can be compared, selects one or more appropriate comparison algorithms and calculates the ...
openaire   +1 more source

An improvement of the Diffie–Hellman noncommutative protocol

Designs, Codes and Cryptography, 2021
\textit{W. Diffie} and \textit{M. E. Hellman} [IEEE Trans. Inf. Theory 22, 644--654 (1976; Zbl 0435.94018)] proposed the first key-exchange protocol which was based on the hardness of the discrete logarithm problem. Subsequently, the commutator key-exchange protocol (AAG) [\textit{I. Anshel} et al., Math. Res. Lett. 6, No.
openaire   +1 more source

Diffy

The Arithmetic Teacher, 1971
The game DIFFY is an academic game that provides intrinsically interesting drill experiences and allows for individual differences. Moreover, teachers need not construct any of the exercises. The student himself initiates the drill, and the nature of the game provides for variety in the numbers encountered.
openaire   +1 more source

The l-th power Diffie–Hellman problem and the l-th root Diffie–Hellman problem

Applicable Algebra in Engineering, Communications and Computing, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongyoung Roh
exaly   +2 more sources

The square root Diffie–Hellman problem

Designs, Codes and Cryptography, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongyoung Roh, Sang Geun Hahn
openaire   +3 more sources

Silver Bullet Talks with Whitfield Diffie

IEEE Security and Privacy, 2015
Gary McGraw talks to Whitfield Diffie, co-creator of the Diffie-Hellman public-key exchange method, about his career in cryptography and the future of privacy.
Gary Mcgraw
exaly   +2 more sources

A Polynomial Representation of the Diffie-Hellman Mapping

Applicable Algebra in Engineering, Communication and Computing, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wilfried Meidl, Arne Winterhof
openaire   +1 more source

On the bit security of the Diffie-Hellman key

Applicable Algebra in Engineering, Communications and Computing, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ian F Blake   +2 more
exaly   +2 more sources

Diffie-Hellman without Difficulty

2012
An excellent way for a protocol to obtain shared keys is Diffie-Hellman. For the automated verification of security protocols, the use of Diffie-Hellman poses a certain amount of difficulty, because it requires algebraic reasoning. Several tools work in the free algebra and even for tools that do support Diffie-Hellman, the algebraic reasoning becomes ...
openaire   +1 more source

The Decision Diffie-Hellman problem

1998
The Decision Diffie-Hellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area.
openaire   +1 more source

Home - About - Disclaimer - Privacy