Results 71 to 80 of about 2,843 (216)
Certificateless strong designated verifier multi-signature
Tongxin xuebao, 2016 In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless ...
Hong-zhen DU, Qiao-yan WEN
doaj +2 more sources
Penerapan Algoritma Hybrid RSA Terhadap Pembangkit Kunci Diffie Hellman untuk Sistem Keamanan
, 2021 Romindo Romindo, Ferawaty
openalex +2 more sources
Polynomial approximation of bilinear Diffie–Hellman maps
Finite Fields and Their Applications, 2008 Let \(p\) b an odd prime and \(\mathbb{F}_q\) the finite field of characteristic \(p\) with \(q\) elements, \(E\) an elliptic curve defined over \(\mathbb{F}_q\), \(\ell\) a prime different from \(p\) dividing the order \(|E(\mathbb{F}_q)|\), \(P\in E(\mathbb{F}_q)\) a point of order \(\ell\) and \(m\) the order of \(q\) (modulo \(\ell\)). The bilinear
Ian F. Blake, Theodoulos Garefalakis
openaire +1 more source
Curve25519: New Diffie-Hellman Speed Records [PDF]
, 2006 This paper explains the design and implementation of a high-security elliptic-curve-Diffie-Hellman function achieving record-setting speeds: e.g., 832457 Pentium III cycles (with several side benefits: free key compression, free key validation, and state-of-the-art timing-attack protection), more than twice as fast as other authors' results at the same
openaire +1 more source
Strongly secure certificateless one-pass authenticated key agreement scheme
Kuwait Journal of Science, 2015 As certificateless public key cryptography (CLPKC) could solve the problem of keyescrow, recently it has been studied more and more. Certificateless authenticated keyagreement (CLAKA), as an important part of the CLPKC, also attracts ...
BAOJUN HUANG, HANG TU
doaj
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem [PDF]
, 2003 Jung Hee Cheon, Byungheup Jun
openalex +1 more source
On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping [PDF]
, 2004 Eike Kiltz, Arne Winterhof
openalex +1 more source
Research on Bilinear Diffie-Hellman Problem
工程科学与技术, 2006 :To construct BDH (Bilinear Diffie-Hellman) parameter generator in key evolving schemes, the security of BDH problem was researched.The origin of BDH problem was reviewed.
doaj
The n-Diffie-Hellman Problem and Its Applications
, 2011 The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman (twin DH) problem proposed by Cash, Kiltz and Shoup is extended to the n-Diffie-Hellman (n-DH) problem for an arbitrary integer n, and this new problem is shown to be at least as hard as the ordinary DH problem.
Liqun Chen 0002, Yu Chen 0003
openaire +4 more sources