Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Ginni
Page 26 of 124
What is the Main Memory?
The main memory is the fundamental storage unit in a computer system. It is associatively large and quick memory and saves programs and information during computer operations. The technology that makes the main memory work is based on semiconductor integrated circuits.RAM is the main memory. Integrated circuit Random Access Memory (RAM) chips are applicable in two possible operating modes are as follows −Static − It consists of internal flip-flops, which store the binary information. The stored data remains solid considering power is provided to the unit. The static RAM is simple to use and has smaller read and write cycles.Dynamic ...
Read MoreWhat are the procedure of Miller-Rabin Primality Testing?
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 MoreWhat are the steps of key generation using RSA algorithm?
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 MoreWhat are the Steps in RSA in Information Security?
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 MoreWhat are the Miller-Rabin Algorithm for testing the primality of a given number?
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 MoreWhat is Primality Testing in Information Security?
A primality test is an algorithm to decide whether an input number is prime. Some primality tests are deterministic. They always correctly decide if a number is prime or composite.The fastest known deterministic primality test was invented in 2004. There are three computer scientists, such as Agrawal, Kayal, and Saxena, invented the AKS primality test that operated in O˜ (log(n)6 ) time, where O˜ (f(n)) is represented as O(f(n).log(f(n))k) for some integer k [1]. Although a significant breakthrough, this speed is rather slow when compared to information security requirement.The advantage of prime numbers are that they are utilized in cryptography. ...
Read MoreWhat is Euler's Theorem in Information Security?
Euler's theorem is a generalization of Fermat's little theorem handling with powers of integers modulo positive integers. It increase in applications of elementary number theory, such as the theoretical supporting structure for the RSA cryptosystem.This theorem states that for every a and n that are relatively prime −$$\mathrm{a^{\phi \left ( n \right )}\, \equiv\, 1\left ( mod \, n \right ) }$$where $\mathrm{\phi}$(n) is Euler's totient function, which counts the number of positive integers less than n that are relatively prime to n.Consider the set of such integers −R = {x1, x2, … x$\mathrm{\phi}$(n)}, i.e., each element xi of R ...
Read MoreWhat is S-Box Substitution?
S-Box Substitution is a procedure that accepts the 48-bit input from the XOR operation containing the compressed key and expanded RPT and creates a 32-bit output utilizing the substitution technique.The substitution is implemented by the eight substitution boxes (also known as the S-boxes). Each 8-S-boxes has a 6-bit input and a 4-bit output. The 48-bit input block is divided into 8 sub-blocks (each including 6 bits), and each sub-blocks is provided to an S-box.The substitution in each box follows a pre-decided rule depends on a 4-row by 16- column table. The sequence of bits one and six of the input ...
Read MoreWhat is Modular Arithmetic in Information Security?
Modular arithmetic is a structure of arithmetic for integers, where numbers "wrap around" upon reaching a specific value. Modular arithmetic enables us to simply make groups, rings and fields which are the basic constructing piece of most modern public-key cryptosystems.For instance, Diffie-Hellman need the multiplicative group of integers modulo a prime pp. There are different groups which can work. Modular or clock arithmetic is arithmetic on a circle rather than a number line modulo N, it can use only the twelve entire numbers from 0 through N-1.Modular arithmetic is very well understood in method of algorithms for several basic operations. ...
Read MoreWhat are the application of Public Key Cryptography in Information Security?
The public key cryptography is treated as the most secure cryptography to make digital signatures and to implement encryption process. The management of digital signature will be treated as the most secured service in future for on-line communications. Therefore, it can perform secure online communications the public key cryptography plays an essential role in cryptography.There are various application of Public key cryptography which are as follows −Digital signatures − It is a message produced by user’s private key used as authenticity of a user. The digital signature generated by the private key of a user and hash algorithm. First the ...
Read More