Re^2: Challenge: A malicious election

Your comment in the spoiler made me think of this kind of an approach to

use strict;
use warnings;

my @candidates = qw( Alice Bob );

## initialize each candidate with 0 votes
my %votes;
   @votes{map lc, @candidates} = ( [0] ) x @candidates;

print "Available candidates: @candidates\n";
print "To cast a vote, type candidate's name. End the election with ^D
+\n";

## record the input vote
while (<>) {
    chomp( my $vote = lc $_ );
    if ( exists $votes{$vote} ) {
        $votes{$vote}[0]++;
    } else {
        warn "Invalid candidate!\n";
    }
}

## print all votes
print "Final results:\n";
printf "%10s : %d\n", $_, $votes{lc $_}[0]
  for @candidates;
[download]

What it does wrong:

Every value in %votes is a reference to the same array ref. So all votes are actually recorded for both candidates, and the election is a tie. This isn't ideal in terms of covertness, since the program reports twice as many votes as were cast.

What would be much nicer is if there is some way to sneak in a division-by-two on the votes, so there will always be the right number of votes (or one less). Perhaps someone can think of a way to sneak >>=1 in there? Or some cleverness in the printf template?

I also think that since having the extra array ref in there is suspicious, one could try to store extra data in the array @{ $votes{$candidate} }. I couldn't think of anything very convincing though.

blokhead

Comment on Re^2: Challenge: A malicious election Select or Download Code


more useful options
	PerlMonks