Results 91 to 100 of about 2,290,669 (124)

A methodology for deploying the max-sum algorithm and a case study on unmanned aerial vehicles

, 2012
We present a methodology for the deployment of the max-sum algorithm, a well known decentralised algorithm for coordinating autonomous agents, for problems related to situational awareness.
Delle Fave, F. M., Farinelli, A., Jennings, Nick, Fave, Francesco Maria Delle, Jennings, N. R., Rogers A., Delle Fave, Francesco Maria, Rogers, Alex, Jennings N. R., Farinelli, Alessandro, Delle Fave F. M., Rogers, A.   +11 more
core   +1 more source

Insights and Limitations of Shor’s Factorization Algorithm on IBM Real Quantum Computers

Quantum Shor’s algorithm offers an exponential speedup over classical methods for integer factorization, a central problem to modern cryptography, and the implica- tions of Shor’s algorithm in factoring large numbers.
Camps Carmona, Adriano José, Villarreal D’Angelo, Juan Manuel, Manresa, Gerard De   +2 more
core   +1 more source

Lattice-Based Post-Quantum Public Key Encryption Scheme Using ElGamal’s Principles

Cryptography
Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems.
Dana Sairangazhykyzy Amirkhanova, Maksim Iavich, Orken Mamyrbayev   +2 more
doaj   +1 more source

Quantum Computation: Shor's algorithm

, 2016
In recent years, the field of quantum computation has evolved to a promising research area, with the capacity to become as important as classical programming is today. This text serves as an introduction into the field of quantum computation.
Cornelissen, A.J. (author)
core  

Shor’s algorithm is optimal

, 2004
We show that the ‘standard ’ quantum algorithm for the abelian hidden subgroup problem is not only efficient but is optimal in the information theoretic sense, in that it maximizes the probability of correctly identifying the hidden subgroup.
Lawrence Ip
core  

An Analysis of Quantum Factoring using Shors Algorithm

, 2016
The most spectacular discovery of quantum computation, Shor's algorithm, efficiently solves the prime factorization problem: given a composite odd positive integer N, finding its prime factors.
Vani, K. H., Aruna, A. G.
core  

Modifying Shor’s algorithm to compute short discrete logarithms [PDF]

, 2016
We revisit Shor\u27s algorithm for computing discrete logarithms in the multiplicative group of GF(p) on a quantum computer and modify it to compute logarithms d in groups of prime order q in the special case where d
Martin Ekerå
core  

Präzise Ionenimplantation mittels Rastermikroskopie [PDF]

, 2007
A new technique for precision ion implantation has been developed. A scanning probe has been equipped with a small aperture and incorporated into an ion beamline, so that ions can be implanted through the aperture into a sample. By using a scanning probe
Persaud, Arun
core  

Topologia de redes e propriedades morfológicas para um modelo de crescimento de aerogéis inorgânicos [PDF]

, 2014
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Ciência e Engenharia de Materiais, Florianópolis, 2014.Um modelo estocástico para crescimento de aerogéis inorgânicos é proposto e simulado ...
Morales, Renzo Angelo Viloche
core  

On the quantum security of high-dimensional RSA protocol

Journal of Mathematical Cryptology
The idea of extending the classical RSA protocol using algebraic number fields was introduced by Takagi and Naito (Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security.
Rahmani Nour-eddine, Serraj Taoufik, Ismaili Moulay Chrif, Azizi Abdelmalek   +3 more
doaj   +1 more source