Results 61 to 70 of about 82,510 (316)

Probabilistic computing with percolating nanoparticle networks using experimental data with signatures of criticality

open access: yesNeuromorphic Computing and Engineering
Percolating networks of nanoparticles (PNNs) are promising systems for neuromorphic computing due to their brain-like network structure and dynamics. In particular, electrical spiking in PNNs meets criteria for criticality, which is thought to be the ...
Sofie J Studholme   +3 more
doaj   +1 more source

New simultaneous Diophantine attacks on generalized RSA key equations

open access: yesJournal of King Saud University: Computer and Information Sciences
RSA stands as a widely adopted method within asymmetric cryptography, commonly applied for digital signature validation and message encryption.
Wan Nur Aqlili Ruzai   +3 more
doaj   +1 more source

An analogue in certain unique factorization domains of the Euclid-Euler theorem on perfect numbers

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1990
We show that there exists a natural extention of the sum of divisors function to all unique factorization domains F having a finite number of units such that if a perfect number in F is defined to be an integer η whose proper divisors sum to η, then the ...
Wayne L. McDaniel
doaj   +1 more source

Factorization of cubic vertices involving three different higher spin fields

open access: yesNuclear Physics B, 2014
We derive a class of cubic interaction vertices for three higher spin fields, with integer spins λ1, λ2, λ3, by closing commutators of the Poincaré algebra in four-dimensional flat spacetime.
Y.S. Akshay, Sudarshan Ananth
doaj   +1 more source

A Robust and Hybrid Cryptosystem for Identity Authentication

open access: yesInformation, 2021
With the progressive development of a wide range of applications, interconnect things and internet of things (IoT) became an imperative required trend by industries and academicians. IoT became a base infrastructure for remote access or control depending
Ali Takieldeen   +4 more
doaj   +1 more source

Multimodal Structural Color Graphics Based on Colloidal Photonic Microdome Arrays

open access: yesAdvanced Functional Materials, EarlyView.
A hybrid photonic system combining colloidal crystals and microscale domes is designed to achieve four switchable optical states via the interplay of Bragg reflection and TIR interference. The graphics composed of the photonic microdome arrays provide tunable, angle‐sensitive structural coloration and concealed‐to‐revealed transitions, offering a ...
Jun‐Gu Kang   +4 more
wiley   +1 more source

A Digital Signature Scheme for Long-Term Security [PDF]

open access: yes, 2014
In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves.
Poulakis, Dimitrios, Rolland, Robert
core   +1 more source

Encoding Magnetic Anisotropies in Digital Light Processing 3D Printing

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

Switchable Thermal Mid‐IR Conducting Polymer Antenna Arrays

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

Faster deterministic integer factorization [PDF]

open access: yesMathematics of Computation, 2013
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan--Gaudry--Schost, following the Pollard--Strassen approach.
Costa, Edgar, Harvey, David
openaire   +3 more sources

Home - About - Disclaimer - Privacy