An Improved Version of the Visual Digital Signature Scheme
暂无分享,去创建一个
[1] Elaine B. Barker,et al. SP 800-57. Recommendation for Key Management, Part 1: General (revised) , 2007 .
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] István Borgulya. An evolutionary framework for 3-SAT problems , 2003 .
[4] Kristina Lerman,et al. Threshold Behavior in a Boolean Network Model for SAT , 2003, IC-AI.
[5] T. M. Murali,et al. NP-Complete Problems , 2013 .
[6] Ching-Nung Yang,et al. New visual secret sharing schemes using probabilistic method , 2004, Pattern Recognit. Lett..
[7] Azman Samsudin,et al. Visual Digital Signature Scheme: A New Approach , 2010 .
[8] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Daniel J. Rosenkrantz,et al. NP-Complete Problems , 2019, Primers in Electronics and Computer Science.
[11] Mohamed El Bachir Menai,et al. Solving the Maximum Satisfiability Problem Using an Evolutionary Local Search Algorithm , 2005, Int. Arab J. Inf. Technol..
[12] M. Mézard,et al. Random K-satisfiability problem: from an analytic solution to an efficient algorithm. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[13] Elaine B. Barker. Recommendation for Key Management - Part 1 General , 2014 .
[14] William E. Burr,et al. Recommendation for Key Management, Part 1: General (Revision 3) , 2006 .