Results 51 to 60 of about 18,463 (180)
On fixed‐point‐free involutions in actions of finite exceptional groups of Lie type
Abstract Let G$G$ be a nontrivial transitive permutation group on a finite set Ω$\Omega$. By a classical theorem of Jordan, G$G$ contains a derangement, which is an element with no fixed points on Ω$\Omega$. Given a prime divisor r$r$ of |Ω|$|\Omega |$, we say that G$G$ is r$r$‐elusive if it does not contain a derangement of order r$r$. In a paper from
Timothy C. Burness, Mikko Korhonen
wiley +1 more source
Classical and Quantum Algorithms for Isogeny-based Cryptography [PDF]
Isogeny-based cryptography using supersingular elliptic curves --- most prominently, the constructions of De Feo-Jao-Plut --- is one of the few practical candidates for post-quantum public key cryptography. Its formidable security claim is earned through
Sankar, Anirudh
core
Genus two isogeny cryptography [PDF]
We study (ℓ,ℓ) -isogeny graphs of principally polarised supersingular abelian surfaces (PPSSAS). The (ℓ,ℓ) -isogeny graph has cycles of small length that can be used to break the collision resistance assumption of the genus two isogeny hash function ...
Ti, YB +4 more
core +2 more sources
Hasse principle for Kummer varieties in the case of generic 2‐torsion
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
Genus Two Isogeny Cryptography [PDF]
We study $(\ell,\ell)$-isogeny graphs of principally polarised supersingular abelian surfaces (PPSSAS). The $(\ell,\ell)$-isogeny graph has cycles of small length that can be used to break the collision resistance assumption of the genus two isogeny hash
Yan Bo Ti, E. V. Flynn
core
Towards quantum‐safe blockchain: Exploration of PQC and public‐key recovery on embedded systems
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
New Techniques for SIDH-based NIKE
We consider the problem of producing an efficient, practical, quantum-resistant non-interactive key exchange (NIKE) protocol based on Supersingular Isogeny Diffie-Hellman (SIDH).
Urbanik David, Jao David
doaj +1 more source
Constructing Efficient Identity‐Based Signatures on Lattices
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 +4 more
wiley +1 more source
Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation
Addition is an essential operation in all cryptographic algorithms. Higher levels of security require larger key sizes and this becomes a limiting factor in GF(p) using large integers because of the carry propagation problem.
Bader Alhazmi, Fayez Gebali
doaj +1 more source
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

