Results 31 to 40 of about 23,346,457 (282)
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
Arithmetic Operators for Pairing-Based Cryptography [PDF]
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¾?
Jean-Luc Beuchat +3 more
openaire +3 more sources
On finite fields for pairing based cryptography
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
Practical Certificate-Less Infrastructure with Application in TLS
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
Practical identity-based key agreement for secure communication in sensor networks [PDF]
Despite much research effort key distribution in Wireless Sensor Networks (WSNs) still remains an open problem. In this paper we address this issue by proposing a simple identity- based key agreement scheme. Our protocol uses Identity-Based Cryptography (
Martin Collier +3 more
core +2 more sources
On the ρ-values of complete families of pairing-friendly elliptic curves
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
Security evaluation of a key management scheme based on bilinear maps on elliptic curves [PDF]
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
Heuristics on pairing-friendly elliptic curves
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
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
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source

