Results 61 to 70 of about 23,331 (249)
Oblivious Transfer based on Key Exchange
, 2007 Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this paper we present a protocol for mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to Diffie-Hellman protocol using the ...
Abhishek Parakh +3 more
core +1 more source
A New Algorithm for Solving Ring-LPN with a Reducible Polynomial [PDF]
, 2014 The LPN (Learning Parity with Noise) problem has recently proved to be of great importance in cryptology. A special and very useful case is the RING-LPN problem, which typically provides improved efficiency in the constructed cryptographic primitive.
Guo, Qian +2 more
core +1 more source
A Comprehensive and Reproducible Comparison of Cryptographic Primitives Execution on Android Devices [PDF]
, 2021 Aleksandr Ometov +4 more
openalex +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
Advanced Quantum Technologies, Volume 9, Issue 5, May 2026.ABSTRACT Quantum‐native communication systems are reshaping secure, programmable, and coherence‐aware networking beyond the classical paradigm. As intelligent physical infrastructures, ranging from unmanned aerial vehicle swarms to satellite Quantum Key Distribution (QKD) platforms, demand trust, synchronization, and ultra‐reliability, conventional ...
Shakil Ahmed +2 more
wiley +1 more source
The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.
Ìнформаційні технології в освіті, 2009 An iterative algorithm used with variable block size of public key encryption, multiple 32-m bits. Encrypt text runs in steps. As cryptographic primitives are used: stochastic scrolling block, bi-directional sliding coding, nonlinear and stochastic ...
A. Beletsky, A. Beletsky
doaj
Verifiable Random Functions (VRFs) [PDF]
, 2018 A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash.
Goldberg, Sharon +3 more
core
Advanced Electronic Materials, Volume 12, Issue 8, 20 April 2026.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 +6 more
wiley +1 more source
Application of JXTA-overlay platform for secure robot control [PDF]
, 2010 In this paper, we present the evaluation and experimental results of secured robot control in a P2P system. The control system is based on JXTA-Overlay platform.
Arnedo Moreno, Joan +5 more
core +1 more source
Linear solutions for cryptographic nonlinear sequence generators
, 2010 This letter shows that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these solutions are pseudo-random noise sequences with application in cryptography:
A. Fúster-Sabater +13 more
core +1 more source