Results 71 to 80 of about 2,290,669 (124)

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

Journal of Graph Theory, Volume 112, Issue 4, Page 421-432, August 2026.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) denote the minimum size of a feedback arc set in an oriented multigraph D. In several papers, upper bounds for fas ( D ) were obtained for oriented multigraphs D with maximum degree upper‐bounded by a constant.
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Factorization of large tetra and penta prime numbers on IBM quantum processor

APL Quantum
The factorization of large digit integers in polynomial time is a challenging computational task to decipher. The development of Shor’s algorithm sparked a new resolution for solving the factorization problem.
Ritu Dhaulakhandi, Bikash K. Behera, Felix J. Seo   +2 more
doaj   +1 more source

Algunas variantes del algoritmo cuántico de Shor [PDF]

, 2022
Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Luis Victor Dieulefait[en] The aim of this project is to study the Shor’s factorization algorithm, as well as some of its variants,
Cano Pradas, Juan
core   +1 more source

Energy Consumption Framework and Analysis of Post-Quantum Key-Generation on Embedded Devices

Journal of Cybersecurity and Privacy
The emergence of quantum computing and Shor’s algorithm necessitates an imminent shift from current public key cryptography techniques to post-quantum-robust techniques.
J. Cameron Patterson, William J. Buchanan, Callum Turino   +2 more
doaj   +1 more source

Integer Factorization – Cryptology Meets Number Theory

Scientific Journal of Gdynia Maritime University, 2019
Integer factorization is one of the oldest mathematical problems. Initially, the interest in factorization was motivated by curiosity about be­haviour of prime numbers, which are the basic building blocks of all other integers.
Josef Pieprzyk
doaj   +1 more source

New Quantum Cryptanalysis of Binary Elliptic Curves

Transactions on Cryptographic Hardware and Embedded Systems
This paper improves upon the quantum circuits required for the Shor’s attack on binary elliptic curves. We present two types of quantum point addition, taking both qubit count and circuit depth into consideration.
Kyungbae Jang, Vikas Srivastava, Anubhab Baksi, Santanu Sarkar, Hwajeong Seo   +4 more
doaj   +1 more source

Tensor network simulation of Shor’s algorithm for prime factorization [PDF]

openThis thesis explores the implementation and simulation of a scalable version of Shor’s algorithm for prime factorization. An acknowledged bottleneck in this algorithm lies in the modular exponentiation process. To address this challenge, we propose a
CAVION, ALESSANDRO
core  

Quantum algorithm for solving binary hyperelliptic curve discrete logarithm problem

Cybersecurity
It is well-established that Shor’s algorithm can solve the discrete logarithm problem (DLP) in polynomial time. The hyperelliptic curve DLP (HCDLP) of genus 2 has found widespread industrial applications and remains an active research domain.
Yan Huang, Du Zeng, Chao Chen, Zijian Zhou, Fangguo Zhang   +4 more
doaj   +1 more source

Quantum Algorithm for Attacking RSA Based on the e^th Root

工程科学与技术, 2018
The emergence of some quantum algorithms has brought a serious threat to modern cryptography,among which Shor’s algorithm is the most important threatening algorithm for cryptanalysis currently.Shor’s algorithm can solve the integer factorization problem
Yahui WANG, Huanguo ZHANG, Houzhen WANG
doaj  

Shor's algorithm [PDF]

, 2017
In this diploma paper we present the Shor’s algorithm for factorising numbers, which runs on quantum computers. Initially, we explain the basics of quantum computing.
Rugelj, Nežka
core