SearcharxivSearch

arXiv subjects

Mariia Rodinko

Publications and source records attributed to Mariia Rodinko.

2 recordsLinked to original sources

Kalyna Block Cipher: From Design Space Exploration to ASIC Design

The Kalyna block cipher is a Ukrainian cryptography standard, selected through a national competition held between 2007 and 2010 and approved in 2015. Although its software implementations have been introduced, hardware-efficient implementations of the algorithm, i.e., accelerators, do not exist. In this paper, we explore various design architectures to implement its encryption, decryption, and unified encryption/decryption functions, considering the trade-off between area and latency. We present hardware reduction techniques and introduce alternative designs with low area, latency, and energy consumption, targeting an application-specific integrated circuit (ASIC). We present hardware-efficient designs that include countermeasures against side-channel analysis (SCA) and fault injection (FI) attacks, such as hiding, masking, and duplication techniques. We validate these implementations in a 65\;nm ASIC chip. Experimental results confirm the need for alternative designs that explore the design search space for different requirements. The proposed architectures enable hiding the power SCA leakage by randomizing the execution of operations, and the temporal duplication in designs with countermeasures against the SCA attacks can mitigate the FI attacks. The functionality of the ASIC test chip, including various Kalyna designs, is validated through measurements.

cs.CR

Enhancing Decentralization in Blockchain Decision-Making Through Quadratic Voting and Its Generalization

This study explores the application of Quadratic Voting (QV) and its generalization to improve decentralization and effectiveness in blockchain governance systems. The conducted research identified three main types of quadratic (square root) voting. Two of them pertain to voting with a split stake, and one involves voting without splitting. In split stakes, Type 1 QV applies the square root to the total stake before distributing it among preferences, while Type 2 QV distributes the stake first and then applies the square root. In unsplit stakes (Type 3 QV), the square root of the total stake is allocated entirely to each preference. The presented formal proofs confirm that Types 2 and 3 QV, along with generalized models, enhance decentralization as measured by the Gini and Nakamoto coefficients. A pivotal discovery is the existence of a threshold stakeholder whose relative voting ratio increases under QV compared to linear voting, while smaller stakeholders also gain influence. The generalized QV model allows flexible adjustment of this threshold, enabling tailored decentralization levels. Maintaining fairness, QV ensures that stakeholders with higher stakes retain a proportionally greater voting ratio while redistributing influence to prevent excessive concentration. It is shown that to preserve fairness and robustness, QV must be implemented alongside privacy-preserving cryptographic voting protocols, as voters casting their ballots last could otherwise manipulate outcomes. The generalized QV model, proposed in this paper, enables algorithmic parametrization to achieve desired levels of decentralization for specific use cases. This flexibility makes it applicable across diverse domains, including user interaction with cryptocurrency platforms, facilitating community events and educational initiatives, and supporting charitable activities through decentralized decision-making.

cs.GT