Functional Verification of Large-integers Circuits using a Cosimulation-based Approach

Cryptography and computational algebra designs are complex systems based on modular arithmetic and build on multi-level modules where bit-width is generally larger than 64-bit. Because of their particularity, such designs pose a real challenge for verification, in part because large-integer’s functions are not supported in actual hardware description languages (HDLs), therefore limiting the HDL testbench utility. In another hand, high-level verification approach proved its efficiency in the last decade over HDL testbench technique by raising the latter at a higher abstraction level. In this work, we propose a high-level platform to verify such designs, by leveraging the capabilities of a popular tool (Matlab/Simulink) to meet the requirements of a cycle accurate verification without bit-size restrictions and in multi-level inside the design architecture. The proposed high-level platform is augmented by an assertion-based verification to complete the verification coverage. The platform experimental results of the testcase provided good evidence of its performance and re-usability.

[1]  Ingrid Verbauwhede,et al.  Novel RNS Parameter Selection for Fast Modular Multiplication , 2014, IEEE Transactions on Computers.

[2]  Chris Peikert,et al.  An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) — FPGA implementation using Simulink , 2012, 2012 IEEE Conference on High Performance Extreme Computing.

[3]  Litian Liu,et al.  Fast RSA decryption through high-radix scalable Montgomery modular multipliers , 2014, Science China Information Sciences.

[4]  Tibor Juhas The use of elliptic curves in cryptography , 2007 .

[5]  Said Boussakta,et al.  Efficient algorithms for computing the new Mersenne number transform , 2014, Digit. Signal Process..

[6]  Kurt Rohloff,et al.  An FPGA co-processor implementation of Homomorphic Encryption , 2014, 2014 IEEE High Performance Extreme Computing Conference (HPEC).

[7]  Suraj N. Kurapati,et al.  Specification-driven functional verification with Verilog PLI & VPI and SystemVerilog DPI , 2007 .

[8]  Consultant,et al.  Using MatLab to aid the implementation of a fast RSA processor on a Xilinx FPGA , 2008 .

[9]  Reza Azarderakhsh,et al.  A Generalization of Addition Chains and Fast Inversions in Binary Fields , 2015, IEEE Transactions on Computers.

[10]  Farimah Farahmandi,et al.  Groebner basis based formal verification of large arithmetic circuits using Gaussian elimination and cone-based polynomial extraction , 2015, Microprocess. Microsystems.

[11]  V. Sridhar,et al.  Design of Multiplier for Medical Image Compression Using Urdhava Tiryakbhyam Sutra , 2016 .

[12]  Zhou Dexin,et al.  Hardware Implementation of Finite-field Arithmetic , 2003 .

[13]  Jan Decaluwe MyHDL: a python-based hardware description language , 2004 .

[14]  Rached Tourki,et al.  Simulation-based verification of large-integer arithmetic circuits , 2016, 2016 1st IEEE International Verification and Security Workshop (IVSW).

[15]  Albin Property specification language reference manual , 2004 .

[16]  G. Athisha,et al.  Reconfigurable Architecture for Elliptic Curve Cryptography Using FPGA , 2013 .

[17]  Gopi Arepalli,et al.  Secure Multicast Routing Protocol in Manets Using Efficient ECGDH Algorithm , 2016 .

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

[19]  P. Muñoz,et al.  Design of elliptic curve cryptoprocessors over GF(2^163) using the Gaussian normal basis , 2014 .

[20]  Leonel Sousa,et al.  A Flexible Architecture for Modular Arithmetic Hardware Accelerators based on RNS , 2014, J. Signal Process. Syst..

[21]  Yinan Kong,et al.  Modular multiplication using the core function in the residue number system , 2015, Applicable Algebra in Engineering, Communication and Computing.

[22]  Jean-Pierre Deschamps,et al.  Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations , 2013, IEEE Transactions on Industrial Electronics.

[23]  Tim Pruss,et al.  Efficient Symbolic Computation for Word-Level Abstraction From Combinational Circuits for Verification Over Finite Fields , 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.