Related papers: Using Repeating Decimals As An Alternative To Prim…

One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is…

In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of…

A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…

We show that if you represent all primes with less than n-digits as points in n-dimensional space, then they can be stored and retrieved conveniently using n-dimensional geometry. Also once you have calculated all the prime numbers less…

In this paper, the author presents a new cryptographic technique, SD-REE, to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original…

This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…

The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…

This work describes an example of an application of a novel method for symmetric cryptography. Its purpose is to show how a regular message can be encrypted and then decrypted in an easy, yet secure way. The encrypting method introduced in…

In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.

Quantum repeaters represent one possible way to achieve long-distance quantum key distribution. Collins et al. in [Phys. Rev. Lett. 98, 060502 (2007)] proposed multiplexing as method to increase the repeater rate and to decrease the…

Encryption study basically deals with three levels of algorithms. The first algorithm deals with encryption mechanism, second deals with decryption Mechanism and the third discusses about the generation of keys and sub keys used in the…

Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…

All the current modern encryption algorithms utilize fixed symbols for plaintext and cyphertext. What I mean by fixed is that there is a set and limited number of symbols to represent the characters, numbers, and punctuations. In addition,…

Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular,…

Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to…

This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a…

Random residue sequences (RR) may be used in many random number applications including those related to multiple access in communications. This paper investigates variations on an algorithm to generate RR sequences that was proposed earlier…

We study the implementation of quantum key distribution (QKD) systems over quantum repeater infrastructures. We particularly consider quantum repeaters with encoding and compare them with probabilistic quantum repeaters. To that end, we…