相关论文: Investigation of Hill Cipher Modifications Based o…

Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent,…

Classical cryptography is a way of disguising the news done by the people when there was no computer. The goal is to protect information by way of encoding. This paper describesa modification of classical algorithms to make cryptanalis…

We propose theoretical and empirical improvements for two-stage hashing methods. We first provide a theoretical analysis on the quality of the binary codes and show that, under mild assumptions, a residual learning scheme can construct…

Throughout the last decade, random forests have established themselves as among the most accurate and popular supervised learning methods. While their black-box nature has made their mathematical analysis difficult, recent work has…

Cryptoprimitives rely on thorough theoretical background, but often lack basic usability features making them prone to unintentional misuse by developers. We argue that this is true even for the state-of-the-art designs. Analyzing 52…

The Hill estimator is often used to infer the power behavior in tails of experimental distribution functions. This estimator is known to produce bad results in certain situations which have lead to the so-called Hill horror plots. In this…

We discuss the nature of the two-stage percolation transition on the enhanced binary tree in order to explain the disagreement in the estimation of the second transition probability between the one in our recent paper (J. Phys. A:Math.…

In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size $M\times N$ with $T$ possible value levels into $K$ blocks of the same size and then operates position…

In this article, we analyze and improve upon the twist-based algorithms introduced by Barr--Simoson and Park--Kim--Cho--Yum for determining the key length of a Vigen\`{e}re cipher. We provide an in-depth discussion on how the domain of the…

In poly alphabetic substitution the plain texts letters are enciphered differently according to their position. The name poly alphabetic suggests that there are more than one key so we have used two keys combination instead of just one, in…

We study uncloneable quantum encryption schemes for classical messages as recently proposed by Broadbent and Lord. We focus on the information-theoretic setting and give several limitations on the structure and security of these schemes:…

This paper presents new results in the theory of number theoretic Hilbert (NHT) transforms. New polymorphic solutions have been found for the 14-point and 16-point transforms. Several transform pairs are computed and solutions found for…

When solving data analysis problems it is important to integrate prior knowledge and/or structural invariances. This paper contributes by a novel framework for incorporating algebraic invariance structure into kernels. In particular, we…

This paper presents 10-point and 12-point versions of the recently introduced number theoretic Hilbert (NHT) transforms. Such transforms have applications in signal processing and scrambling. Polymorphic solutions with respect to different…

Simulations with more than $10^{12}$ spins are used to study the motion of a domain wall driven through a three-dimensional random-field Ising magnet (RFIM) by an external field $H$. The interface advances in a series of avalanches whose…

Caesar cipher is an ancient, elementary method of encrypting plain text message to protect it from adversaries. However, with the advent of powerful computers there is a need for increasing the complexity of such algorithms. In this paper,…

Variant Stochastic cracking is a significantly more resilient approach to adaptive indexing. It showed [1]that Stochastic cracking uses each query as a hint on how to reorganize data, but not blindly so; it gains resilience and avoids…

The paper deals with time-scaling transformations of dynamical systems. Such scaling functions operate a change of coordinates on the time axis of the system trajectories preserving its phase portrait. Exploiting this property, a chaos…

Permutation-based partial-correlation tests guarantee finite-sample Type I error control under any fixed design and exchangeable noise, yet their power can collapse when the permutation-augmented design aligns too closely with the covariate…

We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a…