Results 51 to 60 of about 1,558 (178)
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
ABSTRACT This paper presents MusicoCrypt, a context‐bound music‐modulated stream‐encryption framework that incorporates audio‐derived public side information into a pseudorandom‐function‐centered encryption workflow. A shared reference recording is processed using a pitch‐tracking pipeline, and ordered note pairs are encoded as residues in ℤ132 ...
Cilen Gulsum Turan +2 more
wiley +1 more source
Physical Unclonable Function Based on 3D‐NAND Flash Array Structure With Multi‐Chip Implementation
Physical unclonable function (PUF) based on a 3D‐NAND flash array is proposed, featuring a multi‐chip structure and a massive challenge–response pair (CRP) capacity. The presented utilizes intrinsic string current variations experimentally verified across eight fabricated 48 × 24 NAND flash arrays.
Hwiho Hwang +4 more
wiley +1 more source
The Internet of Things (IoT) is a broad area that encompasses various use cases. Numerous use cases include various IoT devices, which necessitate various cryptographic methods to provide distinct security requirements.
Isil Cetintav, Mehmet Tahir Sandikkaya
doaj +1 more source
On the Use of GF-Inversion as a Cryptographic Primitive [PDF]
Inversion in Galois Fields is a famous primitive permutation for designing cryptographic algorithms e.g. for Rijndael because it has suitable differential and linear properties. Inputs and outputs are usually transformed by addition (e.g. XOR) to key bits. We call this construction the APA (Add-Permute-Add) scheme.
Aoki, Kazumaro, Vaudenay, Serge
openaire +2 more sources
A reconfigurable RRAM platform utilizing thermally pre‐formed filaments (TPFs) is developed to realize robust hardware security. By exploiting the thermodynamic stochasticity of TPFs, exceptionally reliable physically unclonable functions (PUFs) are achieved.
Seongbin Kwon +4 more
wiley +1 more source
All‐Optical Reconfigurable Physical Unclonable Function for Sustainable Security
An all‐optical reconfigurable physical unclonable function (PUF) is demonstrated using plasmonic coupling–induced sintering of optically trapped gold nanoparticles, where Brownian motion serves as a robust entropy source. The resulting optical PUF exhibits high encoding density, strong resistance to modeling attacks, and practical authentication ...
Jang‐Kyun Kwak +4 more
wiley +1 more source
Post-Quantum Cryptographic Hardware Primitives
The development and implementation of post-quantum cryptosystems have become a pressing issue in the design of secure computing systems, as general quantum computers have become more feasible in the last two years. In this work, we introduce a set of hardware post-quantum cryptographic primitives (PCPs) consisting of four frequently used security ...
Bu, Lake +3 more
openaire +3 more sources
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
A connection between cryptography and polynomial functions is extremely significant. Mathematical performance of polynomials helps to enhance the cryptographic primitives, which are trustworthy as well as straightforward representation tools, in everyday
Mohammad Mazyad Hazzazi +4 more
doaj +1 more source

