http://blogs.opml.org/0147153/ en-us Copyright 2005 Ed. Sat, 30 Jul 2005 05:00:00 GMT Sat, 30 Jul 2005 19:09:34 GMT http://blogs.law.harvard.edu/tech/rss OPML Editor version 0.58 http://blogs.opml.org/0147153/2005/07/30#howToHackVotingMachines <p><a href="http://catless.ncl.ac.uk/Risks/23.94.html#subj8">Risks</a> summarises a hack that can be used intentionally to rig results on Diebold voting machines "...a small number of votes is [pre-]loaded for one candidate, offset by a large number of votes for the opposing candidate such that the sum of the numbers, because of the overflow, will be zero. The large number is designed to trigger an integer overflow such that after a certain number of votes is received it will flip the vote counter over to begin counting from zero for that candidate... combining the false report method ... with the pre-arranged integer overflow ... seems to be an especially efficient exploit because it is a one-step process that takes out both the actual process and its safeguard at the same time, while surviving scrutiny of almost anything short of a full manual recount." See <a href="http://www.bbvdocs.org/general/BBVreport-1sheet.pdf ">Overview</a> and <a href="http://www.blackboxvoting.org/BBVreport.pdf">Full technical report </a>. </p> Sat, 30 Jul 2005 16:10:22 GMT http://blogs.opml.org/0147153/2005/07/30#howToHackVotingMachines