A Simple Proof of Rolle's Theorem for Finite Fields

2002 ◽  
Vol 109 (1) ◽  
pp. 72 ◽  
Author(s):  
C. Ballantine ◽  
J. Roberts
Keyword(s):  
Finite Fields ◽  
Simple Proof ◽  
Rolle’S Theorem

A Simple Proof of Rolle's Theorem for Finite Fields

2002 ◽  
Vol 109 (1) ◽  
pp. 72-74 ◽  
Author(s):  
C. Ballantine ◽  
J. Roberts
Keyword(s):  
Finite Fields ◽  
Simple Proof ◽  
Rolle’S Theorem

scholarly journals Solutions of equations over finite fields: Enumeration via bijections

2016 ◽  
Vol 15 (07) ◽  
pp. 1650136 ◽  
Author(s):  
Ioulia N. Baoulina
Keyword(s):  
Recent Result ◽  
Finite Fields ◽  
Simple Proof ◽  
Character Sums ◽  
Alternative Proof ◽  
Number Of Solutions ◽  
Combinatorial Argument ◽  
Solutions Of Equations

We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In both cases, the use of character sums is avoided by using an elementary combinatorial argument.

A SIMPLE PROOF OF CHEBOTAREV’S DENSITY THEOREM OVER FINITE FIELDS

2018 ◽  
Vol 98 (2) ◽  
pp. 196-202
Author(s):  
STEVE MEAGHER
Keyword(s):  
Conjugacy Class ◽  
Finite Fields ◽  
Simple Proof ◽  
Function Fields ◽  
Rational Points ◽  
Density Theorem ◽  
Chebotarev Density Theorem ◽  
Projective Varieties

We present a simple proof of the Chebotarev density theorem for finite morphisms of quasi-projective varieties over finite fields following an idea of Fried and Kosters for function fields. The key idea is to interpret the number of rational points with a given Frobenius conjugacy class as the number of rational points of a twisted variety, which is then bounded by the Lang–Weil estimates.

Finite Fields

1996 ◽  
Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  
Finite Fields

Maximum Distance Separable Hankel Rhotrices over Finite Fields

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

Notes on three-pass protocol

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl
Keyword(s):  
Finite Fields ◽  
Matrix Algebras ◽  
Associative Structures

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.

About the Complexity of Square Root Extraction Algorithms in Finite Fields and Residue Rings

Vestnik MEI ◽  
2018 ◽  
Vol 5 (5) ◽  
pp. 79-88
Author(s):  
Sergey B. Gashkov ◽  
◽  
Aleksandr B. Frolov ◽  
Elizaveta Р. Popova ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Square Root ◽  
Root Extraction
Sign in / Sign up

Export Citation Format

Share Document