A computer virus is a malware, which corrupts or destroys our files on the system. The computer virus is not a new thing to us. It was created and started spreading around the 1980's. Virus is a type of malware which is capable of self-replicating itself and spreads from one machine to another.Generally, Computer virus is a program which controls the computer without the knowledge of the user and it runs parallel with the internet. If more devices are connected and all people are using the web obviously threat and security risk are increasing.Types of Computer VirusesSome of the types ... Read More

RSA is a cryptosystem for public-key encryption, and is broadly used for securing responsive information, specifically when being sent over an insecure network including the Internet.In RSA cryptography, both the public and the private keys can encrypt a message; the inverse key from the one used to encrypt a message is used to decrypt it. This attribute is one reason why RSA has develop into the most broadly used asymmetric algorithm. It supports an approach of assuring the confidentiality, integrity, authenticity and non-reputability of digital connection and data storage.RSA need a multiplicative group G =< Z$\mathrm{\phi}$n, *, X > for ... Read More

RSA is a cryptosystem for public-key encryption, and it is broadly used for securing sensitive information, specifically when being sent over an insecure network including the Internet.RSA algorithm is the most popular asymmetric key cryptographic algorithm depends on the mathematical fact that it is simply to discover and multiply large prime numbers but complex to factor their product. It needs both private and public key.Example of RSA AlgorithmLet us take an example of this procedure to learn the concepts. For ease of reading, it can write the example values along with the algorithm steps.Choose two large prime numbers P and ... Read More

The RSA algorithm is a public-key signature algorithm founded by Ron Rivest, Adi Shamir, and Leonard Adleman. RSA can also encrypt and decrypt general data to securely exchange information along with managing digital signature verification.The RSA algorithm is based on the complexity contained in the factorization of large numbers. The RSA algorithm depends on the fact that there is no effective method to factor very large numbers. Therefore, deducing an RSA key would take a large amount of time and processing power.RSA algorithm is asymmetric cryptography algorithm as it operate on two different keys such as public key and private ... Read More

The Rivest-Shamir-Adleman (RSA) encryption algorithm is an asymmetric encryption algorithm that is broadly used in several products and services. Asymmetric encryption need a key pair that is mathematically connected to encrypt and decrypt data.A private and public key are generated, with the public key being available to anyone and the private key being a secret known only by the key set creator. With RSA, the private or public key can encrypt the information, while the other key decrypts it. This is the reasons that RSA is the generally used asymmetric encryption algorithm.The choice to encrypt with either the private or ... Read More

RSA stands for Rivest, Shamir, Adleman. They are the founder of public-key encryption technology, which is a public-key cryptosystem for protected information transmission. It is a standard encryption approach for transmitting responsive information, particularly while transferring data over the internet.The Rivest-Shamir-Adleman (RSA) encryption algorithm is an asymmetric encryption algorithm that is broadly used in some products and services. A private and public key are generated, with the public key being available to anyone and the private key being a private known only by the key set creator.With RSA, the private or public key can encrypt the information, while the different ... Read More

Public key cryptography is called as asymmetric key cryptography. It is an essential encryption and decryption pattern in online software. It uses two different keys termed as public key and private key.In symmetric key algorithms, only one key is used to implement encryption and decryption operations. But in public key cryptography, there are two keys are used to implement encryption and decryption operations. If one key is used to implement encryption operation, and second key is used to perform decryption operation vice versa.The keys generated in public key cryptography are large including 512, 1024, 2048, etc., bits. These keys are ... Read More

Public key cryptography has become an essential means of providing confidentiality, especially through its need of key distribution, where users seeking private connection exchange encryption keys. It also features digital signatures which enable users to sign keys to check their identities. The approach of public key cryptography derivative from an attempt to attack two of the most complex problems related to symmetric encryption. The first issue is that key distribution. Key distribution under symmetric encryption needed such as − that two communicants already shared a key, which somehow has been ... Read More

Miller Rabin is a fast approach to test primality of the large numbers. This algorithm is called a Rabin-miller primality test and this algorithm decides whether number is prime which is same to other tests including Fermat primality Test and Solovay- Strassen primality test.This test is based on equality or group of equalities that hold the true for prime values, thus checks whether they hold for the number, that it is required to test for primality.This algorithm is most useful known primality testing algorithm and can be used in different software libraries that based on RSA encryption and best instance ... Read More

The Miller-Rabin Permality test combines the Fermat test and the Fermat root test in a classic method to find a strong pseudoprime. In this test, it can write n – 1 as the product of an odd number m and a power of 2 −$$\mathrm{n-1=m\, x\, 2^{k}}$$The Fermat test in base a can be composed as −$$\mathrm{a^{n-1}\, =\, a^{m\, x\, 2k}=\left [ a^{m} \right ]^{2k}=\left [ a^{m} \right ]\frac{2^{2}\cdot \cdot \cdot 2}{K\, times}}$$In other words, rather than calculating an−1(mod n) in one step, it can do it in k+1 steps. The advantage of using k + 1 is that each ... Read More