INSPIRE

Toward an optimal quantum algorithm for polynomial factorization over finite fields

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree n over a finite field F_q, the average-case complexity of our algorithm is an ...
Scientific Research Publishing

Marquis, D. (2014) Deterministic Factorization of Polynomials over Finite Fields. Thesis: MS in Pur Mathematics, Carleton University, Ottawa.

ABSTRACT: Substitution boxes or S-boxes play a significant role in encryption and de-cryption of bit level plaintext and cipher-text respectively. Irreducible Poly-nomials (IPs) have been used to ...
IEEE

Explicit Solution to Quasi-Polynomial Matrix Right Coprime Factorization with Application in Establishment of Time-Delay Fully Actuated System

Abstract: We investigate the right coprime factorization of the transfer function matrix of a linear time-delay system considering constant state and input delays. This transfer function matrix is a ...
GitHub

Code for performing power spectral density factorizations

The power spectral density of a random process can be factorized into minimum and maximum phase factors, along with a scalar. P(z) = s^2 Q(z) Q*(1/z*) The attached .pdf documents ...