Results 41 to 50 of about 23,538,535 (168)
The rapid advancement of quantum computing, exemplified by Shor’s and Grover’s algorithms, poses an existential threat to the Rivest-Shamir-Adleman algorithm, elliptic curve cryptography, and symmetric encryption.
Anuththara Hettiarachchi +2 more
doaj +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
ATIs in cereal seeds link to celiac disease, asthma, and immune response. Here, we report the first study exploring genetic factors affecting ATI levels in barley. GWAS identified multiple QTNs influencing ATI accumulation with notable variation. Eight QTNs are associated with lower ATI levels; a key gene was identified.
Dalia Z. Alomari +8 more
wiley +1 more source
Finding Practical Parameters for Isogeny-based Cryptography
Isogeny-based schemes often come with special requirements on the field of definition of the involved elliptic curves. For instance, the efficiency of SQIsign, a promising candidate in the NIST signature standardisation process, requires a large power of two and a large smooth integer
Maria Corte-Real Santos +3 more
openaire +2 more sources
Towards Isogeny-Based Password-Authenticated Key Establishment
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
Erasure‐Coded Sharding and Proof‐of‐Storage for Practical Blockchain Trilemma Balance
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
Exploring Post-Quantum Cryptography: Review and Directions for the Transition Process
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 +2 more
doaj +1 more source
A Signal‐Matching Approach to RLWE‐Based PSI: Achieving Optimal Online Efficiency in 3 Rounds
In this study, we propose a novel post‐quantum private set intersection (PSI) protocol based on the ring learning with errors (RLWE) assumption. Different from existing PSI protocols based on post‐quantum oblivious pseudorandom functions (EUROCRYPT’25) and fully homomorphic encryption (FHE) (CCS’21), our construction follows the Diffie–Hellman (DH ...
Yue Qin +5 more
wiley +1 more source
Quantum‐Resistant Security in Digital Twin Healthcare Systems
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
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

