Locating Encrypted Data Hidden Among Non-Encrypted Data Using Statistical Tools

<p>This research tests the security of software protection techniques that use encryption to protect code segments containing critical algorithm implementation to prevent reverse engineering. Using the National Institute of Standards and Technology (NIST) Tests for Randomness encrypted regions hidden among non-encrypted bits of a binary executable file are located. The location of ciphertext from four encryption algorithms (AES DES RSA and TEA) and three block sizes (10 100 and 500 32-bit words) were tested during the development of the techniques described in this research. The test files were generated from the Win32 binary executable file of Adobe's Acrobat Reader version 7.0.9. The culmination of this effort developed a technique capable of locating 100% of the encryption regions with no false negative error and minimal false positive error with a 95% confidence. The encrypted region must be encrypted with a strong encryption algorithm whose ciphertext appears statistically random to the NIST Tests for Randomness and the size of the encrypted region must be at least 100 32-bit words (3200 bits).</p><p>This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact and remains as true to the original work as possible. Therefore you will see the original copyright references library stamps (as most of these works have been housed in our most important libraries around the world) and other notations in the work.</p><p>This work is in the public domain in the United States of America and possibly other nations. Within the United States you may freely copy and distribute this work as no entity (individual or corporate) has a copyright on the body of the work.</p><p>As a reproduction of a historical artifact this work may contain missing or blurred pages poor pictures errant marks etc. Scholars believe and we concur that this work is important enough to be preserved reproduced and made generally available to the public. We appreciate your support of the preservation process and thank you for being an important part of keeping this knowledge alive and relevant.</p>