 |
Security software
Watermarking works by inserting a masked content. Recently, more systems have been explored to shield software from piracy. A hidden key is used for the construction of the mark, that mark is then obscured inside the data of the software. Such technique provides a comparatively potent software protection because such watermark can only be extracted effortless by someone who owns the key. Yet, also if there is none effectively disposable, a cracker could assault the certifying mechanism. This is then done by manipulating it into unconditionally confirming the presence of a sound certification. In this context, the fresh programmed systems appear to be comparatively secure. Let's further on check if the question continues whether the technique is efficient.
Computer software suppliers lose a good deal from software reversing. It substantially trims their workable income. The software vendor stays often unable to apply his licensing terms. That is particularly the case because software pirates often work from nations where legal support in prosecuting malevolent somebodies is very terrible till non-existent. Today, the strongest plan working this trouble is the embedding of protection systems in the software. Obviously, the aim is to produce the software as hard to crack as workable.
Multimedia watermarking is also known as digital media watermarking. It has been investigated comprehensively, long before software watermarking. Since then, the programming of safe techniques has seen a significant progress. Nevertheless, watermarking software is a relatively different approach to the problem of copyright protection, it involves implementing ownership information in an executable program.
Software watermarking and fingerprinting are techniques that have recently been studied - in academic environment - to prevent the infringement of copyright. The disposable techniques are corresponding to those of media watermarking. In digital media watermarking, a unique identifier is integrated in data such as audio, text, video, or images. These systems create minor errors in the media. In fact, these errors are unperceivable by the human senses because they are too little to get detected. The conflict with software is that application data is much more perceptible to modifications and the watermark can't be embedded just anywhere. Indeed, unreliable handling could crash the program. Instead, practicing the implanting of the unique identifier in software should not break the original working in any way.
So, software watermarking implants the watermark - a unique identifier - into a software. If the identifier uniquely constitutes the writer of the program, then the identifier is a copyright notice. However, if the identifier uniquely distinguishes the legal purchaser of the computer program, then the watermark is a fingerprint. The employment of a hidden key is an essential aspect of watermarking. Through the use of the key, the watermark is integrated into the software, acquiring a - though barely - different software. Nevertheless, the watermark can not guide to the true pirate of the unlawful action. Thus,the problem continues: a watermark can show ownership but it . It requires a fingerprint to supply such features to the watermark. In fact, the fingerprint is a watermark controlling data from the individual customer.
Watermarking algorithms are identified as static or dynamic. Static watermarking algorithms solely make use of the structures of a software accessible on disk. On the other hand, a dynamic watermarking algorithm relies on data collected during the carrying out of the program, to implement, validate and extract the watermark. Dynamic techniques are split into three subcategories: easter egg, data structure and execution trace watermarks. Some of the underway research is pointed at the analysis of static against every of the dynamic algorithms in order to discover which one is stronger. First studies describe no clear advantage for either. More research in this subject is indispensable though. 64 bit protection programs
Therefore, the strongest protection by watermarking is offered when both - a watermark and a fingerprint - are implemented in the program. The writer of the program implements a fingerprint with specific data from the customer when he sells a copy of his program. But first, he has implemented a standard watermark holding his own data to establish his authorship. The proof is then complete! Despite all protection schemes brought up, it still exists modes of outwitting such guarding systems. A software pirate can eitherremove the verification code or copy the watermark to outsmart the protection mechanism. This is achieved through reverse engineering the program with the unlawful purpose of exposing the verification code and its working together with the remaining code. On victorious reversing, the watermark verification code is dismantled or even totally removed. A reversed copy does no more need to bear the mark because the software doesn't control for its presence anymore. However, the safety degree reaches a really advanced point if watermarking is utilised in conjunction with extra protection techniques.
COMPRESSION AND PACKING
Encrypting a file with the destination to tighten its size is named compression. This is done so that the data can be stored or sent more efficiently. Compression can also be done on a particular form of data: the binary file. Either way, the outcome is leading to a smaller file size. Compression ratio is the relation of the original against the compressed file size. Ratios differ depending on the algorithm utilised and depending on the original file.
Compression is mostly achieved because it happens too often to run out of disk place. When transmitting files, it can take very long to transmit a large file. After compression, the files take up less place and transporting time.
ZIP and RAR are familiar instances of compression schemes for data. Binaries though must have all start-up capabilities therefore necessitating proper binary compression programs.
The process of compressing a binary (executable) file is frequently referred to as packing, a characteristic name for an executable compressing software then becomes a packer. The decompression code that is added up to the compressed data is oftentimes named the decompression stub. Running a compressed executable basically means that the decompression stub unpacks the initial executable code before passing command to the recomposed primary binary. Anyway, the outcome is the same as if the original executable had been run.
Packers also have a different ground of existence: executable compression is utilised to obfuscate, to cloak strings and to change signatures. Nonetheless, this does not eliminate the chance of reverse engineering. Generally, executable compression is totally inadequate to outwit cracking. The protectors are much more reliable for that purpose.
Speed is not a primary reason in favor of or against compressing an executable. That is explainable because a compressed software is smaller, therefore taking less time to map into memory. On the other hand, it needs some time to decompress the data before execution begins which evens out the total.
A compression exercise is the reduction of a text file. This is done by eliminating recurring single words, word combinations and phrases that use up too much storage space to be productive. The said applies also for binary files with repetitive bits and bytes. There can be media such as images whose data information occupies more place than required. Yet, the document or file can be compressed to reduce this inefficiency electronically.
That takes us to the various forms of compression: lossless and lossy compression. If decompression produces an exact replica of the original data, then the compression is lossless. Lossy compression however does not allow reproduction of an exact replica of the original but provides a better compression ratio in return.
JPG and MP3 are systems where there is actually missing as much as 90% of the original information. All the same, the fundamental nature of the data remains present because the primary colours respectively the main sounds are kept intact. This lossy compression gets rid of bits of data that - hopefully - are not fatal.
Lossless compression shrinks file sizes without loss of data, also when decompressed. To attain this, algorithms make reference points for patterns, stock them in a table and transmit the table along with the now tighter encoded file. When decompressed, the file is re-generated by replacing the referenced points with the initial info.
Data and executable compression for 32 bit or for 64 bit are comparable on both platforms. In fact, all that is said in general is also right for 64 bit programs. The same application created in 32 bit is usually slightly smaller than its 64 bit counterpart. Yet, there is frequently a better ratio for the 64 bit software compression because there are more similar patterns in this software (only the same number of basic bits and bytes exist for both). This makes that it is even more advisable to compress 64 bit programs.
64 bit software protection
anti cracking software
Send E-Mail to: letjeantje@hotmail.com
Copyright © 2010 Aldo Vasquez. All Rights Reserved