Abstract
We present a protocol for convincing an opponent that an integer N is of the form PrQs,with P and Q primes congruent to 3 modulo 4 and with r and s odd. Our protocol is provably secure in the sense that it does not reveal the factors of N. The protocol is very fast and therefore can be used in practice.
Cite
CITATION STYLE
APA
van de Graaf, J., & Peralta, R. (1988). A Simple and Secure Way to Show the Validity of Your Public Key. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 293 LNCS, pp. 128–134). Springer Verlag. https://doi.org/10.1007/3-540-48184-2_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free