Relevant bibliographies by topics / Rsa decryption

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Rsa decryption'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Rsa 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.

Journal articles on the topic "Rsa decryption"

1

Gao, Ming Hu, and Hong Yuan Huang. "A New Efficient Variant of the Batch RSA Cryptosystem." Advanced Materials Research 756-759 (September 2013): 2660–62. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2660.

Full text
Abstract:
This paper aims at speeding up Batch RSA decryption. The performance of Batch RSA decryption has directs relationship with the efficiency of the full-sized modular exponentiation implementation in the Exponentiation Phase. This paper proposes a variant (BS1PRSA-Batch RSA-S1 Multi-Power RSA) to improve the Batch RSA decryption performance. The experimental results show that the speed of the decryption has been substantially improved.
APA, Harvard, Vancouver, ISO, and other styles
2

Encinas, L. Hernández, J. Muñoz Masqué, and A. Queiruga Dios. "Large decryption exponents in RSA." Applied Mathematics Letters 16, no. 3 (April 2003): 293–95. http://dx.doi.org/10.1016/s0893-9659(03)80046-0.

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

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
4

J.L. Padmaja, Ch, V. S.Bhagavan, and B. Srinivas. "On using Aryabhatta Remainder Theorem to Decrypt a Message with RPrime and Rebalanced RSA." International Journal of Engineering & Technology 7, no. 2.7 (March 18, 2018): 758. http://dx.doi.org/10.14419/ijet.v7i2.7.10940.

Full text
Abstract:
RSA is the most world widely used asymmetric cryptosystem for network transactions. Through this article, we propose a new implementation of Aryabhatta Remainder theorem (ART) in place of the existing Chinese Remainder Theorem (CRT) to solve congruencies in the decryption phase for the faster variants of RSA such as RPrime RSA and Rebalanced RSA. Through our observations, we prove that using ART for CRT has improved the overall decryption speed of RPrime and Rebalanced RSA.
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

Hariyanto, Eko Hariyanto, Muhammad Zarlis, Darmeli Nasution Nasution, and Sri Wahyuni. "Analysis Aryabhata Remainder Theorem On Rivest Shamir Adleman (RSA) Cryptography." APTIKOM Journal on Computer Science and Information Technologies 5, no. 2 (July 22, 2020): 88–93. http://dx.doi.org/10.34306/csit.v5i2.183.

Full text
Abstract:
Security of RSA cryptography lied in the difficulty of factoring the number p and q bacame the prime factor. The greater the value of p and q used, the better the security level was. However, this could result in a very slow decryption process. The most commonly used and discussed method of speeding up the encryption and decryption process in RSA was the Chinese Remainder Theorem (CRT). Beside that method, there was another method with the same concept with CRT namely Aryabhata Remainder Theorem which was also relevant used in public key cryptography such as RSA. The purpose of this study was to obtain an effective method to RSA especially in the decryption process based on the calculation of the time complexity of computing.
APA, Harvard, Vancouver, ISO, and other styles
7

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
8

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
9

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
10

Christina C, Merlyne Sandra, Karthika M, Vasanthi M, and Vinotha B. "Video Encryption and Decryption using RSA Algorithm." International Journal of Engineering Trends and Technology 33, no. 7 (March 25, 2016): 328–32. http://dx.doi.org/10.14445/22315381/ijett-v33p263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Rsa decryption"

1

Lisoněk, David. "Šifrování SMS pro mobilní komunikaci." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235448.

Full text
Abstract:
This thesis deals with encryption of short text message (SMS) in mobile communication. Introduction is dedicated to overview of the parts of GSM radiotelephone nets and SMS messages transfer . Next chapter is reserved for description of cryptographic methods especially symetric and asymetric encryptografic aproaches. A design of a SMS messages encryption and decryption techniques is in next. For SMS encryption and sign, there is used the asymetric cypher RSA. Encryption use OAEP padding schema. The public key is saved in certificate. The Symbian OS has been choosen as a suitable platform for programming of mobile devices.
APA, Harvard, Vancouver, ISO, and other styles
2

Joseph, George. "Design and implementation of high-speed algorithms for public-key cryptosystems." Diss., Pretoria : [s.n.], 2005. http://upetd.up.ac.za/thesis/available/etd-06092005-122043.

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

Alzaabi, Mohamed Abdulla Hasan Saif. "New cryptanalysis and modelling for wireless networking." Thesis, University of Hertfordshire, 2015. http://hdl.handle.net/2299/17115.

Full text
Abstract:
High data rates and interoperability of vender devices have made WiMAX a prime desire for use worldwide. WiMAX is based on the IEEE 802.16 standard. IEEE 802.16a, b, c & d versions were updated within three years of the first launch of WiMAX. However, during those early years reports were published that highlighted the security weaknesses of the standard. These weaknesses prompted the IEEE to issue a new version, 802.16e to tackle the security issues. Despite this security enhancement, WiMAX remains vulnerable. This research project looks at the vulnerability of WiMAX 802.16e Subscriber Station/Mobile Station authentication at the initial entry and proposes approaches to the prevention of Denial of Service (DoS) attacks at this point in order to secure the Media Access Control (MAC) layer from such threats. A new protocol has been designed and developed to provide confidentiality, authentication and integrity to WiMAX users. This new protocol is integrated with Z algorithm (an algorithm described later in this paper) to provide: • Confidentiality of management messages • Message Authentication code • ID to provide for message integrity and user authentication. A simulation package was also required, to prove that a linear load of DoS attack would disable or exhaust the capacity of the base station of a WiMAX network, as well as providing other simulation functions. The freely available simulation tool NIST (NIST IPSec (Internet Protocol Security) and IKE (Internet Key Exchange) Simulation) is oriented towards fixed network communications (NIIST, 2003). There are no other relevant simulation tools; hence the purpose of this research project is to develop a new tool to simulate WiMAX security vulnerabilities and test the new protocol.
APA, Harvard, Vancouver, ISO, and other styles
4

Luque, González Jorge, and Fernandez Ignacio Arenchaga. "Data Encryption on a Network." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-9352.

Full text
Abstract:
In this project you can find a study about different encryption algorithms, which are use to safeguard the information on messages over the network. We have developed a client-server application which will send information through the network which has to be secured. There are two kinds of encryption algorithms, the symmetric and the asymmetric key algorithms. Both were used to establish the communication, the asymmetric algorithm (RSA) is used to set up a symmetric key and then, all the communication process is done only with the symmetric algorithm (Blowfish).
En este proyecto encontraras un estudio sobre diferentes algoritmos de encriptación, que son usados para salvaguardar la información en mensajes por la red. Además hemos desarrollado una aplicación cliente-servidor que enviara información a través de la red de forma segura. Hay dos tipos de algoritmos de encriptación, los simétricos y los asimétricos. Ambos tipos de algoritmos son utilizados para establecer la comunicación, el asimétrico (RSA) es utilizado para establecer la clave del simétrico y a partir de entonces se utilizara exclusivamente el algoritmo simétrico (Blowfish).
APA, Harvard, Vancouver, ISO, and other styles
5

Scarlato, Michele. "Sicurezza di rete, analisi del traffico e monitoraggio." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3223/.

Full text
Abstract:
Il lavoro è stato suddiviso in tre macro-aree. Una prima riguardante un'analisi teorica di come funzionano le intrusioni, di quali software vengono utilizzati per compierle, e di come proteggersi (usando i dispositivi che in termine generico si possono riconoscere come i firewall). Una seconda macro-area che analizza un'intrusione avvenuta dall'esterno verso dei server sensibili di una rete LAN. Questa analisi viene condotta sui file catturati dalle due interfacce di rete configurate in modalità promiscua su una sonda presente nella LAN. Le interfacce sono due per potersi interfacciare a due segmenti di LAN aventi due maschere di sotto-rete differenti. L'attacco viene analizzato mediante vari software. Si può infatti definire una terza parte del lavoro, la parte dove vengono analizzati i file catturati dalle due interfacce con i software che prima si occupano di analizzare i dati di contenuto completo, come Wireshark, poi dei software che si occupano di analizzare i dati di sessione che sono stati trattati con Argus, e infine i dati di tipo statistico che sono stati trattati con Ntop. Il penultimo capitolo, quello prima delle conclusioni, invece tratta l'installazione di Nagios, e la sua configurazione per il monitoraggio attraverso plugin dello spazio di disco rimanente su una macchina agent remota, e sui servizi MySql e DNS. Ovviamente Nagios può essere configurato per monitorare ogni tipo di servizio offerto sulla rete.
APA, Harvard, Vancouver, ISO, and other styles
6

Chang, Chien-Cheng, and 張建誠. "The Design of a RSA Encryption/Decryption Circuit." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/61393486894775458082.

Full text
Abstract:
碩士
國立臺灣科技大學
電子工程系
88
The RSA encryption algorithm is widely used in communication and data security system. It takes much time to perform because of the RSA algorithm using more than 512-bit word lengths to guarantee security. Developing a high speed RSA encryption circuit which takes less gate count and can carry out its layout easily, will be a challenge. In this thesis, a 1024-bit RSA encryption circuit that is constructed by two 1024-bit adders is proposed. Based on the consideration of speed and regularity, a 1024-bit hierarchical carry skip adder consisting of 8 bits ripple adders is proposed. The adder only takes 9.4ns to perform a 1024-bit addition with 0.35μm SPQM cell library. The resulting RSA circuit can output a 10240-bit encrypted message every 22ms at the operating frequency of 72 MHz. Its die size is 3.7x3.7mm^2 and consumes 633mw. Moreover, the design of the proposed RSA circuit is modularized in a bit-sliced manner so that it can be expanded easily to a longer word length.
APA, Harvard, Vancouver, ISO, and other styles
7

Jwo, Hung-Ming, and 卓宏洺. "Research of RSA Encryption/Decryption Based on Embedded System." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/tcf94z.

Full text
Abstract:
碩士
國立臺灣科技大學
電子工程系
94
Human life gets more and more dependent on internet as it grows rapidly. By means of internet, we can not only transfer text, audio, and video data, but also buy goods and pay for them. But in a public domain like internet, private personal information can be captured easily and therefore encryption is necessary to prevent captured data readable. Based on a developing platform with Samsung S3C2410 as its CPU, this thesis develops a internet transfer application that encrypts files with RSA before sending out via internet, and decrypts them after receiving at receiver end. RSA is currently the most popular public key cryptographic system. It's quite appropriate to use when transferring private information under public domain and it can also be used for digital signature and identification certification. S3C2410, a touch-panel-supported CPU produced by Samsung, is considered suitable for mobile devices such as PDA. Linux, the operating system we use on the developing platform, is capable of great portability, efficient network transfer, support for a great deal of peripherals, and short time to market, and most important of all is that it's open source.
APA, Harvard, Vancouver, ISO, and other styles
8

陳嘉耀. "An Efficient Decryption Method for RSA Cryptosystem And Implementation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/71835300207564971666.

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

Bih-Ching, Yeh. "512-bit RSA Public Key Data Encryption/Decryption Chip Design." 1997. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0009-0112200611290358.

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

Zeng, Xi-Zhe, and 曾希哲. "The Design and Analysis of a RSA Encryption/Decryption Chip." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/36112321014998661900.

Full text
Abstract:
碩士
國立海洋大學
電機工程學系
88
The role of cryptography is more important to prevent the computer- and communication-based crime in recent years. Many applications of cryptographic methods have been proposed recently from electronic mail, trading, and banking to network security. In this thesis, the implementation of a 512 bits public key cryptosystem of RSA encryption/decryption chip is presented based on the Montgomery algorithm to simplify the complexity of exponential modular operation in RSA algorithm. The architecture of chip includes two components: modular and multiplier that are implemented based on the 257 bits pipelining systolic array to achieve a low die area. We applied the VHDL (VHSIC Hardware Description Language) to accomplish its design entry. This chip completed by using FPGA (Field Programmable Gate Array). It’s clock rate can reach 43.5 MHz and the baud rate is 28.2 Kbits/sec.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Rsa decryption"

1

Martin, Keith M. Public-Key Encryption. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788003.003.0005.

Full text
Abstract:
In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Rsa decryption"

1

Bai, Xu, Lei Jiang, Xinxing Liu, and Jianlong Tan. "RSA Encryption/Decryption Implementation Based on Zedboard." In Trustworthy Computing and Services, 114–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47401-3_15.

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

Maitra, Subhamoy, Santanu Sarkar, and Sourav Sen Gupta. "Publishing Upper Half of RSA Decryption Exponent." In Advances in Information and Computer Security, 25–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16825-3_3.

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

Maitra, Subhamoy, and Santanu Sarkar. "Efficient CRT-RSA Decryption for Small Encryption Exponents." In Topics in Cryptology - CT-RSA 2010, 26–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11925-5_3.

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

Huang, Zhangjie, Lei Hu, and Jun Xu. "Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization." In Information Security and Cryptology, 207–19. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16745-9_12.

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

McGregor, John Patrick, Yiqun Lisa Yin, and Ruby B. Lee. "A Traitor Tracing Scheme Based on RSA for Fast Decryption." In Applied Cryptography and Network Security, 56–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11496137_5.

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

Watanabe, Yohei, Keita Emura, and Jae Hong Seo. "New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters." In Topics in Cryptology – CT-RSA 2017, 432–49. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52153-4_25.

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

Sarkar, Santanu, and Subhamoy Maitra. "Side Channel Attack to Actual Cryptanalysis: Breaking CRT-RSA with Low Weight Decryption Exponents." In Cryptographic Hardware and Embedded Systems – CHES 2012, 476–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33027-8_28.

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

Yen, Sung-Ming, Wei-Chih Lien, SangJae Moon, and JaeCheol Ha. "Power Analysis by Exploiting Chosen Message and Internal Collisions – Vulnerability of Checking Mechanism for RSA-Decryption." In Progress in Cryptology – Mycrypt 2005, 183–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11554868_13.

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

Prakash, Ravi, Premkumar Chithaluru, Deepak Sharma, and P. Srikanth. "Implementation of Trapdoor Functionality to Two-Layer Encryption and Decryption by Using RSA-AES Cryptography Algorithms." In Nanoelectronics, Circuits and Communication Systems, 89–95. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0776-8_8.

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

Sahu, Madhusmita. "RSA Based Encryption and Decryption of Any Text with the Help of XOR Operation and Color Mapping Technique." In ICICCT 2019 – System Reliability, Quality Control, Safety, Maintenance and Management, 545–52. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-8461-5_62.

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

Conference papers on the topic "Rsa decryption"

1

Anane, Nadjia, Mohamed Anane, Hamid Bessalah, Mohamed Issad, and Khadidja Messaoudi. "RSA based encryption decryption of medical images." In 2010 7th International Multi-Conference on Systems, Signals and Devices (SSD). IEEE, 2010. http://dx.doi.org/10.1109/ssd.2010.5585539.

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

Wang, Suli, and Ganlai Liu. "File Encryption and Decryption System Based on RSA Algorithm." In 2011 International Conference on Computational and Information Sciences (ICCIS). IEEE, 2011. http://dx.doi.org/10.1109/iccis.2011.150.

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

Mandangan, Arif, Loh Chai Mei, Chang Ee Hung, and Che Haziqah Che Hussin. "Compression-RSA technique: A more efficient encryption-decryption procedure." In PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4882465.

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

Hung, Chang Ee, and Arif Mandangan. "Compression-RSA: New approach of encryption and decryption method." In PROCEEDINGS OF THE 20TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES: Research in Mathematical Sciences: A Catalyst for Creativity and Innovation. AIP, 2013. http://dx.doi.org/10.1063/1.4801103.

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

Xin Zhou and Xiaofei Tang. "Research and implementation of RSA algorithm for encryption and decryption." In 2011 6th International Forum on Strategic Technology (IFOST). IEEE, 2011. http://dx.doi.org/10.1109/ifost.2011.6021216.

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

Asaduzzaman, Abu, Deepthi Gummadi, and Puskar Waichal. "A promising parallel algorithm to manage the RSA decryption complexity." In SoutheastCon 2015. IEEE, 2015. http://dx.doi.org/10.1109/secon.2015.7132926.

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

Yunfei Li, Qing Liu, Tong Li, and Wenming Xiao. "Two efficient methods to speed up the Batch RSA decryption." In 2010 Third International Workshop on Advanced Computational Intelligence (IWACI). IEEE, 2010. http://dx.doi.org/10.1109/iwaci.2010.5585105.

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

Neto, Joao Carlos, Alexandre Ferreira Tenca, and Wilson Vicente Ruggiero. "CRT RSA decryption: Modular exponentiation based solely on Montgomery Multiplication." In 2015 49th Asilomar Conference on Signals, Systems and Computers. IEEE, 2015. http://dx.doi.org/10.1109/acssc.2015.7421164.

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

Gao, Sanshan, Shunqing Zhang, Michael Fu, Shugong Xu, and Weiping Li. "Cost-Efficient Parallel RSA Decryption with Integrated GPGPU and OpenCL." In 2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld). IEEE, 2016. http://dx.doi.org/10.1109/uic-atc-scalcom-cbdcom-iop-smartworld.2016.0101.

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

Abdullah, Kamilah, Sumarni Abu Bakar, Nor Hanimah Kamis, and Hardi Aliamis. "RSA cryptosystem with fuzzy set theory for encryption and decryption." In PROCEEDINGS OF THE 13TH IMT-GT INTERNATIONAL CONFERENCE ON MATHEMATICS, STATISTICS AND THEIR APPLICATIONS (ICMSA2017). Author(s), 2017. http://dx.doi.org/10.1063/1.5012147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Rsa decryption' for particular source types:
Journal articles 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