1986 Ohio gubernatorial election

The 1986 Ohio gubernatorial election was held on November 4, 1986. Incumbent Democratic Governor Dick Celeste ran against four time former Governor Jim Rhodes. The two had faced off before in 1978, with Rhodes winning by 47,536 votes for his fourth victory. Eight years later, at the age of 77, Rhodes was attempting to win a record fifth term. However, Celeste won by an even bigger margin than he did four years earlier, becoming the first Democrat to win consecutive elections for Governor since Frank Lausche, who won three consecutive times in 1950, 1952, and 1954.

1986 Ohio gubernatorial election

November 4, 1986
 
Nominee Dick Celeste Jim Rhodes
Party Democratic Republican
Popular vote 1,858,372 1,207,264
Percentage 60.6% 39.4%

County results
Celeste:      50–60%      60–70%      70–80%
Rhodes:      50-60%

Governor before election

Dick Celeste
Democratic

Elected Governor

Dick Celeste
Democratic

Democratic primary

Candidates

Dick Celeste, Governor of Ohio

Results

Democratic primary results [1]
Party Candidate Votes %
Democratic Dick Celeste (Incumbent) 684,206 99.87
Democratic Write-ins 880 0.13
Total votes 685,086 100.0

Republican primary

Candidates

Results

Republican primary results[2]
Party Candidate Votes %
Republican Jim Rhodes 352,261 48.19
Republican Paul E. Gillmor 281,737 38.54
Republican Paul E. Pfeifer 96,948 13.26
Total votes 730,946 100.00

General election

Results

Ohio gubernatorial election, 1986
Party Candidate Votes % ±
Democratic Dick Celeste (Incumbent) 1,858,372 60.6 +1.2
Republican Jim Rhodes 1,207,264 39.4 +0.5
Write-ins 975
Majority 651,108 21.2
Turnout 3,065,636
Democratic hold Swing
gollark: Modern password hashing functions are designed to be slow to run (and to be fastest on general-purpose computing hardware and not ASICs) to mitigate this sort of thing.
gollark: If you do *not* use that, then people can store a bunch of precalculated mappings from hashes to original passwords (rainbow tables, yes) and work out the original.
gollark: That's why salts are recommended (they're a bit of extra data you store along with the password and feed to the hash function when hashing it in the first place and comparing passwords with the hash).
gollark: The main attack on this is that you can, sometimes even using dedicated ASICs/FPGAs, run hashes *very fast* on a lot of possibilities and figure out what the original password was.
gollark: Yep!

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.