Results 31 to 40 of about 12,868 (287)
Security Analysis of Pairing-based Cryptography
, 2023 8 figures, 8 tables, 5121 ...
Wang, Xiaofeng +2 more
openaire +2 more sources
Using Abelian Varieties to Improve Pairing-Based Cryptography [PDF]
Journal of Cryptology, 2008 In this long and quite technical paper the authors study several aspects of Pairing-Based Cryptography. Bilinear pairings (Weil and Tate pairings) on elliptic curves or higher dimensional abelian varieties are used in Cryptography both in a constructive and destructive way, see [Handbook of elliptic and hyperelliptic curve cryptography. Boca Raton, FL:
Rubin, K., Silverberg, A.
openaire +1 more source
Cryptographic Energy Costs are Assumable in Ad Hoc Networks [PDF]
, 2009 Performance of symmetric and asymmetric cryptography algorithms in small devices is presented. Both temporal and energy costs are measured and compared with the basic functional costs of a device. We demonstrate that cryptographic power costs are not
Herrera Joancomartí, Jordi +1 more
core +1 more source
Improving side-channel attacks against pairing-based cryptography [PDF]
Journal of Cryptographic Engineering, 2017 Although the vulnerability of pairing-based algorithms to side-channel attacks has been demonstrated—pairing implementations were targeted on three different devices in a recent paper [41]—it nevertheless remains difficult to choose an adapted leakage model and detect points of interest.
Jauvart, Damien +3 more
openaire +4 more sources
Subgroup Security in Pairing-Based Cryptography [PDF]
, 2015 Pairings are typically implemented using ordinary pairing-friendly elliptic curves. The two input groups of the pairing function are groups of elliptic curve points, while the target group lies in the multiplicative group of a large finite field. At moderate levels of security, at least two of the three pairing groups are necessarily proper subgroups ...
Barreto, Paulo S.L.M. +5 more
openaire +2 more sources
On the ρ-values of complete families of pairing-friendly elliptic curves
Journal of Mathematical Cryptology, 2012 The parameter ρ of a complete family of pairing-friendly elliptic curves represents how suitable some given elliptic curves are in pairing-based cryptographic schemes. The superiority of the curves depends on how close ρ is to 1.
Okano Keiji
doaj +1 more source
IEEE Access, 2019 As the further extension of the multi-receiver signcryption, the multi-message and multi-receiver signcryption allows a sender to simultaneously signcrypt different messages for different receivers in only one logic operation, which makes it more ...
Liaojun Pang, Mengmeng Wei, Huixian Li
doaj +1 more source
Heuristics on pairing-friendly elliptic curves
Journal of Mathematical Cryptology, 2012 We present a heuristic asymptotic formula as for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree , with fixed discriminant, with rho-value bounded by a fixed such that , and with prime ...
Boxall John
doaj +1 more source
Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography [PDF]
, 2015 Article published in the proceedings of the C2SI conference, May 2015.Pairings are mathematical tools that have been proven to be very useful in the construction of many cryptographic protocols.
El Mrabet, Nadia, Fouotsa, Emmanuel
core +3 more sources
Integrating identity-based cryptography in IMS service authentication
, 2009 Nowadays, the IP Multimedia Subsystem (IMS) is a promising research field. Many ongoing works related to the security and the performances of its employment are presented to the research community. Although, the security and data privacy aspects are very
Abid, Mohamed +3 more
core +6 more sources