Encoding of Floorplans through Deterministic Perturbation

Recent trends in VLSI design involve rapid growth of design reuse and electronic Intellectual Property (IP) commerce. For VLSI physical design, the risk of misappropriation of design IP stored in design repositories, or the threat of hacking the same during its web-based transmission, mandates design file encryption. However, encryption of GDSII/OASIS design files, too large in size and complex in format, is troublesome, time consuming and also prone to typical cryptanalysis. The idea of an alternate efficient approach of encoding by deterministic perturbation of design IP resulting in a degraded design of negligible IP value, is proposed here to ensure security during design storage or transmission. From the highly degraded design only authorized person can quickly regenerate the optimized design. In this paper, the technique for design encoding through perturbation is applied for floorplanning stage. Encoding moves for various floorplan representations are analyzed and a novel technique for encoding tree-based representations is proposed. Experimental results on floorplan perturbation for MCNC benchmarks are encouraging.

[1]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.

[2]  Frank Ruskey,et al.  On Rotations and the Generation of Binary Trees , 1993, J. Algorithms.

[3]  D. Saha,et al.  An Analytical Approach to Direct IP Protection of VLSI Floorplans , 2008, 2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems.

[4]  Susmita Sur-Kolay,et al.  A Novel Scheme for Encoding and Watermark Embedding in VLSI Physical Design for IP Protection , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[5]  Rolf Ernst,et al.  VLSI design exchange with intellectual property protection in FPGA environment using both secret and public-key cryptography , 2006, IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI'06).

[6]  Yici Cai,et al.  Corner block list representation and its application to floorplan optimization , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[8]  Yao-Wen Chang,et al.  B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.

[9]  Igor L. Markov,et al.  Are floorplan representations important in digital design? , 2005, ISPD '05.

[10]  Frank Ruskey,et al.  Generating Binary Trees Lexicographically , 1977, SIAM J. Comput..

[11]  Edoardo Charbon,et al.  On intellectual property protection , 2000, Proceedings of the IEEE 2000 Custom Integrated Circuits Conference (Cat. No.00CH37044).