On Hardware and Software Implementation of Arithmetic in Finite Fields of Characteristic 7 for Calculation of Pairings

Author(s):  
Sergei Gashkov ◽  
Anatoli Bolotov ◽  
Alexej Burtzev ◽  
Alexander Frolov ◽  
Sergei Zhebet
2010 ◽  
Vol 168 (1) ◽  
pp. 49-75 ◽  
Author(s):  
S. B. Gashkov ◽  
A. A. Bolotov ◽  
A. A. Burtsev ◽  
S. Yu. Zhebet ◽  
A. B. Frolov

2006 ◽  
Vol 93 (1-3) ◽  
pp. 3-32 ◽  
Author(s):  
Jorge Guajardo ◽  
Sandeep S. Kumar ◽  
Christof Paar ◽  
Jan Pelzl

2002 ◽  
Vol 5 ◽  
pp. 181-193 ◽  
Author(s):  
K. Harrison ◽  
D. Page ◽  
N. P. Smart

AbstractIn this paper, the authors examine a number of ways of implementing characteristic three arithmetic for use in cryptosystems based on the Tate pairing. Three alternative representations of the field elements are examined, and the resulting algorithms for the field addition, multiplication and cubing are compared. Issues related to the arithmetic of supersingular elliptic curves over fields of characteristic three are also examined. Details of how to compute the Tate pairing itself are not covered, since these are well documented elsewhere.


Author(s):  
Erdem Alkim ◽  
Hülya Evkan ◽  
Norman Lahr ◽  
Ruben Niederhagen ◽  
Richard Petri

We present and evaluate a custom extension to the RISC-V instruction set for finite field arithmetic. The result serves as a very compact approach to software-hardware co-design of PQC implementations in the context of small embedded processors such as smartcards. The extension provides instructions that implement finite field operations with subsequent reduction of the result. As small finite fields are used in various PQC schemes, such instructions can provide a considerable speedup for an otherwise software-based implementation. Furthermore, we create a prototype implementation of the presented instructions for the extendable VexRiscv core, integrate the result into a chip design, and evaluate the design on two different FPGA platforms. The effectiveness of the extension is evaluated by using the instructions to optimize the Kyber and NewHope key-encapsulation schemes. To that end, we also present an optimized software implementation for the standard RISC-V instruction set for the polynomial arithmetic underlying those schemes, which serves as basis for comparison. Both variants are tuned on an assembler level to optimally use the processor pipelines of contemporary RISC-V CPUs. The result shows a speedup for the polynomial arithmetic of up to 85% over the basic software implementation. Using the custom instructions drastically reduces the code and data size of the implementation without introducing runtime-performance penalties at a small cost in circuit size. When used in the selected schemes, the custom instructions can be used to replace a full general purpose multiplier to achieve very compact implementations.


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