Related papers: An analogue of the ElGamal scheme based on the Mar…

We use Hidden Markov Models to motivate a quantitative compositional semantics for noninterference-based security with iteration, including a refinement- or "implements" relation that compares two programs with respect to their information…

In this paper we describe a new cryptosystem we call "The Hush Cryptosystem" for hiding encrypted data in innocent Arabic sentences. The main purpose of this cryptosystem is to fool observer-supporting software into thinking that the…

In this paper, we have studied on adapting to asymmetric cryptography power Fibonacci sequence module m . To do this, We have restructed Discreate Logarithm Problem which is one of mathematical difficult problems by using power Fibonacci…

This document brings together several articles devoted to manual encryption and introduces new algorithms and ciphers: a permutation algorithm, Spirale (a one-time-pad cipher), a solution to the problem of the ordered route of a table,…

This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…

I propose a large class of stochastic Markov processes associated with probability distributions analogous to that of lattice gauge theory with dynamical fermions. The construction incorporates the idea of approximate spectral split of the…

Signature-based algorithms is a popular kind of algorithms for computing Gr\"obner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a…

In the present paper we propose to describe gene networks in biological systems using probabilistic algorithms. We describe gene duplication in the process of biological evolution using introduction of the replica procedure for…

Public-key cryptosystems are suggested based on invariants of groups. We give also an overview of the known cryptosystems which involve groups.

The survey presents the well-known Warshall's algorithm, a generalization and some interesting applications of this.

We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan's list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The…

In September 2019, voters for the election at the Parliament of the city of Moscow were allowed to use an Internet voting system. The source code of it had been made available for public testing. In this paper we show two successful attacks…

I show how to construct Monte Carlo algorithms (programs), prove that they are correct and document them. Complicated algorithms are build using a handful of elementary methods. This construction process is transparently illustrated using…

This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recently proposed cryptographic schemes. The complexity analysis…

In this paper, we propose a new of coding/decoding algorithm using Padovan Q-matrices. This method is based on blocked message matrices. an advantage of this method is that the encryption of each message matrix will use a different key and…

In this work is proposed a method using orthogonal matrix transform properties to encrypt and decrypt a message. It will be showed how to use matrix functions to create complex encryptions. Because orthogonal matrix are always…

This paper presents a new probabilistic approach to embedding message text on an elliptic curve, by using the concept of the RSA Algorithm and its security, and such approach allows us discovering the message from the point, only according…

A formal description of a quantum abacus based encoding system is presented. This way of representing data for processing purposes is based on a quantum algorithm for counting qubits introduced by Lesovik et al. \cite{LesovikEtal2010} and…

This paper introduces a novel cryptographic approach based on the continuous logarithm in the complex circle, designed to address the challenges posed by quantum computing. By leveraging its multi-valued and spectral properties, this…

The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It…