Email Security and PGP Technical Analysis

2012 ◽  
Vol 546-547 ◽  
pp. 1075-1079
Author(s):  
Chun Ying Gu ◽  
Rui Ying Fang
Keyword(s):  
Digital Signature ◽  
Technical Analysis ◽  
Generation Process ◽  
Transmission Method ◽  
Private Key ◽  
Encryption And Decryption ◽  
Secure Email ◽  
Pair Generation

Currently, Email is one of the most popular applications in people’s life. A secure email requires that the email system can provide encryption and digital signature, PGP is a popular email encryption and transmission method, the paper gives a brief overview of email security, details the PGP algorithm, function, encryption and decryption process and public/private key pair generation process, and analysis’s Security of PGP.

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

Implementation of Algorithms for Identity Based Encryption and Decryption

2021 ◽  
pp. 315-327
Author(s):  
Kannan Balasubramanian ◽  
M. Rajakani
Keyword(s):  
Third Party ◽  
Public And Private ◽  
Trusted Third Party ◽  
Private Key ◽  
Identity Based Encryption ◽  
Encryption And Decryption ◽  
Semantic Security ◽  
Identity Based ◽  
Mail Address ◽  
E Mail

Identity-based cryptosystems were introduced to overcome one of the main problems in public key encryption, the generation of public and private keys. In the identity-based cryptosystem, an identifier such as an e-mail address of a user can be used to generate public and private keys by a trusted third party. The trusted third party uses a system-wide master secret to provide private keys to a user. Identity-based cryptosystems can be constructed using the idea of pairings. This article discusses four different identity-based cryptosystems: the Boneh-Franklin scheme, the Cock's scheme, the Authenticated IBE scheme and the Hierarchical IBE scheme. This article also discusses the security notions considered for the identity-based cryptosystem. The security notions considered are: one-wayness, indistinguishability, semantic security and non-malleability. An architecture consisting of a public parameter server and private key generator for the implementation of the identity-based cryptosystems is also discussed.

Hybrid Cryptography for Random-key Generation based on ECC Algorithm

2017 ◽  
Vol 7 (3) ◽  
pp. 1293 ◽  
Author(s):  
P. Gayathri ◽  
Syed Umar ◽  
G. Sridevi ◽  
N. Bashwanth ◽  
Royyuru Srikanth
Keyword(s):  
Security Level ◽  
Key Generation ◽  
Public Key Encryption ◽  
Private Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Safe Side ◽  
Key Length ◽  
High Level ◽  
User Friendly

As more increase in usage of communications and developing them more user friendly. While developing those communications, we need to take care of security and safety of user’s data. Many researchers have developed many complex algorithms to maintain security in user’s application. Among those one of the best algorithms are cryptography based, in which user will be safe side mostly from the attackers.  We already had some AES algorithm which uses very complex cryptographic algorithm to increase the performance and more usage of lookup tables. So the cache timing attackers will correlates the details to encrypt the data under known key with the unknown key. So, for this we provide an improvised solution. This paper deals with an extension of public-key encryption and decryption support including a private key. The private key is generated with the combination of AES and ECC. In general AES, key length is 128 bits with 10 times of iterations. But with this, users won’t get efficient security for their operations, so to increase the security level we are implementing 196-bit based encryption with 12 times round-key generation iterations. By this enhancement, we can assure to users to high level security and can keep users data in confidential way.

New Algorithm to Reduce File Size and Bandwidth of Hashed Digital Signature for Image Steganography Using LSB

2014 ◽  
Vol 980 ◽  
pp. 194-197
Author(s):  
Erfaneh Noroozi ◽  
Salwani Bt Mohd Daud ◽  
Ali Sabouhi ◽  
Mohammad Reza Salehnamadi
Keyword(s):  
Digital Signature ◽  
Image Steganography ◽  
Sensitive Information ◽  
Multi Agent Systems ◽  
File Size ◽  
Agent Systems ◽  
Private Key ◽  
Simple Implementation ◽  
Multi Agent ◽  
Original File

In computer cryptography, digital signature is one of the best cryptography systems. Public-private keys are used to pass sensitive information however it can also be used to provide authentication on the particulars of a sender. Proposed algorithm is a new design and simple implementation mechanism for producing a digital signature. Some applications such as multi agent systems transferred data with small size and capacity. The new scheme minimizes the size of original file and gives us a dynamic and smaller hashed message output. In this algorithm load the original files then hashed the message and encode it with the private key of sender. Finally modify the established code into a unique digital signature at Base 16. We concentrate on designing and implementation of functions of algorithm.

Design of Digital Signature Scheme Based on Elliptic Curve Cryptosystem

2014 ◽  
Vol 685 ◽  
pp. 579-582
Author(s):  
Shi Guo Jin ◽  
Guang Jiang Wang
Keyword(s):  
Elliptic Curve ◽  
Digital Signature ◽  
Public Key Cryptography ◽  
Elliptic Curve Cryptosystem ◽  
Generation Process ◽  
Signature Scheme ◽  
Technical Performance ◽  
Elliptic Curve Cryptosystems ◽  
Process System ◽  
Digital Signature Scheme

Digital signature is electronically password technique for electronic document signature. Elliptic curve cryptography is a method of public key cryptography based on elliptic curve mathematical. Digital signature scheme consists of three processes: initialization process, the signature generation process and signature verification process system. This paper analyzes the elliptic curve cryptosystems mathematical principle and technical performance. The paper proposes design of digital signature scheme based on elliptic curve cryptosystem.

scholarly journals Encryption and Decryption of data using Elliptical Curve Cryptography

2019 ◽  
Vol 8 (9) ◽  
pp. 1141-1144
Keyword(s):  
Performance Metrics ◽  
Personal Information ◽  
Public Key Cryptography ◽  
Original Data ◽  
Public Key ◽  
Key Generation ◽  
Plain Text ◽  
Private Key ◽  
Encryption And Decryption ◽  
Pixel Value

Aadhaar database is the world's largest biometric database system. The security of Aadhaar database plays a major role. In order to secure such huge database, an encryption and decryption algorithm has been proposed in this paper. Elliptic Curve Cryptography (ECC) is a public key cryptography which is used to provide high security to those databases. The Aadhaar database contains individual personal information as well as their biometric identities. ECC is widely used for providing security to all kinds of data. ECC has smaller key size, fast computation, high throughput compared to other cryptographic algorithms. The data’s present in database are converted into their corresponding Pixel or ASCII values. After that the encryption process is done with the help of public key, private key, generation points and plain text. After the encryption process, the encrypted coordinates can be mapped with the generated points and from that corresponding ASCII value for text, pixel value for image can be retrieved. Then, the alphabet which is corresponding to ASCII will be displayed so that the cipher text can be viewed. This encrypted data is stored in the database. In order to retrieve the original data decryption process using ECC is carried out. In decryption process, receiver’s private key and cipher coordinates which is retrieved from encryption process are used. Therefore, the personal details of an individual can be retrieved with the presence of that particular person who only knows that private key. So, the hackers will not be able to retrieve the database of any individual just by knowing their Aadhaar ID. The proposed work is implemented in the MATLAB software. The Performance metrics like PSNR, Similarity, Correlation Coefficient, NPCR and UACI has been done for analysis.

scholarly journals Encrypted Communications: It's not what it seems.

2020 ◽  
Author(s):  
Neelkumar Patel ◽  
Jay Sukhadiya ◽  
Jinan Fiaidhi
Keyword(s):  
Web Application ◽  
Electronic Mail ◽  
Third Party ◽  
Communication Process ◽  
Secure Communications ◽  
Android Application ◽  
Private Key ◽  
Encryption And Decryption ◽  
End To End

<div>Secure communications is when two entities communicate with each other and the communication is completely secured from a third party or the intruder. This type of communication process can be achieved using encryption and decryption mechanism. The implementation of Email encryption is performed with the intension of showing the working of encryption and decryption mechanism. This web application allows user to send an encrypted electronic-mail to any domain and it can be only decrypted using the receiver’s private key. Whereas, messaging android application was developed to replicate existing WhatsApp application to see whether, it performs end-to-end encryption or it’s not what it seems. The application allows users to securely communicate with each other via performing actual end-to-end encryption.</div>

scholarly journals Analisis dan Implementasi Algoritma Asimetris Dual Modulus RSA (DM-RSA) pada Aplikasi Chat

2021 ◽  
Vol 5 (4) ◽  
pp. 768-773
Author(s):  
Aminudin ◽  
Ilyas Nuryasin
Keyword(s):  
Prime Numbers ◽  
Public Key ◽  
Generation Process ◽  
Key Generation ◽  
The Public ◽  
Asymmetric Model ◽  
Rsa Algorithm ◽  
Private Key ◽  
Public Keys ◽  
Cryptographic Algorithms

The RSA algorithm is one of the cryptographic algorithms with an asymmetric model where the algorithm has two keys, namely the public key and the private key. However, as time goes on, these algorithms are increasingly exposed to security holes and make this algorithm vulnerable to being hacked by people who do not have authority. The vulnerability stems from the algorithm's public keys (e and n). The strength of the RSA algorithm is based on the difficulty of factoring two prime numbers that are generated during the key generation process, if these values ​​can be known using certain methods, the public key and private key values ​​will be found. Therefore, there are many studies that improvise the RSA algorithm, one of which is the Dual Modulus RSA (DM-RSA) algorithm. The algorithm uses four prime numbers which produce 2 modulus and 4 keys (2 public keys and 2 private keys). From the results of the Kraitchik factorization test, it was found that the DM-RSA algorithm was proven to be more resistant up to 2 times or even more than the standard RSA algorithm. This is evidenced by the fact that the value of n is 24 bits, the RSA algorithm can last up to 63204 ms (1 minute 22 seconds) while the Dual Modulus RSA algorithm lasts up to 248494123 ms (142 minutes 47 seconds).  

scholarly journals A New Method Encryption and Decryption

Webology ◽  
2021 ◽  
Vol 18 (1) ◽  
pp. 20-31
Author(s):  
Ali Abdulwahhab Mohammed ◽  
Haitham A. Anwer
Keyword(s):  
New Method ◽  
Huge Number ◽  
Private Key ◽  
Encryption And Decryption ◽  
Long Time ◽  
Security Guarantees

In all times manual investigation and decryption of enciphered archives is a repetitive and mistake inclined work. Regularly considerably in the wake of investing a lot of energy in a specific figure, no decipherment can be found. Computerizing the unscrambling of different kinds of figures makes it conceivable to filter through the huge number of encoded messages found in libraries and files. We propose in this paper new algorithm has been made to encrypt the information; this algorithm works to shield information from robbery and can't be decrypted in the text. It is taken care of precisely to very accurately to avoid any penetration to arrive at the first text. It tends to be used in companies or some other system; however, it takes a long time to encrypt it. To the first text when encryption to ensure the assurance of information in full and security. Encrypted text contains a unique key, even when stolen. The private key can't be decrypted by the specialist and licensed by the maker of the code in order to protect the data in an excellent manner. While demonstrating in addition much stronger security guarantees with regards to Differential/ direct assaults. Specifically, we are can to provide new Method Encryption and Decryption with strong bounds for all versions.

Sign in / Sign up

Export Citation Format

Share Document