A Unified, Reconfigurable Architecture for Montgomery Multiplication in Finite Fields GF(p) and GF(2^n)

2007 ◽  
Author(s):  
M. Sudhakar ◽  
R.V. Kamala ◽  
M.B. Srinivas
Keyword(s):  
Finite Fields ◽  
Reconfigurable Architecture ◽  
Montgomery Multiplication

Reconfigurable Architecture for Cryptography over Binary Finite Fields

2012 ◽  
pp. 319-362
Author(s):  
Samuel Antão ◽  
Ricardo Chaves ◽  
Leonel Sousa
Keyword(s):  
Finite Fields ◽  
Reconfigurable Architecture

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

HyDRA: Hybrid Dynamically Reconfigurable Architecture for DSP Applications

2016 ◽  
Vol E99.C (7) ◽  
pp. 866-877 ◽  
Author(s):  
Abdulfattah M. OBEID ◽  
Syed Manzoor QASIM ◽  
Mohammed S. BENSALEH ◽  
Abdullah A. ALJUFFRI
Keyword(s):  
Reconfigurable Architecture ◽  
Dynamically Reconfigurable ◽  
Dsp Applications ◽  
Dynamically Reconfigurable Architecture

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.

Sign in / Sign up

Export Citation Format

Share Document