Results 61 to 70 of about 290 (181)
Erasure‐Coded Sharding and Proof‐of‐Storage for Practical Blockchain Trilemma Balance
IET Blockchain, Volume 6, Issue 1, January/December 2026.The proposed storage‐first blockchain framework resolves the blockchain trilemma by synergistically combining decentralised storage, zero‐knowledge proofs and sharded proof‐of‐storage consensus. Empirical evaluation demonstrates a peak throughput of 2800 transactions per second with low latency and strong Byzantine fault tolerance, while substantially ...
Saha Reno +3 more
wiley +1 more source
Heuristics on pairing-friendly elliptic curves
Journal of Mathematical Cryptology, 2012 We present a heuristic asymptotic formula as for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree , with fixed discriminant, with rho-value bounded by a fixed such that , and with prime ...
Boxall John
doaj +1 more source
Towards Isogeny-Based Password-Authenticated Key Establishment
Journal of Mathematical Cryptology, 2020 Password authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the absence of public key infrastructure.
Taraskin Oleg +3 more
doaj +1 more source
On the supersingular GPST attack
Journal of Mathematical Cryptology, 2021 The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange.
Basso Andrea, Pazuki Fabien
doaj +1 more source
Quantum‐Resistant Security in Digital Twin Healthcare Systems
IET Wireless Sensor Systems, Volume 16, Issue 1, January/December 2026.Quantum‐safe architecture for secure healthcare data transmission integrating QKD, edge devices, and cloud‐based Digital Twin analytics. ABSTRACT The development of digital twin (DT) systems for healthcare presents several challenges, particularly in ensuring data protection and communication security in real‐time environments.
Ahmed K. Jameil, Hamed Al‐Raweshidy
wiley +1 more source
The modular automorphisms of quotient modular curves
Mathematika, Volume 72, Issue 1, January 2026.Abstract We obtain the modular automorphism group of any quotient modular curve of level N$N$, with 4,9∤N$4,9\nmid N$. In particular, we obtain some unexpected automorphisms of order 3 that appear for the quotient modular curves when the Atkin–Lehner involution w25$w_{25}$ belongs to the quotient modular group. We also prove that such automorphisms are
Francesc Bars, Tarun Dalal
wiley +1 more source
Optimized SeaSign for Enhanced Efficiency
IEEE AccessThis paper optimized SeaSign – an isogeny-based digital signature algorithm that combines the class group actions of CSIDH with the notion of Fiat-Shamir with abort.
Suhri Kim
doaj +1 more source
A note on the cohomology of moduli spaces of local shtukas
Bulletin of the London Mathematical Society, Volume 57, Issue 12, Page 3709-3729, December 2025.Abstract We study localized versions of spectral action of Fargues–Scholze, using methods from higher algebra. As our main motivation and application, we deduce a formula for the cohomology of moduli spaces of local shtukas under certain genericity assumptions, and discuss its relation with the Kottwitz conjecture.
David Hansen, Christian Johansson
wiley +1 more source
POKEx: Performance Analysis of POKÉ-Key Exchange and SIDH-Variants
IEEE AccessIn this paper, we present a comparative performance analysis of the POKÉ-based key exchange and SIDH variants. SIDH gained attention for its small key size and efficient performance, and has been selected as an alternate candidate in NIST PQC ...
Hyeonhak Kim, Suhri Kim
doaj +1 more source
A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
Journal of Mathematical Cryptology, 2020 We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David +3 more
doaj +1 more source