Results 91 to 100 of about 2,168 (195)

New Techniques for SIDH-based NIKE

open access: yesJournal of Mathematical Cryptology, 2020
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

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

open access: yesIET 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

On the Distribution of Atkin and Elkies Primes [PDF]

open access: yes, 2011
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational points on E ...
Shparlinski, Igor E.   +1 more
core   +2 more sources

Quantum blockchain: Trends, technologies, and future directions

open access: yesIET Quantum Communication, Volume 5, Issue 4, Page 516-542, December 2024.
This article surveys the current state of blockchain technology, emphasising its security, authentication protocols, AI integration, and the emerging field of quantum blockchain. It highlights how quantum computing can enhance blockchain security and the necessity for quantum‐resistant designs to ensure the robustness of blockchain networks against ...
Manjula Gandhi S   +15 more
wiley   +1 more source

Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation

open access: yesIEEE Access, 2019
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

On isogeny classes of Edwards curves over finite fields [PDF]

open access: yes, 2011
We count the number of isogeny classes of Edwards curves over finite fields, answering a question recently posed by Rezaeian and Shparlinski. We also show that each isogeny class contains a {\em complete} Edwards curve, and that an Edwards curve is ...
Ahmadi, Omran, Granger, Robert
core   +1 more source

On the cyclicity of the rational points group of abelian varieties over finite fields

open access: yes, 2018
We propose a simple criterion to know if an abelian variety $A$ defined over a finite field $\mathbb{F}_q$ is cyclic, i.e., it has a cyclic group of rational points; this criterion is based on the endomorphism ring End$_{\mathbb{F}_q}(A)$.
Giangreco-Maidana, Alejandro J.
core   +3 more sources

A survey analysis of quantum computing adoption and the paradigm of privacy engineering

open access: yesSECURITY AND PRIVACY, Volume 7, Issue 6, November/December 2024.
Abstract This study investigates the adoption of quantum computing (QC) technology using the diffusion of innovation (DOI) theory and provides an extensive literature review. We deployed structural equation modeling to analyze data from a survey conducted among 96 top managers in various industries from Canada, the US, and Europe, including IT‐based ...
Nour Mousa, Farid Shirazi
wiley   +1 more source

On extensions of the Jacobson–Morozov theorem to even characteristic

open access: yesJournal of the London Mathematical Society, Volume 110, Issue 5, November 2024.
Abstract Let G$G$ be a simple algebraic group over an algebraically closed field k$\mathbb {k}$ of characteristic 2. We consider analogues of the Jacobson–Morozov theorem in this setting. More precisely, we classify those nilpotent elements with a simple 3‐dimensional Lie overalgebra in g:=Lie(G)$\mathfrak {g}:=\operatorname{Lie}(G)$ and also those ...
David I. Stewart, Adam R. Thomas
wiley   +1 more source

Constructing Permutation Rational Functions From Isogenies

open access: yes, 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   +3 more sources

Home - About - Disclaimer - Privacy