Results 31 to 40 of about 19,309 (293)
Arithmetic Operators for Pairing-Based Cryptography [PDF]
, 2007 Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we first study an accelerator for the i¾?
Beuchat, Jean-Luc +3 more
openaire +3 more sources
PRESTvO: PRivacy Enabled Smartphone Based Access to Vehicle On-Board Units
IEEE Access, 2020 Smartphones are quickly moving toward complementing or even replacing traditional car keys. We advocate a role-based access control policy mixed with attributes that facilitates access to various functionalities of vehicular on-board units from ...
Bogdan Groza +4 more
doaj +1 more source
Security evaluation of a key management scheme based on bilinear maps on elliptic curves [PDF]
, 2022 In recent years, many applications of elliptic curves to cryptography have been developed. Cryptosystems based on groups of rational points on elliptic curves allow more efficient alternatives to finite field cryptography, which usually requires groups ...
Parolini, Luca
core
Practical Certificate-Less Infrastructure with Application in TLS
Cryptography, 2023 We propose highly efficient certificate-less (CL) protocols for the infrastructure used by authenticated key exchange (AKE). The construction is based on elliptic curves (EC) without pairing, which means it can be easily supported by most industrial ...
Li Duan, Yong Li, Lijun Liao
doaj +1 more source
On finite fields for pairing based cryptography
Advances in Mathematics of Communications, 2007 Here, we improve our previous bound on the number of finite fields over which elliptic curves of cryptographic interest with a given embedding degree and small complex multiplication discriminant may exist. We also give some heuristic arguments which lead to a lower bound which in some cases is close to our upper bound.
Florian Luca, Igor E. Shparlinski
openaire +2 more sources
Secure architectures for pairing based public key cryptography.
, 2013 Along with the growing demand for cryptosystems in systems ranging from large servers to mobile devices, suitable cryptogrophic protocols for use under certain constraints are becoming more and more important. Constraints such as calculation time, area, efficiency and security, must be considered by the designer.
Pan, Weibo
openaire +2 more sources
, 2023 In dieser Masterarbeit untersuchen wir Pairings auf elliptischen Kurven, deren Anwendung in der Kryptographie und deren Berechnung. Pairings sind bestimmte bilineare Funktionen zwischen Gruppen, wobei wir solche Abbildungen insbesondere für die Gruppe der Punkte elliptischer Kurven finden können. Beide diese Begriffe werden in dieser Arbeit eingeführt.
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric sarcomas are a heterogeneous group of tumors that contribute disproportionately to cancer mortality in children. Although congenital anomalies are among the strongest known risk factors for childhood cancer, the risk of specific sarcoma subtypes among affected individuals has not yet been thoroughly evaluated. Procedure We
Russ Wolters +17 more
wiley +1 more source