Integer factorization is an important problem in modern cryptography as it is the basis of RSA encryption. I have implemented two integer factorization algorithms: Pollard’s rho algorithm and Dixon’s factorization method. While the results are not revolutionary, they illustrate the software design difficulties inherent to integer factorization. The code for this project is available at https://...

A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider stability and optimality. To address these problems, we propose methodologies to design stable and optimal PLUS factorization algorithms. Firstly, we propose three stable PLUS factorization algorithms, prove the stabi...

The security of public key encryption such as RSA scheme relied on the integer factoring problem. The security of RSA algorithm is based on positive integer N, because each transmitting node generates pair of keys such as public and private. Encryption and decryption of any message depends on N. Where, N is the product of two prime numbers and pair of key generation is dependent on these prime ...

We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L). We observe that uf(L) need not be context-free if L is context-free. Next, we con...

In this paper we address the problem of matrix factorization on compressively-sampled measurements which are obtained by random projections. While this approach improves the scalability of matrix factorization, its performance is not satisfactory. We present a matrix co-factorization method where compressed measurements and a small number of uncompressed measurements are jointly decomposed, sha...

In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

We consider Gabor systems generated by a Gaussian function and prove certain classical results of Paley and Wiener on nonharmonic Fourier series of complex exponentials for the Gabor expansion‎. ‎In particular, we prove a version of Plancherel-Po ́lya theorem for entire functions with finite order of growth and use the Hadamard factorization theorem to study regularity‎, ‎exactness and deficienc...