void main()
{
int a[100];
int n;
RandomArray(a,n);
PrintArray(a,n);
getch();
}
void main()
{
int a[100];
int n;
RandomArray(a,n);
PrintArray(a,n);
DisplayResult(a,n);
getch();
}
void main()
{
int a[100];
int n;
RandomArray(a,n);
PrintArray(a,n);
FindPosition(a,n);
getch();
}
void main()
{
int a[100];
int n;
RandomArray(a,n);
PrintArray(a,n);
//SimpleSort(a,n);
BinaryInsertionSort(a,n);
PrintArray(a,n);
getch();
}
void main()
{
int a[100];
int b[100];
int n;
int m = 0;
RandomArray(a,n);
CreateNewArray(a,b,n,m);
PrintArray(a,n);
PrintArray(b,m);
getch();
}
int main2(void){
int aScores[20]={0};
int els = numsof(aScores);
int i;
srand((unsigned int)time(NULL));
RandomArray(aScores);
PrintArray(aScores);
BubbleSort(aScores, els);
PrintArray(aScores);
return 0;
}
void main()
{
int a[100];
int h[100];
int n,k;
RandomArray(a,n);
PrintArray(a,n);
GetSteps(h,k,n);
ShellSort(a,n,h,k);
PrintArray(a,n);
getch();
}
void main(){
srand((int)time(NULL));
const int size = 4;
int* array1 = RandomArray(size);
showArray(array1, size);
int* RevArray = ReverseArray1(array1, size);
showArray(RevArray, size);
int AscArray[4] = {};
AscendingArray(array1, AscArray);
showArray(AscArray, size);
}
void RunIntSort(){
Vector<int> randarr = RandomArray(500,0,500);
//unused code for testing an already-sorted list
Vector<int> orderedarr;
for(int i = 0; i < 10000; i++){
orderedarr.add(i);
}
cout << "Testing our CombSort on a vector of random integers..." << endl << endl;
cout << "Here is the unsorted vector of integers:" << endl << endl;
PrintVectorInt(randarr);
CombSort(randarr);
cout << "Here is the sorted version" << endl << endl;
PrintVectorInt(randarr);
}
void RunSetIntSort(){
// Populating a vector with randomized sets.
Vector<Set<int> > testsets;
for(int i = 0; i < 40; i++){
Set<int> newset;
Vector<int> nums = RandomArray(RandomInteger(4,12),0,50);
for(int i = 0; i < nums.size(); i++){
newset.add(nums[i]);
}
testsets.add(newset);
}
// Putting the vector of sets through the sort!
cout << "Testing our CombSort on a vector of sets of integers." << endl << endl;
cout << "Here is the unsorted vector of sets:" << endl << endl;
PrintVectorSetInt(testsets);
CombSort(testsets,SetIntCmp);
cout << "Here is the sorted version." << endl << endl;
PrintVectorSetInt(testsets);
}
bool proofOfShuffle(proofStruct &pfStr,
const Node &w,
const Node &w_prime,
const Node &mu,
const Node &tau_pos,
const Node &sigma_pos)
{
// Byte trees that will be used in this function
Node u;
IntLeaf A_prime;
IntLeaf C_prime;
IntLeaf D_prime;
Node F_prime;
Node B;
Node B_prime;
IntLeaf kA;
IntLeaf kC;
IntLeaf kD;
Node kF;
Node kB;
Node kE;
// Save p,q,g for convenience
const IntLeaf &p = pfStr.Gq.getIntLeafChild(0);
const IntLeaf &q = pfStr.Gq.getIntLeafChild(1);
const IntLeaf &g = pfStr.Gq.getIntLeafChild(2);
// Step 1
// a) assert that mu is array of Pdersen commitments in pfStr.Gq
u = mu;
// Loop through all children and make sure each one is
// a Pedersen commitment in Gq
for(unsigned int i=0; i < pfStr.N; ++i)
{
try {
if(!isPedersenCommitment(pfStr.Gq, u.getIntLeafChild(i)))
{
// u is not a N-array of Pedersen Commitments
return false;
}
}
catch(...)
{
// u is not a N-array of Pedersen Commitments
return false;
}
}
// b) assert that tau_pos is a Node (B, A', B', C', D', F'), where
// A',C',D' is in G_q, F' is in Cw and B and B' are arrays of N
// elements in Gq
try
{
A_prime = tau_pos.getIntLeafChild(1);
C_prime = tau_pos.getIntLeafChild(3);
D_prime = tau_pos.getIntLeafChild(4);
if(!isElemOfGq(pfStr.Gq, A_prime))
{
return false;
}
if(!isElemOfGq(pfStr.Gq, C_prime))
{
return false;
}
if(!isElemOfGq(pfStr.Gq, D_prime))
{
return false;
}
F_prime = tau_pos.getNodeChild(5);
if(pfStr.width == 1) {
Node u;
Node v;
u.addChild(F_prime.getIntLeafChild(0));
v.addChild(F_prime.getIntLeafChild(1));
Node uv;
uv.addChild(u);
uv.addChild(v);
F_prime = uv;
}
if(!isElemOfCw(pfStr, F_prime))
{
return false;
}
B = tau_pos.getNodeChild(0);
B_prime = tau_pos.getNodeChild(2);
for(unsigned int i=0; i<pfStr.N; ++i)
{
if(!isElemOfGq(pfStr.Gq, B.getIntLeafChild(i)))
{
return false;
}
if(!isElemOfGq(pfStr.Gq, B_prime.getIntLeafChild(i)))
{
return false;
}
}
}
catch(...)
{
// tau_pos could not be interpreted as needed
return false;
}
// c) assert that sigma_pos is a Node (kA, kB, kC, kD, kE, kF),
// where kA, kC, kD, kF is in Z_q, kB is an array of N elements in
// Rw and kE is an array of N elements in G_q
try
{
kA = sigma_pos.getIntLeafChild(0);
kC = sigma_pos.getIntLeafChild(2);
kD = sigma_pos.getIntLeafChild(3);
if(pfStr.width == 1) {
kF.addChild(sigma_pos.getNodeChild(5));
} else {
kF = sigma_pos.getNodeChild(5);
}
kB = sigma_pos.getNodeChild(1);
kE = sigma_pos.getNodeChild(4);
if(!isElemOfZn(q, kA) ||
!isElemOfZn(q, kC) ||
!isElemOfZn(q, kD) ||
!isElemOfRw(pfStr, kF))
{
return false;
}
for(unsigned int i=0; i<pfStr.N; ++i)
{
if(!isElemOfZn(q, kB.getIntLeafChild(i)))
{
return false;
}
if(!isElemOfZn(q, kE.getIntLeafChild(i)))
{
return false;
}
}
}
catch(...)
{
return false;
}
// Get random array h - (TODO: could be moved outside of ProofOfShuffle)
DataLeaf generators = DataLeaf("generators");
bytevector seed_data = pfStr.rho;
bytevector seed_data2 = generators.serialize();
seed_data.insert(seed_data.end(), seed_data2.begin(), seed_data2.end());
RO RO_seed = RO(pfStr.hash, pfStr.nH);
IntLeaf s = RO_seed(seed_data);
Node h = RandomArray(pfStr.Gq, pfStr.N, pfStr.hash, s.toVector(), pfStr.nR);
print_debug("ProofOfShuffle: h", h.serializeString());
// Step 2, compute a seed by creating the node/array Node(g,h,u,pk,w,w')
Node seed_gen;
// TODO: Fix h-vector
// Does not work with correct h-vector either
seed_gen.addChild(g);
seed_gen.addChild(h);
seed_gen.addChild(u);
seed_gen.addChild(pfStr.pk);
seed_gen.addChild(w);
seed_gen.addChild(w_prime);
// Concatenate byte representation of rho with seed_gen
bytevector gen = pfStr.rho;
bytevector gen2 = seed_gen.serialize();
gen.insert(gen.end(), gen2.begin(), gen2.end());
print_debug("ProofOfShuffle: s_hash", gen);
// Create a random oracle to be used to generate a seed, seedlen specified
RO rs = RO(pfStr.hash, pfStr.nE);
// Generate the seed
IntLeaf seed = rs(gen);
print_debug("ProofOfShuffle: s", seed.toVector());
// Step 3 - TODO: Runda upp nE/8
PRG prg = PRG(pfStr.hash, seed.serialize(), (pfStr.nE/8)*8);
Node t;
for(unsigned int i=0; i<pfStr.N; ++i)
{
t.addChild(prg.next());
}
// e_i = t_i mod 2^(nE)
IntLeaf exp(2);
exp.expTo(pfStr.nE);
Node e = t.mod(exp);
// compute A and F
IntLeaf A = u.expMultMod(e, p);
Node F;
{
Node u = w.getNodeChild(0);
Node v = w.getNodeChild(1);
if(pfStr.width == 1) {
F.addChild(u.expMultMod(e, p));
F.addChild(v.expMultMod(e, p));
} else {
Node a, b;
for(unsigned int i = 0; i < pfStr.width; i++) {
a.addChild(u.getNodeChild(i).expMultMod(e, p));
b.addChild(v.getNodeChild(i).expMultMod(e, p));
}
F.addChild(a);
F.addChild(b);
}
}
print_debug("ProofOfShuffle: A", A.serializeString());
print_debug("ProofOfShuffle: F", F.serializeString());
print_debug("ProofOfShuffle: B", B.serializeString());
print_debug("ProofOfShuffle: Ap", A_prime.serializeString());
print_debug("ProofOfShuffle: Bp", B_prime.serializeString());
print_debug("ProofOfShuffle: Cp", C_prime.serializeString());
print_debug("ProofOfShuffle: Dp", D_prime.serializeString());
print_debug("ProofOfShuffle: Fp", F_prime.serializeString());
// Step 4, compute a challenge
// challenge_gen = Node(seed, tau_pos)
Node challenge_gen;
challenge_gen.addChild(seed);
challenge_gen.addChild(tau_pos);
// concatenate rho with the Node above
gen = pfStr.rho;
gen2 = challenge_gen.serialize();
gen.insert(gen.end(), gen2.begin(), gen2.end());
// create a challenge RO
RO RO_challenge = RO(pfStr.hash, pfStr.nV);
// use the seed above to generate v, interpret v as non-negative integer
IntLeaf v = RO_challenge(gen);
// Step 5 - Compute C, D and check that equalities hold as specified
IntLeaf C = u.prodMod(p).multMod(h.prodMod(p).inverse(p), p);
IntLeaf D = B.getIntLeafChild(pfStr.N - 1).multMod(h.getIntLeafChild(0).expMod(e.prodMod(p), p).inverse(p),p);
print_debug("ProofOfShuffle: v", v.toVector());
print_debug("ProofOfShuffle: C", C.serializeString());
print_debug("ProofOfShuffle: D", D.serializeString());
print_debug("ProofOfShuffle: k_A", kA.serializeString());
print_debug("ProofOfShuffle: k_B", kB.serializeString());
print_debug("ProofOfShuffle: k_C", kC.serializeString());
print_debug("ProofOfShuffle: k_D", kD.serializeString());
print_debug("ProofOfShuffle: k_F", kF.serializeString());
// Check A^v * A' == g^kA * prod h_i^kE_i
IntLeaf left = A.expMod(v, p).multMod(A_prime, p);
IntLeaf right = g.expMod(kA, p).multMod(h.expMultMod(kE, p), p);
if(A.expMod(v, p).multMod(A_prime, p) != g.expMod(kA, p).multMod(h.expMultMod(kE, p), p))
{
return false;
}
// Check B_i^v * B'_i == g^kB_i * B_{i-1}^kE_i for i = 1,...,N-1
for(unsigned int i=1; i<pfStr.N; ++i)
{
if(B.getIntLeafChild(i).expMod(v, p).multMod(B_prime.getIntLeafChild(i), p) !=
g.expMod(kB.getIntLeafChild(i),p).multMod(B.getIntLeafChild(i-1).expMod(kE.getIntLeafChild(i),p), p))
{
return false;
}
}
// Handling case: B.getChild(i-1) = h_0, i.e i == 0
if(B.getIntLeafChild(0).expMod(v,p).multMod(B_prime.getIntLeafChild(0), p) !=
g.expMod(kB.getIntLeafChild(0),p).multMod(h.getIntLeafChild(0).expMod(kE.getIntLeafChild(0),p),p))
{
return false;
}
// Check C^v * C' == g^kC
if(C.expMod(v, p).multMod(C_prime,p) != g.expMod(kC, p))
{
return false;
}
// Check D^v * D' == g^kD
if(D.expMod(v, p).multMod(D_prime, p) != g.expMod(kD, p))
{
return false;
}
// Check F^v * F' = Enc_pk(1, -kF)* prod (w'_i)^kE_i
/*if(pfStr.width == 1) {
}*/
//TODO: Fixa denna kodrad
/*if(F.expMod(v, p) * F_prime != Enc(pfStr.pk, IntLeaf(1), -kF, p) * w_prime.expMultMod(kE, p))
{
return false;
}*/
// All equalities holds, return true
return true;
}
