A New Family of Boolean Functions with Good Cryptographic Properties

In 2005, Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of the Maiorana–McFarland’s (MM) construction of bent functions. In this paper, we study a new family of Boolean functions with cryptographically strong properties, such as non-linearity, propagation criterion, resiliency, and balance. The construction of cryptographically strong Boolean functions is a daunting task, and there is currently a wide range of algebraic techniques and heuristics for constructing such functions; however, these methods can be complex, computationally difficult to implement, and not always produce a sufficient variety of functions. We present in this paper a construction of Boolean functions using algebraic codes following Guillot’s work.

A Topological View of Reed–Solomon Codes

We studied a particular class of well known error-correcting codes known as Reed–Solomon codes. We constructed RS codes as algebraic-geometric codes from the normal rational curve. This approach allowed us to study some algebraic representations of RS codes through the study of the general linear group GL(n,q). We characterized the coefficients that appear in the decompostion of an irreducible representation of the special linear group in terms of Gromov–Witten invariants of the Hilbert scheme of points in the plane. In addition, we classified all the algebraic codes defined over the normal rational curve, thereby providing an algorithm to compute a set of generators of the ideal associated with any algebraic code constructed on the rational normal curve (NRC) over an extension Fqn of Fq.

The Genetic Code, Algebraic Codes and Double Numbers

The article shows materials to the question about algebraic features of the genetic code and about the dictatorial influence of the DNA and RNA molecules on the whole organism. Presented results testify in favor that the genetic code is an algebraic code related with a wide class of algebraic codes, which are a basis of noise-immune coding of information in communication technologies. Structural features of the genetic systems are associated with hypercomplex double (or hyperbolic) numbers and with bisymmetric doubly stochastic matrices. The received results confirm that represented matrix approaches are effective for modeling genetic phenomena and revealing the interconnections of structures of biological bodies at various levels of their organization. This allows one to think that living organisms are algebraically encoded entities where structures of genetic molecules have the dictatorial influence on inherited structures of the whole organism. New described algebraic approaches and results are discussed.

The Genetic Code, Algebraic Codes and Double Numbers

The article shows materials to the question on algebraic features of the genetic code. Presented results testify in favor that the genetic code is an algebraic code related with a wide class of algebraic codes, which are a basis of noise-immune coding of information in communication technologies. Algebraic features of the genetic code are associated with hypercomplex double (or hyperbolic) numbers. The article also presents data on structural relations of some genetically inherited macrobiological phenomena with double numbers and with their algebraic extentions. The received results confirm that multidimensional numerical systems is effective for modeling and revealing the interconnections of structures of biological bodies at various levels of their organization. This allows one to think that living organisms are algebraically encoded entities.

New Soft Set Based Class of Linear Algebraic Codes

In this paper, we design and develop a new class of linear algebraic codes defined as soft linear algebraic codes using soft sets. The advantage of using these codes is that they have the ability to transmit m-distinct messages to m-set of receivers simultaneously. The methods of generating and decoding these new classes of soft linear algebraic codes have been developed. The notion of soft canonical generator matrix, soft canonical parity check matrix, and soft syndrome are defined to aid in construction and decoding of these codes. Error detection and correction of these codes are developed and illustrated by an example.