creates a pdf file contaning marks for all valid and invalid marks,
a bar code with the digital signature of the serial number + the marks and
in a corner it has the chosen page, the serial number and the marked possitions
Computes the mark permutations using the following algorithm
For P:
Let M be a byte array of length 16 (see below how M is constructed for P1,P2,D2)
Compute a secret key SK = Dmk1(C xor Emk2(C xor Emk1(M))) AES128 ECB NoPadding
Let MM be a byte array of length 2, MM[0]=question number, MM[1]=answer number
Using the secret key SK, encrypt MM using AES128 ECB PKCS#5Padding
sort the cryptograms to generate the permutation
For P1:
M=serial+"top"
For P2:
M=serial+"bottom"
For D2:
M=DInstanceNumber+serial+"d2"
D4 is computed from P1,P2,P4
The format of the permutatio is:
each permutation is represented as an array of possitive bytes (thus max 127).
Initializes the meeting with mk1=mk2=c={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15},
100 ballots, 2 D tables
Creates a default Election Specification (4 questions, 1 out of 2, 1 out of 5, 3 out of 6, rank 3 out of 4)