Results 31 to 40 of about 10,668 (123)
A CMOS‐compatible flash memory structure with multi‐level programming produces reliable and reproducible physically unclonable functions (PUFs) for secure IoT applications. Device‐specific variations in flat‐band voltage enable scalable key generation without standby power.
Kyumin Sim +6 more
wiley +1 more source
This study introduces a fusion filtering‐based method to accurately extract spectral trajectories of non‐repetitive transient weak signals in industrial control networks, enhancing signal clarity and reliability across multiple frequency bands. ABSTRACT In response to the problem of difficulty in accurately extracting spectral trajectories of multi ...
Changzhong Gao +4 more
wiley +1 more source
Distributed PCP Theorems for Hardness of Approximation in P
We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows $x_{n/2+1},\dots,x_n ...
Abboud, Amir +2 more
core +1 more source
ABSTRACT A key application of phylogenetics in ecological studies is identifying unknown sequences with respect to known ones. This goal can be formalised as assigning taxonomic labels or inserting sequences into a reference phylogenetic tree (phylogenetic placement). Much attention has been paid to the phylogenetic placement of short fragments used in
Eleonora Rachtman +2 more
wiley +1 more source
A schema for cryptographic keys generation using hybrid biometrics [PDF]
Biometric identifiers refer to unique physical properties or behavioural attributes of individuals. Some of the well known biometric identifiers are voice, finger prints, retina or iris, facial structure etc. In our daily interaction with others directly
Donelan, Helen +2 more
core
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
We present a data structure representing a dynamic set S of w-bit integers on a w-bit word RAM. With |S|=n and w > log n and space O(n), we support the following standard operations in O(log n / log w) time: - insert(x) sets S = S + {x}.
Patrascu, Mihai, Thorup, Mikkel
core +1 more source
Illuminating Advances in Materials: Optical Physical Unclonable Functions for Security Applications
This review highlights Optical Physical Unclonable Functions (OPUFs) as secure, light‐driven authentication tools. It surveys material platforms including optical fibers, low‐dimensional materials, luminophores, plasmonic nanoparticles and rare earth OPUFs systems.
Syeda Ramsha Ali +4 more
wiley +1 more source
This work presents a secure telemedicine cryptosystem based on a novel 4D memristive chaotic oscillator and a Dispatched Gray Code Scrambler (DGCS). Implemented on FPGA, the system ensures power‐efficient encryption, making it suitable for real‐time medical image transmission in IoT healthcare environments.
Fritz Nguemo Kemdoum +3 more
wiley +1 more source
Succinct data structures for representing equivalence classes
Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class.
Lewenstein, Moshe +2 more
core +1 more source
Machine learning‐enhanced NIDS, integrating diverse data sources and rigorous feature selection, achieves near‐perfect detection of sophisticated evasive cyber threats—including APTs, DDoS, zero‐day exploits, and MitM attacks—surpassing industry benchmarks in accuracy, precision, recall, and F1$$ {\mathrm{F}}_1 $$‐score. ABSTRACT Advanced cyber threats
Khandakar Md Shafin +2 more
wiley +1 more source

