Results 51 to 60 of about 26,436 (209)
RRAM Variability Harvesting for CIM‐Integrated TRNG
This work demonstrates a compute‐in‐memory‐compatible true random number generator that harvests intrinsic cycle‐to‐cycle variability from a 1T1R RRAM array. Parallel entropy extraction enables high‐throughput bit generation without dedicated circuits. This approach achieves NIST‐compliant randomness and low per‐bit energy, offering a scalable hardware
Ankit Bende +4 more
wiley +1 more source
SiOx‐Based Probabilistic Bits Enabling Invertible Logic Gate for Cryptographic Applications
To enable lightweight hardware encryption and decryption, a Ti/SiOx/Ti threshold switching device is engineered to generate controllable stochastic oscillations. By tuning the input voltage, the device produces a programmable spike probability governed by intrinsic switching dynamics, enabling probabilistic bits that construct an invertible ...
Jihyun Kim, Hyeonsik Choi, Jiyong Woo
wiley +1 more source
cryptographic Primitives: Insertions, Examples and Open Problems
Cryptographic primitives are considered. Each of cryptographic primitives can be the basis for building more complex cryptographic protocol. Examples of insertion of cryptographic primitives are given. The problems arising at the proof of security of the
Stanislav Olegovich Dordzhiev +1 more
doaj
Using quantum key distribution for cryptographic purposes: a survey
The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does not provide a standalone
, +23 more
core +3 more sources
A Security-aware Approach to JXTA-Overlay Primitives [PDF]
The JXTA-Overlay project is an effort to use JXTA technology to provide a generic set of functionalities that can be used by developers to deploy P2P applications.
Arnedo Moreno, Joan +3 more
core +3 more sources
The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2
Abstract Let q$q$ be a prime power and Fq$\mathbb {F}_q$ the finite field with q$q$ elements. For a positive integer n$n$, the polynomial Xn−1∈Fq[X]$X^n - 1 \in \mathbb {F}_q[X]$ is termed 3‐sparse over Fq$\mathbb {F}_q$ if all its irreducible factors in Fq[X]$\mathbb {F}_q[X]$ are either binomials or trinomials.
Kaimin Cheng
wiley +1 more source
Research on semantics of trust transitivity in cryptographic primitives
Under the background of trustable computing and trust management, the semantics of trust transitivity in cryptographic primitives were concerned, and an embryo model was proposed. Further, by using the model as a tool, se-mantics of trust transitivity in
WANG Li-cheng1 +3 more
doaj +2 more sources
Formally based semi-automatic implementation of an open security protocol [PDF]
International audienceThis paper presents an experiment in which an implementation of the client side of the SSH Transport Layer Protocol (SSH-TLP) was semi-automatically derived according to a model-driven development paradigm that leverages formal ...
Alfredo Pironti +37 more
core +3 more sources
This review synthesizes AI advancements in food systems, leveraging machine learning, computer vision, robotics, and IoT for 96%–100% accurate quality inspection, 30% reduced downtime, and enhanced traceability from farm to fork. It highlights transformative potential in sustainability and SDGs while addressing data, ethical, and scalability challenges
Muhammad Waqar +9 more
wiley +1 more source
Privacy-Aware Processing of Biometric Templates by Means of Secure Two-Party Computation [PDF]
The use of biometric data for person identification and access control is gaining more and more popularity. Handling biometric data, however, requires particular care, since biometric data is indissolubly tied to the identity of the owner hence raising ...
Barni, M. +2 more
core +1 more source

