Log in

Relevant bibliographies by topics / Encryption and Decryption / Journal articles

To see the other types of publications on this topic, follow the link: Encryption and Decryption.

Journal articles on the topic 'Encryption and Decryption'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Encryption and Decryption.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Wadehra, Shivangi, Shivam Goel, and Nidhi Sengar. "AES Algorithm: Encryption and Decryption." International Journal of Trend in Scientific Research and Development Volume-2, Issue-3 (April 30, 2018): 1075–77. http://dx.doi.org/10.31142/ijtsrd11221.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jo, Suhyung, Sang Su Lee, and Doo Ho Choi. "Data Preprocessor for Order Preserving Encryption." Applied Mechanics and Materials 752-753 (April 2015): 1356–59. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1356.

Full text

Abstract:

Sensitive data such as personal telephone number, address, social security number at database is prevented to access by SQL search query. In order to prevent security problems it needs to encrypt database. Order preserving encryption (OPE) is a method of encrypting data so that it's possible to make efficient inequality comparisons on the encrypted items without decrypting them. OPE data of database is available to make index without decryption. In this paper, the data preprocessor by reducing plaintext range, the performance of OPE is increased and sensitive data are protected at database.

APA, Harvard, Vancouver, ISO, and other styles

3

Ruan, Wei Hua, and Qing Sheng Hu. "A Kind of Logarithmic Function Hardware Encryptor and Decryptor." Applied Mechanics and Materials 427-429 (September 2013): 2956–59. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2956.

Full text

Abstract:

This paper presents the realization of a kind of hardware encryptor and decryptor, which is based on Logarithmic Function principle. It shows how to design the encryption circuit and the decryption circuit by the sequential circuit. It had been designed in VHDL and simulated by Modelsim software, and then synthesized as well as realized on the FPGA chip EP2C5T144 by QuartusII software, last finished the test.

APA, Harvard, Vancouver, ISO, and other styles

4

Pronika, Pronika, and S. S. Tyagi. "Performance analysis of encryption and decryption algorithm." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 2 (August 1, 2021): 1030. http://dx.doi.org/10.11591/ijeecs.v23.i2.pp1030-1038.

Full text

Abstract:

<p class="Abstract">In this tumultuous 21st century, we are surrounding by lots of applications such as social media websites all over the internet or this era can also define as digital era in which everything is accessible over the internet. There are billions of internet users all over the world and they share their information over the same and because of this lots of people intentionally trying to steal the confidential data of other people, so it is always advisable to share and store data in encrypted form. In this paper, we discuss different encryption and decryption algorithms and compare them with respect to time take by these algorithms for encrypting and decrypting different sizes of files.</p>

APA, Harvard, Vancouver, ISO, and other styles

5

Bozduman, Hanife Çağıl, and Erkan Afacan. "Simulation of a Homomorphic Encryption System." Applied Mathematics and Nonlinear Sciences 5, no. 1 (April 10, 2020): 479–84. http://dx.doi.org/10.2478/amns.2020.1.00046.

Full text

Abstract:

AbstractCryptology is defined as the science of making communication incomprehensible to third parties who have no right to read and understand the data or messages. Cryptology consists of two parts, namely, cryptography and cryptanalysis. Cryptography analyzes methods of encrypting messages, and cryptanalysis analyzes methods of decrypting encrypted messages. Encryption is the process of translating plaintext data into something that appears to be random and meaningless. Decryption is the process of converting this random text into plaintext. Cloud computing is the legal transfer of computing services over the Internet. Cloud services let individuals and businesses to use software and hardware resources at remote locations. Widespread use of cloud computing raises the question of whether it is possible to delegate the processing of data without giving access to it. However, homomorphic encryption allows performing computations on encrypted data without decryption. In homomorphic encryption, only the encrypted version of the data is given to the untrusted computer to process. The computer will perform the computation on this encrypted data, without knowing anything on its real value. Finally, it will send back the result, and whoever has the proper deciphering key can decrypt the cryptogram correctly. The decrypted result will be equal to the intended computed value. In this paper, homomorphic encryption and their types are reviewed. Also, a simulation of somewhat homomorphic encryption is examined.

APA, Harvard, Vancouver, ISO, and other styles

6

L, Vinothkumar, and Balaji V. "Encryption and Decryption Technique Using Matrix Theory." Journal of Computational Mathematica 3, no. 2 (December 30, 2019): 1–7. http://dx.doi.org/10.26524/cm49.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kaur, Kulwinder. "Performance Evaluation of Ciphers Using CRYPTOOL 2.0." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 3, no. 1 (August 1, 2012): 39–43. http://dx.doi.org/10.24297/ijct.v3i1a.2727.

Full text

Abstract:

Cryptography is an emerging technology, which is important for network security. Research on cryptography is still in its developing stages and considerable research effort is required. This paper includes the complete step by step implementation of advance encryption technique, i.e. encrypting and decrypting 128 bit data using the AES and its modification for enhanced reliability and security. The encryption process consists of the combination of various classical techniques such as substitution, rearrangement and transformation encoding technique. The encryption and decryption module include the key expansion module which generates the key for all iterations. The modification includes the addition of an arithmetic operation and a route transposition cipher in the attacks iterative rounds. The key expansion module is extended to double the number of iterative rounds in order to increase its immunity against unauthorized attacks.

APA, Harvard, Vancouver, ISO, and other styles

8

Aminudin, Nur, Andino Maseleno, Shankar K, S. Hemalatha, K. Sathesh kumar, Fauzi ., Rita Irviani, and Muhamad Muslihudin. "Nur Algorithm on Data Encryption and Decryption." International Journal of Engineering & Technology 7, no. 2.26 (May 7, 2018): 109. http://dx.doi.org/10.14419/ijet.v7i2.26.14363.

Full text

Abstract:

Security is a priority in information system, especially in the exchange of data that are important or confidential. The information to be given to the party entitled to the information must be properly safeguarded, don’t fall into the other hands who have no right to such information. One way to maintain the security of information exchanged in a system can be done using cryptographic techniques. Cryptography is the art and science to hide information from third parties. In cryptography a person who has a private key can convert plaintext data into unique and unreadable data (ciphertext) and can convert existing ciphertext into plaintext form by using its private key. System development (System Development Lifecycle) can mean to construct a new system to replace old system, combined with prototyping technique to build a cryptographic system using Nur algorithm which is implemented using programming language used is assembly (MASM32). In Nur Aminuddin's Encryptor there are two data-reading techniques namely encryption technique (the technique of converting data from the original into unreadable code) and decryption technique (the techniques of reading unreadable codes become readable) Encryption technique is built by applying technique of modern cryptography which holds secrecy on the symmetric key, so the security of encryption depends only on the key and does not depend on whether the algorithm is known to people or not.

APA, Harvard, Vancouver, ISO, and other styles

9

SIROMONEY, RANI, K. G. SUBRAMANIAN, and P. J. ABISHA. "ENCRYPTION-DECRYPTION TECHNIQUES FOR PICTURES." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (December 1989): 497–503. http://dx.doi.org/10.1142/s0218001489000371.

Full text

Abstract:

Language theoretic public key cryptosystems for strings and pictures are discussed. Two methods of constructing public key cryptosystems for the safe transmission or storage of chain code pictures are presented; the first one encrypts a chain code picture as a string and the second one as a two-dimensional array.

APA, Harvard, Vancouver, ISO, and other styles

10

Bhargava, Puvvula, and Kuppam Hari Kishan. "144-BIT Encryption/Decryption Technique." International Journal of Computer Applications 1, no. 21 (February 25, 2010): 67–74. http://dx.doi.org/10.5120/53-647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Devi, SistlaVasundhara, and Harika Devi Kotha. "AES encryption and decryption standards." Journal of Physics: Conference Series 1228 (May 2019): 012006. http://dx.doi.org/10.1088/1742-6596/1228/1/012006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Nayak, Nikhilesh, Akshay Chandak, Nisarg Shah, and B. Karthikeyan. "Encryption and decryption using FPGA." IOP Conference Series: Materials Science and Engineering 263 (November 2017): 052030. http://dx.doi.org/10.1088/1757-899x/263/5/052030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Visconti, Paolo, Ramiro Velazquez, Stefano Capoccia, and Roberto De Fazio. "High-performance AES-128 algorithm implementation by FPGA-based SoC for 5G communications." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 5 (October 1, 2021): 4221. http://dx.doi.org/10.11591/ijece.v11i5.pp4221-4232.

Full text

Abstract:

<p>In this research work, a fast and lightweight AES-128 cypher based on the Xilinx ZCU102 FPGA board is presented, suitable for 5G communications. In particular, both encryption and decryption algorithms have been developed using a pipelined approach, so enabling the simultaneous processing of the rounds on multiple data packets at each clock cycle. Both the encryption and decryption systems support an operative frequency up to 220 MHz, reaching 28.16 Gbit/s maximum data throughput; besides, the encryption and decryption phases last both only ten clock periods. To guarantee the interoperability of the developed encryption/decryption system with the other sections of the 5G communication apparatus, synchronization and control signals have been integrated. The encryption system uses only 1631 CLBs, whereas the decryption one only 3464 CLBs, ascribable, mainly, to the Inverse Mix Columns step. The developed cypher shows higher efficiency (8.63 Mbps/slice) than similar solutions present in literature.</p>

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, Huawei, Ye Li, Yingnan Jiao, and Zhengping Jin. "An efficient outsourced attribute-based encryption scheme in the device-to-device mobile network." International Journal of Distributed Sensor Networks 15, no. 7 (July 2019): 155014771986550. http://dx.doi.org/10.1177/1550147719865507.

Full text

Abstract:

Device-to-device communication is considered as one of the hopeful technologies for proximal communication, which plays a vital role in the wireless systems and 5G cellular networks. The outsourced attribute-based encryption scheme is convinced to be very suitable for secure device-to-device communication since it allows not only fine-grained sharing of encrypted data but also achieves high efficiency in the decryption of general attribute-based encryption schemes. However, almost all existing outsourced attribute-based encryption schemes can hardly be applied directly in the device-to-device communication because many heavy computation operations, such as pairing and modular exponentiations, cannot be taken on the mobile devices in the device-to-device network. In this article, we propose a concept of outsourcing threshold decryption for attribute-based encryption and design a new efficient outsourcing threshold decryption scheme for ciphertext-policy attribute-based encryption. In our definition of outsourcing threshold decryption, the decryption, which is a computationally expensive operation, is outsourced to multiple semi-trusted and lightweight computing devices determined by an access structure and can be jointly taken by these devices. Our scheme supports proxy re-encryption which enables the decryption delegation. Finally, security and efficiency analyses of our proposed method indicate that our proposal guarantees strong security against chosen plaintext attacks and requires less outsourced computation and communication cost than the existing outsourced attribute-based encryption schemes.

APA, Harvard, Vancouver, ISO, and other styles

15

Liu, Yonghong. "Group and Cipher in Wormhole and Quantum Entanglement." European Journal of Pure and Applied Mathematics 14, no. 2 (May 18, 2021): 521–36. http://dx.doi.org/10.29020/nybg.ejpam.v14i2.3972.

Full text

Abstract:

In this article, we present wormholes cryptosystems (WCS). The first is the wormhole key distribution centre theorem, which asserts that the WCS is a public key group. The second is the security theorem, which asserts that the WCS are a one-way function. The third is new version of the definition for the WCS, and we introduce the notion of groups of WCS. The fourth ingredient is the encryption algorithm and decryption algorithm, and design principle. Here, we present a toy example to illustrate the computation of these encryptions and decryptions. The finally we present the unsymmetrical WCS theorem.

APA, Harvard, Vancouver, ISO, and other styles

16

G. B, Suresh, and V. Mathivanan. "Chaos Based Image Encryption." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 1 (January 1, 2018): 97. http://dx.doi.org/10.11591/ijeecs.v9.i1.pp97-100.

Full text

Abstract:

<p>New method of secure image encryption and decryption scheme based on the chaos is proposed. There are two steps are followed after the preprocessing step in the proposed system namely, Encryption and Decryption. In preprocessing, images are denoised using median filter. Then the original input images will be encrypted by using the chaos mapping algorithm. At last the original images are retrieved back from the encrypted image by using the key that is specified during the encryption process for the decryption of the original images. Then the histogram mapping is done for the encrypted and the decrypted images. The proposed system is tested on well-known images like Lena, Mandrill, Clown and Barbara. The experimental results have demonstrated that the introduced image encryption scheme can achieve high security for practical image encryption.</p>

APA, Harvard, Vancouver, ISO, and other styles

17

B.J., Santhosh Kumar, and Kruthika Vijay. "Symmetric Key based Encryption and Decryption using Lissajous Curve Equations." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 1 (February 1, 2017): 285. http://dx.doi.org/10.11591/ijece.v7i1.pp285-288.

Full text

Abstract:

Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.

APA, Harvard, Vancouver, ISO, and other styles

18

Aryanti, Aryanti, and Ikhthison Mekongga. "Implementation of Rivest Shamir Adleman Algorithm (RSA) and Vigenere Cipher In Web Based Information System." E3S Web of Conferences 31 (2018): 10007. http://dx.doi.org/10.1051/e3sconf/20183110007.

Full text

Abstract:

Data security and confidentiality is one of the most important aspects of information systems at the moment. One attempt to secure data such as by using cryptography. In this study developed a data security system by implementing the cryptography algorithm Rivest, Shamir Adleman (RSA) and Vigenere Cipher. The research was done by combining Rivest, Shamir Adleman (RSA) and Vigenere Cipher cryptographic algorithms to document file either word, excel, and pdf. This application includes the process of encryption and decryption of data, which is created by using PHP software and my SQL. Data encryption is done on the transmit side through RSA cryptographic calculations using the public key, then proceed with Vigenere Cipher algorithm which also uses public key. As for the stage of the decryption side received by using the Vigenere Cipher algorithm still use public key and then the RSA cryptographic algorithm using a private key. Test results show that the system can encrypt files, decrypt files and transmit files. Tests performed on the process of encryption and decryption of files with different file sizes, file size affects the process of encryption and decryption. The larger the file size the longer the process of encryption and decryption.

APA, Harvard, Vancouver, ISO, and other styles

19

Ge, Yue Tao, Xiao Ming Liu, and Xiao Tong Yin. "Study on TEA Encryption for Public Communication Network Wireless Remoter." Applied Mechanics and Materials 565 (June 2014): 179–82. http://dx.doi.org/10.4028/www.scientific.net/amm.565.179.

Full text

Abstract:

In order to realize wireless remoter not only securely but also quickly data transmission in the public communication network, the Tiny Encryption Algorithm (TEA) encryption and decryption algorithm is studied in this paper and the properties of TEA are analyzed. According to communication protocol of remoter, encryption and decryption program process are designed. Because of TEA encryption, remoter transmitter and receiver can communicate strongly in the public communication network.

APA, Harvard, Vancouver, ISO, and other styles

20

ABDULHAMID, Mohanad, and Nyagathu GICHUKI. "Comparative Study of Cryptographic Algorithms." International Journal of Information Security and Cybercrime 8, no. 1 (June 28, 2019): 13–22. http://dx.doi.org/10.19107/ijisc.2019.01.01.

Full text

Abstract:

This paper presents a comparative study of two cryptosystems, Data Encryption Standard (DES) and the Rivest-Shamir-Adleman (RSA) schemes. DES is a symmetric (or private) key cipher. This means that the same key is used for encryption and decryption. RSA, on the other hand, is an asymmetric (or public) key cipher, meaning that two keys are used, one for encryption and the other for decryption. The objective of this paper is to implement these two schemes in software. The program is written in the Java™ language. It generates a key from a passphrase given by the user, encrypts and decrypts a message using the same key, for the case of DES. In RSA, decryption is done by computing the decryption key from the encryption key. Finally, the program returns the time taken to encrypt and decrypt a message.

APA, Harvard, Vancouver, ISO, and other styles

21

Crowe, David, and Wasim Al-Hamdani. "Retained-Key Encryption." International Journal of Interdisciplinary Telecommunications and Networking 5, no. 2 (April 2013): 1–17. http://dx.doi.org/10.4018/jitn.2013040101.

Full text

Abstract:

This paper presents a synchronous encryption key management model that does not require the sender to disclose the encryption key in order to effect decryption. This eliminates the need for key exchange mechanisms, giving the sender improved control over their keys. The retained-key model is presented as being a software application that handles the initiation of a secure communication channel between sender and receiver, and facilitates user authentication by a trusted third party—presumably, the software’s vendor. This model is not intended to replace public/private key-based mechanisms, as they serve an important role in message signing and authentication. Rather, it seeks to provide an alternative means of decrypting messages in a secure fashion while allowing the sender to avoid the need to disclose the message’s key.

APA, Harvard, Vancouver, ISO, and other styles

22

Rasmi AL-Mousa, Mohammad, Fadi Al-salameen, and Khaled Eisa Alqawasmi. "Using Encryption Square Keywith One-Dimensional Matrix for Enhancing RGB Color Image Encryption-Decryption." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 3 (March 1, 2018): 771. http://dx.doi.org/10.11591/ijeecs.v9.i3.pp771-777.

Full text

Abstract:

<p class="Affiliation">Recently, the security of digital images becomes an important issue with the rapid growth of digital communication and multimedia application. Recent cryptography algorithms are providing essential techniques to protect information and multimedia data. However, those algorithms are usually suffering from the problem of time-consuming. Encryption algorithms have been growth quickly and many image encryption methods have been used to protect information and multimedia data from unauthorized access. This research presents effective technique for image encryption which employs Red, Green and Blue (RGB) components of the RGB color image. The proposed technique utilizes matrix multiplication and inverse matrices for encryption-decryption purpose. Moreover, the effectiveness of the proposed encryption-decryption techniques lay on minimizing the encryption-decryption time and the square error between the original and the decrypted image. The evaluations of the proposed technique were done using many images with different sizes, while the ex perimental results show that the improved encryption technique time are greatly reduced compared with “RGB Color Image Encryption-Decryption Using Gray Image” method. The proposed technique has a high confidentiality level through using confusion diffusion sequentially with a square matrix key and two vectors keys. However, those keys are generated randomly and make the process of hacking the image very difficult.</p>

APA, Harvard, Vancouver, ISO, and other styles

23

Zhang, Xin He, and Guan Nan Liu. "Study on AES and its Efficient Implementation on STM32F103 Processor." Applied Mechanics and Materials 397-400 (September 2013): 1828–32. http://dx.doi.org/10.4028/www.scientific.net/amm.397-400.1828.

Full text

Abstract:

A optimized Rijndael algorithm which can execute effectively on STM32F103 processor is presented. Firstly, a theoretical analysis of the Rijndael algorithm and code optimization are carried out, and then simulation results of the optimized algorithm on stm32f103 processor are given. Subsequently, the conclusions as follow can be drawn. The cycles of key schedule for decryption are more than those for encryption. Key schedule for decryption demands larger memory than that for encryption. Decryption is slower than encryption. At last, the experiment shows that the algorithm can be executed on STM32F103 processor efficiently.

APA, Harvard, Vancouver, ISO, and other styles

24

Al-Dwairi, M. O., A. Y. Hendi, and Z. A. AlQadi. "An Efficient and Highly Secure Technique to Encrypt and Decrypt Color Images." Engineering, Technology & Applied Science Research 9, no. 3 (June 8, 2019): 4165–68. http://dx.doi.org/10.48084/etasr.2525.

Full text

Abstract:

Digital color images are considered as the most widely used data. They are exchanged frequently on the internet and via email, so an efficient and highly secure method of color image encryption and decryption is needed. Different methods of encryption-decryption are used, but most of them suffer from low efficiency or low-security level or both. In this paper, an efficient and highly secure method of encryption-decryption will be proposed, tested, and implemented. The efficiency parameters will be calculated and compared with other methods’ parameters to prove the efficiency of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

25

Darari, Radifan, Edi Winarko, and Auli Damayanti. "Encryption and Decryption Application on Images with Hybrid Algorithm Vigenere and RSA." Contemporary Mathematics and Applications (ConMathA) 2, no. 2 (December 15, 2020): 109. http://dx.doi.org/10.20473/conmatha.v2i2.23855.

Full text

Abstract:

Digital image is digital pictures on a two-dimensional plane which consists of pixels, where every pixels has Red, Green, Blue (RGB) with varying intensity depending on the image. In this thesis digital image is encrypted using hybrid algorithm Vigenere and RSA. Vigenere algorithm is a symmetric key algorithm which is a variety from Caesar algorithm where the similarity is in both of them are based on shifting the index of alphabet letters. RSA algorithm are based on the difficulty of factorizing large numbers that have 2 and only 2 factors (Prime numbers). The encryption process starts with getting the RGB intensity of each pixels from the image, then the RGB values are encrypted using Vigenere algorithm, after that RSA Algorithm encrypt those values, the values of RSA Algorithm encryption are limited so the value can be within the intervals of RGB values and the after limitation the values after being limited become the RGB values in the encrypted image. The decryption process is the inverse of encryption process, which enables the encrypted image to become the initial image before encryption. The program for encrypting and decrypting image are made using Java programming language with Netbeans IDE 8.2 software. The result of this implementation on image file donbass.jpg with the length of Vigenere key of 5 those are k1=144, k2=166 , k3=38 , k4=204 , k5=98, and RSA Algorithm keys are n=2201, e=1139, d=59, the results from the encrypted image is a visually very different image from the initial image. While in the decryption process, the encrypted image is able to be decrypted back to the initial image.

APA, Harvard, Vancouver, ISO, and other styles

26

Vilardy O., Juan M., Leiner Barba J., and Cesar O. Torres M. "Image Encryption and Decryption Systems Using the Jigsaw Transform and the Iterative Finite Field Cosine Transform." Photonics 6, no. 4 (November 26, 2019): 121. http://dx.doi.org/10.3390/photonics6040121.

Full text

Abstract:

We propose the use of the Jigsaw transform (JT) and the iterative cosine transform over a finite field in order to encrypt and decrypt images. The JT is a nonlinear operation that allows one to increase the security over the encrypted images by adding new keys to the encryption and decryption systems. The finite field is a finite set of integer numbers where the basic mathematical operations are performed using modular arithmetic. The finite field used in the encryption and decryption systems has an order given by the Fermat prime number 257. The iterative finite field cosine transform (FFCT) was used in our work with the purpose of obtaining images that had an uniform random distribution. We used a security key given by an image randomly generated and uniformly distributed. The JT and iterative FFCT was utilized twice in the encryption and decryption systems. The encrypted images presented a uniformly distributed histogram and the decrypted images were the same original images used as inputs in the encryption system. The resulting decrypted images had a high level of image quality in comparison to the image quality of the decrypted images obtained by the actual optical decryption systems. The proposed encryption and decryption systems have three security keys represented by two random permutations used in the JTs and one random image. The key space of the proposed encryption and decryption systems is larger. The previous features of the security system allow a better protection of the encrypted image against brute force and statistical analysis attacks.

APA, Harvard, Vancouver, ISO, and other styles

27

Zargar, Ansah Jeelani. "ENCRYPTION/DECRYPTION USING ELLIPTICAL CURVE CRYPTOGRAPHY." International Journal of Advanced Research in Computer Science 8, no. 7 (August 20, 2017): 48–51. http://dx.doi.org/10.26483/ijarcs.v8i7.4208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Chen, V. M., and P. J. Hogg. "Encryption and decryption of tissue factor." Journal of Thrombosis and Haemostasis 11 (June 2013): 277–84. http://dx.doi.org/10.1111/jth.12228.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Jyothi, P., D. Raghavaraju, and S. Vasundara. "Attribute based Encryption and Decryption Technique." International Journal of Computer Applications 132, no. 5 (December 17, 2015): 40–42. http://dx.doi.org/10.5120/ijca2015907369.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Chandkavathe, Vidyashri M., and Rashmi S. Bhaskar. "Optimized Full Parallelism AES Encryption / Decryption." International Journal of Electronics and Communication Engineering 3, no. 6 (June 25, 2016): 14–16. http://dx.doi.org/10.14445/23488549/ijece-v3i6p104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Mankar, Manisha. "Encryption and Decryption Using Rijndael Algorithm." International Journal on Recent and Innovation Trends in Computing and Communication 3, no. 4 (2015): 2326–29. http://dx.doi.org/10.17762/ijritcc2321-8169.1504119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Mohammed, Ali Abdulwahhab, and Haitham A. Anwer. "A New Method Encryption and Decryption." Webology 18, no. 1 (January 1, 2021): 20–31. http://dx.doi.org/10.14704/web/v18i1/web18002.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

33

Chowdhary, Chiranji Lal, Pushpam Virenbhai Patel, Krupal Jaysukhbhai Kathrotia, Muhammad Attique, Kumaresan Perumal, and Muhammad Fazal Ijaz. "Analytical Study of Hybrid Techniques for Image Encryption and Decryption." Sensors 20, no. 18 (September 10, 2020): 5162. http://dx.doi.org/10.3390/s20185162.

Full text

Abstract:

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

APA, Harvard, Vancouver, ISO, and other styles

34

Ma, Xiao Cong, Guang Hui Cai, Hong Chao Sun, and Hong Ye Li. "Design and Implementation of an Encryption/Decryption System Based on FPGA." Advanced Materials Research 1022 (August 2014): 368–71. http://dx.doi.org/10.4028/www.scientific.net/amr.1022.368.

Full text

Abstract:

This paper designs an encryption and decryption system based on the FPGA. The system uses AES algorithm to encrypt and decrypt data. A pipeline IP core is designed with the reconfigurable technology complying with the Avalon bus interface specification. The IP core is applied to be a custom component on Nios II architecture so that the encryption and decryption processes through hardware can be controlled by software. Finally, the program is downloaded to the Altera DE2 development board and completes the testing of encryption and decryption processes. The system can be widely implemented in the field of data security.

APA, Harvard, Vancouver, ISO, and other styles

35

Stoyanov, Borislav, and Gyurhan Nedzhibov. "Symmetric Key Encryption Based on Rotation-Translation Equation." Symmetry 12, no. 1 (January 2, 2020): 73. http://dx.doi.org/10.3390/sym12010073.

Full text

Abstract:

In this paper, an improved encryption algorithm based on numerical methods and rotation–translation equation is proposed. We develop the new encryption-decryption algorithm by using the concept of symmetric key instead of public key. Symmetric key algorithms use the same key for both encryption and decryption. Most symmetric key encryption algorithms use either block ciphers or stream ciphers. Our goal in this work is to improve an existing encryption algorithm by using a faster convergent iterative method, providing secure convergence of the corresponding numerical scheme, and improved security by a using rotation–translation formula.

APA, Harvard, Vancouver, ISO, and other styles

36

Sann, Zarni, Thi thi Soe, Kaythi Wyut Mhone Knin, and Zin May Win. "Performance Comparison of Asymmetric Cryptography (Case study- Mail message)." APTIKOM Journal on Computer Science and Information Technologies 4, no. 3 (November 1, 2019): 105–11. http://dx.doi.org/10.11591/aptikom.j.csit.147.

Full text

Abstract:

Encryption is a well known technology for protecting sensitive data. ElGamal encryption and RSA algorithm is made before storing mails to mail server. ElGamal decryption and RSA decryption is made after retrieving mails from mail server. This system is implemented to secure mail server system for local government’s important mail messages. These algorithms consume a considerable amount of time and resources such as memory, CPU time, and computation time to encrypt and decrypt data. In this paper, the results are comparison of these algorithms in term of encryption time, decryption time, and memory usage over variable file sizes. After processing, it is proven that RSA performs a faster encryption process than ElGamal. However, ElGamal decryption process is faster than RSA. This system is also expressed comparison of storage Size between RSA and ElGamal. Both of these algorithms are cryptographic public-key algorithms but have functions in different ways. This system is using C# programming language and SQL Server to store mail messages.

APA, Harvard, Vancouver, ISO, and other styles

37

Fan, Lin Na, and Jun Liu. "A New Mechanism of Database Encryption." Applied Mechanics and Materials 135-136 (October 2011): 87–91. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.87.

Full text

Abstract:

In order to improve the security of database system and resist threat from all aspects, especially the threat from database administrators, the paper designed a new database encryption system. In this system sensitive information is encrypted and establishes ciphertext address index table for it. Encryptions for character fields and numeric fields have different processing methods. Decryption key should be synthesized by both client and server. System can execute SQL query like equality queries, range queries and so on which are difficult to deal with after encryption. The analysis shows that the system has better security.

APA, Harvard, Vancouver, ISO, and other styles

38

Shahmohammadi Beni, Mehrdad, Hiroshi Watabe, and Kwan Ngok Yu. "SecureVision: An Open-Source User-Customizable Image Encryption Program." Applied Sciences 11, no. 17 (August 27, 2021): 7915. http://dx.doi.org/10.3390/app11177915.

Full text

Abstract:

Data security has become indispensable, with a view to keep sensitive information confidential. One important method is through image encryption, upon which features in an image would no longer be visible. The original image with its features could only be restored upon decryption using a set of keys. There are prestigious works in the literature regarding image encryption. However, there is a lack of easy-to-use, GUI-based, user-customizable computer programs for image encryption. In the present work, we developed a GUI-based image encryption and decryption program with server file transfer support, namely, SecureVision. A custom-made random number generator using the equation of an ellipse was developed to randomly shuffle the pixel positions. SecureVision was found to be robust, user-friendly and fast in both encryption and decryption. The program was highly sensitive to the supplied keys, which prevented brute-force attacks. SecureVision provided full user control, where users could modify the program modules to match their desired applications, which was particularly desirable for pedagogical purposes in that interested parties had the freedom to explore the concept of image encryption and decryption. SecureVision is distributed under a GPLv3 license, which would allow everyone to use, modify and distribute the program without any restriction.

APA, Harvard, Vancouver, ISO, and other styles

39

Tseng, Yi-Fan, Zi-Yuan Liu, and Raylin Tso. "Practical Inner Product Encryption with Constant Private Key." Applied Sciences 10, no. 23 (December 3, 2020): 8669. http://dx.doi.org/10.3390/app10238669.

Full text

Abstract:

Inner product encryption, first introduced by Katz et al., is a type of predicate encryption in which a ciphertext and a private key correspond to an attribute vector and a predicate vector, respectively. Only if the attribute and predicate vectors satisfy the inner product predicate will the decryption in this scheme be correct. In addition, the ability to use inner product encryption as an underlying building block to construct other useful cryptographic primitives has been demonstrated in the context of anonymous identity-based encryption and hidden vector encryption. However, the computing cost and communication cost of performing inner product encryption are very high at present. To resolve this problem, we introduce an efficient inner product encryption approach in this work. Specifically, the size of the private key is only one G element and one Zp element, and decryption requires only one pairing computation. The formal security proof and implementation result are also demonstrated. Compared with other state-of-the-art schemes, our scheme is the most efficient in terms of the number of pairing computations for decryption and the private key length.

APA, Harvard, Vancouver, ISO, and other styles

40

Gbaden, Terlumun. "A Chaos based image Encryption Scheme using one Dimensional Exponential Logistic Map." NIGERIAN ANNALS OF PURE AND APPLIED SCIENCES 1 (December 30, 2019): 223–37. http://dx.doi.org/10.46912/napas.125.

Full text

Abstract:

The widespread use of images in various sectors of life makes its protection increasingly necessary and important. An improvement over encryption and decryption algorithm using exponential logistic chaotic map was proposed. In this work, we adopt an encryption/decryption strategy for colour images using the exponential logistic chaotic map. The proposed encryption/decryption algorithms are implemented in MATLAB for computer simulation. The experimental results indicate that the proposed algorithms can be used successfully to encrypt/decrypt images with secret keys. The performance analysis using histogram uniformity analysis and correlation coefficient show that the algorithms give larger space, quick speed and easy to realize. The encrypted images have good encryption effect and low correlation coefficient rendering it a good candidate for confidential and secure means of transmitting image information in untrusted networks.

APA, Harvard, Vancouver, ISO, and other styles

41

Aliev, F. K., A. V. Korolkov, E. A. Matveev, and I. A. Sheremet. "On the Sensitivity of the Gamma of the Quantum Cryptographic System AKM2017 to Changes in the Session Key." Programmnaya Ingeneria 12, no. 4 (July 14, 2021): 179–88. http://dx.doi.org/10.17587/prin.12.179-188.

Full text

Abstract:

The quantum cryptographic system AKM2017 is considered. The results of the analysis of the dependence of the degree of difference between the encryption and decryption gamut on the degree of difference between the corresponding session keys are presented. The equality of these degrees of distinction is revealed and substantiated. For an arbitrarily fixed encryption session key, the distribution of session decryption keys by classes is revealed and described, depending on the value of the degree of difference between the encryption and decryption gamuts. One class is made up of all session decryption keys, leading to the same value of the degree of difference between the encryption and decryption gamuts. A geometric interpretation of the specified distribution by classes is given in the form of placement along circles (class is a circle) on the surface of a sphere of unit radius centered at the origin of the Euclidean rectangular coordinate system in a three-dimensional linear space over the field of real numbers. The stated results can be used to solve the problems of optimizing the values of the parameters of accuracy and reliability of the functioning of variants of practical implementations of the quantum cryptographic system AKM2017, for example, when setting up a session decryption key, which makes it possible to guarantee a predetermined small value of the mathematical expectation of the number of incorrectly decrypted binary plain text.

APA, Harvard, Vancouver, ISO, and other styles

42

Shen, Yu Fen. "The Implementation of Anti-Attack AES Mathematical Model in Library Network Encryption." Advanced Materials Research 756-759 (September 2013): 2944–47. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2944.

Full text

Abstract:

With the continuous improvement of university library network safety requirements, this paper studies encryption and decryption algorithm analyzing advanced encryption standard AES of the computer, substitution and replacement operation in encryption and decryption process, and key expansion mathematical model. The detailed design of the mathematical modeling process of the algorithm is given, and the whole mathematical modeling process is more thoroughly analyzed. According to the model, library network encryption application is completed. Verified by computer simulation technology, the mathematical model has a good robustness and achieved good results.

APA, Harvard, Vancouver, ISO, and other styles

43

Fagin, Barry. "Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p." Information 9, no. 9 (August 28, 2018): 216. http://dx.doi.org/10.3390/info9090216.

Full text

Abstract:

RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e and d. In some cases, specific ( s , r ) pairs can be found for which encryption and decryption will be correct for any ( e , d ) exponent pair. Certain s exist, however, for which encryption and decryption are correct for any odd prime r ∤ s . We give necessary and sufficient conditions for s with this property.

APA, Harvard, Vancouver, ISO, and other styles

44

Kihara, Maki, and Satoshi Iriyama. "New Authentication Algorithm Based on Verifiable Encryption with Digital Identity." Cryptography 3, no. 3 (July 29, 2019): 19. http://dx.doi.org/10.3390/cryptography3030019.

Full text

Abstract:

We propose a new authentication algorithm for small internet of things (IoT) devices without key distribution and secure servers. Encrypted private data are stored on the cloud server in the registration step and compared with incoming encrypted data without decryption in the verification step. We call a set of encryptions that can verify two encrypted data items without decryption a verifiable encryption (VE). In this paper, we define VE, and claim that several cryptosystems belong to the VE class. Moreover, we introduce an authentication algorithm based on VE, and show an example of the algorithm and discuss its performance and security. As the algorithm neither shares any secret keys nor decrypts, its computation time becomes very small.

APA, Harvard, Vancouver, ISO, and other styles

45

Flynn, Sofia. "An Investigation Into the Mathematics of Decryption Techniques in RSA Encryption, With an Implementation in Python." Spring 2021, no. 2 (July 31, 2021): 6–18. http://dx.doi.org/10.48091/gsr.v1i2.18.

Full text

Abstract:

This study explores the mathematics of two different techniques that can be used to access the decryption key in RSA encryption including semi-prime factorization and a logarithmic method. The study then presents a Python program, written by the author, that automates the calculations for either of the decryption techniques and also calculates the number of iterations required to determine the decryption key in either circumstance. Most importantly, the program utilizes only values of the RSA encryption algorithm that would be made publicly available in actual circumstances to calculate the decryption key so as to mimic real-life occurrences with as much integrity and accuracy as possible.

APA, Harvard, Vancouver, ISO, and other styles

46

Chen, Baoju, Simin Yu, Ping Chen, Liangshan Xiao, and Jinhu Lü. "Design and Virtex-7-Based Implementation of Video Chaotic Secure Communications." International Journal of Bifurcation and Chaos 30, no. 05 (April 2020): 2050075. http://dx.doi.org/10.1142/s0218127420500753.

Full text

Abstract:

In this paper, a Virtex-7-based video chaotic secure communication scheme is investigated. First, the network sending and receiving controller Intellectual Property (IP) cores are designed. Next, the chaotic encryption and decryption IP cores are implemented using fixed-point algorithm, pipeline operation, and state machine control. Thus, video capturing, video displaying, network sending, network receiving, chaotic encrypting, and chaotic decrypting can be achieved via IP core integration design. An improved 7D chaotic stream cipher algorithm for resisting divide-and-conquer attack is then designed and realized on a Virtex-7 high-end FPGA platform. Hardware experimental results are also given to verify the feasibility of the scheme.

APA, Harvard, Vancouver, ISO, and other styles

47

Liu, Bao Long, Hua Chen, and Yi Guo. "Encrypted XML Data Query Processing with Range Query." Applied Mechanics and Materials 65 (June 2011): 241–45. http://dx.doi.org/10.4028/www.scientific.net/amm.65.241.

Full text

Abstract:

Without decrypting the encrypted blocks, it is difficult to query encrypted XML data. Inspired by Query-Aware decryption scheme, the paper extends the scheme to support range query with value index. Value index is based on order preserving encryption. The testing results indicate that the proposed scheme can complete a correct query processing, and support range query.

APA, Harvard, Vancouver, ISO, and other styles

48

Sann, Zarni, Thi Thi Soe, Kaythi Wyut Mhone Knin, and Zin May Win. "Performance comparison of asymmetric cryptography (case study-mail message)." APTIKOM Journal on Computer Science and Information Technologies 4, no. 3 (January 27, 2020): 105–11. http://dx.doi.org/10.34306/csit.v4i3.98.

Full text

Abstract:

Data encryption is well known as essential for today’s technology. ElGamal encryption and RSA algorithmis made before storing mails to mail server. ElGamal decryption and RSA decryption is made after retrieving mailsfrom mail server. This system is implemented to secure mail server system for local government’s important mailmessages. These algorithms consume a considerable amount of time and resources of memory, CPU time, andcomputation time to encrypt and decrypt data. This paper discuss the results comparison of these algorithms in termof encryption time, decryption time, and memory usage over variable file sizes. The results show that RSA does fasterencryption process in compare with ElGamal. However, ElGamal decryption process is quicker than RSA. This systemis also expressed comparison of storage Size between RSA and ElGamal. Both of these algorithms are cryptographicpublic-key algorithms but have roles in different techniques. This system is using C# programming language and SQLServer to store mail messages.

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Huai Sheng. "A No Interference Optical Image Encryption by a Fresnel Diffraction and a Fourier Transformation." Advanced Materials Research 459 (January 2012): 461–64. http://dx.doi.org/10.4028/www.scientific.net/amr.459.461.

Full text

Abstract:

A no interference optical image encryption is put forward in this paper. The encrypting process is composed of a Fresnel diffraction and a Fourier transformation. A digital image coded with a random phase plate first takes a Fresnel diffraction. The diffraction function is enlarged and coded with another random phase mask. At last the enlarged function undergoes a Fourier transformation. The real part of the transformed function is defined as an encrypted image. In decrypting process, first the encrypted image takes an inverse Fourier transformation. Then the upper left corner of the transformed function is intercepted. According to the space inversion of the transformed function, if the intercepted function takes an inverse Fresnel diffraction, the original digital image can be restored from the final diffraction function. Because there is no interference process in encryption and decryption, the optical system is relatively simple and the quality of restored image is very good

APA, Harvard, Vancouver, ISO, and other styles

50

Li, You Guo. "Improved RSA Algorithm in Hardware Encryption." Applied Mechanics and Materials 543-547 (March 2014): 3610–13. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3610.

Full text

Abstract:

Montgomery algorithm will die N operation into shift operation, optimized Systolic array with fewer resources to achieve efficient Montgomery algorithm, and the application of power conversion technology to further improve the RSA encryption,decryption speed. In order to make full use of FPGA resources, this paper analyzes the impact of the Systolic array at different levels of granularity on the performance of the system, and gives the realization and S = key and encryption,decryption information are RSA encryption system of s hardware 1024 time results.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!