information security(Public key encryption its characteristics and weakness, Diffie-Hellman Algorithm with example )
Download as pptx, pdf0 likes76 views
This document provides information on public key encryption. It discusses how public key encryption uses a public key for encryption and a private key for decryption. It also describes how the Diffie-Hellman key exchange algorithm works, including how two parties can generate a shared secret key over an open channel by exchanging public values and performing calculations. An example of the Diffie-Hellman algorithm is also provided. The document concludes by listing some applications of public key encryption like confidentiality and digital signatures, and also discusses some weaknesses like vulnerability to brute force attacks.
1 of 13
Download to read offline
Ad
Recommended
Encryption and Key Distribution Methods
Encryption and Key Distribution MethodsGulcin Yildirim Jelinek The document discusses encryption, which is the process of encoding information to ensure confidentiality and security during communication. It details types of encryption, such as symmetric and public key encryption, and the significance of encryption algorithms like block and stream ciphers. Additionally, it addresses key distribution methods and emphasizes the use of trusted centers or public key infrastructure for securely sharing cryptographic keys.
Pooguzhali
PooguzhaliNIVEDHINIMANIVANNAN This document discusses public key cryptography and the RSA algorithm. It provides explanations of public key encryption including its key components like plaintext, encryption algorithm, public and private keys, and decryption algorithm. It then describes the conventional encryption method versus public key encryption. Finally, it explains the RSA algorithm in detail, including how it generates key pairs, how encryption and decryption works using the keys, and some of the mathematical concepts that make RSA secure like the difficulty of factoring large numbers.
Key distribution code.ppt
Key distribution code.pptPrabhat Kumar This document discusses network security and cryptography. It defines four requirements for secure transactions: confidentiality, integrity, authentication, and non-repudiation. It also defines cryptography as the science of encrypting messages to make them secure and immune to attacks. The two main categories of cryptography are symmetric-key and asymmetric-key cryptography. Symmetric-key cryptography uses the same key to encrypt and decrypt, while asymmetric-key cryptography uses public and private key pairs. Digital signatures, public key infrastructure, certificates, and cryptanalysis are also discussed.
cryptography
cryptographyJai Nathwani Cryptography is the art of transforming plain messages into secure messages to protect them from attacks, with key applications in areas like ATM transactions and e-commerce. It includes essential concepts such as confidentiality, authentication, integrity, and non-repudiation, as well as the distinction between symmetric and asymmetric key cryptography. The document outlines the mechanisms of encryption and decryption involving plaintext, ciphertext, and keys, emphasizing the practical relevance of cryptography in everyday life.
Public key Cryptography & RSA
Public key Cryptography & RSAAmit Debnath Public-key cryptography uses two keys, a public key that can encrypt messages and a private key that decrypts them, allowing secure communication without secretly exchanging keys. It was a major advance in cryptography and enables applications like encryption for security and digital signatures for authentication. The RSA algorithm is an example of public-key cryptography that revolutionized encryption by using this two-key system.
Unit 1
Unit 1Trupti Kodinariya The document provides information on classical encryption techniques, specifically covering symmetric cipher models, cryptography, cryptanalysis, and attacks. It discusses substitution and transposition techniques, including the Caesar cipher, monoalphabetic cipher, and Playfair cipher. For each technique, it explains the encryption and decryption process, cryptanalysis methods, and provides examples to illustrate how the techniques work.
CNS - Unit - 4 - Public Key Cryptosystem
CNS - Unit - 4 - Public Key Cryptosystem Gyanmanjari Institute Of Technology The document discusses public key cryptosystems, which utilize asymmetric encryption to enhance security through the use of two keys: a public key for encryption and a private key for decryption. It covers key algorithms such as RSA and the Diffie-Hellman key exchange method, their computational aspects, and associated vulnerabilities like man-in-the-middle attacks. Additionally, it outlines the foundational principles of public key infrastructures, the essential components of public-key encryption schemes, and their various applications.
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network SecurityKathirvel Ayyaswamy The document covers public-key cryptography, detailing its principles, including algorithms like RSA, Diffie-Hellman key exchange, and ElGamal cryptosystem. Public-key cryptography uses two keys for encryption and decryption, addressing issues of key distribution and digital signatures. It also discusses the security mechanisms and challenges associated with these cryptosystems, such as brute force attacks and timing attacks.
key distribution in network security
key distribution in network securitybabak danyal Symmetric encryption uses the same key to encrypt and decrypt data, providing confidentiality. Keys must be distributed securely between parties. Common approaches involve using a key distribution center (KDC) that shares secret keys with parties and can provide temporary session keys. Link encryption protects data as it travels over each network link, while end-to-end encryption protects data for its entire journey but leaves some header data unencrypted. Key distribution, storage, renewal and replacement are important aspects of maintaining security when using symmetric encryption.
Key Distribution Problem in advanced operating system
Key Distribution Problem in advanced operating systemMerlin Florrence The document discusses the key distribution problem in cryptography. When two entities want to securely communicate, they must obtain matching encryption and decryption keys. There are different approaches to key distribution, including a centralized approach where a single Key Distribution Center (KDC) maintains secret keys for each user, and a fully distributed approach without a central authority. The centralized approach is simple to implement but relies on a single point of failure.
Cryptography by gaurav singh
Cryptography by gaurav singhGaurav Singh Cryptography involves encrypting information to keep it secret or authenticate its source. There are three main types: public key cryptography uses two keys, symmetric key cryptography uses a single secret key, and hash functions create unique fingerprints of data without keys. Cryptography is used to securely transmit data, authenticate users, digitally sign messages, and verify data integrity.
Cryptography
CryptographySandip kumar This document discusses cryptography and some of its key concepts. It defines cryptography as the science of secret writing and describes how it can be used to securely transmit messages and protect information. It then summarizes some common issues in cryptography like confidentiality, authentication, and integrity. It also defines important cryptography terms like plaintext, ciphertext, ciphers, keys, symmetric and asymmetric algorithms. Specific algorithms like DES, AES, RSA are also outlined at a high level.
Cryptography
CryptographyNishant Pahad This document provides an overview of cryptography concepts including:
- Cryptography is the study of encrypted information and involves encryption to convert plaintext to ciphertext and decryption to convert ciphertext back to plaintext.
- Ciphers use algorithms and keys to encrypt and decrypt messages, with symmetric encryption using the same key and asymmetric encryption using different keys.
- Common encryption methods include substitution ciphers that swap letters and transposition ciphers that rearrange letters.
- Cryptanalysis involves decrypting messages without the key by analyzing patterns and weaknesses in encryption algorithms.
Cryptography
Cryptography أحلام انصارى Cryptography is the practice of hiding information and involves techniques like secret key cryptography, public key cryptography, and hash functions. New trends in cryptography include elliptic curve cryptography, which uses points on elliptic curves to securely exchange keys, quantum cryptography which uses quantum effects for secure communication, and pairing based cryptography which pairs elements of groups to construct hybrid cryptosystems. The document discusses different encryption techniques, their drawbacks, and the need for new techniques that are more secure against attacks.
Network security
Network securityABHISHEK KUMAR Network security involves securing computer networks and systems. It is handled by network administrators who implement security policies, software, and hardware to protect networks from unauthorized access, misuse, or denial of resources. Network security aims to authenticate users, control access to resources, and ensure confidentiality, integrity, non-repudiation and availability of networks and resources. Common methods include authentication, access control, encryption, digital signatures, and monitoring systems for security audits.
Cryptographic tools
Cryptographic toolsCAS The document provides an overview of cryptographic tools in computer security, focusing on symmetric and asymmetric encryption methods, message authentication, hash functions, and digital signatures. It discusses the algorithms, principles, and applications of these techniques, highlighting their roles in ensuring confidentiality, integrity, and authenticity of data. Additionally, it addresses the importance of random number generation and the encryption of stored data.
2. public key cryptography and RSA
2. public key cryptography and RSADr.Florence Dayana Public Key Cryptography (PKC) is an encryption method utilizing a pair of public and private keys for secure communications. The document explains the principles, requirements, and applications of PKC, including the RSA algorithm, which is widely used for encrypting messages and protecting confidentiality. Additionally, it covers various types of attacks on RSA and the use of Optimal Asymmetric Encryption Padding (OAEP) for enhanced security.
20 security
20 securityabiy2004 This document provides an overview of DNS security (DNSSec). It discusses some past attacks on the root DNS servers and issues of trust with top-level domain operators. DNSSec aims to address these security issues by digitally signing DNS records to authenticate the origin and integrity of DNS data.
Symmetric and asymmetric key
Symmetric and asymmetric keyTriad Square InfoSec Symmetric encryption uses a shared secret key between the sender and receiver to encrypt and decrypt messages. It is faster than asymmetric encryption but requires secure key exchange. Asymmetric encryption uses separate public and private keys, where the public key is used to encrypt and the private key decrypts, allowing secure communication without pre-shared keys. Common symmetric algorithms are AES and DES, while asymmetric algorithms include RSA, Diffie-Hellman, and ECDSA.
Encryption ppt
Encryption pptAnil Neupane Encryption is the process of encoding messages or information so that only authorized parties can read it. There are two main types of encryption: symmetric key encryption which uses the same key to encrypt and decrypt, and asymmetric key encryption which uses a public key to encrypt and a private key to decrypt. While symmetric encryption is faster, asymmetric encryption is more secure since it does not require sharing the same key. Encryption is widely used to provide authentication, privacy, integrity, and accountability of data.
CGI White Paper - Key Incryption Mechanism
CGI White Paper - Key Incryption MechanismAmit Singh This white paper discusses public key encryption and digital signatures. It begins by defining public key cryptography and explaining how it works using asymmetric key pairs for encryption/decryption and digital signatures. It then discusses how certificates are used to validate identities and keys. Certificates contain a user's public key and identity information, signed by a certificate authority, allowing identities to be verified. The paper also explains how digital signatures, encryption, and certificates are implemented in practice when sending signed and encrypted messages.
Asymmetric key
Asymmetric key khushbu chauhan Asymmetric key cryptography uses two keys: a public key and a private key. The public key can encrypt messages but only the private key can decrypt them. This allows for convenience, message authentication, detection of tampering, and non-repudiation. However, public keys need authentication, it is slower than symmetric key cryptography, uses more computer resources, a security compromise could affect many users, and loss of the private key would be irreparable.
Mathematics Towards Elliptic Curve Cryptography-by Dr. R.Srinivasan
Mathematics Towards Elliptic Curve Cryptography-by Dr. R.Srinivasanmunicsaa The document provides an overview of elliptic curve cryptography including:
1. It discusses the evolution of cryptography from ancient times to modern algorithms like RSA, AES, and Diffie-Hellman key exchange.
2. It introduces elliptic curve cryptography as an alternative that provides the same level of security with smaller key sizes due to the difficulty of solving the elliptic curve discrete logarithm problem.
3. It provides examples of elliptic curve groups over prime fields and binary fields, showing how points on the curve satisfy the elliptic curve equation over a finite field.
CNS - Unit - 1 - Introduction
CNS - Unit - 1 - IntroductionGyanmanjari Institute Of Technology The document provides an extensive overview of cryptography and network security, detailing concepts such as security services, mechanisms, and attacks. It covers the importance of data protection, authentication, access control, confidentiality, integrity, and non-repudiation. Additionally, it explores various techniques for encryption, cryptanalysis, and elaborates on passive and active security attacks.
Cryptography
CryptographyJens Patel This document provides an overview of cryptography. It defines cryptography as the science of secret writing and discusses its use in applications like ATM cards and passwords. It describes the basic components of cryptography including plaintext, ciphertext, ciphers, keys, and algorithms. It differentiates between symmetric and asymmetric key cryptography. It provides examples of traditional and modern ciphers, including DES, AES, and RSA algorithms. In conclusion, it states that cryptography techniques help maintain data security, privacy, and integrity.
RSA Algoritmn
RSA AlgoritmnDr. Kapil Gupta This document provides an overview of symmetric encryption, asymmetric encryption, and the RSA algorithm. It discusses how symmetric encryption uses a shared key for encryption and decryption, while asymmetric encryption uses public and private key pairs. It then explains that RSA is an asymmetric encryption algorithm that is widely used today. Specifically, RSA is based on the difficulty of factoring large prime numbers, where a public key is used to encrypt messages and a private key is used to decrypt them.
Final ss2-digital-signature-group5
Final ss2-digital-signature-group5Phan Minh This document discusses digital signatures and the RSA and ECC algorithms. It defines a digital signature as equivalent to a personal signature on a written document, using cryptography to uniquely bind an identity to a message. RSA is described as using a public/private key pair for encryption/decryption. ECC uses elliptic curves for smaller key sizes and faster computation compared to RSA. The document outlines the ECDSA algorithm for digital signatures using ECC, including key generation, signing, and verification. It also discusses applications of ECDSA in Bitcoin. Demo implementations of RSA and ECC are presented.
Cryptography - Simplified - Asymmetric Encryption
Cryptography - Simplified - Asymmetric EncryptionAbdul Manaf Vellakodath The document provides an overview of asymmetric encryption, highlighting key algorithms such as RSA, Diffie-Hellman, and elliptic curve cryptography. It explains how RSA employs a pair of keys (private and public) for secure communication, ensuring integrity, confidentiality, and non-repudiation. The document also outlines the basic premise of RSA encryption and decryption processes, along with a reference link for further understanding of RSA key generation.
Introduction to Cryptography CYB 303.pptx
Introduction to Cryptography CYB 303.pptxAbolarinwa The document provides an overview of cryptography, detailing its fundamental components such as ciphers, key exchange mechanisms, and the concepts of symmetric and public key cryptography. It discusses methods for symmetric key distribution, key agreement through algorithms like Diffie-Hellman, and introduces public key cryptography utilizing RSA and elliptic curve cryptography for secure communications. Additionally, it addresses digital signatures, hashing, non-repudiation, and the role of digital certificates in ensuring the authenticity of public keys.
Unit 3(1)
Unit 3(1)Vinod Kumar Gorrepati The document discusses principles of public-key cryptography and algorithms like RSA and Diffie-Hellman key exchange. It provides the following key points:
1. Public-key cryptography solves the key distribution problem of symmetric encryption by using different but mathematically-related public and private keys.
2. The RSA algorithm was one of the first practical public-key cryptosystems, using modular exponentiation with large prime numbers.
3. Diffie-Hellman key exchange allows two parties to jointly establish a shared secret over an insecure channel without any prior secrets. It is based on the difficulty of calculating discrete logarithms.
More Related Content
What's hot (20)
key distribution in network security
key distribution in network securitybabak danyal Symmetric encryption uses the same key to encrypt and decrypt data, providing confidentiality. Keys must be distributed securely between parties. Common approaches involve using a key distribution center (KDC) that shares secret keys with parties and can provide temporary session keys. Link encryption protects data as it travels over each network link, while end-to-end encryption protects data for its entire journey but leaves some header data unencrypted. Key distribution, storage, renewal and replacement are important aspects of maintaining security when using symmetric encryption.
Key Distribution Problem in advanced operating system
Key Distribution Problem in advanced operating systemMerlin Florrence The document discusses the key distribution problem in cryptography. When two entities want to securely communicate, they must obtain matching encryption and decryption keys. There are different approaches to key distribution, including a centralized approach where a single Key Distribution Center (KDC) maintains secret keys for each user, and a fully distributed approach without a central authority. The centralized approach is simple to implement but relies on a single point of failure.
Cryptography by gaurav singh
Cryptography by gaurav singhGaurav Singh Cryptography involves encrypting information to keep it secret or authenticate its source. There are three main types: public key cryptography uses two keys, symmetric key cryptography uses a single secret key, and hash functions create unique fingerprints of data without keys. Cryptography is used to securely transmit data, authenticate users, digitally sign messages, and verify data integrity.
Cryptography
CryptographySandip kumar This document discusses cryptography and some of its key concepts. It defines cryptography as the science of secret writing and describes how it can be used to securely transmit messages and protect information. It then summarizes some common issues in cryptography like confidentiality, authentication, and integrity. It also defines important cryptography terms like plaintext, ciphertext, ciphers, keys, symmetric and asymmetric algorithms. Specific algorithms like DES, AES, RSA are also outlined at a high level.
Cryptography
CryptographyNishant Pahad This document provides an overview of cryptography concepts including:
- Cryptography is the study of encrypted information and involves encryption to convert plaintext to ciphertext and decryption to convert ciphertext back to plaintext.
- Ciphers use algorithms and keys to encrypt and decrypt messages, with symmetric encryption using the same key and asymmetric encryption using different keys.
- Common encryption methods include substitution ciphers that swap letters and transposition ciphers that rearrange letters.
- Cryptanalysis involves decrypting messages without the key by analyzing patterns and weaknesses in encryption algorithms.
Cryptography
Cryptography أحلام انصارى Cryptography is the practice of hiding information and involves techniques like secret key cryptography, public key cryptography, and hash functions. New trends in cryptography include elliptic curve cryptography, which uses points on elliptic curves to securely exchange keys, quantum cryptography which uses quantum effects for secure communication, and pairing based cryptography which pairs elements of groups to construct hybrid cryptosystems. The document discusses different encryption techniques, their drawbacks, and the need for new techniques that are more secure against attacks.
Network security
Network securityABHISHEK KUMAR Network security involves securing computer networks and systems. It is handled by network administrators who implement security policies, software, and hardware to protect networks from unauthorized access, misuse, or denial of resources. Network security aims to authenticate users, control access to resources, and ensure confidentiality, integrity, non-repudiation and availability of networks and resources. Common methods include authentication, access control, encryption, digital signatures, and monitoring systems for security audits.
Cryptographic tools
Cryptographic toolsCAS The document provides an overview of cryptographic tools in computer security, focusing on symmetric and asymmetric encryption methods, message authentication, hash functions, and digital signatures. It discusses the algorithms, principles, and applications of these techniques, highlighting their roles in ensuring confidentiality, integrity, and authenticity of data. Additionally, it addresses the importance of random number generation and the encryption of stored data.
2. public key cryptography and RSA
2. public key cryptography and RSADr.Florence Dayana Public Key Cryptography (PKC) is an encryption method utilizing a pair of public and private keys for secure communications. The document explains the principles, requirements, and applications of PKC, including the RSA algorithm, which is widely used for encrypting messages and protecting confidentiality. Additionally, it covers various types of attacks on RSA and the use of Optimal Asymmetric Encryption Padding (OAEP) for enhanced security.
20 security
20 securityabiy2004 This document provides an overview of DNS security (DNSSec). It discusses some past attacks on the root DNS servers and issues of trust with top-level domain operators. DNSSec aims to address these security issues by digitally signing DNS records to authenticate the origin and integrity of DNS data.
Symmetric and asymmetric key
Symmetric and asymmetric keyTriad Square InfoSec Symmetric encryption uses a shared secret key between the sender and receiver to encrypt and decrypt messages. It is faster than asymmetric encryption but requires secure key exchange. Asymmetric encryption uses separate public and private keys, where the public key is used to encrypt and the private key decrypts, allowing secure communication without pre-shared keys. Common symmetric algorithms are AES and DES, while asymmetric algorithms include RSA, Diffie-Hellman, and ECDSA.
Encryption ppt
Encryption pptAnil Neupane Encryption is the process of encoding messages or information so that only authorized parties can read it. There are two main types of encryption: symmetric key encryption which uses the same key to encrypt and decrypt, and asymmetric key encryption which uses a public key to encrypt and a private key to decrypt. While symmetric encryption is faster, asymmetric encryption is more secure since it does not require sharing the same key. Encryption is widely used to provide authentication, privacy, integrity, and accountability of data.
CGI White Paper - Key Incryption Mechanism
CGI White Paper - Key Incryption MechanismAmit Singh This white paper discusses public key encryption and digital signatures. It begins by defining public key cryptography and explaining how it works using asymmetric key pairs for encryption/decryption and digital signatures. It then discusses how certificates are used to validate identities and keys. Certificates contain a user's public key and identity information, signed by a certificate authority, allowing identities to be verified. The paper also explains how digital signatures, encryption, and certificates are implemented in practice when sending signed and encrypted messages.
Asymmetric key
Asymmetric key khushbu chauhan Asymmetric key cryptography uses two keys: a public key and a private key. The public key can encrypt messages but only the private key can decrypt them. This allows for convenience, message authentication, detection of tampering, and non-repudiation. However, public keys need authentication, it is slower than symmetric key cryptography, uses more computer resources, a security compromise could affect many users, and loss of the private key would be irreparable.
Mathematics Towards Elliptic Curve Cryptography-by Dr. R.Srinivasan
Mathematics Towards Elliptic Curve Cryptography-by Dr. R.Srinivasanmunicsaa The document provides an overview of elliptic curve cryptography including:
1. It discusses the evolution of cryptography from ancient times to modern algorithms like RSA, AES, and Diffie-Hellman key exchange.
2. It introduces elliptic curve cryptography as an alternative that provides the same level of security with smaller key sizes due to the difficulty of solving the elliptic curve discrete logarithm problem.
3. It provides examples of elliptic curve groups over prime fields and binary fields, showing how points on the curve satisfy the elliptic curve equation over a finite field.
CNS - Unit - 1 - Introduction
CNS - Unit - 1 - IntroductionGyanmanjari Institute Of Technology The document provides an extensive overview of cryptography and network security, detailing concepts such as security services, mechanisms, and attacks. It covers the importance of data protection, authentication, access control, confidentiality, integrity, and non-repudiation. Additionally, it explores various techniques for encryption, cryptanalysis, and elaborates on passive and active security attacks.
Cryptography
CryptographyJens Patel This document provides an overview of cryptography. It defines cryptography as the science of secret writing and discusses its use in applications like ATM cards and passwords. It describes the basic components of cryptography including plaintext, ciphertext, ciphers, keys, and algorithms. It differentiates between symmetric and asymmetric key cryptography. It provides examples of traditional and modern ciphers, including DES, AES, and RSA algorithms. In conclusion, it states that cryptography techniques help maintain data security, privacy, and integrity.
RSA Algoritmn
RSA AlgoritmnDr. Kapil Gupta This document provides an overview of symmetric encryption, asymmetric encryption, and the RSA algorithm. It discusses how symmetric encryption uses a shared key for encryption and decryption, while asymmetric encryption uses public and private key pairs. It then explains that RSA is an asymmetric encryption algorithm that is widely used today. Specifically, RSA is based on the difficulty of factoring large prime numbers, where a public key is used to encrypt messages and a private key is used to decrypt them.
Final ss2-digital-signature-group5
Final ss2-digital-signature-group5Phan Minh This document discusses digital signatures and the RSA and ECC algorithms. It defines a digital signature as equivalent to a personal signature on a written document, using cryptography to uniquely bind an identity to a message. RSA is described as using a public/private key pair for encryption/decryption. ECC uses elliptic curves for smaller key sizes and faster computation compared to RSA. The document outlines the ECDSA algorithm for digital signatures using ECC, including key generation, signing, and verification. It also discusses applications of ECDSA in Bitcoin. Demo implementations of RSA and ECC are presented.
Cryptography - Simplified - Asymmetric Encryption
Cryptography - Simplified - Asymmetric EncryptionAbdul Manaf Vellakodath The document provides an overview of asymmetric encryption, highlighting key algorithms such as RSA, Diffie-Hellman, and elliptic curve cryptography. It explains how RSA employs a pair of keys (private and public) for secure communication, ensuring integrity, confidentiality, and non-repudiation. The document also outlines the basic premise of RSA encryption and decryption processes, along with a reference link for further understanding of RSA key generation.
Similar to information security(Public key encryption its characteristics and weakness, Diffie-Hellman Algorithm with example ) (20)
Introduction to Cryptography CYB 303.pptx
Introduction to Cryptography CYB 303.pptxAbolarinwa The document provides an overview of cryptography, detailing its fundamental components such as ciphers, key exchange mechanisms, and the concepts of symmetric and public key cryptography. It discusses methods for symmetric key distribution, key agreement through algorithms like Diffie-Hellman, and introduces public key cryptography utilizing RSA and elliptic curve cryptography for secure communications. Additionally, it addresses digital signatures, hashing, non-repudiation, and the role of digital certificates in ensuring the authenticity of public keys.
Unit 3(1)
Unit 3(1)Vinod Kumar Gorrepati The document discusses principles of public-key cryptography and algorithms like RSA and Diffie-Hellman key exchange. It provides the following key points:
1. Public-key cryptography solves the key distribution problem of symmetric encryption by using different but mathematically-related public and private keys.
2. The RSA algorithm was one of the first practical public-key cryptosystems, using modular exponentiation with large prime numbers.
3. Diffie-Hellman key exchange allows two parties to jointly establish a shared secret over an insecure channel without any prior secrets. It is based on the difficulty of calculating discrete logarithms.
CNS 3RD UNIT PPT.pptx
CNS 3RD UNIT PPT.pptxpjeraids 1. Public key cryptography uses asymmetric key encryption where each user has a public key for encryption and a private key for decryption.
2. The RSA algorithm is an example of public key encryption that uses modular exponentiation with large prime numbers to encrypt plaintext and decrypt ciphertext.
3. Diffie-Hellman key exchange allows two users to securely exchange a secret key over an insecure channel without any prior secrets.
Unit 3(1)
Unit 3(1)Vinod Kumar Gorrepati The document discusses principles of public-key cryptography and the Diffie-Hellman key exchange algorithm. It begins by explaining the problems with symmetric encryption that public-key cryptography aims to address. It then provides an overview of public-key cryptosystems and their requirements. The document goes on to describe the RSA algorithm in detail and provide an example of how it works. It also explains the Diffie-Hellman key exchange algorithm, how it allows two parties to securely exchange a key without transmitting it, and provides a numerical example.
international security system data threats
international security system data threatsgacop74666 1. Principle of Least Privilege (POLP) This principle states that every user and program on the system should be granted only the specific rights and permissions needed to perform their tasks, with no more.
PRINCIPLES OF INFORMATION SYSTEM SECURITY
PRINCIPLES OF INFORMATION SYSTEM SECURITYgacop74666 Introduction: Information security is more and more important every day in the workplace. If we want to improve our information security, we need a solid understanding of the principles that will help us do that. This guide explores those principles and will guide you to building a more secure environment.
Information Security Principles: There are three basic principles of information security, and all other practices are based on these three:
* Confidentiality: Confidentiality is the basic tenet of information security. Confidentiality means that you don't share private or confidential information with anyone who shouldn't know it. As the name implies, you don't give out confidential information.
* Availability: Availability means that you can access the information you need when you need it. You may not need access to everything all the time, but when you do, you want access quickly. You may need access to your bank account when you pay a bill. This is availability.
* Integrity: If you make a change to something, it should be tracked and logged in a journal or log. That way, you can verify that no unauthorized changes were made to the original information, so we know that the information is genuine. In short, integrity means you can verify that the information hasn't been altered in any way.
There are four key concepts that underpin the practice of information security. These concepts, when integrated and applied appropriately, enable security managers and practitioners to defend against and recover from attacks. The four key concepts are:
* Confidentiality: Confidentiality refers to protecting information from unauthorized access, use, or disclosure. This includes both internal and external threats. Data encryption or access control lists are examples of confidentiality controls.
* Integrity: Integrity refers to protecting the accuracy, completeness, and validity of information. This includes protecting data from being modified without authorization. Data hashing algorithms or message authentication codes are examples of integrity controls.
* Availability: Availability refers to ensuring that information and systems are accessible to authorized users when they need them. This includes measures to prevent service outages or data loss due to natural disasters or accidental or intentional malicious activity. Redundant systems, data backups, and disaster recovery plans are examples of availability controls.
* Accountability: Accountability involves tracing user actions to the identity of the user. If the user's identity is associated with a group, then the actions of the user are also associated with the group. Accountability mechanisms typically involve the use of logs, audit trails, and other monitoring techniques. Accountability controls are also used to identify and fix system weaknesses that could lead to unauthorized access or changes to data and systems.
By following these basic principles, we can help protect our information fro
Unit-III_3R-CRYPTO_2021-22_VSM.pptx
Unit-III_3R-CRYPTO_2021-22_VSM.pptxVishwanathMahalle This document discusses public-key cryptography and digital signatures. It begins with an introduction to symmetric and asymmetric key cryptography, including the basic concepts and differences between the two approaches. It then provides more details on public-key cryptography principles, including how public/private key pairs are generated and used. The document explains the RSA algorithm for public-key encryption and decryption in detail with examples. It also covers digital signature models and how they provide message authentication, integrity, and non-repudiation using public-key techniques. Diffie-Hellman key exchange is introduced as a method for securely transmitting a symmetric secret key between two parties.
Rsa and diffie hellman algorithms
Rsa and diffie hellman algorithmsdaxesh chauhan The document provides an overview of RSA and Diffie-Hellman algorithms. It defines key terms in cryptography like plain text, cipher text, and key. It then describes how RSA works by choosing prime numbers, computing keys, and encrypting/decrypting messages. Diffie-Hellman allows two parties to establish a shared secret key over an insecure channel by agreeing on a modulus and base, and exchanging values while keeping their secret integers private.
Unit 2_Public Key Cryptograohy_RSA_Example.pdf
Unit 2_Public Key Cryptograohy_RSA_Example.pdfKanchanPatil34 Public key Cryptography, Components of Public key Cryptography, Public Key Cryptosystem, RSA algorithm, Example
Rsa diffi-network security-itt
Rsa diffi-network security-ittrameshvvv Public-key cryptography uses two keys, a public key that can be shared widely, and a private key that is kept secret. It allows for both encryption and digital signatures. The most widely used public-key cryptosystem is RSA, which relies on the difficulty of factoring large prime numbers. Diffie-Hellman key exchange allows two parties to securely exchange a secret key over an insecure channel without any prior secrets.
UNIT-IV.pptx
UNIT-IV.pptxSunnyAnchews - Public key cryptography uses asymmetric encryption involving two keys - a public key to encrypt and a private key to decrypt. This allows secure communication without pre-sharing keys.
- RSA was the first practical public key cryptosystem, based on the difficulty of factoring large prime numbers. It allows encryption with a public key and decryption with a private key.
- Diffie-Hellman key exchange allows two parties to jointly establish a shared secret key over an insecure channel without any prior secrets. This key can then be used to encrypt subsequent communications.
Ch9
Ch9Mahender Kumar This document discusses public key cryptography and the RSA algorithm. It begins by outlining some misconceptions about public key encryption. It then provides an overview of the key concepts behind public key cryptosystems, including the use of public and private key pairs to enable encryption, digital signatures, and key exchange. The document goes on to provide detailed explanations of the RSA algorithm, including how it uses large prime numbers and modular arithmetic to encrypt and decrypt messages securely. It discusses the security of the RSA algorithm and analyzes approaches for attacking it, such as brute force key searching and mathematical attacks based on factoring the private key.
Public key algorithm
Public key algorithmPrateek Pandey Public key algorithms like RSA and ElGamal allow for secure encryption without a shared private key. RSA uses a public and private key pair generated from large prime numbers such that a message encrypted with the public key can only be decrypted by the corresponding private key. It is widely used due to its security being based on the difficulty of factoring large numbers, though it is less efficient than symmetric algorithms due to involving modular exponentiation. ElGamal also uses a public/private key approach and its security relies on the discrete logarithm problem.
Public key cryptography and RSA
Public key cryptography and RSAShafaan Khaliq Bhatti 1. The document discusses public-key cryptography and some of its key concepts like asymmetric encryption where each user has a public and private key.
2. It also covers applications like encryption, digital signatures, and key exchange. It notes that while public-key crypto has advantages, symmetric crypto is still important due to public-key crypto's lower speed.
3. The RSA algorithm is presented as one of the first implementations of public-key cryptography based on the difficulty of factoring large integers.
Module 2 of cryptography old scheme VTU ppt
Module 2 of cryptography old scheme VTU pptMonaReddy12 This document discusses public-key cryptography, specifically the principles of public-key cryptosystems like RSA and the Diffie-Hellman key exchange method. It explains key concepts such as encryption and decryption algorithms, plain text, cipher text, and the roles of public and private keys. Additionally, it highlights the ElGamal cryptographic system, which is based on the Diffie-Hellman method and the difficulty of computing discrete logarithms.
Cyptography and network security unit 3-1
Cyptography and network security unit 3-1AsrithaKorupolu The document discusses the principles of public key cryptography including public and private keys, encryption, decryption, digital signatures, key exchange, security, trust, and revocation. It then provides details on the RSA algorithm including key generation, encryption, decryption, and security. It also discusses symmetric key distribution and key management principles like key generation, storage, distribution, rotation, expiration, revocation, and destruction. Finally, it discusses different techniques for distributing public keys such as public announcement, public directories, and using a public key authority.
Asymmetric Cryptography
Asymmetric CryptographyUTD Computer Security Group The document provides an overview of asymmetric cryptography, detailing its importance for confidentiality, integrity, authentication, and nonrepudiation. It focuses on RSA and Diffie-Hellman key exchange methods, their key generation processes, uses, and the vulnerabilities associated with public key cryptography. Additionally, it discusses historical milestones in cryptography, notable attacks, and future events related to pentesting and capture-the-flag competitions.
Survey on asymmetric key cryptography algorithms
Survey on asymmetric key cryptography algorithmsEditor Jacotech The document summarizes and compares several asymmetric key cryptography algorithms. It begins by introducing the concept of public key cryptography and describing some of its advantages. It then provides brief overviews of the following algorithms: RSA, Diffie-Hellman key exchange, Digital Signature Algorithm, Elliptic Curve Cryptography, Elliptic Curve Diffie-Hellman, ElGamal Encryption Algorithm, and the Knapsack Algorithm. For each algorithm, it outlines the key generation, encryption, and decryption processes. It concludes by comparing the advantages and disadvantages of the different approaches.
Ad
More from Zara Nawaz (11)
Translation Look Aside buffer
Translation Look Aside buffer Zara Nawaz A Translation Lookaside Buffer (TLB) is a memory cache that improves access speed by storing recent translations of virtual memory to physical addresses, which helps avoid multiple memory accesses. It operates by checking for virtual page numbers, resulting in either a TLB hit (found in cache) or a TLB miss (not found, requiring additional lookups). Handling TLB misses can involve either hardware or software methods to retrieve the necessary data and manage page faults effectively.
information security (network security methods)
information security (network security methods)Zara Nawaz This document provides an overview of information security concepts. It discusses basic security principles like how no system is completely secure but security measures can reduce risks. It then summarizes key aspects of network security such as protecting systems through configuration, detection of issues, and rapid response. Common network security methods are outlined like access control, anti-malware tools, and firewalls. Goals of security like confidentiality, integrity and availability are defined in relation to the CIA triad model. Threats to these goals are also summarized.
information security(Feistal Cipher)
information security(Feistal Cipher)Zara Nawaz The document discusses symmetric key cryptography, focusing on the Feistel cipher, which is a design model for block ciphers like the Data Encryption Standard (DES). It details the encryption and decryption processes involving multiple rounds of substitution and permutation, the role of round keys, and the importance of the round function. The DES algorithm specifically uses a 16-round Feistel structure with a 64-bit block size and an effective key length of 56 bits, while also addressing its strengths and weaknesses.
Information security (Symmetric encryption, cryptography, crypto-analysis)
Information security (Symmetric encryption, cryptography, crypto-analysis)Zara Nawaz 1. Symmetric encryption involves encrypting messages using a shared secret key between the sender and receiver. It uses algorithms to convert plain text into cipher text and back again.
2. Cryptography involves secret writing and cryptanalysis involves breaking secret codes. Cryptology is the overall study of both. There are different types of cryptography including symmetric, asymmetric, and hashing.
3. Classical cryptanalysis techniques include frequency analysis, brute force attacks, and mathematical analysis to break encryption algorithms. Modern techniques also target implementation and side channels.
information security(authentication application, Authentication and Access Co...
information security(authentication application, Authentication and Access Co...Zara Nawaz The document discusses the principles of authentication and access control in information security, focusing on Kerberos as a centralized authentication service that enhances reliability, security, transparency, and scalability. It highlights the differences between authorization and access control, detailing mechanisms like discretionary access control and access lists for managing user permissions and network traffic. Additionally, it outlines the key considerations for designing effective access control systems within web applications to protect sensitive data.
information security (Audit mechanism, intrusion detection, password manageme...
information security (Audit mechanism, intrusion detection, password manageme...Zara Nawaz The document outlines various security audit mechanisms, including black box, white box, and grey box audits, each tailored to different organizational needs. It also discusses intrusion detection systems (IDS), their classifications, detection methods, and compares them to firewalls, emphasizing the importance of password management and the principles of information security: confidentiality, integrity, and availability (CIA). Furthermore, it addresses IP security (IPsec) protocols for data authentication, integrity, and confidentiality across IP networks.
Information Security (Malicious Software)
Information Security (Malicious Software)Zara Nawaz The document discusses malicious software, commonly known as malware, which includes various types such as viruses, worms, trojans, spyware, adware, and rootkits that harm computer systems or networks. It outlines preventive measures to avoid malware, like keeping software updated, avoiding unknown emails, and using anti-virus software. Additionally, it lists anti-malware tools that can help remove malware from affected systems.
Information Security (Firewall)
Information Security (Firewall)Zara Nawaz Firewalls are network security devices that control incoming and outgoing network traffic based on a set of security rules. There are three main types of firewalls: packet filtering firewalls, which filter network traffic at the packet level; application-level firewalls, which filter traffic at the application layer; and circuit-level firewalls, which monitor traffic connections and sessions. Firewalls provide security benefits but also have limitations, such as not preventing unauthorized internal access or protecting against social engineering attacks.
Information security ist lecture
Information security ist lectureZara Nawaz The document outlines fundamental concepts of information security, focusing on the importance of protecting organizational data through various security measures. It details network security practices, including access control, anti-malware, application security, and intrusion detection, emphasizing the goals of confidentiality, integrity, and availability in the CIA triad. Furthermore, the document describes types of security attacks—active and passive—and the necessary mechanisms for prevention and detection to safeguard information systems.
Lecture01 algorithm analysis
Lecture01 algorithm analysisZara Nawaz The document discusses an algorithms analysis and design course. The major objectives are to design and analyze modern algorithms, compare their efficiencies, and solve real-world problems. Students will learn to prove algorithm correctness, analyze running times, and apply techniques like dynamic programming and graph algorithms. While algorithms can differ in efficiency, even on faster hardware, the computational model used makes reasonable assumptions for comparing algorithms asymptotically.
Information Security (Digital Signatures)
Information Security (Digital Signatures)Zara Nawaz Digital signatures rely on encryption and authentication to verify the identity of a sender and ensure a document has not been altered. They use a mathematical technique that validates authenticity, integrity, and allows verification of author, date, and time. Digital signatures offer more security than traditional signatures by solving problems of tampering and impersonation. They are important for authentication, non-repudiation, and ensuring integrity of communications. Key generation and signing algorithms are used to create digital signatures, while verification algorithms are used to validate signatures.
Ad
Recently uploaded (20)
THE PSYCHOANALYTIC OF THE BLACK CAT BY EDGAR ALLAN POE (1).pdf
THE PSYCHOANALYTIC OF THE BLACK CAT BY EDGAR ALLAN POE (1).pdfnabilahk908 Psychoanalytic Analysis of The Black Cat by Edgar Allan Poe explores the deep psychological dimensions of the narrator’s disturbed mind through the lens of Sigmund Freud’s psychoanalytic theory. According to Freud (1923), the human psyche is structured into three components: the Id, which contains primitive and unconscious desires; the Ego, which operates on the reality principle and mediates between the Id and the external world; and the Superego, which reflects internalized moral standards.
In this story, Poe presents a narrator who experiences a psychological breakdown triggered by repressed guilt, aggression, and internal conflict. This analysis focuses not only on the gothic horror elements of the narrative but also on the narrator’s mental instability and emotional repression, demonstrating how the imbalance of these three psychic forces contributes to his downfall.
Q1_ENGLISH_PPT_WEEK 1 power point grade 3 Quarter 1 week 1
Q1_ENGLISH_PPT_WEEK 1 power point grade 3 Quarter 1 week 1jutaydeonne Grade 3 Quarter 1 Week 1 English part 2
VCE Literature Section A Exam Response Guide
VCE Literature Section A Exam Response Guidejpinnuck This practical guide shows students of Unit 3&4 VCE Literature how to write responses to Section A of the exam. Including a range of examples writing about different types of texts, this guide:
*Breaks down and explains what Q1 and Q2 tasks involve and expect
*Breaks down example responses for each question
*Explains and scaffolds students to write responses for each question
*Includes a comprehensive range of sentence starters and vocabulary for responding to each question
*Includes critical theory vocabulary lists to support Q2 responses
Code Profiling in Odoo 18 - Odoo 18 Slides
Code Profiling in Odoo 18 - Odoo 18 SlidesCeline George Profiling in Odoo identifies slow code and resource-heavy processes, ensuring better system performance. Odoo code profiling detects bottlenecks in custom modules, making it easier to improve speed and scalability.
Great Governors' Send-Off Quiz 2025 Prelims IIT KGP
Great Governors' Send-Off Quiz 2025 Prelims IIT KGPIIT Kharagpur Quiz Club Prelims of the Great Governors' Send-Off Quiz 2025 hosted by the outgoing governors.
QMs: Aarushi, Aatir, Aditya, Arnav
Paper 106 | Ambition and Corruption: A Comparative Analysis of ‘The Great Gat...
Paper 106 | Ambition and Corruption: A Comparative Analysis of ‘The Great Gat...Rajdeep Bavaliya Dive into the glittering allure and hidden rot of the American Dream as we compare Jay Gatsby’s lofty ambitions with Jordan Belfort’s brazen excess. Uncover how both characters chase success at the cost of their integrity and ultimately pay the price for unchecked desire. Which downfall resonates more—Gatsby’s doomed romance or Belfort’s scandalous spiral? Hit like if you’ve ever chased a dream, and follow for more literary-versus-film showdowns!
M.A. Sem - 2 | Presentation
Presentation Season - 2
Paper - 106: The Twentieth Century Literature: 1900 to World War II
Submitted Date: April 3, 2025
Paper Name: The Twentieth Century Literature: 1900 to World War II
Topic: Ambition and Corruption: A Comparative Analysis of ‘The Great Gatsby’ and ‘The Wolf of Wall Street’
[Please copy the link and paste it into any web browser to access the content.]
Video Link: https://youtu.be/4mXmSVjTLt8
For a more in-depth discussion of this presentation, please visit the full blog post at the following link: https://rajdeepbavaliya2.blogspot.com/2025/04/ambition-and-corruption-a-comparative-analysis-of-the-great-gatsby-and-the-wolf-of-wall-street.html
Please visit this blog to explore additional presentations from this season:
Hashtags:
#AmericanDream #GreatGatsby #WolfOfWallStreet #AmbitionAndCorruption #LiteratureVsFilm #Fitzgerald #Scorsese #JayGatsby #JordanBelfort #DreamOrDownfall
Keyword Tags:
The Great Gatsby, Wolf of Wall Street, American Dream analysis, ambition corruption, Gatsby vs. Belfort, F. Scott Fitzgerald themes, Martin Scorsese film, literary comparison, movie vs. novel, moral critique
K12 Tableau User Group virtual event June 18, 2025
K12 Tableau User Group virtual event June 18, 2025dogden2 National K12 Tableau User Group: June 2025 meeting slides
University of Ghana Cracks Down on Misconduct: Over 100 Students Sanctioned
University of Ghana Cracks Down on Misconduct: Over 100 Students SanctionedKweku Zurek University of Ghana Cracks Down on Misconduct: Over 100 Students Sanctioned
List View Components in Odoo 18 - Odoo Slides
List View Components in Odoo 18 - Odoo SlidesCeline George In Odoo, there are many types of views possible like List view, Kanban view, Calendar view, Pivot view, Search view, etc.
The major change that introduced in the Odoo 18 technical part in creating views is the tag <tree> got replaced with the <list> for creating list views.
LDMMIA Shop & Student News Summer Solstice 25
LDMMIA Shop & Student News Summer Solstice 25LDM & Mia eStudios 6/18/25
Shop, Upcoming: Final Notes to Review as we Close Level One. Make sure to review the orientation and videos as well. There’s more to come and material to cover in Levels 2-3. The content will be a combination of Reiki and Yoga. Also energy topics of our spiritual collective.
Thanks again all future Practitioner Level Students. Our Levels so far are: Guest, Grad, and Practitioner. We have had over 5k Spring Views.
https://ldm-mia.creator-spring.com
Pests of Maize: An comprehensive overview.pptx
Pests of Maize: An comprehensive overview.pptxArshad Shaikh Maize is susceptible to various pests that can significantly impact yields. Key pests include the fall armyworm, stem borers, cob earworms, shoot fly. These pests can cause extensive damage, from leaf feeding and stalk tunneling to grain destruction. Effective management strategies, such as integrated pest management (IPM), resistant varieties, biological control, and judicious use of chemicals, are essential to mitigate losses and ensure sustainable maize production.
How payment terms are configured in Odoo 18
How payment terms are configured in Odoo 18Celine George Payment terms in Odoo 18 help define the conditions for when invoices are due. This feature can split payments into multiple parts and automate due dates based on specific rules.
June 2025 Progress Update With Board Call_In process.pptx
June 2025 Progress Update With Board Call_In process.pptxInternational Society of Service Innovation Professionals ---
June 25 ISSIP Event - slides in process
20250618 PPre-Event Presentation Summary - Progress Update with Board Series June 25
ISSIP Website Upcoming Events Description: https://issip.org/event/semi-annual-issip-progress-call/
Register here (even if you cannot attend live online, all who register will get link to recording and slides post-event): https://docs.google.com/forms/d/e/1FAIpQLSdThrop1rafOCo4PQkYiS2XApclJuMjYONEHRMGBsceRdcQqg/viewform
This pre-event presentation: https://www.slideshare.net/slideshow/june-2025-progress-update-with-board-call_in-process-pptx/280718770
This pre-event recording: https://youtu.be/Shjgd5o488o
---
HistoPathology Ppt. Arshita Gupta for Diploma
HistoPathology Ppt. Arshita Gupta for Diplomaarshitagupta674 Hello everyone please suggest your views and likes so that I uploaded more study materials
In this slide full HistoPathology according to diploma course available like fixation
Tissue processing , staining etc
IIT KGP Quiz Week 2024 Sports Quiz (Prelims + Finals)
IIT KGP Quiz Week 2024 Sports Quiz (Prelims + Finals)IIT Kharagpur Quiz Club The document outlines the format for the Sports Quiz at Quiz Week 2024, covering various sports & games and requiring participants to Answer without external sources. It includes specific details about question types, scoring, and examples of quiz questions. The document emphasizes fair play and enjoyment of the quiz experience.
ECONOMICS, DISASTER MANAGEMENT, ROAD SAFETY - STUDY MATERIAL [10TH]
ECONOMICS, DISASTER MANAGEMENT, ROAD SAFETY - STUDY MATERIAL [10TH]SHERAZ AHMAD LONE This study material for Class 10th covers the core subjects of Economics, Disaster Management, and Road Safety Education, developed strictly in line with the JKBOSE textbook. It presents the content in a simplified, structured, and student-friendly format, ensuring clarity in concepts. The material includes reframed explanations, flowcharts, infographics, and key point summaries to support better understanding and retention. Designed for classroom teaching and exam preparation, it aims to enhance comprehension, critical thinking, and practical awareness among students.
Paper 107 | From Watchdog to Lapdog: Ishiguro’s Fiction and the Rise of “Godi...
Paper 107 | From Watchdog to Lapdog: Ishiguro’s Fiction and the Rise of “Godi...Rajdeep Bavaliya Dive into a captivating analysis where Kazuo Ishiguro’s nuanced fiction meets the stark realities of post‑2014 Indian journalism. Uncover how “Godi Media” turned from watchdog to lapdog, echoing the moral compromises of Ishiguro’s protagonists. We’ll draw parallels between restrained narrative silences and sensationalist headlines—are our media heroes or traitors? Don’t forget to follow for more deep dives!
M.A. Sem - 2 | Presentation
Presentation Season - 2
Paper - 107: The Twentieth Century Literature: From World War II to the End of the Century
Submitted Date: April 4, 2025
Paper Name: The Twentieth Century Literature: From World War II to the End of the Century
Topic: From Watchdog to Lapdog: Ishiguro’s Fiction and the Rise of “Godi Media” in Post-2014 Indian Journalism
[Please copy the link and paste it into any web browser to access the content.]
Video Link: https://youtu.be/kIEqwzhHJ54
For a more in-depth discussion of this presentation, please visit the full blog post at the following link: https://rajdeepbavaliya2.blogspot.com/2025/04/from-watchdog-to-lapdog-ishiguro-s-fiction-and-the-rise-of-godi-media-in-post-2014-indian-journalism.html
Please visit this blog to explore additional presentations from this season:
Hashtags:
#GodiMedia #Ishiguro #MediaEthics #WatchdogVsLapdog #IndianJournalism #PressFreedom #LiteraryCritique #AnArtistOfTheFloatingWorld #MediaCapture #KazuoIshiguro
Keyword Tags:
Godi Media, Ishiguro fiction, post-2014 Indian journalism, media capture, Kazuo Ishiguro analysis, watchdog to lapdog, press freedom India, media ethics, literature and media, An Artist of the Floating World
June 2025 Progress Update With Board Call_In process.pptx
June 2025 Progress Update With Board Call_In process.pptxInternational Society of Service Innovation Professionals
information security(Public key encryption its characteristics and weakness, Diffie-Hellman Algorithm with example )
- 2. Public Key Encryption • Encryption When the two parties communicate to each other to transfer the intelligible or sensible message, referred to as plaintext, is converted into apparently random nonsense for security purpose referred to as ciphertext. The process of changing the plaintext into the ciphertext is referred to as encryption. The encryption process consists of an algorithm and a key. The key is a value independent of the plaintext. Once the ciphertext is produced, it may be transmitted.
- 3. Public Key Encryption • The security of conventional encryption depends on the major two factors: • The Encryption algorithm • Secrecy of the key
- 4. Public Key Encryption • The algorithm will produce a different output depending on the specific key being used at the time. Changing the key changes the output of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the ciphertext can be transformed back to the original plaintext by using a decryption algorithm and the same key that was used for encryption. Decryption: The process of changing the ciphertext to the plaintext that process is known as decryption. Asymmetric is a form of Cryptosystem in which encryption and decryption are performed using different keys-Public key (known to everyone) and Private key (Secret key). This is known as Public Key Encryption.
- 5. Characteristics of Public Encryption key: • Public key Encryption is important because it is infeasible to determine the decryption key given only the knowledge of the cryptographic algorithm and encryption key. • Either of the two key (Public and Private key) can be used for encryption with other key used for decryption. • Due to Public key cryptosystem, public keys can be freely shared, allowing users an easy and convenient method for encrypting content and verifying digital signatures, and private keys can be kept secret, ensuring only the owners of the private keys can decrypt content and create digital signatures. • The most widely used public-key cryptosystem is RSA (Rivest–Shamir– Adleman). The difficulty of finding the prime factors of a composite number is the backbone of RSA.
- 6. Weakness of the Public Key Encryption: • Public key Encryption is vulnerable to Brute-force attack. • This algorithm also fails when the user lost his private key, then the Public key Encryption becomes the most vulnerable algorithm. • Public Key Encryption also is weak towards man in the middle attack. In this attack a third party can disrupt the public key communication and then modify the public keys. • If user private key used for certificate creation higher in the PKI(Public Key Infrastructure) server hierarchy is compromised, or accidentally disclosed, then a “man-in-the-middle attack” is also possible, making any subordinate certificate wholly insecure. This is also the weakness of Public key Encryption.
- 7. Applications: • Confidentiality can be achieved using Public Key Encryption. In this the Plain text is encrypted using receiver public key. This will ensures that no one other than receiver private key can decrypt the cipher text. • Digital signature is for senders authentication purpose. In this sender encrypt the plain text using his own private key. This step will make sure the authentication of the sender because receiver can decrypt the cipher text using senders pubic key only. • This algorithm can use in both Key-management and securely transmission of data.
- 8. Diffie-Hellman Algorithm • The key exchange was invented by Whitfield Diffie and Martin Hellmann in 1976 as the first practical method for establishing a shared secret code over an open communications channel. The general idea of the Diffie-Hellmann key exchange involves two parties exchanging numbers and doing simple calculations in order to get a common number which serves as the secret key. Both parties may not know beforehand what the final secret number is, but after some calculations, both are left with a value that only they know about which they can use for various purposes like identification and as a secret key for other cryptographic methods.
- 9. Diffie-Hellman Algorithm • The Diffie-Hellman algorithm is being used to establish a shared secret that can be used for secret communications while exchanging data over a public network using the elliptic curve to generate points and get the secret key using the parameters. • For the sake of simplicity and practical implementation of the algorithm, we will consider only 4 variables one prime P and G (a primitive root of P) and two private values a and b. • P and G are both publicly available numbers. Users (say Alice and Bob) pick private values a and b and they generate a key and exchange it publicly, the opposite person received the key and from that generates a secret key after which they have the same secret key to encrypt.
- 11. Example • Step 1: Alice and Bob get public numbers P = 23, G = 9 • Step 2: Alice selected a private key a = 4 and • Bob selected a private key b = 3 • Step 3: Alice and Bob compute public values • Alice: x =(9^4 mod 23) = (6561 mod 23) = 6 • Bob: y = (9^3 mod 23) = (729 mod 23) = 16
- 12. Example • Step 4: Alice and Bob exchange public numbers • Step 5: Alice receives public key y =16 and • Bob receives public key x = 6 • Step 6: Alice and Bob compute symmetric keys • Alice: ka = y^a mod p = 65536 mod 23 = 9 • Bob: kb = x^b mod p = 216 mod 23 = 9 • Step 7: 9 is the shared secret.
- 13. presentation • Topics • RSA Algorithm • Chinese Remainder Theorem • Needham Schroder, key Management Distribution, KDC,CRM Submission date: 13-2-2020