Computer Security

Removing 1 Click Spam Shield thru Add/Remove Programs on Control Panel is the most common way used by many computer users. Generally, you can take the following steps:

1. Exit all the programs open.

2. Click Start, and click Control Panel tab.

3. Find out Add/Remove Programs applet in Windows XP or Windows 2000, and then Click Uninstall a Program in Windows Vista.

4. Click the Change or Remove Programs button on the top of the left list.

5. Scroll down the list and highlight 1 Click Spam Shield, then click Remove to uninstall 1 Click Spam Shield in Windows XP or Windows 2000; Click Uninstall in Windows Vista.

6. Click Yes when prompts to reboot the computer.

Good luck!

Example One: A Hacker getting your computer's password by use of a brute-force attack.

Example Two: A Hacking gaining access to a database by cracking the encrypted password.

True

The kernel ensures the security of computer systems by implementing a strict access control mechanism, managing permissions for user processes and system resources. It isolates processes through memory protection, preventing unauthorized access and modifications between them. Additionally, the kernel enforces security policies and can utilize features like user authentication, encryption, and secure inter-process communication to safeguard data integrity and confidentiality. By operating at a privileged level, the kernel serves as a critical barrier against malicious activities and vulnerabilities.

Group Policy

In an unsafe environment, computer security faces significant challenges such as increased vulnerability to cyberattacks, data breaches, and unauthorized access. Poor physical security can lead to theft or tampering with hardware, while weak network defenses may expose sensitive information to malicious actors. Additionally, the lack of security protocols can result in inadequate employee training, leading to human errors that compromise systems. Overall, these factors create a precarious landscape for maintaining the integrity and confidentiality of digital assets.

1. It takes time for one person to enter the door with a biometric reader. Fingerprint account is usually combined with a users card, and iris recognition also takes time, so the main question is, how many people use that door per minute.

2. Fingerprint is recognized by the number of matching minutiae (http://en.wikipedia.org/wiki/Fingerprint_recognition), and the result of each reading is a certain number, that varies as a result of temperature, humidity, user behavior, etc.
You got to find a fine compromise between having a secure scanner, and not making a queue at the door.


If the access system is too tough on users, they will seek a way to bend the rules, by leaving the door open, or giving pass for more people at the same time.

Dr. Watson was a machine debugger for Windows. When an application crashed, Dr. Watson could be forwarded the dead application so it could perform a virtual autopsy and figure out why the program failed.

Firewalls can be one of the most effective forms of computer security. In order to do this, they need to be configured properly, by someone with intimate knowledge both of the network and of computer security in general. Too many large organizations will buy a firewall, have it installed, and leave it at that. They feel that just because the firewall is "out there" that they will be safe.

Generally hacking websites are illegal because they involve sharing information on how to perform illegal actions or share information that was gained illegally.

hardware theft

No, it's called "3 User", because you can install it on 3 different PCs, for a total of 3 users. The user part is not referring to different user accounts on your PC.

Encryption and decryption algorithms are called ciphers in cryptography

password

god

your username

the name of one of your pets

the name of one of your kids

the name of your significant other

the current month

your birthday

any word that can be found in a dictionary

A key is used to encipher something. The same key can be used to decipher it.

3 assests of computer system

-hardware

-software

-printer

Answer: Data encryption is the process of scrambling stored or transmitted information so that it is unintelligible until it is unscrambled by the intended recipient. Historically, data encryption has been used primarily to protect diplomatic and military secrets from foreign governments. It is also now used increasingly by the financial industry to protect money transfers, by merchants to protect credit-card information in electronic commerce, and by corporations to secure sensitive communications of proprietary information. Encryption systems are often grouped into families. Common families include symmetric systems (e.g. AES) and asymmetric systems (e.g. RSA), or may be grouped according to the central algorithm used (e.g. elliptic curve cryptography). As each of these is of a different level of cryptographic complexity, it is usual to have different key sizes for the same level of security, depending upon the algorithm used. For example, the security available with a 1024-bit key using asymmetric RSA is considered approximately equal in security to an 80-bit key in a symmetric algorithm (Source: RSA Security). The actual degree of security achieved over time varies, as more computational power and more powerful mathematical analytic methods become available. For this reason cryptologists tend to look at indicators that an algorithm or key length shows signs of potential vulnerability, to move to longer key sizes or more difficult algorithms. For example as of May 2007, a 1039 bit integer was factored, with the special number field sieve using 400 computers over 11 months. The factored number was of a special form; the special number field sieve cannot be used on RSA keys. The computation is roughly equivalent to breaking a 700 bit RSA key. However, this might be an advanced warning that 1024 bit RSA used in secure online commerce should be deprecated, since they may become breakable in the near future. Cryptography professor Arjen Lenstra observed that "Last time, it took nine years for us to generalize from a special to a non-special, hard-to-factor number" and when asked whether 1024-bit RSA keys are dead, said: "The answer to that question is an unqualified yes 64 bit encryption indicates that the size of the key used to encrypt the messageis 64 bits. The 64-bit encryption standard was used in some early Internet and wireless communication encryption algorithms such as DES and WEP. Unfortunately, 64-bit encryption has proven too easy to decipher or crack in practice. Now, 128-bit encryption (in 3DES or TDES) have replaced the 64-bit encryption keys (DES).

Symmetric-key algorithms are a class of algorithms for cryptography that use trivially related, often identical, cryptographic keys for both decryption and encryption.

Mahak NAfish

DNA computing, also known as molecular computing, is a new approach to massively parallel computation based on groundbreaking work by Adleman . In November of 1994, Dr. Leonard Adleman wrote the first paper on DNA computing. In this paper, he found a way to solve the "Hamiltonian path problem," which involves finding all the possible paths between a certain number of vertices. It is also known as the "traveling salesman problem." This name comes from viewing each vertex as a city, with the problem to find all possible routes for a salesman passing through each of these cities . Computers today all use binary codes - 1's and 0's or on's and off's. These codes are the basis for all possible calculations a computer is able to perform. Because the DNA molecule is also a code, Adleman saw the possibility of employing DNA as a molecular computer. However, rather than relying in the position of electronic switches in a microchip, Adleman relied on the much faster reactions of DNA nucleotides binding with their complements, a brute force method that would indeed work A DNA computer is a collection of DNA strands that have been specially selected to aid in the search of solutions for some problems. DNA computing results in parallelism, which means that when enough DNA information is given, huge problems can be solved by invoking a parallel search

patches