Results 51 to 60 of about 2,050 (182)

Hasse principle for Kummer varieties in the case of generic 2‐torsion

Proceedings of the London Mathematical Society, Volume 131, Issue 1, July 2025.
Abstract Conditional on finiteness of relevant Shafarevich–Tate groups, Harpaz and Skorobogatov used Swinnerton‐Dyer's descent‐fibration method to establish the Hasse principle for Kummer varieties associated to a 2‐covering of a principally polarised abelian variety under certain largeness assumptions on its mod 2 Galois image.
Adam Morgan
wiley   +1 more source

Towards quantum‐safe blockchain: Exploration of PQC and public‐key recovery on embedded systems

IET Blockchain, Volume 5, Issue 1, January/December 2025.
This paper addresses the need for quantum‐safe blockchain solutions specifically for embedded systems by integrating Post‐Quantum Cryptography (PQC) into blockchain frameworks. We propose a quantum‐secure blockchain architecture using NIST‐standardized PQC algorithms, finding Falcon‐512 to be optimal for embedded environments due to its security and ...
Dominik Marchsreiter
wiley   +1 more source

dCTIDH: Fast & Deterministic CTIDH

Transactions on Cryptographic Hardware and Embedded Systems
This paper presents dCTIDH, a CSIDH implementation that combines two recent developments into a novel state-of-the-art deterministic implementation. We combine the approach of deterministic variants of CSIDH with the batching strategy of CTIDH, which ...
Fabio Campos, Andreas Hellenbrand, Michael Meyer, Krijn Reijnders   +3 more
doaj   +1 more source

Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?

, 2005
The aim of this paper is to justify the common cryptographic practice of selecting elliptic curves using their order as the primary criterion. We can formalize this issue by asking whether the discrete log problem (DLOG) has the same difficulty for all ...
Jao, David, Miller, Stephen D., Venkatesan, Ramarathnam   +2 more
core   +2 more sources

On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average [PDF]

, 2015
For an elliptic curve E/Q without complex multiplication we study the distribution of Atkin and Elkies primes l, on average, over all good reductions of E modulo primes p.
Andrew, Igor E. Shparlinski, V. Sutherland   +2 more
core   +2 more sources

Constructing Efficient Identity‐Based Signatures on Lattices

IET Information Security, Volume 2025, Issue 1, 2025.
In this work, we explore the recent developments related to lattice‐based signature and preimage sampling, and specify a compact identity‐based signature (IBS) on an ideal lattice for practical use. Specifically, we first propose an ellipsoid version of the G + G signature scheme (Asiacrypt 2023) that achieves slightly better signature size and higher ...
Huiwen Jia, Ying Liu, Chunming Tang, Lin Wang, Qichun Wang   +4 more
wiley   +1 more source

Constructing Permutation Rational Functions From Isogenies

, 2017
A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$.
Bisson, Gaetan, Tibouchi, Mehdi
core   +2 more sources

Explicit CM-theory for level 2-structures on abelian surfaces [PDF]

, 2011
For a complex abelian variety $A$ with endomorphism ring isomorphic to the maximal order in a quartic CM-field $K$, the Igusa invariants $j_1(A), j_2(A),j_3(A)$ generate an abelian extension of the reflex field of $K$.
Broker, Reinier, Gruenewald, David, Lauter, Kristin   +2 more
core   +2 more sources

x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes

IET Quantum Communication, Volume 5, Issue 4, Page 349-359, December 2024.
An efficient architecture for BRLWE‐based PQC schemes is proposed. It comprises a modified LFSR structure to obtain less latency and high throughput compared to the existing works. Due to reduction in latency, the performance metrics such as delay and area‐delay product (ADP) are also improved.
Shaik Ahmadunnisa, Sudha Ellison Mathe
wiley   +1 more source

Exploring Post-Quantum Cryptography: Review and Directions for the Transition Process

Technologies
As quantum computing advances, current cryptographic protocols are increasingly vulnerable to quantum attacks, particularly those based on Public Key Infrastructure (PKI) like RSA or Elliptic Curve Cryptography (ECC).
Kanza Cherkaoui Dekkaki, Igor Tasic, Maria-Dolores Cano   +2 more
doaj   +1 more source