Results 41 to 50 of about 388,006 (269)

Cryptographic primitives in blockchains

Journal of Network and Computer Applications, 2019
Abstract Blockchain, as one of the crypto-intensive creatures, has become a very hot topic recently. Although many surveys have recently been dedicated to the security and privacy issues of blockchains, there still lacks a systematic examination on the cryptographic primitives in blockchains.
Licheng Wang, Xiaoying Shen, Jing Li, Jun Shao, Yixian Yang   +4 more
openaire   +1 more source

Quantum advantage for probabilistic one-time programs

Nature Communications, 2018
Information Theoretically-secure deterministic programs that self-destruct after a single use are known to be impossible to implement. Here, the authors use quantum states to implement a probabilistic version of this fundamental cryptographic primitive ...
Marie-Christine Roehsner, Joshua A. Kettlewell, Tiago B. Batalhão, Joseph F. Fitzsimons, Philip Walther   +4 more
doaj   +1 more source

Statistical assessment – as a part of security assessment applied to a block cipher [PDF]

Revista Română de Statistică, 2016
The security provided by the block cipher algorithms is a top modern approached issue within the specific researches. The security assessment of a block algorithm involves the assessing and testing of components, the statistical testing of algorithm and ...
Ioana Roxana Dragomir, Marilena Lazăr
doaj  

The Eleventh Power Residue Symbol

Journal of Mathematical Cryptology, 2020
This paper presents an efficient algorithm for computing 11th-power residue symbols in the cyclo-tomic field ℚ(ζ11),$ \mathbb{Q}\left( {{\zeta }_{11}} \right), $where 11 is a primitive 11th root of unity.
Joye Marc, Lapiha Oleksandra, Nguyen Ky, Naccache David   +3 more
doaj   +1 more source

RRAM Variability Harvesting for CIM‐Integrated TRNG

Advanced Electronic Materials, EarlyView.
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, Gokulnath Rajendran, Regina Dittmann, Anupam Chattopadhyay, Vikas Rana   +4 more
wiley   +1 more source

Concealable and Field‐Free Physical Unclonable Function Based on Voltage‐Controlled Magnetic Tunnel Junctions

Advanced Electronic Materials, EarlyView.
A concealable physical unclonable function (PUF) based on an array of 384 nanoscale voltage‐controlled magnetic tunnel junctions is demonstrated. The PUF operates without any external magnetic field. It uses a combination of deterministic and stochastic switching mechanisms, based on the spin transfer torque and voltage‐controlled magnetic anisotropy ...
Thomas Neuner, Jaimin Kang, Jordan Athas, Christian Duffee, Noraica Davila Melendez, Jordan A. Katine, Pedram Khalili Amiri   +6 more
wiley   +1 more source

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

CAAI Transactions on Intelligence Technology, EarlyView.
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

Cost-effective secure E-health cloud system using identity based cryptographic techniques

Future generations computer systems, 2017
Nowadays E-health cloud systems are more and more widely employed. However the security of these systems needs more consideration for the sensitive health information of patients.
Xu An Wang, Jianfeng Ma, F. Xhafa, Mingwu Zhang, X. Luo   +4 more
semanticscholar   +1 more source

The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2

Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
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

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

Advanced 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, Ryun‐Han Koo, Youngchan Cho, Changhyeon Han, Dongbin Kim, Soi Jeong, Yunho Shin, Joonhyeok Choi, Jiseong Im, Jonghyun Ko, Jong‐Ho Lee, Jangsaeng Kim, Youngho Kang, Wonjun Shin, Daewoong Kwon   +14 more
wiley   +1 more source