Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

doi 10.1007/3-540-48658-5_26
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

The Concept of Data Encryption. Diffie Hellman Protocol

2019English

Fixing the Integrated Diffie-Hellman-Dsa Key Exchange Protocol

IEEE Communications Letters
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2005English

An Algebra for Symbolic Diffie-Hellman Protocol Analysis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

A Diffie-Hellman and Two Step Verification Based Secure Cloud Computing Paradigm

International Journal of Computer Networks And Applications
2018English

Additional Diffie-Hellman Tests for the Internet Key Exchange Protocol Version 2 (IKEv2)

2013English

A Secure Delegation Process Using Diffie-Hellman Assumption in Cloud Computing

International Journal of Computer Applications
2015English

Measuring Small Subgroup Attacks Against Diffie-Hellman

2017English

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation

English

Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy