scholarly journals Data Encryption to Decryption by using Laplace Transform

2020 ◽  
Vol 9 (6) ◽  
pp. 330-334
Keyword(s):  
Mathematical Model ◽  
Laplace Transformation ◽  
Original Data ◽  
Data Encryption ◽  
Inverse Laplace Transformation ◽  
Plain Text ◽  
Encryption And Decryption ◽  
Ascii Code ◽  
Primary Key ◽  
The Given

In this paper, we introduce an encryption and decryption procedure with high security by mathematical model, using Laplace transformation and Inverse Laplace Transformation for the given transforming data from one end to other end. We also give an example. Here we convert plain text to ASCII code. We take two primes as a primary key for encryption and decrypt in of the original data.

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 Securitary Text on Images with RC-128 Bit Synthric Key Encryption

2021 ◽  
Vol 6 (2) ◽  
pp. 94-102
Author(s):  
Muslih Muslih ◽  
Abdussalam Abdussalam ◽  
Elkaf Rahmawan Pramudya
Keyword(s):  
Information Security ◽  
Stream Cipher ◽  
Original Data ◽  
Data Encryption ◽  
Experimental Results ◽  
Basic Information ◽  
Security Services ◽  
Security Service ◽  
Encryption And Decryption ◽  
Mathematical Algorithms

The main purpose of using cryptography is to provide the following four basic information security services. One of the purposes of cryptography is secrecy. Confidentiality is the fundamental security service provided by cryptography. This is a security service that stores information from unauthorized persons. Confidentiality can be achieved through a variety of ways ranging from physical security to the use of mathematical algorithms for data encryption. Vernam cipher is a stream cipher where the original data or plain with 8x8 block operation. Experimental results prove that RC4 can perform encryption and decryption with a fast execution process. In this study used a processor with 8GB of RAM. The encryption result of the text used yields the average encryption time and decryption average of 2 second.

A MATHEMATICAL PROPOSED MODEL FOR PUBLIC KEY ENCRYPTION ALGORITHMS IN CYBERSECURITY

2021 ◽  
Vol 10 (9) ◽  
pp. 3063-3092
Author(s):  
H.A. Saif ◽  
G.M.I. Gharib ◽  
M.R. AL-Mousa
Keyword(s):  
Mathematical Model ◽  
Financial Economic ◽  
Data Encryption ◽  
Public Key ◽  
Secret Data ◽  
Continuous Increase ◽  
Plain Text ◽  
The Public ◽  
Private Key ◽  
General Mathematical Model

Information security is a very important science, especially after the continuous increase in cybercrime of all kinds, which caused very large financial, economic and political losses, so it was necessary to find a solution to protect the data and keep it secret. Data encryption is one of the most important solutions to preserve data and reduce cybercrime. The encryption process means converting the plain text using a private key into symbols and numbers that make this text incomprehensible to others. There are many algorithms that are used for encryption, and the public key algorithms are the strongest in the encryption process because they depend on two keys, the public key and the private key. One of the most important problems facing this type of algorithm is the lack of a clear mathematical model that facilitates understanding and how to deal with these keys. In this thesis, a mathematical model has been proposed in which two functions are defined, the public key and the function of the private key, based on the concepts and specific characteristics of the function. A general mathematical model was constructed by defining two functions, one for the public key and the other for the private key, using the properties of a function in mathematics, to produce strong keys used in the public key algorithm, to protect data and keep it secret, and this model was applied to the RSA and ELGamal algorithms. The most important result was that in the case of applying the mathematical model, it is easy to understand and deal with the public key and the private key mathematically.

scholarly journals Computer Modeling of Aerosol Emissions Spread in the Atmosphere

2019 ◽  
Vol 97 ◽  
pp. 05023 ◽  
Author(s):  
Daler Sharipov ◽  
Sharofiddin Aynakulov ◽  
Otabek Khafizov
Keyword(s):  
Boundary Layer ◽  
Mathematical Model ◽  
Atmospheric Boundary Layer ◽  
Computer Modeling ◽  
Numerical Experiments ◽  
Climatic Factors ◽  
Numerical Algorithms ◽  
Aerosol Emissions ◽  
The Given ◽  
And Diffusion

The paper deals with the development of mathematical model and numerical algorithms for solving the problem of transfer and diffusion of aerosol emissions in the atmospheric boundary layer. The model takes into account several significant parameters such as terrain relief, characteristics of underlying surface and weather-climatic factors. A series of numerical experiments were conducted based on the given model. The obtained results presented here show how these factors affect aerosol emissions spread in the atmosphere.

scholarly journals A proposal of privacy preserving reinforcement learning for secure multiparty computation

2017 ◽  
Vol 6 (2) ◽  
pp. 57 ◽  
Author(s):  
Hirofumi Miyajima ◽  
Noritaka Shigei ◽  
Syunki Makino ◽  
Hiromi Miyajima ◽  
Yohtaro Miyanishi ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Distributed Processing ◽  
Data Encryption ◽  
Secure Multiparty Computation ◽  
Multiparty Computation ◽  
Learning Methods ◽  
Q Learning ◽  
Encryption And Decryption ◽  
Maze Problem ◽  
Learning Data

Many studies have been done with the security of cloud computing. Though data encryption is a typical approach, high computing complexity for encryption and decryption of data is needed. Therefore, safe system for distributed processing with secure data attracts attention, and a lot of studies have been done. Secure multiparty computation (SMC) is one of these methods. Specifically, two learning methods for machine learning (ML) with SMC are known. One is to divide learning data into several subsets and perform learning. The other is to divide each item of learning data and perform learning. So far, most of works for ML with SMC are ones with supervised and unsupervised learning such as BP and K-means methods. It seems that there does not exist any studies for reinforcement learning (RL) with SMC. This paper proposes learning methods with SMC for Q-learning which is one of typical methods for RL. The effectiveness of proposed methods is shown by numerical simulation for the maze problem.

scholarly journals Study A Public Key in RSA Algorithm

2020 ◽  
Vol 5 (4) ◽  
pp. 395-398
Author(s):  
Taleb Samad Obaid
Keyword(s):  
Private Information ◽  
Original Data ◽  
Prime Numbers ◽  
Public Key ◽  
The Internet ◽  
Sensitive Information ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Main Disadvantage ◽  
Encryption Decryption

To transmit sensitive information over the unsafe communication network like the internet network, the security is precarious tasks to protect this information. Always, we have much doubt that there are more chances to uncover the information that is being sent through network terminals or the internet by professional/amateur parasitical persons. To protect our information we may need a secure way to safeguard our transferred information. So, encryption/decryption, stenographic and vital cryptography may be adapted to care for the required important information. In system cryptography, the information transferred between both sides sender/receiver in the network must be scrambled using the encryption algorithm. The second side (receiver) should be outlook the original data using the decryption algorithms. Some encryption techniques applied the only one key in the cooperation of encryption and decryption algorithms. When the similar key used in both proceeds is called symmetric algorithm. Other techniques may use two different keys in encryption/decryption in transferring information which is known as the asymmetric key.  In general, the algorithms that implicated asymmetric keys are much more secure than others using one key.   RSA algorithm used asymmetric keys; one of them for encryption the message, and is known as a public key and another used to decrypt the encrypted message and is called a private key. The main disadvantage of the RSA algorithm is that extra time is taken to perform the encryption process. In this study, the MATLAB library functions are implemented to achieve the work. The software helps us to hold very big prime numbers to generate the required keys which enhanced the security of transmitted information and we expected to be difficult for a hacker to interfere with the private information. The algorithms are implemented successfully on different sizes of messages files.

Sign in / Sign up

Export Citation Format

Share Document