Results 11 to 20 of about 94,460 (146)
Tilings from some non-irreducible, Pisot substitutions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A generating method of self-affine tilings for Pisot, unimodular, irreducible substitutions, as well as the fact that the associated substitution dynamical systems are isomorphic to rotations on the torus are established in P. Arnoux and S. Ito.
Shunji Ito, Hiromi Ei
doaj +3 more sources
On the number of prime divisors of character degrees and conjugacy classes of a finite group
Comptes Rendus. Mathématique, 2022 A result of Gluck is that any finite group $G$ has an abelian subgroup $A$ such that $|G : A|$ is bounded by a polynomial function of the largest irreducible character degree of $G$. Moretó presented a variation of this result that looks at the number of
Yang, Yong
doaj +1 more source
Modified the RC4 Stream Cipher Algorithm Based on Irreducible Polynomial [PDF]
Engineering and Technology Journal, 2015 The increase in the speed of computers and adoption on it as means of encryption (send and receive encrypted data), which led to the development of modern encryption techniques such as (stream cipher and block cipher).
Zainab Mohammed Hussein +1 more
doaj +1 more source
The distance to an irreducible polynomial, II [PDF]
Mathematics of Computation, 2012 A classical question of Turán asks for the existence of an absolute constant \(C\) such that for every polynomial \(f\) having integer coefficients there exists an irreducible polynomial \(g\) having integer coefficients, for which \(\deg(g)\leq\deg(f)\) and \(L(f-g)\leq C\).
Michael Filaseta, Michael J. Mossinghoff
openaire +1 more source
Irreducibility properties of Keller maps [PDF]
, 2016 Jedrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials.
de Bondt, Michiel, Yan, Dan
core +2 more sources
GALOIS IRREDUCIBLE POLYNOMIALS
Communications of the Korean Mathematical Society, 2017 Summary: In this paper, the fundamental theorem of Galois Theory is used to generalize cyclotomic polynomials and construct irreducible polynomials associated with the \(n\)-th primitive roots of unity.
Kwon, Miyeon, Lee, Ji-Eun, Lee, Ki-Suk
openaire +2 more sources
Современные информационные технологии и IT-образование, 2019 We consider vector mappings over the set of 0 and 1 given by the set of Boolean functions. Boolean functions included in the map are given in ANF. Having fixed the rule according to which the binary vectors are associated with the elements of a finite ...
Sergey A. Belov
doaj +1 more source
Developed Protocol for Key Exchange Based on Irreducible Polynomial [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 The Aim of this paper is to design a protocol for key exchanging to work on the available computers for different data security application. This paper proposed idea to modify the Diffie-Hellman key exchange by using truncated polynomial instead of ...
Abdul Monem S. Rahma +2 more
doaj +1 more source
A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes [PDF]
Groups, Complexity, Cryptology, 2020 A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is described. In particular, we obtain low-degree polynomial equations in parts of
Julian Danner, Martin Kreuzer
doaj +1 more source
Determining Minimal Polynomial of Proper Element by Using Higher Degree Traces [PDF]
, 2001 Modern communication engineerings, such as elliptic curve cryptographies, often requires algebra on finite extension field defined by modulus arithmetic with an irreducible polynomial. This paper provides a new method to detemine the minimal (irreducible)
Morikawa, Yoshitaka, Nogami, Yasuyuki
core +1 more source