Three Results in Number Theory and Cryptography: 1. A New Algorithm to Compute Square Roots Modulo A Prime Number. 2. On the Bit Complexity of the Discrete Logarithm. 3. A Framework for the Study of Cryptoprotocols
René C. Peralta
EECS Department, University of California, Berkeley
1985
Advisors: Manuel Blum
BibTeX citation:
@phdthesis{Peralta:7657,
Author= {Peralta, René C.},
Title= {Three Results in Number Theory and Cryptography: 1. A New Algorithm to Compute Square Roots Modulo A Prime Number. 2. On the Bit Complexity of the Discrete Logarithm. 3. A Framework for the Study of Cryptoprotocols},
School= {EECS Department, University of California, Berkeley},
Year= {1985},
}
EndNote citation:
%0 Thesis %A Peralta, René C. %T Three Results in Number Theory and Cryptography: 1. A New Algorithm to Compute Square Roots Modulo A Prime Number. 2. On the Bit Complexity of the Discrete Logarithm. 3. A Framework for the Study of Cryptoprotocols %I EECS Department, University of California, Berkeley %D 1985 %F Peralta:7657