Blockchain technology has attracted a lot of research interest in the last few years. Originally, their consensus algorithm was Hashcash, which is an instance of the so-called Proof-of-Work. Nowadays, there are several competing consensus algorithms, not necessarily PoW. In this paper, we propose an alternative proof of work algorithm which is based on the solution of consecutive discrete logarithm problems over the point group of elliptic curves. At the same time, we sketch a blockchain scheme, whose consensus is reached via our algorithm. In the considered architecture, the curves are pseudorandomly determined by block creators, chosen to be cryptographically secure and changed every epoch. Given the current state of the chain and a prescribed set of transactions, the curve selection is fully rigid, therefore trust is needed neither in miners nor in the scheme proposers.
We show how a small subgroup confinement-like attack may be mounted on the Bitcoin addresses generation protocol, by inspecting a special subgroup of the group associated to point multiplication. This approach does not undermine the system security but highlights the importance of using fair random sources during the private key selection.
We describe first-degree prime ideals of biquadratic extensions in terms of the first-degree prime ideals of two underlying quadratic fields. The identification of the prime divisors is given by numerical conditions involving their ideal norms. The correspondence between these ideals in the larger ring and those in the smaller ones extends to the divisibility of specially-shaped principal ideals in their respective rings, with some exceptions that we explicitly characterize.
About Me
Please visit my updated website:
https://sites.google.com/view/danieletaufer
Please visit my updated website:
https://sites.google.com/view/danieletaufer