281 research outputs found
Efficient Side-Channel Aware Elliptic Curve Cryptosystems over Prime Fields
Elliptic Curve Cryptosystems (ECCs) are utilized as an alternative to traditional public-key cryptosystems, and are more suitable for resource limited environments due to smaller parameter size. In this dissertation we carry out a thorough investigation of side-channel attack aware ECC implementations over finite fields of prime characteristic including the recently introduced Edwards formulation of elliptic curves, which have built-in resiliency against simple side-channel attacks. We implement Joye\u27s highly regular add-always scalar multiplication algorithm both with the Weierstrass and Edwards formulation of elliptic curves. We also propose a technique to apply non-adjacent form (NAF) scalar multiplication algorithm with side-channel security using the Edwards formulation. Our results show that the Edwards formulation allows increased area-time performance with projective coordinates. However, the Weierstrass formulation with affine coordinates results in the simplest architecture, and therefore has the best area-time performance as long as an efficient modular divider is available
Post-quantum cryptography
Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.</p
An Analysis of ZVP-Attack on ECC Cryptosystems
Elliptic curve cryptography (ECC) is an efficient public cryptosystem with
a short key size. For this reason it is suitable for implementing on memory-constraint
devices such as smart cards, mobile devices, etc. However, these devices leak information
about their private key through side channels (power consumption, electromagnetic
radiation, timing etc) during cryptographic processing. In this paper we have examined
countermeasures against a specific class of side channel attacks (power analysis) called
Zero-Value Point Attack (ZVP), using elliptic curve isomorphism and isogeny. We found
that these methods are an efficient way of securing cryptographic devices using ECC
against ZVP attack. Our main contribution is to extend the work of Akishita and Takagi
[3,2] to binary fields. We also provide a more detail analysis of the ZVP attack over
prime fields
FPGA IMPLEMENTATION FOR ELLIPTIC CURVE CRYPTOGRAPHY OVER BINARY EXTENSION FIELD
Elliptic curve cryptography plays a crucial role in network and communication security. However, implementation of elliptic curve cryptography, especially the implementation of scalar multiplication on an elliptic curve, faces multiple challenges. One of the main challenges is side channel attacks (SCAs). SCAs pose a real threat to the conventional implementations of scalar multiplication such as binary methods (also called doubling-and-add methods). Several scalar multiplication algorithms with countermeasures against side channel attacks have been proposed. Among them, Montgomery Powering Ladder (MPL) has been shown an effective countermeasure against simple power analysis. However, MPL is still vulnerable to certain more sophisticated side channel attacks. A recently proposed modified MPL utilizes a combination of sequence masking (SM), exponent splitting (ES) and point randomization (PR). And it has shown to be one of the best countermeasure algorithms that are immune to many sophisticated side channel attacks [11]. In this thesis, an efficient hardware architecture for this algorithm is proposed and its FPGA implementation is also presented. To our best knowledge, this is the first time that this modified MPL with SM, ES, and PR has been implemented in hardware
Envisioning the Future of Cyber Security in Post-Quantum Era: A Survey on PQ Standardization, Applications, Challenges and Opportunities
The rise of quantum computers exposes vulnerabilities in current public key
cryptographic protocols, necessitating the development of secure post-quantum
(PQ) schemes. Hence, we conduct a comprehensive study on various PQ approaches,
covering the constructional design, structural vulnerabilities, and offer
security assessments, implementation evaluations, and a particular focus on
side-channel attacks. We analyze global standardization processes, evaluate
their metrics in relation to real-world applications, and primarily focus on
standardized PQ schemes, selected additional signature competition candidates,
and PQ-secure cutting-edge schemes beyond standardization. Finally, we present
visions and potential future directions for a seamless transition to the PQ
era
Algorithmic Security is Insufficient: A Comprehensive Survey on Implementation Attacks Haunting Post-Quantum Security
This survey is on forward-looking, emerging security concerns in post-quantum
era, i.e., the implementation attacks for 2022 winners of NIST post-quantum
cryptography (PQC) competition and thus the visions, insights, and discussions
can be used as a step forward towards scrutinizing the new standards for
applications ranging from Metaverse, Web 3.0 to deeply-embedded systems. The
rapid advances in quantum computing have brought immense opportunities for
scientific discovery and technological progress; however, it poses a major risk
to today's security since advanced quantum computers are believed to break all
traditional public-key cryptographic algorithms. This has led to active
research on PQC algorithms that are believed to be secure against classical and
powerful quantum computers. However, algorithmic security is unfortunately
insufficient, and many cryptographic algorithms are vulnerable to side-channel
attacks (SCA), where an attacker passively or actively gets side-channel data
to compromise the security properties that are assumed to be safe
theoretically. In this survey, we explore such imminent threats and their
countermeasures with respect to PQC. We provide the respective, latest
advancements in PQC research, as well as assessments and providing visions on
the different types of SCAs
ΠΠΎΠΊΠ°Π·Π½ΠΈΠΊΠΈ ΠΎΡΡΠ½ΠΊΠΈ Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΡΠ² ΡΠΈΡΡΡΠ²Π°Π½Π½Ρ Π½Π° Π΅Π»ΡΠΏΡΠΈΡΠ½ΠΈΡ ΠΊΡΠΈΠ²ΠΈΡ
ΠΠ°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎ ΠΏΠΎΠΊΠ°Π·Π½ΠΈΠΊΠΈ Π΄Π»Ρ ΠΎΡΡΠ½ΠΊΠΈ Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΡ Π·Π°ΡΡΠΎΡΡΠ²Π°Π½Π½Ρ Π°Π»Π³ΠΎΡΠΈΡΠΌΡΠ² ΡΠΈΡΡΡΠ²Π°Π½Π½Ρ Π½Π° Π΅Π»ΡΠΏΡΠΈΡΠ½ΠΈΡ
ΠΊΡΠΈΠ²ΠΈΡ
Π΄Π»Ρ Π·Π°Π΄Π°Ρ Π·Π°Ρ
ΠΈΡΡΡ ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΡ. ΠΠ»Ρ ΠΎΡΡΠ½ΠΊΠΈ Π²ΠΊΠ°Π·Π°Π½ΠΈΡ
ΠΏΠΎΠΊΠ°Π·Π½ΠΈΠΊΡΠ² ΡΡΠΎΡΠΌΠΎΠ²Π°Π½ΠΎ ΠΊΡΠΈΡΠ΅ΡΡΡ.In this paper the authors have proposed the parameters to estimate the effectiveness of elliptic curve cipher algorithms usage to solve the data protection tasks. To evaluate these parameters some criteria have been formed
- β¦