Related papers: Narayana Sequences for Cryptographic Applications

Let p be an odd prime. Let K = Q(zeta) be the p-cyclotomic field. Let v be any primitive root mod p. Let sigma be a Q-isomorphism of K. Let P(sigma) = sigma^{p-2}v^{-(p-2)}+ ... + sigma v^{-1} +1 \in Z[G] where 1 \leq v^n \leq p-1 is a…

We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$,…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is…

We present a variant of the Agrawal-Biswas algorithm, a Monte Carlo algorithm which tests the primality of an integer $N$ by checking whether or not $(x+a)^N$ and $x^N + a$ are equivalent in a residue ring of $\mathbb{Z}/N\mathbb{Z}[x]$.…

For an odd prime $p$ and $n=2m$, a new decimation $d=\frac{(p^{m}-1)^{2}}{2}+1$ of Niho type of $m$-sequences is presented. Using generalized Niho's Theorem, we show that the cross-correlation function between a $p$-ary $m$-sequence of…

In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

This paper investigates the use of different transformations for improving the randomness of sequences. In particular, convolutional codes are used for increasing the size of a given sequence and then a random mapping function is used for…

With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information…

Pollard's rho method finds a prime factor $p$ of an integer $N$ by searching for a collision in a map of the form $x \mapsto x^{2k} + c$ modulo $N$. This search can be parallelized to multiple machines, which may use distinct parameters $k$…

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

We show that corner Majorana zero modes in a two-dimensional $p+id$ topological superconductor can be controlled by the manipulation of the parent $p-$wave superconducting order. Assuming that the $p$-wave superconducting order is in either…

To any nilpotent group of class n, one can associate a non-interactive key exchange protocol between n+1 users. The multilinear commutator maps associated to nilpotent groups play a key role in this protocol. In the present paper, we…

We complete a proof of a theorem that was inspired by an Indian Olympiad problem, which gives an interesting characterization of a prime number $p$ with respect to the binomial coefficients ${n\choose p}$. We also derive a related result…

The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…

Primitive roots of 1 mod p^k (k>2 and odd prime p) are sought, in cyclic units group G_k = A_k B_k mod p^k, coprime to p, of order (p-1)p^{k-1}. 'Core' subgroup A_k has order p-1 independent of k, and p+1 generates 'extension' subgroup B_k…

We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.