Relevant bibliographies by topics / RSA algorithm / Journal articles
To see the other types of publications on this topic, follow the link: RSA algorithm.

Journal articles on the topic 'RSA algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 May 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 'RSA algorithm.'

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

Aminudin and Ilyas Nuryasin. "Analisis dan Implementasi Algoritma Asimetris Dual Modulus RSA (DM-RSA) pada Aplikasi Chat." Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) 5, no. 4 (August 25, 2021): 768–73. http://dx.doi.org/10.29207/resti.v5i4.3297.

Full text
Abstract:
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).
APA, Harvard, Vancouver, ISO, and other styles
2

Kuljanski, Sonja. "RSA algorithm." Vojnotehnicki glasnik 58, no. 3 (2010): 65–77. http://dx.doi.org/10.5937/vojtehg1003065k.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zajac, Bernard. "RSA algorithm factored." Computer Fraud & Security Bulletin 1994, no. 6 (June 1994): 2. http://dx.doi.org/10.1016/0142-0496(94)90109-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bahjat Abdulrazzaq, Maiwan. "Selective Multi Keys to Modify RSA Algorithm." Journal of Zankoy Sulaimani - Part A 21, no. 1 (June 20, 2019): 99–106. http://dx.doi.org/10.17656/jzs.10748.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alguraby, Atyaf, and Mohammed Joudah Zaiter. "MULTI KEY ALGORITHM FOR SECURITY ENHANCEMENT OF RSA ALGORITHM USING MATLAB." Iraqi Journal of Information & Communications Technology 3, no. 1 (April 11, 2020): 1–10. http://dx.doi.org/10.31987/ijict.3.1.90.

Full text
Abstract:
In this paper, a new technique is deployed to afford a strong secure algorithm based on dynamic keys strategy. The objective of this technique is to provide confidentiality and authentication of data between any partners. The proposed technique takes Multiple keys pair(Public and Private) with RSA algorithm that used fast expansion to enhancement the speed of RSA. Simulation results have been achieved using MATLAB R2014a; Single Key RSA (SK-RSA) and proposed Multi Keys RSA (MK-RSA) are compared analysis is made on execution time. Hence, deploying the MK-RSA algorithm is proving more secure than SK-RSA algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Shin, Seung-Hyeok, Won-Sok Yoo, and Hojong Choi. "Development of Public Key Cryptographic Algorithm Using Matrix Pattern for Tele-Ultrasound Applications." Mathematics 7, no. 8 (August 17, 2019): 752. http://dx.doi.org/10.3390/math7080752.

Full text
Abstract:
A novel public key cryptographic algorithm using a matrix pattern is developed to improve encrypting strength. Compared to the Rivest–Sharmir–Adleman (RSA) and Elliptic Curve Cryptography (ECC) algorithms, our proposed algorithm has superior encrypting strength due to several unknown quantities and one additional sub-equation during the encrypting process. Our proposed algorithm also provides a faster encoding/decoding speed when the patient’s images for tele-ultrasound applications are transmitted/received, compared to the RSA and ECC encrypting algorithms, because it encodes/decodes the plain memory block by simple addition and multiplication operations of n terms. However, the RSA and ECC algorithms encode/decode each memory block using complex mathematical exponentiation and congruence. To implement encrypting algorithms for tele-ultrasound applications, a streaming server was constructed to transmit the images to the systems using ultrasound machines. Using the obtained ultrasound images from a breast phantom, we compared our developed algorithm, utilizing a matrix pattern, with the RSA and ECC algorithms. The elapsed average time for our proposed algorithm is much faster than that for the RSA and ECC algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

Wibowo, Nur Cayo Hendro, Khotibul Umam, Albadru Muh Izul Khaq, and Favian Agung Rizki. "Komparasi Waktu Algoritma RSA dengan RSA-CRT Base On Computer." Walisongo Journal of Information Technology 2, no. 1 (June 17, 2020): 13. http://dx.doi.org/10.21580/wjit.2020.2.1.5402.

Full text
Abstract:
<p align="center"><em>Cryptography is a branch of mathematics. Asymmetric algorithms such as RSA, including the type of cryptography that is more widely used to be implemented in everyday life because it has an algorithm that is not easy to be misused by others. However, the encryption and decryption process of RSA requires quite a long time. For this reason, RSA - CRT emerged. In this study a time comparison between the RSA algorithm and the RSA-CRT Base On Computer is done. The purpose of this study was to determine the execution time of the RSA-CRT algorithm using PHP.</em></p><p><em>This research uses the Research and Development or R&amp;D method, with the R&amp;D method created by the product development RSA-CRT algorithm application from UIN Walisongo Semarang based on computer. Based on the data analysis, the conclusion is that although the manual calculation of the RSA-CRT algorithm takes longer than the others in this case RSA. But have a faster time when using PHP.</em></p><p align="center"> </p>
APA, Harvard, Vancouver, ISO, and other styles
8

Skobic, Velibor, Branko Dokic, and Zeljko Ivanovic. "Hardware modules of the RSA algorithm." Serbian Journal of Electrical Engineering 11, no. 1 (2014): 121–31. http://dx.doi.org/10.2298/sjee140114011s.

Full text
Abstract:
This paper describes basic principles of data protection using the RSA algorithm, as well as algorithms for its calculation. The RSA algorithm is implemented on FPGA integrated circuit EP4CE115F29C7, family Cyclone IV, Altera. Four modules of Montgomery algorithm are designed using VHDL. Synthesis and simulation are done using Quartus II software and ModelSim. The modules are analyzed for different key lengths (16 to 1024) in terms of the number of logic elements, the maximum frequency and speed.
APA, Harvard, Vancouver, ISO, and other styles
9

Rachmawati, Dian, Mohammad Andri Budiman, and William Andrei. "Comparison Of RSA Algorithm & Hybrid RSA-OTP Algorithm For Image Security." Journal of Physics: Conference Series 1235 (June 2019): 012076. http://dx.doi.org/10.1088/1742-6596/1235/1/012076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Et.al, R. Felista Sugirtha Lizy. "Image Encryption Using RK-RSA Algorithm in Aadhaar Card." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 10, 2021): 4683–93. http://dx.doi.org/10.17762/turcomat.v12i3.1887.

Full text
Abstract:
Cryptography is used for secretly sending information. The information or given data is protected by cryptographic technique. The technique is used in Text and images. The technique is supported by a lot of algorithms. RSA is a better encryption technique for smart cards. In this paper, an image in the Aadhaar card is encrypted using the RK-RSA algorithm for better protection and confidentiality. The proposed RK-RSA algorithm is very secure for smart cards and Aadhaar cards. The better performance of the RK-RSA is evaluated based on the Avalanche Effect, Speed, Throughput, and Power Consumption. The improved performance of the RK-RSA algorithm’s experimental results is reported. The mathematical justification supporting the RK-RSA algorithm is also detailed.
APA, Harvard, Vancouver, ISO, and other styles
11

Ihwani, Mohamad. "INFORMATION SECURITY MODEL BASED DIGITAL SIGNATURE ALGORITHM WITH RSA ALGORITHM." Computer Engineering, Science and System Journal 1, no. 1 (January 31, 2016): 15–20. http://dx.doi.org/10.24114/cess.v1i1.4037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Dr Asha Ambhaikar, Mr Abhishek Guru,. "AES AND RSA-BASED HYBRID ALGORITHMS FOR MESSAGE ENCRYPTION & DECRYPTION." INFORMATION TECHNOLOGY IN INDUSTRY 9, no. 1 (March 1, 2021): 273–79. http://dx.doi.org/10.17762/itii.v9i1.129.

Full text
Abstract:
File encryption is an easy means of securing personal or business data protection. The RSA and AES representative encryption algorithms are not capable of satisfying the criteria of file encryption reliability and security when used separately. A hybrid encryption algorithm mixing AES and RSA algorithms is suggested in this paper to overcome the above issues in order to solve file encryption performance and security problems. The experimental results suggest that the RSA and AES hybrid encryption algorithm can not only encrypt files, but also provide the benefits of efficiency and protection of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
13

Aditya, Gadhing Putra, Aminuddin Aminuddin, and Sofyan Arifianto. "Improvisasi Algoritma RSA Menggunakan Generate Key ESRKGS pada Instant Messaging Berbasis Socket TCP." Jurnal Repositor 2, no. 11 (December 4, 2020): 1444. http://dx.doi.org/10.22219/repositor.v2i11.731.

Full text
Abstract:
AbstrakSocket TCP adalah abstraksi yang digunakan aplikasi untuk mengirim dan menerima data melalui koneksi antar dua host dalam jaringan komputer. Jaringan yang biasa kita gunakan bersifat publik yang sangat rentan akan penyadapan data. Masalah ini dapat teratasi dengan menggunakan algoritma kriptografi pada socket TCP, salah satunya menggunakan algoritma RSA. Tingkat keamanan algoritma RSA standar memiliki celah keamanan pada kunci publik ataupun privat yang berasal dari inputan 2 bilangan prima saat pembangkitan kunci, begitupun dengan algoritma improvisasi RSA meskipun menggunakan 4 bilangan prima akan tetapi mulai dari pembangkitan kunci hingga dekripsi memiliki proses yang sama persis dengan RSA standar sehingga tingkat keamanan dari kedua algoritma tersebut sama – sama kurang aman meskipun jumlah bilangan prima dari algoritma improvisasi RSA lebih banyak dari RSA standar. Peningkatan keamanan dapat dilakukan dengan memodifikasi algoritma RSA dengan menggunakan ESRKGS (Enhanced and Secured RSA Key Generation Scheme). ESRKGS RSA memiliki kelebihan yang utama pada segi keamanannya. ESRKGS RSA secara total memodifikasi algoritma RSA terutama pada bagian pembangkitan kunci dan diklaim mempunyai performa lebih cepat dari algoritma improvisasi RSA yang sama – sama menggunakan 4 bilangan prima dan tentunya lebih aman dari serangan known plaintext attack dan fermat factorization attack yang akan penulis gunakan untuk pengujian keamanan pada penelitian ini. Hasil pengujian performa waktu pembangkitan kunci dengan panjang bit 256 bit, 512 bit, dan 1024 bit serta untuk proses enkripsi dan dekripsi panjang karakter yang digunakan adalah 100, 250, dan 400 menunjukkan bahwa algoritma ESRKGS RSA lebih baik dibandingkan algoritma improvisasi RSA. Pengujian kemanan menggunakan known plaintext attack dan fermat factorization attack menunjukkan bahwa algoritma ESRKGS RSA lebih baik dibandingkan algoritma RSA standar dan improvisasi RSA. Abstract TCP sockets are abstractions that applications use to send and receive data through connections between two hosts in a computer network. The networks that we usually use are public and are very vulnerable to data tapping. This problem can be overcome by using a cryptographic algorithm on the TCP socket, one of which uses the RSA algorithm. The security level of the standard RSA algorithm has security gaps on public or private keys originating from the input of 2 primes during key generation, as well as the RSA improvisation algorithm even though using 4 prime numbers but starting from generating key to decryption has the exact same process as the standard RSA so the security level of the two algorithms is equally less safe even though the number of prime numbers of the RSA improvisation algorithm is more than the standard RSA. Improved security can be done by modifying the RSA algorithm by using ESRKGS (Enhanced and Secured RSA Key Generation Scheme). RSA ESRKGS has the main advantages in terms of safety. ESRKGS RSA totally modified the RSA algorithm, especially in the key generation section and claimed to have faster performance than the RSA improvisation algorithm that both use 4 prime numbers and is certainly safer from known plaintext attacks and fermat factorization attacks that the authors will use for security testing. in this research. The results of the key generation time performance test with 256 bit length, 512 bit, and 1024 bit and for the encryption and decryption process the length of characters used is 100, 250, and 400 shows that the RSA ESRKGS algorithm is better than the RSA improvisation algorithm. Security testing using known plaintext attacks and fermat factorization attacks shows that the RSA ESRKGS algorithm is better than the standard RSA algorithm and RSA improvisation.
APA, Harvard, Vancouver, ISO, and other styles
14

Obaid, Taleb Samad. "Study A Public Key in RSA Algorithm." European Journal of Engineering Research and Science 5, no. 4 (April 1, 2020): 395–98. http://dx.doi.org/10.24018/ejers.2020.5.4.1843.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
15

Obaid, Taleb Samad. "Study A Public Key in RSA Algorithm." European Journal of Engineering and Technology Research 5, no. 4 (April 1, 2020): 395–98. http://dx.doi.org/10.24018/ejeng.2020.5.4.1843.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
16

Et.al, R. Felista Sugirtha Lizy. "Improvement of RSA Algorithm Using Euclidean Technique." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 10, 2021): 4694–700. http://dx.doi.org/10.17762/turcomat.v12i3.1889.

Full text
Abstract:
Information Security has become an essential concern in the modern world. Encryption is an effective way to prevent an unofficial person from viewing the digital information with the secret key. RSA encryption is often used for digital signatures which can prove the authenticity and reliability of a message. As RSA encryption is less competent and resource-heavy, it is not used to encrypt the entire message. If a message is encrypted with a symmetric-key RSA encryption it will be more efficient. Under this process, only the RSA private key will be able to decrypt the symmetric key. The Euclidean algorithm is attainably one of the most extensively known algorithms. The Euclidean algorithm is used for finding the greatest common divisor of two numbers. The algorithm can also be defined for more general rings than just the integers. This work is very useful to improve the data security in Smart card and Aadhaar card. In this paper, the RSA algorithm is modified using the Euclidean technique to improve its performance. The proposed algorithm shows its better performance in terms of speed, throughput, power consumption, and the avalanche effect. Experimental results and mathematical justification supporting the proposed method are reported.
APA, Harvard, Vancouver, ISO, and other styles
17

Falah Hameed Al Saffar, Najlae. "Steganography Algorithm Based RSA Cryptosystem." Journal of Engineering and Applied Sciences 14, no. 7 (December 31, 2019): 2240–43. http://dx.doi.org/10.36478/jeasci.2019.2240.2243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Jones, Josh. "The RSA algorithm (abstract only)." ACM Communications in Computer Algebra 42, no. 1-2 (July 25, 2008): 74. http://dx.doi.org/10.1145/1394042.1394084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

He, Shufang, Yang Qiu, and Jing Xu. "Invalid-Resource-Aware Spectrum Assignment for Advanced-Reservation Traffic in Elastic Optical Network." Sensors 20, no. 15 (July 28, 2020): 4190. http://dx.doi.org/10.3390/s20154190.

Full text
Abstract:
Elastic optical networks (EONs) can make service accommodation more flexible and precise by employing efficient routing and spectrum allocation (RSA) algorithms. In order to improve the efficiency of RSA algorithms, the advanced-reservation technique was introduced into designing RSA algorithms. However, few of these advanced-reservation-based RSA algorithms were focused on the unavailable spectrum resources in EONs. In this paper, we propose an Advanced-Reservation-based Invalid-Spectrum-Aware (AR-ISA) resource allocation algorithm to improve the networking performance and the resource alignment of EONs. By employing a new index, Invalid Spectrum Rate (ISR), to record the proportion of unavailable spectrum resources in EONs, the proposed AR-ISA algorithm set a network load threshold to trigger the postponement of an arriving service. Compared with the traditional slack-based AR mechanism, the proposed algorithm has more concerns about the current spectrum usage of the path designated by the service than the conflicts between AR services and other existing services. To further increase the networking performance, the proposed algorithm adopts defragmentation to increase the number of available spectrum resources when postponing a service. Theoretical analysis and simulation results show that the proposed AR-ISA algorithm has obvious effectiveness in reducing the service blocking rate and increasing the spectrum alignment rate.
APA, Harvard, Vancouver, ISO, and other styles
20

Markelova, A. V. "Kleptographic (algorithmic) backdoors in the RSA key generator." Prikladnaya Diskretnaya Matematika, no. 55 (2022): 14–34. http://dx.doi.org/10.17223/20710410/55/2.

Full text
Abstract:
The main types of algorithmic bookmarks are considered. A method for constructing asymmetric kleptographic bookmarks in the RSA key generator is presented, which allows the owner of the bookmark key (the developer or an authorized intelligence agency) to access a user key generated by an infected algorithm. Theorems illustrating the performance of the described algorithms are formulated, and the computational complexity of these algorithms is estimated. The resistance of the built tabs to some classes of attacks is demonstrated even if the adversary knows the methods used and has access to the source code of the key generator.
APA, Harvard, Vancouver, ISO, and other styles
21

Baek, Yoo-Jin. "Key Recovery Algorithm from Randomly-Given Bits of Multi-Prime RSA and Prime Power RSA." Journal of the Korea Institute of Information Security and Cryptology 26, no. 6 (December 31, 2016): 1401–11. http://dx.doi.org/10.13089/jkiisc.2016.26.6.1401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

M. Abd Zaid, Mustafa, and Dr Soukaena Hassan. "Lightweight Rsa Algorithm Using Three Prime Numbers." International Journal of Engineering & Technology 7, no. 4.36 (December 9, 2018): 293. http://dx.doi.org/10.14419/ijet.v7i4.36.23790.

Full text
Abstract:
The computing devices utilized as a part of an extensive class of remote correspondence systems, for example, cell phones, remote sensor systems (WSNs), vehicular ad hoc networks (VANETs), mobile ad hoc networks (MANETs), Internet of Things (IoT), body area networks (BANs) and so on, are little and asset compelled. In the current developments of the resource constraint environments, the trend is shifted towards lightweight cryptographic algorithm. Many lightweight cryptographic algorithms have been developed and also existed algorithms are modified in terms of resource constraint environments. One of such new procedures is utilizing three prime numbers for RSA cryptosystem, which is not easily breakable. Our approach using three prime number rather than two prime-dependent systems to get (n) with same length of standard RSA but less bits for prime numbers. The suggested algorithm has speed enhancement on standard RSA key generation side and decryption side by utilizing three primes and the Chinese Reminder Theorem (CRT). The results indicate that the average of speed improvement is ~80% in key generation process, ~96% in decryption process, and only 4% in the encryption process.
APA, Harvard, Vancouver, ISO, and other styles
23

Mohit, Prerna, and G. P. Biswas. "Modification of Traditional RSA into Symmetric-RSA Cryptosystems." International Journal of Business Data Communications and Networking 13, no. 1 (January 2017): 66–73. http://dx.doi.org/10.4018/ijbdcn.2017010106.

Full text
Abstract:
This paper addresses the modification of RSA cryptography namely Symmetric-RSA, which seem to be equally useful for different cryptographic applications such as encryption, digital signature, etc. In order to design Symmetric-RSA, two prime numbers are negotiated using Diffie-Hellman key exchange protocol followed by RSA algorithm. As the new scheme uses Diffie-Hellman and RSA algorithm, the security of the overall system depends on discrete logarithm as well as factorization problem and thus, its security is more than public-key RSA. Finally, some new cryptographic applications of the proposed modifications are described that certainly extend the applications of the existing RSA.
APA, Harvard, Vancouver, ISO, and other styles
24

Laurentinus, Laurentinus, Harrizki Arie Pradana, Dwi Yuny Sylfania, and Fransiskus Panca Juniawan. "Performance comparison of RSA and AES to SMS messages compression using Huffman algorithm." Jurnal Teknologi dan Sistem Komputer 8, no. 3 (April 19, 2020): 171–77. http://dx.doi.org/10.14710/jtsiskom.2020.13468.

Full text
Abstract:
Improved security of short message services (SMS) can be obtained using cryptographic methods, both symmetric and asymmetric, but must remain efficient. This paper aims to study the performance and efficiency of the symmetric crypto of AES-128 and asymmetric crypto of RSA with message compression in securing SMS messages. The ciphertext of RSA and AES were compressed using the Huffman algorithm. The average AES encryption time for each character is faster than RSA, which is 5.8 and 24.7 ms/character for AES and AES+Huffman encryption and 8.7 and 45.8 ms/character for RSA and RSA+Huffman, from messages with 15, 30, 60 and 90 characters. AES decryption time is also faster, which is 27.2 ms/character compared to 47.6 ms/character in RSA. Huffman compression produces an average efficiency of 24.8 % for the RSA algorithm, better than 17.35 % of AES efficiency for plaintext of 1, 16, 45, and 88 characters.
APA, Harvard, Vancouver, ISO, and other styles
25

Aini, Fifin Nur, Siti Amiroch, and Novita Eka Chandra. "Penggunaan Algoritma Vigenere Cipher dan RSA (Rivest-Shamir-Adleman) Untuk Keamanan Data Pembelian di PT Lamongan Marine Industry." Unisda Journal of Mathematics and Computer Science (UJMC) 6, no. 01 (June 30, 2020): 39–46. http://dx.doi.org/10.52166/ujmc.v6i01.2386.

Full text
Abstract:
Purchasing data is very important for business actors because the data is very influential on companies, especially in the field of production and marketing. Therefore, the purchase data is one of the things that is kept secret by the business actors, such as PT Lamongan Marine Industry. With current technology hackers can easily hack such data, so the use of cryptography is a very appropriate solution to this problem. In this study the authors used the Vigenere Cipher algorithm and the RSA algorithm with a high security key. The hacker was not easy to find out the contents of the data. The data obtained is a purchase order, then presented in tabular form. The data is then encrypted and decrypted so that the comparison of the two algorithms is known. The results of the analysis state that the Vigenere Cipher algorithm is more effective in both encryption and decryption processing time. Ciphertext generated from the encryption process of the Vigenere Cipher algorithm is mostly in the form of punctuation, while the ciphertext generated by the RSA algorithm from the encryption process is mostly in alphabetical letters. The ciphertext generated by the RSA algorithm depends on the value of the modulo. but in terms of security the RSA algorithm is superior to the Vigenere Cipher algorithm.
APA, Harvard, Vancouver, ISO, and other styles
26

Thomas, Ambili, and V. Lakshmi Narasimhan. "Symmetric and Asymmetric Encryption Algorithm Modeling on CPU Execution Time as Employed Over a Mobile Environment." International Journal of Natural Computing Research 10, no. 2 (April 2021): 21–41. http://dx.doi.org/10.4018/ijncr.2021040102.

Full text
Abstract:
This paper presents results on modelling of AES and RSA encryption algorithms in terms of CPU execution time, considering different modelling techniques such as linear, quadratic, cubic, and exponential mathematical models, each with the application of piecewise approximations. C#.net framework is used to implement this study. The authors consider the symmetric encryption algorithm named AES and the asymmetric encryption algorithm named RSA to carry out this study. This study recommends quadratic piecewise approximation modelling as the most optimized model for modelling the CPU execution time of AES and RSA towards encryption of data files. The model proposed in this study can be extended to other symmetric and asymmetric encryption algorithms, besides taking them over a mobile cloud environment.
APA, Harvard, Vancouver, ISO, and other styles
27

Li, Zixiang, Mukund Nilakantan Janardhanan, Peter Nielsen, and Qiuhua Tang. "Mathematical models and simulated annealing algorithms for the robotic assembly line balancing problem." Assembly Automation 38, no. 4 (September 3, 2018): 420–36. http://dx.doi.org/10.1108/aa-09-2017-115.

Full text
Abstract:
Purpose Robots are used in assembly lines because of their higher flexibility and lower costs. The purpose of this paper is to develop mathematical models and simulated annealing algorithms to solve the robotic assembly line balancing (RALB-II) to minimize the cycle time. Design/methodology/approach Four mixed-integer linear programming models are developed and encoded in CPLEX solver to find optimal solutions for small-sized problem instances. Two simulated annealing algorithms, original simulated annealing algorithm and restarted simulated annealing (RSA) algorithm, are proposed to tackle large-sized problems. The restart mechanism in the RSA methodology replaces the incumbent temperature with a new temperature. In addition, the proposed methods use iterative mechanisms for updating cycle time and a new objective to select the solution with fewer critical workstations. Findings The comparative study among the tested algorithms and other methods adapted verifies the effectiveness of the proposed methods. The results obtained by these algorithms on the benchmark instances show that 23 new upper bounds out of 32 tested cases are achieved. The RSA algorithm ranks first among the algorithms in the number of updated upper bounds. Originality/value Four models are developed for RALBP-II and their performance is evaluated for the first time. An RSA algorithm is developed to solve RALBP-II, where the restart mechanism is developed to replace the incumbent temperature with a new temperature. The proposed methods also use iterative mechanisms and a new objective to select the solution with fewer critical workstations.
APA, Harvard, Vancouver, ISO, and other styles
28

Madras, Neal, and Zhongrong Zheng. "On the swapping algorithm." Random Structures and Algorithms 22, no. 1 (November 18, 2002): 66–97. http://dx.doi.org/10.1002/rsa.10066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Nazal, Muhammad Asghar, Reza Pulungan, and Mardhani Riasetiawan. "Data Integrity and Security using Keccak and Digital Signature Algorithm (DSA)." IJCCS (Indonesian Journal of Computing and Cybernetics Systems) 13, no. 3 (July 31, 2019): 273. http://dx.doi.org/10.22146/ijccs.47267.

Full text
Abstract:
Data security is a very important compilation using cloud computing; one of the research that is running and using cloud technology as a means of storage is G-Connect. One of the developments made by the G-Connect project is about data security; most of the problems verification of the data sent. In previous studies, Keccak and RSA algorithms have implemented for data verification needs. But after a literature study of other algorithms that can make digital signatures, we found what is meant by an algorithm that is better than RSA in rectangular speeds, namely Digital Signature Algorithm (DSA).DSA is one of the key algorithms used for digital signatures, but because DSA still uses Secure Hash Algorithm (SHA-1) as an algorithm for hashes, DSA rarely used for data security purposes, so Keccak is used instead of the hash algorithm on DSA. Now, Keccak become the standard for the new SHA-3 hash function algorithm. Because of the above problems, the focus of this research is about data verification using Keccak and DSA. The results of the research are proven that Keccak can run on DSA work system, obtained a comparison of execution time process between DSA and RSA where both use Keccak.
APA, Harvard, Vancouver, ISO, and other styles
30

Hussain, Md Equebal, and Mohammad Rashid Hussain. "Securing Cloud Data using RSA Algorithm." International Journal of Recent Contributions from Engineering, Science & IT (iJES) 6, no. 4 (December 19, 2018): 96. http://dx.doi.org/10.3991/ijes.v6i4.9910.

Full text
Abstract:
security is one of the most important concern on cloud computing therefore institutions are hesitating to host their data over cloud. Not all data can be afforded to move on the cloud (example accounts data). The main purpose of moving data over cloud is to reduce cost (infrastructure and maintenance), faster performance, easy upgrade, storage capacity but at the same time security is major concern because cloud is not private but maintained by third party over the internet, security issues like privacy, confidentiality, authorization (what you are allowed to do), authentication (who you are) and accounting (what you actually do) will be encountered. Variety of encryption algorithms required for higher level of security. In this paper we try to provide solution for better security by proposing a combined method of key exchange algorithm with encryption technique. Data stored in cloud can be protected from hackers using proposed solution because even if transmitted key is hacked of no use without user’s private key.
APA, Harvard, Vancouver, ISO, and other styles
31

Azmi, Fadhillah, and Winda Erika. "DATA SECURITY ANALYSIS OF BLOCK CIPHER RSA CRYPTOGRAPHY ALGORITHM." Computer Engineering, Science and System Journal 2, no. 1 (January 31, 2017): 102–4. http://dx.doi.org/10.24114/cess.v2i1.4967.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

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
33

Zhang, C. N. "An improved binary algorithm for RSA." Computers & Mathematics with Applications 25, no. 6 (March 1993): 15–24. http://dx.doi.org/10.1016/0898-1221(93)90295-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Chithra, P. L., and C. Vishnu Priya. "Image Based Password using RSA Algorithm." International Journal of Computing Algorithm 5, no. 1 (June 15, 2016): 34–36. http://dx.doi.org/10.20894/ijcoa.101.005.001.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Shi, Ronghua. "A redundant binary algorithm for RSA." Journal of Computer Science and Technology 11, no. 4 (July 1996): 416–20. http://dx.doi.org/10.1007/bf02948485.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Asthana, N., and S. Shridevi. "DECRYPTING RSA ENCRYPTION USING QUANTUM ALGORITHM." Advances in Mathematics: Scientific Journal 10, no. 2 (February 8, 2020): 729–42. http://dx.doi.org/10.37418/amsj.10.2.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Candra, Ade, Mohammad Andri Budiman, and Dian Rachmawati. "On Factoring The RSA Modulus Using Tabu Search." Data Science: Journal of Computing and Applied Informatics 1, no. 1 (July 18, 2017): 30–37. http://dx.doi.org/10.32734/jocai.v1.i1-65.

Full text
Abstract:
It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a result, lots of exact factorization algorithms, such as Fermat’s factorization algorithm, quadratic sieve method, and Pollard’s rho algorithm have been found. The factorization problem is in the class of NP (non-deterministic polynomial time). Tabu search is a metaheuristic in the field of artificial intelligence which is often used to solve NP and NP-hard problems; the result of this method is expected to be close-to-optimal (suboptimal). This study aims to factorize the RSA modulus into its two prime factors using tabu search by conducting experiments in Python programming language and to compare its time performance with an exact factorization algorithm, i.e. Pollard’s algorithm. The primality test is done with Lehmann’s algorithm.
APA, Harvard, Vancouver, ISO, and other styles
38

Singh, Sukhpreet, and Er Kumar Saurabh. "Providing Security in Data Aggregation using RSA algorithm." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 3, no. 1 (August 1, 2012): 60–65. http://dx.doi.org/10.24297/ijct.v3i1a.2729.

Full text
Abstract:
The RSA algorithm proposed by Rivest, Adi Shamir and Leonard Adleman is cryptography technique. The current problem with wireless sensor network is how to protect the security of the sensor data. RSA algoritm is used as a digital signature authentication in the field of security, basically works on deciding encryption variable. In this also the basic concept is to decide a description variable and then decide the description variable using same encryption variable. It is a secure and fast cryptographic system. The major effort will be applied on the RSA encryption technique in order to make node authenticated as well as to secure data while dealing with aggregation.
APA, Harvard, Vancouver, ISO, and other styles
39

KIJKO, Tomasz, and Michał WROŃSKI. "COMPARISON OF ALGORITHMS FOR FACTORIZATION OF LARGE NUMBERS HAVING SEVERAL DISTINCT PRIME FACTORS." National Security Studies 6, no. 2 (December 5, 2014): 151–62. http://dx.doi.org/10.37055/sbn/135227.

Full text
Abstract:
We present analysis of security of the most known assymetric algorythm RSA and its modern version MultiPrime RSA. We focused on more precisious estimations of time complexity of two factorization algorithms: Elliptic Curve Method and General Number Field Sieve. Additionally for the MultiPrime RSA algorithm we computed the maximal number of prime factors for given modulus length which does not decrease the security level.
APA, Harvard, Vancouver, ISO, and other styles
40

Suhandinata, Sebastian, Reyhan Achmad Rizal, Dedy Ongky Wijaya, Prabhu Warren, and Srinjiwi Srinjiwi. "ANALISIS PERFORMA KRIPTOGRAFI HYBRID ALGORITMA BLOWFISH DAN ALGORITMA RSA." JURTEKSI (Jurnal Teknologi dan Sistem Informasi) 6, no. 1 (December 10, 2019): 1–10. http://dx.doi.org/10.33330/jurteksi.v6i1.395.

Full text
Abstract:
Abstract:Computer data security relies on preventing data theft from irresponsible parties by using cryptography method. Some cryptography algorithms have good and poor performance in encrypting and decrypting data depending on the key types. Therefore the purpose of this research is to measure the performance of the hybrid algorithm, consisting a symmetric keyBlowfish algorithm and an asymmetric key RSA algorithm, in encrypting and decrypting multiple types of data such as documents, photos, audios, and videos. The result is the performance of the hybrid algorithm is almost on par with Blowfish and provides a more secure data encryption and decryption by taking advantage of RSA algorithm. The average encryption performance of hybrid algorithm is 0.85s on document, 1.06s on photo, 3.38s on audio, and 15.56s on video. While the average decryption performance of hybrid algorithm is 1.01s on document, 1.38s on photo, 4.3s on audio, and 27.56s on video. Keywords:Hybrid cryptography, Data security, Performance, Blowfish, RSA Abstrak:Keamanan data komputer berhubungan dengan pencegahan dari pencurian data oleh pihak yang tidak bertanggung jawab, salah satu cara pengamanan data komputer yaitu dengan teknik kriptografi. Beberapa metode kriptografi memiliki performa yang baik dan buruk tergantung dengan tipe kuncinya. Maka dari itu, tujuan dari penelitian ini adalah mengukur tingkat kecepatan kriptografi hybrid, terdiri dari algoritma simetris Blowfish dan algoritma asimetris RSA, dengan beberapa tipe data seperti dokumen, foto, audio dan video. Hasil dari penelitian ini adalah algoritma hybrid memiliki performa yang tidak jauh berbeda dari algoritma Blowfish dan membuat proses enkripsi dan dekripsi data lebih aman dengan keunggulan dari algoritma RSA. Rata-rata kecepatan enkripsi algoritma hybrid untuk dokumen 0,85 detik, gambar 1,06 detik, audio 3,38 detik, dan video 15,56 detik. Sedangkan rata-rata kecepatan dekripsi algoritma hybrid untuk dokumen 1,01 detik, gambar 1,38 detik, audio 4,3 detik, dan video 27,56 detik. Kata kunci:Kriptografihybrid, Keamanan data, Performa, Blowfish, RSA
APA, Harvard, Vancouver, ISO, and other styles
41

Aminudin, Aminudin, Gadhing Putra Aditya, and Sofyan Arifianto. "RSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol." Jurnal Teknologi dan Sistem Komputer 8, no. 2 (February 7, 2020): 113–20. http://dx.doi.org/10.14710/jtsiskom.8.2.2020.113-120.

Full text
Abstract:
This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS). ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation. This method was applied to instant messaging using TCP sockets. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number. It also applies to the encryption and decryption process. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. The test was processed for 15 hours until the test computer resource runs out.
APA, Harvard, Vancouver, ISO, and other styles
42

Budati, Anil Kumar, Ganesh Snv, Kumar Cherukupalli, Anil Kumar P., and Venkata Krishna Moorthy T. "High speed data encryption technique with optimized memory based RSA algorithm for communications." Circuit World 47, no. 3 (June 22, 2021): 269–73. http://dx.doi.org/10.1108/cw-10-2020-0282.

Full text
Abstract:
Purpose The privacy of the information is a major challenge in the communication process. In the present modern generation, the cryptography plays a vital role in providing security for data, such as text, images and video while transmitting from source to destination through internet or intranet. The Rivest-Shamir-Adleman (RSA) is an asymmetric key cryptographic system, where the security of the method works on the strength of the key. Design/methodology/approach In an asymmetric key crypto system, a pair of keys is generated one public key for encryption and one private key for decryption. The major challenge of implementing the RSA is the power function which becomes tedious and time consuming as the exponential value increases. The Chinese remainder theorem proves to be the best for data encryption when it comes to execution time of the algorithm. The proposed novel RSA algorithm with lookup table (LUT) is an extension to the Chinese remainder algorithm, which works better for image and video in terms of time complexity. Findings This paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods. Originality/value This paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods.
APA, Harvard, Vancouver, ISO, and other styles
43

Tahir, Ari Shawkat. "Design and Implementation of RSA Algorithm using FPGA." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 12 (September 22, 2015): 6361–67. http://dx.doi.org/10.24297/ijct.v14i12.1737.

Full text
Abstract:
RSA cryptographic algorithm used to encrypt and decrypt the messages to send it over the secure transmission channel like internet. The RSA algorithm is a secure, high quality, public key algorithm. In this paper, a new architecture and modeling has been proposed for RSA public key algorithm, the suggested system uses 1024-bit RSA encryption/decryption for restricted system. The system uses the multiply and square algorithm to perform modular operation. The design has been described by VHDL and simulated by using Xilinx ISE 12.2 tool. The architectures have been implemented on reconfigurable platforms FPGAs. Accomplishment when implemented on Xilinx_Spartan3 (device XC3S50, package PG208, speed -4) which confirms that the proposed architectures have minimum hardware resource, where only 29% of the chip resources are used for RSA algorithm design with realizable operating clock frequency of 68.573 MHz.
APA, Harvard, Vancouver, ISO, and other styles
44

Sihombing, Grace Lamudur Arta. "HYBRID CHRIPTOGRAPHY STREAM CIPHER AND RSA ALGORITHM WITH DIGITAL SIGNATURE AS A KEY." InfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan) 1, no. 2 (March 6, 2017): 75–83. http://dx.doi.org/10.30743/infotekjar.v1i2.66.

Full text
Abstract:
Confidentiality of data is very important in communication. Many cyber crimes that exploit security holes for entry and manipulation. To ensure the security and confidentiality of the data, required a certain technique to encrypt data or information called cryptography. It is one of the components that can not be ignored in building security. And this research aimed to analyze the hybrid cryptography with symmetric key by using a stream cipher algorithm and asymmetric key by using RSA (Rivest Shamir Adleman) algorithm. The advantages of hybrid cryptography is the speed in processing data using a symmetric algorithm and easy transfer of key using asymmetric algorithm. This can increase the speed of transaction processing data. Stream Cipher Algorithm using the image digital signature as a keys, that will be secured by the RSA algorithm. So, the key for encryption and decryption are different. Blum Blum Shub methods used to generate keys for the value p, q on the RSA algorithm. It will be very difficult for a cryptanalyst to break the key. Analysis of hybrid cryptography stream cipher and RSA algorithms with digital signatures as a key, indicates that the size of the encrypted file is equal to the size of the plaintext, not to be larger or smaller so that the time required for encryption and decryption process is relatively fast.
APA, Harvard, Vancouver, ISO, and other styles
45

WANG, Yahui, and Huanguo ZHANG. "Quantum Algorithm for Attacking RSA Based on Fourier Transform and Fixed-Point." Wuhan University Journal of Natural Sciences 26, no. 6 (December 2021): 489–94. http://dx.doi.org/10.1051/wujns/2021266489.

Full text
Abstract:
Shor in 1994 proposed a quantum polynomial-time algorithm for finding the order r of an element a in the multiplicative group Zn*, which can be used to factor the integer n by computing [see formula in PDF] and hence break the famous RSA cryptosystem. However, the order r must be even. This restriction can be removed. So in this paper, we propose a quantum polynomial-time fixed-point attack for directly recovering the RSA plaintext M from the ciphertext C, without explicitly factoring the modulus n. Compared to Shor’s algorithm, the order r of the fixed-point C for RSA(e, n) satisfying [see formula in PDF] does not need to be even. Moreover, the success probability of the new algorithm is at least [see formula in PDF] and higher than that of Shor’s algorithm, though the time complexity for both algorithms is about the same.
APA, Harvard, Vancouver, ISO, and other styles
46

Hu, Xiao-Bing, Ming Wang, Mark S. Leeson, Ezequiel A. Di Paolo, and Hao Liu. "Deterministic Agent-Based Path Optimization by Mimicking the Spreading of Ripples." Evolutionary Computation 24, no. 2 (June 2016): 319–46. http://dx.doi.org/10.1162/evco_a_00156.

Full text
Abstract:
Inspirations from nature have contributed fundamentally to the development of evolutionary computation. Learning from the natural ripple-spreading phenomenon, this article proposes a novel ripple-spreading algorithm (RSA) for the path optimization problem (POP). In nature, a ripple spreads at a constant speed in all directions, and the node closest to the source is the first to be reached. This very simple principle forms the foundation of the proposed RSA. In contrast to most deterministic top-down centralized path optimization methods, such as Dijkstra’s algorithm, the RSA is a bottom-up decentralized agent-based simulation model. Moreover, it is distinguished from other agent-based algorithms, such as genetic algorithms and ant colony optimization, by being a deterministic method that can always guarantee the global optimal solution with very good scalability. Here, the RSA is specifically applied to four different POPs. The comparative simulation results illustrate the advantages of the RSA in terms of effectiveness and efficiency. Thanks to the agent-based and deterministic features, the RSA opens new opportunities to attack some problems, such as calculating the exact complete Pareto front in multiobjective optimization and determining the kth shortest project time in project management, which are very difficult, if not impossible, for existing methods to resolve. The ripple-spreading optimization principle and the new distinguishing features and capacities of the RSA enrich the theoretical foundations of evolutionary computation.
APA, Harvard, Vancouver, ISO, and other styles
47

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
48

Alekseev, A. P. "Analysis of secret-key algorithm vulnerability in RSA-cryptosystems." Infokommunikacionnye tehnologii 13, no. 4 (December 2015): 464–67. http://dx.doi.org/10.18469/ikt.2015.13.4.17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Hammad, Baraa Tareq, Ali Maki Sagheer, Ismail Taha Ahmed, and Norziana Jamil. "A comparative review on symmetric and asymmetric DNA-based cryptography." Bulletin of Electrical Engineering and Informatics 9, no. 6 (December 1, 2020): 2484–91. http://dx.doi.org/10.11591/eei.v9i6.2470.

Full text
Abstract:
Current researchers have focused on DNA-based cryptography, in fact, DNA or deoxyribonucleic acid, has been applied in cryptography for performing computation as well as storing and transmitting information. In the present work, we made use of DNA in cryptographic, i.e. its storing capabilities (superior information density) and parallelism, in order to improve other classical cryptographic algorithms. Data encryption is made possible via DNA sequences. In this paper, two cases utilizing different DNA properties were studied by combining the DNA codes with those conventional cryptography algorithms. The first case concerned on symmetric cryptography that involved DNA coding with OTP (one time pad) algorithms. Asymmetric cryptography was considered in the second case by incorporating the DNA codes in RSA algorithm. The efficiencies of DNA coding in OTP, RSA, and other algorithms were given. As observed, the computational time of RSA algorithm combined with DNA coding was longer. In order to alleviate this problem, data redundancy was reduced by activating the GZIP compressed algorithm. The present experimental results showed that DNA symmetric cryptography worked quite well in both time and size analyses. Nevertheless, it was less efficient than the compressed DNA asymmetric cryptography.
APA, Harvard, Vancouver, ISO, and other styles
50

Al-Shourbaji, Ibrahim, Na Helian, Yi Sun, Samah Alshathri, and Mohamed Abd Elaziz. "Boosting Ant Colony Optimization with Reptile Search Algorithm for Churn Prediction." Mathematics 10, no. 7 (March 23, 2022): 1031. http://dx.doi.org/10.3390/math10071031.

Full text
Abstract:
The telecommunications industry is greatly concerned about customer churn due to dissatisfaction with service. This industry has started investing in the development of machine learning (ML) models for churn prediction to extract, examine and visualize their customers’ historical information from a vast amount of big data which will assist to further understand customer needs and take appropriate actions to control customer churn. However, the high-dimensionality of the data has a large influence on the performance of the ML model, so feature selection (FS) has been applied since it is a primary preprocessing step. It improves the ML model’s performance by selecting salient features while reducing the computational time, which can assist this sector in building effective prediction models. This paper proposes a new FS approach ACO-RSA, that combines two metaheuristic algorithms (MAs), namely, ant colony optimization (ACO) and reptile search algorithm (RSA). In the developed ACO-RSA approach, an ACO and RSA are integrated to choose an important subset of features for churn prediction. The ACO-RSA approach is evaluated on seven open-source customer churn prediction datasets, ten CEC 2019 test functions, and its performance is compared to particle swarm optimization (PSO), multi verse optimizer (MVO) and grey wolf optimizer (GWO), standard ACO and standard RSA. According to the results along with statistical analysis, ACO-RSA is an effective and superior approach compared to other competitor algorithms on most datasets.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'RSA algorithm' for other source types:
Dissertations / Theses
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!

To the bibliography