相关论文: Investigation of Hill Cipher Modifications Based o…
We propose an incremental strategy for learning hash functions with kernels for large-scale image search. Our method is based on a two-stage classification framework that treats binary codes as intermediate variables between the feature…
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…
In this paper a randomness evaluation of a block cipher for secure image communication is presented. The GFHT cipher is a genetic algorithm, that combines gene fusion (GF) and horizontal gene transfer (HGT) both inspired from antibiotic…
Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the…
Silicon Photomultipliers (SiPMs) have been widely adopted for photon detection in next-generation dark matter and neutrino detection experiments. Internal crosstalk, resulting from secondary photons produced during charge avalanches, is a…
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…
We propose a novel approach to improving software security called Cryptographic Path Hardening, which is aimed at hiding security vulnerabilities in software from attackers through the use of provably secure and obfuscated cryptographic…
In many applications one wants to identify identical subtrees of a program syntax tree. This identification should ideally be robust to alpha-renaming of the program, but no existing technique has been shown to achieve this with good…
In this paper, a simple and robust color image encryption algorithm based on high-dimensional chaotic maps is proposed. The algorithm employs a 3D Arnold transform to perform inter-component shuffling of plain-image, while a 2D…
Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…
Charge multiplication through avalanche processes is commonly employed in the detection of single photons or charged particles in high-energy physics and beyond. In this report, we provide a detailed discussion of the properties of…
We reveal the nature of the avalanche collapse of the giant viable component in multiplex networks under perturbations such as random damage. Specifically, we identify latent critical clusters associated with the avalanches of random…
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of…
The presence of interparticle cohesion can drastically change the behavior of granular materials. For instance, powders are challenging to handle, and one can make a sandcastle using wet grains. In this study, we report experimental results…
An alternative definition for the non local impact ionization coefficient is given and its relationship to the ionization pathlength probability distribution function (PDF) is determined. A model for the ionization pathlength PDF is…
Weak coherent states as a photon source for quantum cryptography have limit in secure data rate and transmission distance because of the presence of multi-photon events and loss in transmission line. Two-photon events in a coherent state…
In recent years, although some homomorphic encryption algorithms have been proposed to provide additive homomorphic encryption and multiplicative homomorphic encryption. However, similarity measures are required for searches and queries…
Two decades ago, a breakthrough in indexing string collections made it possible to represent them within their compressed space while at the same time offering indexed search functionalities. As this new technology permeated through…
Traditional minwise hashing (MinHash) requires applying $K$ independent permutations to estimate the Jaccard similarity in massive binary (0/1) data, where $K$ can be (e.g.,) 1024 or even larger, depending on applications. The recent work…
The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing…