Results 241 to 250 of about 671,694 (290)
Some of the next articles are maybe not open access.

Securing pairing-based cryptography on smartcards

International Journal of Information and Computer Security, 2012
Research efforts have produced many algorithms for fast pairing computation and several efficient hardware implementations. However, side channel attacks (SCAs) are a serious threat on hardware implementations. Previous works in this area have provided some costly countermeasures against side channel attacks.
openaire   +1 more source

Performance Analysis of Pairing-Based Elliptic Curve Cryptography on Constrained Devices

International Conference on Ultra Modern Telecommunications, 2018
The paper deals with the implementation aspects of the bilinear pairing operation over an elliptic curve on constrained devices, such as smart cards, embedded devices, smart meters and similar devices.
J. Hajny   +4 more
semanticscholar   +1 more source

High Security Pairing-Based Cryptography Revisited

2006
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves for various practical levels of security.
Granger, Robert   +2 more
openaire   +1 more source

Instruction Set Extensions for Pairing-Based Cryptography

2007
A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means many different variations of base field must ideally be supported on the target platform.
Tobias Vejda   +2 more
openaire   +1 more source

Access Control Using Pairing Based Cryptography

2003
We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem.
openaire   +1 more source

Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography

International Conference on Cryptology in Malaysia, 2016
A. Menezes, P. Sarkar, Shashank Singh
semanticscholar   +1 more source

Constructing suitable parameters for pairing-based cryptography

2017
Οι ``ζευγισμοί'' παρουσιάστηκαν για πρώτη φορά από τον André Weil το 1940 και αρχικά χρησιμοποιήθηκαν ως μηχανισμός επίθεσης στο πρόβλημα διακριτού λογάριθμου σε ελλειπτικές καμπύλες. Περίπου 60 χρόνια μετά την ανακάλυψή τους, οι ζευγισμοί έχουν γίνει ένα από τα σπουδαιότερα αντικείμενα μελέτης στην κρυπτογραφία.
openaire   +2 more sources

A light-weight hardware/software co-design for pairing-based cryptography with low power and energy consumption

International Conference on Field-Programmable Technology, 2017
A. Salman, William Diehl, J. Kaps
semanticscholar   +1 more source

Securing Information Exchange in VANETs by Using Pairing-Based Cryptography

International Journal of Foundations of Computer Science, 2017
Chin-Ling Chen   +4 more
semanticscholar   +1 more source

Effective Pairings in Isogeny-based Cryptography

IACR Cryptology ePrint Archive, 2023
Krijn Reijnders
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy