Anatoli A. Bolotov

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

We study scheme (hardware) and program (software) methods of multiplication of polynomials over fields of characteristic 7 in order to apply them to cryptographic protocols on elliptic curves based on parings. We consider hardware and software implementations of arithmetic in

MULTIPLE-MODE CRYPTOGRAPHIC MODULE USABLE WITH MEMORY CONTROLLERS

GF(7),

Search engine for large-width data

\

Fast free memory address controller

GF(7^2),

Method and apparatus for formula area and delay minimization

\

FIFO memory with single port memory modules for allowing simultaneous read and write operations

GF(7^n),

Low Density Parity Check Decoder With Miscorrection Handling

\

IMPULSE REGULAR EXPRESSION MATCHING

GF(7^{7n}),

Memory timing model with back-annotating

and

MODIFYING TIMING GRAPH TO AVOID GIVEN SET OF PATHS

GF(7^{14n})