Results 51 to 60 of about 993 (178)

Improving String Matching through Enhanced Hashing

open access: yesSoftware: Practice and Experience, EarlyView.
ABSTRACT Background Hashing offers opportunities to tune string matching algorithms while enabling efficient data retrieval and pattern detection. Many of the best algorithms apply hashing. Objective We try to develop faster online algorithms for exact string matching.
Francesco Pio Marino, Jorma Tarhio
wiley   +1 more source

The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.

open access: yesÌнформаційні технології в освіті, 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  

The Cultural Evolution of Human Goals

open access: yesTopics in Cognitive Science, EarlyView.
Abstract Humans pursue remarkably diverse goals that vary over time and across cultures. These goals are both drivers and products of cultural evolutionary dynamics, yet most theories of cultural evolution have focused on the influence of culture on how individuals reach their goals, rather than on which goals they pursue.
Jérémy Perez   +5 more
wiley   +1 more source

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

open access: yesTransactions 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

Breaking universal limitations on quantum conference key agreement without quantum memory

open access: yesCommunications Physics, 2023
Quantum conference key agreement is an important cryptographic primitive for future quantum network. Realizing this primitive requires high-brightness and robust multiphoton entanglement sources, which is challenging in experiment and unpractical in ...
Chen-Long Li   +7 more
doaj   +1 more source

CryptoKnight: Generating and Modelling Compiled Cryptographic Primitives [PDF]

open access: yesInformation, 2018
Cryptovirological augmentations present an immediate, incomparable threat. Over the last decade, the substantial proliferation of crypto-ransomware has had widespread consequences for consumers and organisations alike. Established preventive measures perform well, however, the problem has not ceased.
Hill, Gregory, Bellekens, Xavier
openaire   +5 more sources

MusicoCrypt: A Music‐Modulated Stream Cipher Using Deep Pitch Estimation and Number‐Theoretic Dynamics

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 15, August 2026.
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

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  

Towards Unconditional Uncloneable Encryption [PDF]

open access: yesQuantum
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side ...
Pierre Botteron   +5 more
doaj   +1 more source

Physical Unclonable Function Based on 3D‐NAND Flash Array Structure With Multi‐Chip Implementation

open access: yesSmall, Volume 22, Issue 45, 13 August 2026.
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

Home - About - Disclaimer - Privacy