A custom instruction approach for hardware and software implementations of finite field arithmetic over F263 using Gaussian normal bases

The invention is an improved hardener for use with phenolresorcinol-formaldehyde wood bonding adhesives. The hardener is conveniently made and shipped as a stable dry powdered material. It is then slurried in water at the point of use for convenience with continuously mixed and dispensed liquid-liquid, two part adhesive systems. The hardener comprises paraformaldehyde or alphapolyoxymethylene, fillers, viscosity and/or rheology control agents, and a solid acidic material. The latter ingredient is a critical component used to adjust the pH of an aqueous slurry to the range of 4.0 to 5.5. Oxalic acid is preferred. In this pH range, the formaldehyde polymers are stable and the slurried hardener does not give off significant formaldehyde odor for periods up to several days. Bonding performance is improved because the characteristics of the hardener and resulting adhesive have very little variation over time.

[1]  Wai Keung Wong,et al.  FPGA implementation of a microcoded elliptic curve cryptographic processor , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[2]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[3]  Tim Kerins,et al.  Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2) , 2002, FPL.

[4]  Michael Rosing,et al.  Implementing elliptic curve cryptography , 1998 .

[5]  M. Anwar Hasan,et al.  High performance FPGA based elliptic curve cryptographic co-processor , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[6]  Vipul Gupta,et al.  An End-to-End Systems Approach to Elliptic Curve Cryptography , 2002, CHES.

[7]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[8]  Philip Heng Wai Leong,et al.  A microcoded elliptic curve processor using FPGA technology , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[9]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[10]  M. Anwar Hasan,et al.  Fast Normal Basis Multiplication Using General Purpose Processors , 2003, IEEE Trans. Computers.

[11]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[12]  Ricardo Dahab,et al.  Software multiplication using Gaussian normal bases , 2006, IEEE Transactions on Computers.

[13]  Wenbo Mao,et al.  Modern Cryptography: Theory and Practice , 2003 .

[14]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[15]  Wayne Luk,et al.  Customising Hardware Designs for Elliptic Curve Cryptography , 2004, SAMOS.

[16]  Ian F. Blake,et al.  Low complexity normal bases , 1989, Discret. Appl. Math..

[17]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[18]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[19]  M. Anwar Hasan,et al.  Fast Normal Basis Multiplication Using General Purpose Processors , 2001, Selected Areas in Cryptography.

[20]  Johann Großschädl,et al.  A Simple Architectural Enhancement for Fast and Flexible Elliptic Curve Cryptography over Binary Finite Fields GF(2m) , 2004, Asia-Pacific Computer Systems Architecture Conference.

[21]  Johann Großschädl,et al.  Instruction Set Extensions for Fast Arithmetic in Finite Fields GF( p) and GF(2m) , 2004, CHES.