Skip to main content
Conference Proceedings

Algorithms for pairing-friendly primes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8365 LNCS 215-228
DOI: 10.1007/978-3-319-04873-4_13
3Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given an integer n > 1 and a square-free Δ < 0, we present a general method of generating primes p and q such that q |Φn (p) and q |p + 1 - t, where |t| ≤ 2√p and 4p - t2 = -Δf2 for some integers f, t. Such primes can be used for implementing pairing-based cryptographic systems. © 2014 Springer International Publishing.

Author supplied keywords

Cite

CITATION STYLE

APA

Grześkowiak, M. (2014). Algorithms for pairing-friendly primes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8365 LNCS, pp. 215–228). https://doi.org/10.1007/978-3-319-04873-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free