Results 41 to 50 of about 82,329 (274)
Hardware Acceleration of Large-Scale CMOS Invertible Logic Based on Sparse Hamiltonian Matrices
IEEE Open Journal of Circuits and Systems, 2021 Invertible logic has been recently presented that can realize bidirectional computing based on Hamiltonians for solving several critical issues, such as integer factorization and training neural networks.
Naoya Onizawa +2 more
doaj +1 more source
Encoding Magnetic Anisotropies in Digital Light Processing 3D Printing
Advanced Functional Materials, EarlyView.A hybrid magnetic device—combining a coaxial coil within a nested Halbach array—is presented, integrated into a DLP 3D printer to enable spatially resolved magnetic field control. This system enables complex, multimodal responses by programming liquid crystal elastomer resins for magnetic and thermal actuation, and by inducing electrically conductive ...
Eléonore Aïdonidis +11 more
wiley +1 more source
Asymptotically fast factorization of integers [PDF]
Mathematics of Computation, 1981 The paper describes a "probabilistic algorithm" for finding a factor of any large composite integer n (the required input is the integer n together with an auxiliary sequence of random numbers). It is proved that the expected number of operations which will be required is O ( exp { β (
openaire +1 more source
A Note on Integer Factorization Using Lattices [PDF]
, 2010 We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine approximation" paper ...
Vera, Antonio Ignacio
core +4 more sources
Switchable Thermal Mid‐IR Conducting Polymer Antenna Arrays
Advanced Functional Materials, EarlyView.This study presents switchable mid‐infrared plasmonic resonances in PEDOT antenna arrays. Their optical extinction peaks can be reversibly switched ‘OFF’ and ‘ON’ by tuning the polaronic charge carrier concentration via the polymer's redox state, offering modulation of optical responses in the thermal mid‐infrared range including around 10 µm ...
Pravallika Bandaru +5 more
wiley +1 more source
Solving Generalized Bivariate Integer Equations and Its Application to Factoring With Known Bits
IEEE Access, 2023 In this paper, we propose two improved theorems for addressing generalized bivariate integer equations using the lattice-based method. We examine the application of these theorems to the problem of factoring general RSA (Rivest–Shamir– ...
Mengce Zheng, Zhigang Chen, Yaohui Wu
doaj +1 more source
The difficulty of prime factorization is a consequence of the positional numeral system [PDF]
, 2016 The importance of the prime factorization problem is very well known (e.g., many security protocols are based on the impossibility of a fast factorization of integers on traditional computers). It is necessary from a number k
Sergeyev, Yaroslav
core
Efficient Computation of the Characteristic Polynomial
, 2005 This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian elimination. We
Dumas, Jean-Guillaume +2 more
core +2 more sources
Magnetic Force Microscopy Signatures of Higher‐Order Skyrmions and Antiskyrmions
Advanced Functional Materials, EarlyView.Magnetic force microscopy operated under vacuum conditions enables the qualitative identification of higher‐order skyrmions and antiskyrmions in Co/Ni multilayers at room temperature. Distinct stray‐field contrast signatures arise from vertical Bloch lines and complex domain‐wall configurations.
Sabri Koraltan +8 more
wiley +1 more source
Specialized integer factorization [PDF]
, 1998 Vanstone and Zuccherato [3] propose a cryptographic system based on an elliptic curve modulo a composite number. We show that the composite numbers so constructed are easily factored, rendering the system insecure.
openaire +1 more source