Problem Sets

PS7: In problem 4, assume a unique binary representation for each element of G and an efficient way to recognize if a binary string represents an element of G, and assume an efficient algorithm to apply the group operation on two elements.  You can find a solution in https://arxiv.org/pdf/cs/0101004.pdf.  Give a concise explanation of their approach in your own words; you can accept the theorems they use without proof.