Results 71 to 80 of about 23,331 (249)

HMC‐DSR: An FPGA‐Accelerated Clustered Routing Protocol for Scalable and Energy‐Efficient MANETs

open access: yesEngineering Reports, Volume 8, Issue 4, April 2026.
FPGA‐based HMC‐DSR protocol enhances MANET routing with real‐time, energy‐efficient processing, reducing end‐to‐end delay by 20.7%. Power consumption decreased by 15.8%, making it ideal for energy‐constrained systems. Hardware resource optimization achieved a 31.2% reduction in flip‐flops and 27.4% in slice utilization. Throughput improvement of 19.4%,
Arvind Kumar   +3 more
wiley   +1 more source

Access Control in Healthcare IoT: A Comprehensive Survey

open access: yesEngineering Reports, Volume 8, Issue 4, April 2026.
This survey analyses access control mechanisms in Healthcare IoT, reviewing traditional and emerging models, identifying security and privacy challenges, and highlighting open research issues. It provides a comparative perspective to support the design of secure, scalable, and patient‐centric healthcare IoT systems.
Aleena Nazir   +3 more
wiley   +1 more source

THE TABULAR OF CRYPTOGRAPHIC PRIMITIVES OF NONLINEAR SUBSTITUTIONS

open access: yesÌнформаційні технології в освіті, 2015
Classic primitives nonlinear substitution is a simple replacing each character encrypted text on a fixed symbol of the same alphabet, actually realizing the transformation one alphabet simple substitution cipher. And as a consequence - the entropy cipher
A. Beletsky
doaj  

One-time memory from isolated Majorana islands

open access: yesNew Journal of Physics, 2022
A one-time memory (OTM) stores two bits such that either bit can be retrieved, but not both. One-time memories have been shown to allow for secure classical and quantum computations.
Sourav Kundu, Ben Reichardt
doaj   +1 more source

High-level Cryptographic Abstractions

open access: yes, 2019
The interfaces exposed by commonly used cryptographic libraries are clumsy, complicated, and assume an understanding of cryptographic algorithms. The challenge is to design high-level abstractions that require minimum knowledge and effort to use while ...
Chand, Saksham   +4 more
core   +1 more source

Notions of Reducibility between Cryptographic Primitives [PDF]

open access: yes, 2004
Starting with the seminal paper of Impagliazzo and Rudich [17], there has been a large body of work showing that various cryptographic primitives cannot be reduced to each other via “black-box” reductions. The common interpretation of these results is that there are inherent limitations in using a primitive as a black box, and that these impossibility ...
Omer Reingold   +2 more
openaire   +1 more source

CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives [PDF]

open access: diamond, 2023
Joel Kuepper   +11 more
openalex   +1 more source

A Probability‐Aware AI Framework for Reliable Anti‐Jamming Communication

open access: yesCAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 349-366, April 2026.
ABSTRACT Adversarial jamming attacks have increased on communication systems, causing distortion and threatening transmissions. Typical attacks rely on traditional, well‐defined cryptographic protocols and frequency‐hopping techniques. Nevertheless, these techniques become vulnerable when facing intelligent jammers.
Tawfeeq Shawly, Ahmed A. Alsheikhy
wiley   +1 more source

In Materia Shaping of Randomness with a Standard Complementary Metal‐Oxide‐Semiconductor Transistor for Task‐Adaptive Entropy Generation

open access: yesAdvanced Functional Materials, Volume 36, Issue 23, 19 March 2026.
This study establishes a materials‐driven framework for entropy generation within standard CMOS technology. By electrically rebalancing gate‐oxide traps and Si‐channel defects in foundry‐fabricated FDSOI transistors, the work realizes in‐materia control of temporal correlation – achieving task adaptive entropy optimization for reinforcement learning ...
Been Kwak   +14 more
wiley   +1 more source

On the Bit Security of Cryptographic Primitives

open access: yes, 2018
We introduce a formal quantitative notion of “bit security” for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic function requiring a brute force attack on a k-bit key space.
Daniele Micciancio, Michael Walter 0001
openaire   +2 more sources

Home - About - Disclaimer - Privacy