Results 61 to 70 of about 1,826,401 (170)

A Power Associative Loop Structure for the Construction of Non-Linear Components of Block Cipher

open access: yesIEEE Access, 2020
In the symmetric key cryptography, the purpose of the substitution box is to generate confusion and hence improve the security of the whole cryptosystem.
Sadam Hussain   +3 more
doaj   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) in PG ( 7 , q 3 )

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

On the fixed‐point proportion of self‐similar groups

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We prove that super strongly fractal groups acting on regular rooted trees have null fixed‐point proportion. In particular, we show that the fixed‐point proportion of an infinite family of iterated monodromy groups of exceptional complex polynomials has the same property.
Jorge Fariña‐Asategui, Santiago Radi
wiley   +1 more source

Computing Galois groups of Eisenstein polynomials over p-adic fields [PDF]

open access: yes, 2017
The most efficient algorithms for computing Galois groups of polynomials over global fields are based on Stauduhar’s relative resolvent method. These methods are not directly generalizable to the local field case, since they require a field that contains
Milstead, Jonathan   +1 more
core  

Application of the Algebraic Extension Method to the Construction of Orthogonal Bases for Partial Digital Convolutions

open access: yesAlgorithms
Mathematical tools have been developed that are analogous to the tool that allows one to reduce the description of linear systems in terms of convolution operations to a description in terms of amplitude-frequency characteristics.
Aruzhan Kadyrzhan   +3 more
doaj   +1 more source

An elegant model of the geodesic flow on the modular surface

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley   +1 more source

Application of Partial Discrete Logarithms for Discrete Logarithm Computation

open access: yesComputers
A novel approach to constructing an algorithm for computing discrete logarithms, which holds significant interest for advancing cryptographic methods and the applied use of multivalued logic, is proposed.
Dina Shaltykova   +3 more
doaj   +1 more source

Abelian threefolds with imaginary multiplication

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Let A$A$ be an abelian threefold defined over a number field K$K$ with potential multiplication by an imaginary quadratic field M$M$. Under mild assumptions on K$K$, if A$A$ has signature (2,1) and the multiplication by M$M$ is defined over KM$KM$, we attach to A$A$ an elliptic curve defined over K$K$ with potential complex multiplication by M$
Francesc Fité, Pip Goodman
wiley   +1 more source

Oeuvres mathématiques d'Évariste Galois

open access: yes, 1897
Evariste Galois ; publ. sous les auspices de la Société math. de France, avec une introduction par M.
Galois, Evariste
core   +1 more source

Galois Field Instructions in the Sandblaster 2.0 Architectrue

open access: yesInternational Journal of Digital Multimedia Broadcasting, 2009
This paper presents a novel approach to implementing multiplication of Galois Fields with 2N. Elements of GF(2N) can be represented as polynomials of degree less than N over GF(2).
Mayan Moudgill   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy