Switching Construction of Planar Functions on Finite Fields

Author(s):  
Alexander Pott ◽  
Yue Zhou
COMBINATORICA ◽  
1989 ◽  
Vol 9 (3) ◽  
pp. 315-320 ◽  
Author(s):  
L. Rónyai ◽  
T. SzŐnyi

Author(s):  
Amela Muratović-Ribić ◽  
Alexander Pott ◽  
David Thomson ◽  
Qiang Wang

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