Polynomial Approximation and Arithmetic Complexity of the Diffie—Hellman Key

1999 ◽  
pp. 83-96
Author(s):  
Igor Shparlinski
Keyword(s):  
Polynomial Approximation ◽  
Arithmetic Complexity ◽  
Diffie Hellman

scholarly journals Polynomial representations of the Diffie-Hellman mapping

2001 ◽  
Vol 63 (3) ◽  
pp. 467-473 ◽  
Author(s):  
Edwin El Mahassni ◽  
Igor Shparlinski
Keyword(s):  
Finite Field ◽  
Lower Bounds ◽  
Primitive Root ◽  
Polynomial Equations ◽  
Arithmetic Complexity ◽  
Diffie Hellman ◽  
Polynomial Representations ◽  
Parallel Arithmetic

We obtain lower bounds on the degrees of polynomials representing the Diffie-Hellman mapping (gx, gy) → gxy, where g is a primitive root of a finite field q of q elements. These bounds are exponential in terms of log q. In particular, these results can be used to obtain lower bounds on the parallel arithmetic complexity of breaking the Diffie-Hellman cryptosystem. The method is based on bounds of numbers of solutions of some polynomial equations.

scholarly journals Polynomial approximation of bilinear Diffie–Hellman maps

2008 ◽  
Vol 14 (2) ◽  
pp. 379-389 ◽  
Author(s):  
Ian F. Blake ◽  
Theo Garefalakis
Keyword(s):  
Polynomial Approximation ◽  
Diffie Hellman

On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping

2000 ◽  
Vol 13 (3) ◽  
pp. 339-360 ◽  
Author(s):  
Don Coppersmith ◽  
Igor Shparlinski
Keyword(s):  
Polynomial Approximation ◽  
Discrete Logarithm ◽  
Diffie Hellman

Implementasi Keamanan pada Transaksi Data Menggunakan Sertifikat Digital X.509

2017 ◽  
Vol 8 (1) ◽  
pp. 1-10
Author(s):  
Is Mardianto ◽  
Kuswandi Kuswandi
Keyword(s):  
Mobile Phone ◽  
Web Service ◽  
Data Exchange ◽  
User Authentication ◽  
Digital Certificate ◽  
Security Issues ◽  
Diffie Hellman ◽  
Digital Certificates ◽  
Mobile Phone Applications ◽  
Secure Hash Algorithm

Security issues have become a major issue on the Internet. One of the security methods that are widely used today is to implement a digital certificate. Digital certificates have evolved over time, one of which is the X.509 digital certificate. Digital certificates have been widely used as authentication applications, web network authentication and other authentication systems that require digital certificates. This research is carried out by implementing an X.509 digital certificate technology as a mobile web service with its client. Secure Hash Algorithm (SHA), Diffie-Hellman, and Advanced Encryption Standard (AES) are used to secure the data exchange transaction between the web service and mobile phone. SHA algorithm will be used for user authentication, Diffie-Hellman algorithm will be used for public key exchange and AES algorithms will be used for symmetric cryptography data. The results of the application of digital certificates, the SHA algorithm, Diffie-Hellman, and AES in mobile phone applications, provide security application running on web service. Index Terms—Digital Certificate, X.509, SHA, Diffie Hellman, AES

Sign in / Sign up

Export Citation Format

Share Document