Modular Arithmetic, Groups, Finite Fields and Probability

Author(s):  
Nigel P. Smart
Author(s):  
Manuel Mogollon

Mathematics plays an important role in encryption, public-key, authentication, and digital signatures. Knowing certain basic math concepts such as counting techniques, permutations, plotting a curve, raising a number to a power, modular arithmetic, and congruence would help to understand the material in this book.


2007 ◽  
Vol 49 (2) ◽  
pp. 243-255 ◽  
Author(s):  
S. J. PATTERSON

AbstractThe concept of a metaplectic form was introduced about 40 years ago by T. Kubota. He showed how Jacobi-Legendre symbols of arbitrary order give rise to characters of arithmetic groups. Metaplectic forms are the automorphic forms with these characters. Kubota also showed how higher analogues of the classical theta functions could be constructed using Selberg's theory of Eisenstein series. Unfortunately many aspects of these generalized theta series are still unknown, for example, their Fourier coefficients. The analogues in the case of function fields over finite fields can in principle be calculated explicitly and this was done first by J. Hoffstein in the case of a rational function field. Here we shall return to his calculations and clarify a number of aspects of them, some of which are important for recent developments.


Author(s):  
Peter M. Higgins

‘Vector spaces’ discusses the algebra of vector spaces, which are abelian groups with an additional scalar multiplication by a field. Every finite abelian group is the direct product of cyclic groups. Any finite abelian group can be represented in one of two special ways based on numerical relationships between the subscripts of the cyclic groups involved. In one representation, all the subscripts are powers of primes; in the alternative, each subscript is a divisor of its successor. It concludes by bringing together the ideas of modular arithmetic, the construction of the complex numbers, factorization of polynomials, and vector spaces to explain the existence of finite fields.


Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.


Sign in / Sign up

Export Citation Format

Share Document