We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Efficient ways of prime number generation for ring signatures.
- Authors
Salazar, José Luis; Tornos, José Luis; Piles, Joan Josep
- Abstract
The authors describe two different algorithms to perform efficiently the ring signature keys generation. Given an integer size, l, their algorithms find efficiently (memory and time, respectively) two distinct l /2‐bit primes (e1, e2) such that e = 2e1e2 + 1 will be a prime integer. With a naïve algorithm one only needs to store O (l) bits (more specifically, only one l /2‐integer), and need, in average, O (l4) basic l‐bit operations. With the second algorithm, one not only improves this computational complexity O (l7/2), but also needs to use, in average, O (l3/2) bits. The authors consider these algorithms useful for implementing ring signatures in mobile devices where there exist strong time and space constraints.
- Publication
IET Information Security (Wiley-Blackwell), 2016, Vol 10, Issue 1, p33
- ISSN
1751-8709
- Publication type
Article
- DOI
10.1049/iet-ifs.2014.0547