Crypto Graphy Unit 4
Crypto Graphy Unit 4
Crypto Graphy Unit 4
Step-1:
User login and request services on the host. Thus user requests for ticket-granting
service.
Step-2:
Authentication Server verifies user’s access right using database and then gives
ticket-granting-ticket and session key. Results are encrypted using the Password of
the user.
Unit-4
Step-3:
The decryption of the message is done using the password then send the ticket to
Ticket Granting Server. The Ticket contains authenticators like user names and
network addresses.
Step-4:
Ticket Granting Server decrypts the ticket sent by User and authenticator verifies the
request then creates the ticket for requesting services from the Server.
Step-5:
The user sends the Ticket and Authenticator to the Server.
Step-6:
The server verifies the Ticket and authenticators then generate access to the service.
After this User can access the services.
Kerberos Limitations
Each network service must be modified individually for use with Kerberos
It doesn’t work well in a timeshare environment
Secured Kerberos Server
Requires an always-on Kerberos server
Stores all passwords are encrypted with a single key
Assumes workstations are secure
May result in cascading loss of trust.
Scalability
Unit-4
2. The server presents its certificate to the browser, and the browser validates the
public certificate.
3. An authentication request is made from the server for the user to authenticate
themselves.
4. While the user is being authenticated, the browser presents the user’s certificate to
the server for validation.
5. The server authenticates the user’s identity and allows access to the network.
Unit-4
Increased security. Traditional username and password combinations are among the least
secure forms of authentication. Often, these passwords are easy to guess and are stored in
an insecure manner, such as written down on sticky notes. Certificate-based authentication
is a much stronger form of authentication and eliminates vulnerable passwords. Eliminating
passwords also decreases the possibility of phishing or brute force attacks from bad actors.
Streamline authentication. Certificates allow users to be authenticated without having to
remember several username and password combinations. Users often spend considerable
time guessing and resetting passwords when they have many to remember. Certificate-
based authentication decreases friction for the end user while increasing employee
productivity.
Ease of deployment. Unlike other authentication methods like one-time passcode (OTP)
tokens or biometrics, certificates are stored on the device locally and are implemented
without needing any extra hardware. Certificate-based authentication also makes access
control very simple.
For example
logging in to your Google account once will allow you to access Google applications such as
Google Docs, Gmail, and Google Drive.
Without SSO solution, the website maintains a database of login credentials – username and
passwords. Each time the user login to the website, it checks the user’s credentials against
its database and authenticates the user.
How does SSO work ?
User enters login credentials on the website and the website checks to see if the
user has already been authenticated by SSO solution. If so, the SSO solution would
give the user access to the website. Otherwise, it presents the user with the SSO
solution for login.
The user enters username and password on the SSO solution.
The user’s login credentials are sent to SSO solution.
The SSO solution seeks authentication from the identity provider, such as an Active
Directory, to verify the user’s identity. Once the user’s identity is verified, the
identity provider sends a verification to the SSO solution.
The authentication information is passed from the SSO solution to the website
where the user will be granted access to the website.
Unit-4
Upon successful login with SSO, the website passes authentication data in the form
of tokens as a form of verification that the user is authenticated as the user
navigates to a different application or web page.
Advantages of SSO :
These are advantages for users, for businesses.
For Users –
Risk of access to 3rd party sites are mitigated as the website database do not store
the user’s login credentials.
Increased convenience for users as they only need to remember and key in login
information once.
Increased security assurance for users as website owners do not store login
credentials.
For Businesses –
Increase customer base and satisfaction as SSO provides lower barrier to entry and
seamless user experience.
Reduce IT costs for managing customer’s username and passwords.
Unit-4
1. Number of Rounds
2. Design of Function F
3. Key Schedule Algorithm
1. Number of Rounds
The number of rounds judges the strength of the block cipher algorithm. It
is considered that more is the number of rounds, difficult is for cryptanalysis
to break the algorithm.
2. Design of Function F
The function F of the block cipher must be designed such that it must be
impossible for any cryptanalysis to unscramble the substitution. The
criterion that strengthens the function F is it non-linearity.
More the function F is nonlinear, more it would be difficult to crack it. Well,
while designing the function F it should be confirmed that it has a good
avalanche property which states that a change in one-bit of input must
reflect the change in many bits of output.
It is suggested that the key schedule should confirm the strict avalanche
effect and bit independence criterion.
Unit-4
Diagram
Unit-4
architecture ip security
IPSec (IP Security) architecture uses two protocols to secure the traffic or data
flow. These protocols are ESP (Encapsulation Security Payload) and AH
(Authentication Header). IPSec Architecture includes protocols, algorithms,
DOI, and Key Management. All these components are very important in order
to provide the three main services:
Confidentiality
Authentication
Integrity
IP Security Architecture:
Packet Format:
Types of honeypots
Based on design and deployment, there are two main types of honeypots:
production and research.
Benefits
Euler theorem
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 −
aϕ(n)≡1(modn)aϕ(n)≡1(modn)
where ϕϕ(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ϕϕ(n)}, i.e., each element xi of R is unique positive integer less than n
with ged(xi, n) = 1. Then multiply each element by a and modulo n −
S = {(ax1mod n), (ax2mod n), … (axϕϕ(n)mod n)}
Because a is relatively prime to n and x i is relatively prime to n, axi must also be
relatively prime to n. Therefore, all the members of S are integers that are less than
n and that are relatively prime to n.
There are no duplicates in S.
If axi mod n and n = axj mod n then xi = xj
Therefore,
Πϕ(n)i=1(aximodn)=Πϕ(n)i=1xiΠi=1ϕ(n)(aximodn)=Πi=1ϕ(n)xi
Πϕ(n)i=1axi≡Πϕ(n)i=1xi(modn)Πi=1ϕ(n)axi≡Πi=1ϕ(n)xi(modn)
aϕ(n)x[Πϕ(n)i=1xi]=Πϕ(n)i=1xi(modn)aϕ(n)x[Πi=1ϕ(n)xi]=Πi=1ϕ(n)xi(modn)
aϕ(n)≡1(modn)aϕ(n)≡1(modn)
Euler Totient Function
Euler’s Totient function is the mathematical multiplicative functions which count the
positive integers up to the given integer generally known as as ‘n’ that are a prime
number to ‘n’ and the function can be used to understand the number of prime
numbers that exist up to the given integer ‘n’.
Euler’s Totient function is also called as Euler’s phi function. It plays an essential
role in cryptography. It can discover the number of integers that are both smaller
than n and relatively prime to n. These set of numbers defined by Z∗nZn∗ (number
that are smaller than n and relatively prime to n).
Euler’s totient function is beneficial in several ways. It can be used in the RSA
encryption system, which can be used for security goals. The function deals with the
prime number theory, and it is beneficial in the computation of large calculations
also. The function can be utilized in algebraic computation and simple numbers.
The symbol used to indicate the function is ϕ, and it is also known as phi function.
The function includes more theoretical use instead of practical use. The sensible
requirement of the function is limited.
Unit-4
The function can be better understood through the several practical examples
instead of only theoretical explanations. There are several rules for computing the
Euler’s totient function, and for different numbers, different rules are to be used.
The Euler totient function ϕϕ(n) calculates the number of elements in Z∗nZn∗ with
the help of the following rules −
ϕϕ(1) = 0.
ϕϕ(P) = P − 1 if P is a Prime.
ϕϕ(m x n) = ϕϕ(m) x ϕϕ(n) if m and n are relatively prime.
ϕϕ(Pe) = Pe − Pe−1 (if P is a prime. )
The following four rules can be combined to obtain the value of ϕϕ(n), factorize n as
n=Pe11xPe22x⋅⋅⋅Pekkn=P1e1xP2e2x⋅⋅⋅Pkek
ϕ(n)=(Pe11−Pe1−11)(Pe22−Pe2−12)x⋅⋅⋅x(Pekk−Pek−1k)