Results 111 to 120 of about 2,924 (299)
An investigation on Integer Factorization applied to Public Key Cryptography [PDF]
Public key cryptography allows two or more users to communicate in a secure way on an insecure channel, using two different keys: a public key, which has the function to encrypt the messages, and a private key, employed in the decryption of the ...
Santilli, Giordano
core
Integer Factorization of a Positive-Definite Matrix [PDF]
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension of the matrix.
openaire +4 more sources
Photonic‐Enabled Energy‐Efficient Transparent Neuromorphic Computing Devices: A Review
Transparent photonic neuromorphic computing devices merge optics and brain‐inspired computing to overcome von Neumann bottlenecks with ultrafast, low‐energy processing. By exploiting transparent oxides, 2D materials, phase‐change materials, and hybrid heterostructures, these platforms enable photonic synapses, memory, and logic for see‐through edge ...
Shuvaraj Ghosh +8 more
wiley +1 more source
Twisted Baker–Akhiezer function from determinants
General description of eigenfunctions of integrable Hamiltonians associated with the integer rays of Ding–Iohara–Miki (DIM) algebra, is provided by the theory of Chalykh Baker–Akhiezer functions (BAF) defined as solutions to a simply looking linear ...
A. Mironov, A. Morozov, A. Popolitov
doaj +1 more source
An Evaluation of Computational Complexity of Shor’s Algorithm on Surface Codes for Factorization
Shor’s algorithm is a quantum algorithm that can efficiently solve the problems of integer factorization and discrete logarithms, which potentially break currently used public-key cryptosystems such as RSA and elliptic curve cryptography. However,
Kento Oonishi, Noboru Kunihiro
doaj +1 more source
Factoring Integers with Elliptic Curves
Summary: This paper is devoted to the description and analysis of a new algorithm to factor positive integers. It depends on the use of elliptic curves. The new method is obtained from \textit{J. M. Pollard}'s \(p-1\)-method [Proc. Camb. Philos. Soc. 76, 521--528 (1974; Zbl 0294.10005)] by replacing the multiplicative group by the group of points on a ...
openaire +5 more sources
SPADE integrates spatial transcriptomics with single‐cell RNA sequencing by using cell–cell communications (CCC) as a guide for spatial mapping. It improves cell‐type localization, enhances sparse gene‐expression signals, and reveals CCC programs at single‐spot resolution.
Xinyi Li, Ning Zhang, Zijie Jin
wiley +1 more source
Factoring Integers by CVP Algorithms [PDF]
We use pruned enumeration algorithms to find lattice vectors close to a specific target vector for the prime number lattice. These algorithms generate multiplicative prime number relations modulo N that factorize a given integer N. The algorithm New Enum performs the stages of exhaustive enumeration of close lattice vectors in order of decreasing ...
openaire +1 more source
New integer factorizations [PDF]
New factorizations of Fibonacci numbers, Lucas numbers, and numbers of the form 2 n
openaire +2 more sources
CauFinder: Steering Cell‐State and Phenotype Transitions by Causal Disentanglement Learning
CauFinder combines causal disentanglement modeling and network control to prioritize causal drivers of cell‐state transitions from observational transcriptomic data. The framework separates transition‐relevant signals from spurious associations, nominates intervention targets across biological and disease contexts, and identifies DAAM1 as an actionable
Chengming Zhang +11 more
wiley +1 more source

