Referências

Referências

 [AFO92]

T. Okamoto A. Fujioka and K. Ohta. A practical secret voting scheme for large scale elections. 1992.

 [BT94]

J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. 1994.

 [BY88]

J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. 1988.

 [CF85]

J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. Proceedings of the 26th IEEE Symposium on Foundations of Computer Science., pages 372-382 edition, 1985.

 [Cha81]

David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM., 24(2) edition, 1981.

 [con03]

condorcet.org. condorcet.org. World Wide Web, http://condorcet.org/, 2003.

 [CP03]

Cryptography and Information Security Group Research Project. evox. World Wide Web, http://theory.lcs.mit.edu/ cis/voting/voting.html, 2003.

 [Joh03]

Paul Johnston. RSA: Mathematics. World Wide Web, http://pajhome.org.uk/index.html, 2003.

 [Jon03]

William Henry Jones. The Extended Euclidian Algorithm. World Wide Web, http://www.grc.nasa.gov/WWW/price000/pfc/htc/zz_xeuclidalg.html, 2003.

 [Pro03a]

GNU Project. The GNU Project and the Free Software Foundation, Inc. World Wide Web, http://www.gnu.org/home.html, 2003.

 [Pro03b]

The Debian Project. Debian Voting Information. World Wide Web, http://www.debian.org/vote/, 2003.

 [Sch96]

Bruce Schneier. Applied Cryptography. Jon Wiler, 2st edition, 1996.

 [Too03]

Python Cryptography Toolkit. pycrypto. World Wide Web, http://www.amk.ca/python/code/crypto.html, 2003.

 [Wei03]

Eric W. Weisstein. Rabin-Miller Strong Pseudoprime Test. World Wide Web, http://hades.ph.tn.tudelft.nl/Internal/PHServices/Documentation/MathWorld/math/math/r/r011.htm, 2003.

Referências