Simulation-based verification of large-integer arithmetic circuits

被引：0

作者：

Alimi, Nejmeddine ^{[1
,3
]}

Lahbib, Younes ^{[2
,3
]}

Machhout, Mohsen ^{[3
]}

Tourki, Rached ^{[3
]}

机构：

[1] Univ Tunis El Manar, Fac Sci Tunis, El Manar Tunis 2092, Tunisia

[2] Univ Carthage, Natl Engn Sch Carthage, Charguia Ii Tunis 2035, Tunisia

[3] Univ Monastir, Elect & Microelect Lab, Monastir 5000, Tunisia

来源：

2016 1ST IEEE INTERNATIONAL VERIFICATION AND SECURITY WORKSHOP (IVSW) | 2016年

关键词：

Verification; large-integer; algebra; cryptography; co-simulation; MATLAB; Simulink; CRYPTOSYSTEMS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Large-integers are integers with bit-size larger than 64 and are mainly used in cryptography and computational algebra. Large-integers arithmetic is constantly changing resulting in continuous new hardware implementations where operations are generally in multi-level within the same design. One of the shortcomings of hardware description languages libraries is their lack of support for large-integer's functions. This paper presents a high-level simulation-based platform dedicated to verify large-integer hardware designs in multi-level and without bit-size restriction.

引用

页码：19 / 24

页数：6

共 19 条

[1] Alrimeih H, 2014, IEEE INT CONF ASAP, P48, DOI 10.1109/ASAP.2014.6868630
[2] [Anonymous], 2012, Recommendation for Random Number Generation Using Deterministic Random Bit Generators (Revised)
[3] Bautista J. N., 2012, 2012 Technologies Applied to Electronics Teaching, P32, DOI 10.1109/TAEE.2012.6235402
[4] BERGERON J, 2003, WRITING TESTBENCHES
[5] Deschamps J.P., 2009, Hardware Implementation of Finite-Field Arithmetic
[6] Hankerson D., 2003, Guide to Elliptic Curve Cryptography
[7] KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5
[8] Kurapati S. N., RUBY VPI
[9] Miller V.S., 1986, ADV CRYPTOLOGY CRYPT, V218
[10] Pakin S, 2013, I S WORKL CHAR PROC, P111, DOI 10.1109/IISWC.2013.6704676

← 1 2 →