Cryptography and network security

PGP, PGP/MIME, OpenPGP,S/MIME  PGP, PGP/MIME, OpenPGP,S/MIME Notes
   PGP (Pretty Good Privacy) encryption has been around for some time. (Some time = A long time on a computer scale, but a very short time on a history of cryptography scale.)
Rate this Book:
The Chinese Remainder Theorem The Chinese Remainder Theorem Notes
  Solving Two Congruences, A More General Theorem, Solving Lots of Congruences Explicit Formulas
Rate this Book:
Web Security Web Security Notes
  Protect web content from those who don’t have a “need to know” Require users to authenticate using a userid/password before they are allowed access to certain URLs
Rate this Book:
System Security System Security Notes
  Like other database systems, the Teradata provides solutions for system security. Security is the protection of data against unauthorized access.
Rate this Book:
Simplified DES Simplified DES Notes
  Developed 1996 as a teaching tool Santa Clara University\ Prof. Edward Schaefer Takes an 8-bit block plaintext, a 10 –bit key and produces an 8-bit block of ciphertext
Rate this Book:
Network Security  Network Security Notes
  The art of war teaches us to rely not on the likelihood of the enemy's not coming, but on our own readiness to receive him; not on the chance of his not attacking, but rather on the fact that we have made our position unassailable.
Rate this Book:
RSA Algorithm RSA Algorithm Notes
  RSA Algorithm topics is discused in this chapter
Rate this Book:
Authentication Applications Authentication Applications Notes
  Introduction to KERBEROS,How Kerberos works?,Comparison between version 4 and 5 Certificates,X.509 Directory Authentication Service,Conclusion
Rate this Book:
Stream Ciphers Stream Ciphers Notes
  Stream ciphers are a very important class of encryption algorithms. These notes explain what stream ciphers are, explain common subclasses of stream ciphers and discuss the attack models relevant to stream ciphers.
Rate this Book:
Digital Signature, Digital Certificate Digital Signature,Digital Certificate Notes
  Cryptography Secret-key algorithms,Public-key algorithms,Message-Digest algorithms Digital Signature,Digital Certificate,Public Key Infrastructure (PKI),Secure Electronic Transaction (SET) Summary
Rate this Book:
MD5 & Hash Encryption MD5 & Hash Encryption Notes
  Purpose of MD5 and Hash Encryptions Examples,MD5 Algorithm,Explanation of Possible Security Risks Practical Applications Through Code,Possible Future Security Risks
Rate this Book:
Malicious Software Malicious Software Notes
  Malicious software is one of the concerns of the contemporary computing environment. Malcontents, pranksters, vandals, and adversaries all have the potential ability to disrupt the conduct of our computing business.
Rate this Book:
LFSR sequences LFSR sequences Notes
  Symmetric encryption algorithms are divided into two main categories, block ciphers and stream ciphers.
Rate this Book:
The Legendre and Jacobi Symbols The Legendre and Jacobi Symbols Notes
  The Legendre and Jacobi Symbols and formula are discused in this topic
Rate this Book:
IP Security IP Security Notes
  Provide Professional training,Support local business Help our customers with their service quality
Rate this Book:
Models of Information Security Analysis Models of Information Security Analysis Notes
  Definitions,Analysis framework,Cautionary factors,Sample analysis
Rate this Book:
Hash functions Hash functions Notes
  In a previous job, I was asked to look at hashing functions and got into a dispute with my boss about how such functions should be designed.
Rate this Book:
Firewalls Firewalls Notes
  A choke point of control and monitoring,Interconnects networks with differing trust
Rate this Book:
Fermat and Euler’s Theorems Fermat and Euler’s Theorems Notes
  Prime Numbers,Prime Factorization,Relatively Prime Numbers
Rate this Book:
ElGamal Public-Key Cryptosystem ElGamal Public-Key Cryptosystem Notes
  The Order of an Element. Primitive Roots,ElGamal Public-Key Cryptosystem
Rate this Book:
Electronic Mail Security Electronic Mail Security Notes
  email is one of the most widely used and regarded network services currently message contents are not secure,may be inspected either in transit,or by suitably privileged users on destination system
Rate this Book:
Discrete logarithms Discrete logarithms Notes
  Given a primitive element g of a finite field GF(q), the discrete logarithm of a nonzero element u Î GF(q) is that integer k, 1 £ k £ q - 1, for which u = gk.
Rate this Book:
Hellman key exchange Hellman key exchange Notes
  The Di±e{Hellman key exchange algorithm solves the following dilemma.Alice and Bob want to share a secret key for use in a symmetric cipher, but their only means of communication is insecure.
Rate this Book:
Differential cryptanalysis Differential cryptanalysis Notes
  Differential cryptanalysis, published in 1990 by Biham and Shamir [5, 6], was the first notable cryptanalysis technique to be discovered outside the world’s intelligence agencies.
Rate this Book:
DES, Triple-DES, and AES DES, Triple-DES, and AES	 Notes
  Symmetric Cryptography,DES: Data Encryption Standard,DESiderata
Rate this Book:
Cryptography Types of ciphers Cryptography Types of ciphers Notes
  Classical substitution ciphers,Transposition (permutation) ciphers,Polyalphabetic Ciphers
Rate this Book:
Introduction to Congruences Introduction to Congruences Notes
  The study of congruences is fundamental in Number Theory, and its essential spirit can be captured very quickly by a simple, but important computational
Rate this Book:
Classical (secret-key) cryptosystems Classical (secret-key) cryptosystems Notes
  In this chapter we deal with some of the very old or quite old cryptosystems that were primarily used in the pre-computer era
Rate this Book:
Birthday-Attack Birthday-Attack Notes
  Sometimes what we also need is collision resistance it is hard to find two random messages M and M1 such that H(M)=H(M1), This is called birthday attack and is based on a birthday paradox
Rate this Book:
Basic Number Theory Basic Number Theory Notes
  Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that a divides b, denoted a|b if there’s a k such that ka = b. We say that p is prime if for a > 0, a|p only for a = 1 and a = p
Rate this Book: