Implementing Cryptographic Pairings at Standard Security Levels

Andreas Enge, Jérôme Milan

Type: Book-Chapter

Publication Date: 2014-01-01

Citations: 9

DOI: https://doi.org/10.1007/978-3-319-12060-7_3

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF
HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Still wrong use of pairings in cryptography	2018	Osmanbey Uzunkol Mehmet Sabır Kiraz
+	Implementing cryptographic pairings at standard security levels	2014	Andreas Enge Jérôme Milan
+	Implementing cryptographic pairings at standard security levels	2014	Andreas Enge Jérôme Milan
+	Efficient pairings and scalar multiplications for next generation public key cryptography	2011	由美酒見
+ PDF Chat	High-Level Cryptographic Abstractions	2019	Christopher Kane Bo Lin Saksham Chand Scott D. Stoller Yanhong A. Liu
+	Pairing for Greenhorn: Survey and Future Perspective	2021	M. Kumar Satish Chand
+	Pairing for Greenhorn: Survey and Future Perspective.	2021	Mahender Kumar Satish Chand
+	Bilinear Pairings	2025
+	Bilinear Pairings	2011
+ PDF Chat	Compiling and securing cryptographic protocols	2009	Yannick Chevalier Michaël Rusinowitch
+	Lightweight usable cryptography: a usability evaluation of the Ascon 1.2 family	2023	Arne Padmos
+	Practical Blind Signatures in Pairing-Free Groups	2024	Michael Klooß Michael Reichle Benedikt Wagner
+	A Toolkit for Ring-LWE Cryptography	2013	Vadim Lyubashevsky Chris Peikert Oded Regev
+ PDF Chat	On the Design of Cryptographic Primitives	2006	Pino Caballero‐Gil Amparo Fúster-Sabater
+ PDF Chat	Cryptography with Certified Deletion	2023	James Bartusek Dakshita Khurana
+	Cryptography and Applications	2003	Norman E. Hurt
+ PDF Chat	Code-Based Cryptography	2023	Thomas Jerkovits Felicitas Hörmann Hannes Bartz
+	Defending Cryptography Against Quantum Attackers	2020	Davis S Beilue
+	White-Box Cryptography	2013	Dušan Klinec Petr Švenda
+ PDF Chat	Scabbard: An Exploratory Study on Hardware Aware Design Choices of Learning with Rounding-based Key Encapsulation Mechanisms	2024	Suparna Kundu Quinten Norga Angshuman Karmakar S Gangopadhyay Jose Maria Bermudo Mera Ingrid Verbauwhede

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Still wrong use of pairings in cryptography	2018	Osmanbey Uzunkol Mehmet Sabır Kiraz

Works Cited by This (7)

Action	Title	Year	Authors
+	A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic	2014	Razvan Barbulescu Pierrick Gaudry Antoine Joux Emmanuel Thomé
+ PDF Chat	The Weil Pairing, and Its Efficient Calculation	2004	Victor S. Miller
+ PDF Chat	A Taxonomy of Pairing-Friendly Elliptic Curves	2009	David Mandell Freeman Michael Scott Edlyn Teske
+	Efficient Exponentiation in Extensions of Finite Fields without Fast Frobenius Mappings	2008	Yasuyuki Nogami Hidehiro Kato Kenta Nekado Yoshitaka Morikawa
+	On the Evaluation of Powers	1976	Andrew Chi-Chih Yao
+ PDF Chat	A family of implementation-friendly BN elliptic curves	2011	Geovandro C. C. F. Pereira Marcos A. Simplício Michael Naehrig Paulo S. L. M. Barreto
+	Batch Groth–Sahai	2010	Olivier Blazy Georg Fuchsbauer Malika Izabachène Amandine Jambert Hervé Sibert Damien Vergnaud