English
Related papers

Related papers: $\mu$Kummer: efficient hyperelliptic signatures an…

200 papers

We discuss the use of elliptic curves in cryptography on high-dimensional surfaces. In particular, instead of a Diffie-Hellman key exchange protocol written in the form of a bi-dimensional row, where the elements are made up with 256 bits,…

Cryptography and Security · Computer Science 2016-10-06 Alberto Sonnino , Giorgio Sonnino

qDSA is a high-speed, high-security signature scheme that facilitates implementations with a very small memory footprint, a crucial requirement for embedded systems and IoT devices, and that uses the same public keys as modern…

Cryptography and Security · Computer Science 2017-09-12 Joost Renes , Benjamin Smith

In modern critical infrastructure such as power grids, it is crucial to ensure security of data communications between network-connected devices while following strict latency criteria. This necessitates the use of cryptographic hardware…

Cryptography and Security · Computer Science 2025-04-08 Aniket Banerjee , Utsav Banerjee

Elliptic Curve Cryptography (ECC) is widely accepted for ensuring secure data exchange between resource-limited IoT devices. The National Institute of Standards and Technology (NIST) recommended implementation, such as B-163, is…

Hardware Architecture · Computer Science 2025-06-17 Ruby Kumari , Tapas Rout , Babul Saini , Jai Gopal Pandey , Abhijit Karmakar

Modular reduction is a crucial operation in many post-quantum cryptographic schemes, including the Kyber key exchange method or Dilithium signature scheme. However, it can be computationally expensive and pose a performance bottleneck in…

Cryptography and Security · Computer Science 2023-08-30 Robin Müller , Willi Meier , Christoph F. Wildfeuer

Efficient scalar multiplication is critical for enhancing the performance of elliptic curve cryptography (ECC), especially in applications requiring large-scale or real-time cryptographic operations. This paper proposes an M-ary…

Cryptography and Security · Computer Science 2025-05-06 Tongxi Wu , Xufeng Liu , Jin Yang , Yijie Zhu , Shunyang Zeng , Mingming Zhan

Code that is highly optimized poses a problem for program-level verification: programmers can employ various clever tricks that are non-trivial to reason about. For cryptography on low-power devices, it is nonetheless crucial that…

Cryptography and Security · Computer Science 2021-03-30 Marc Schoolderman , Jonathan Moerman , Sjaak Smetsers , Marko van Eekelen

Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…

Cryptography and Security · Computer Science 2019-05-20 Wesam Eid , Marius C. Silaghi

The performance of any elliptic curve cryptography hardware accelerator significantly relies on the efficiency of the underlying point multiplication (PM) architecture. This article presents a hardware implementation of field-programmable…

After 38 years of birthday Diffie-Hellman Key Exchange (DHKE), there are many proposed improvements in the DHKE protocol to encounter modern security issues. This protocol seems quite simple to be implemented, but it can be vulnerable to…

Cryptography and Security · Computer Science 2014-09-02 Mohd Anuar Mat Isa , Habibah Hashim , Jamalul-lail Ab Manan , Syed Farid Syed Adnan , Ramlan Mahmod

Elliptic curve cryptography (ECC) has emerged as the dominant public-key protocol, with NIST standardizing parameters for binary field GF(2^m) ECC systems. This work presents a hardware implementation of a Hybrid Multiplication technique…

Cryptography and Security · Computer Science 2025-06-25 Ruby Kumari , Gaurav Purohit , Abhijit Karmakar

Smart grid is a self-sufficient system. That tracks how the energy is used from its source to its final destination. The smart grid can increase the service quality while reducing the consumption of electricity. However, the safety and…

Cryptography and Security · Computer Science 2023-06-16 Shivali Meenakshi

In this paper, we propose an elliptic curve key generation processor over GF(2m) and GF(P) with Network-on-Chip (NoC) design scheme based on binary scalar multiplication algorithm. Over the Two last decades, Elliptic Curve Cryptography…

Cryptography and Security · Computer Science 2011-10-06 Hamid Javashi , Reza Sabbaghi-Nadooshan

We present a cryptanalysis of a key exchange protocol based on the digital semiring. For this purpose, we find the maximal solution of a linear system over such semiring, and use the properties of circulant matrix to demonstrate that the…

Cryptography and Security · Computer Science 2025-06-18 Alvaro Otero Sanchez

Multi-scalar multiplication (MSM) is crucial in cryptographic applications and computationally intensive in zero-knowledge proofs. MSM involves accumulating the products of scalars and points on an elliptic curve over a 377-bit modulus, and…

Hardware Architecture · Computer Science 2025-02-18 Ayumi Ohno , Kotaro Shimamura , Shinya Takamaeda-Yamazaki

Multitenancy increases throughput and reduces costs in cloud-based quantum computing, but concurrent job execution introduces security risks through inter-circuit crosstalk. We characterize the structural predictability of these…

Quantum Physics · Physics 2026-05-04 Andrew Woods , Chi-Ren Shyu

CRYSTAL-Kyber (Kyber) is one of the post-quantum cryptography (PQC) key-encapsulation mechanism (KEM) schemes selected during the standardization process. This paper addresses optimization for Kyber architecture with respect to latency and…

Cryptography and Security · Computer Science 2023-12-05 Weihang Tan , Yingjie Lao , Keshab K. Parhi

Resource constraints in smart devices demand an efficient cryptosystem that allows for low power and memory consumption. This has led to popularity of comparatively efficient Elliptic curve cryptog-raphy (ECC). Prior to this paper, much of…

Cryptography and Security · Computer Science 2015-02-09 Yasir Malik

We present a new key exchange protocol based on circulant matrices acting on matrices over a congruence-simple semiring. We describe how to compute matrices with the necessary properties for the implementation of the protocol. Additionally,…

Commutative Algebra · Mathematics 2025-05-14 Alvaro Otero Sanchez

Rivest-Shamir-Adleman (RSA) cryptosystem uses modular multiplication for encryption and decryption. So, performance of RSA can be drastically improved by optimizing modular multiplication. This paper proposes a new parallel, high-radix…

Hardware Architecture · Computer Science 2020-09-09 Javad Bagherzadeh , Vishishtha Bothra , Disha Gujar , Sugandha Gupta , Jinal Shah
‹ Prev 1 2 3 10 Next ›