Log in

Relevant bibliographies by topics / RSA algorithm

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "RSA algorithm"

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&D method, with the R&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

More sources

Dissertations / Theses on the topic "RSA algorithm"

1

Таранова, Д. В. "Шифрування з відкритим кодом. Алгоритм RSA." Thesis, Сумський державний університет, 2015. http://essuir.sumdu.edu.ua/handle/123456789/43423.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chatterjee, Aakriti. "Development of an RSA Algorithm using Reduced RISC V instruction Set." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1617104502129937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Романюк, О. О., and М. П. Смаглюк. "Програмна реалізація алгоритму шифрування RSA." Thesis, Сумський державний університет, 2017. http://essuir.sumdu.edu.ua/handle/123456789/64443.

Full text

Abstract:

Криптографічні системи з відкритим ключем в даний час широко застосовуються в різних мережевих протоколах. Асиметричне шифрування на основі відкритого ключа RSA (розшифровується, як Rivest, Shamir and Aldeman - творці алгоритму) використовує більшість продуктів на ринку інформаційної безпеки. Його криптостійкість грунтується на складності розкладання великих чисел на множники.

APA, Harvard, Vancouver, ISO, and other styles

4

Дяченко, Є., М. Кір'ян, and С. Танський. "Реалізація алгоритму RSA з використанням новітніх WEB-технологій." Thesis, Сумський державний університет, 2015. http://essuir.sumdu.edu.ua/handle/123456789/43353.

Full text

Abstract:

Розвиток WEB-технологій має передове значення у розвитку науки, адже в наш час саме Інтернет є основним джерелом та провідником знань. Людина, яка має доступ до Інтернету, має доступ до всесвітньої бази інформації.

APA, Harvard, Vancouver, ISO, and other styles

5

Al-Tuwaijry, Fahd A. A. "Fast algorithms for implementation of public-key cryptosystems : VLSI simulation of modified algorithm to increase the speed of public-key cryptosystem (RSA) implementation." Thesis, University of Bradford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Průcha, Jan. "Elektronický geocaching." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-220208.

Full text

Abstract:

The master’s thesis is focusing on electronization of worldwide known game geocaching. It contains introduction to classic geocashing, analysis of current status and outline of possible solution. The design of electronization is based on smart card Gemalto. Very important part of the thesis is cryptographic security, therefore there is explanation of symetric and asymetric cryptography. The digital signature of transmitted message is realized by RSA algorithm, which is supported by the Gemalto smart card. Due to future expandability, it is appropriate to use general protocol. For this reason was chosen the ACP protocol which the supervisor of thesis adviced. In the following part, there is introduction to smart cards, their types and detailed description of Gemalto smart card. In the chapter 7 starts the solution of this issue and there are described the programmed apps.

APA, Harvard, Vancouver, ISO, and other styles

7

Nwaokocha, Martyns. "Shorův algoritmus v kvantové kryptografii." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-445457.

Full text

Abstract:

Kryptografie je velmi důležitým aspektem našeho každodenního života, protože poskytuje teoretický základ informační bezpečnosti. Kvantové výpočty a informace se také stávají velmi důležitou oblastí vědy kvůli mnoha aplikačním oblastem včetně kryptologie a konkrétněji v kryptografii veřejných klíčů. Obtížnost čísel do hlavních faktorů je základem některých důležitých veřejných kryptosystémů, jejichž klíčem je kryptosystém RSA . Shorův kvantový faktoringový al-goritmus využívá zejména kvantový interferenční účinek kvantového výpočtu k faktorovým semi-prime číslům v polynomiálním čase na kvantovém počítači. Ačkoli kapacita současných kvantových počítačů vykonávat Shorův algoritmus je velmi omezená, existuje mnoho rozsáhlých základních vědeckých výzkumů o různých technikách optimalizace algoritmu, pokud jde o faktory, jako je počet qubitů, hloubka obvodu a počet bran. v této práci jsou diskutovány, analyzovány a porovnávány různé varianty Shorova factoringového algoritmu a kvantových obvodů. Některé varianty Shorova algoritmu jsou také simulované a skutečně prováděné na simulátorech a kvantových počítačích na platformě IBM QuantumExperience. Výsledky simulace jsou porovnávány z hlediska jejich složitosti a míry úspěšnosti. Organizace práce je následující: Kapitola 1 pojednává o některých klíčových historických výsledcích kvantové kryptografie, uvádí problém diskutovaný v této práci a představuje cíle, kterých má být dosaženo. Kapitola 2 shrnuje matematické základy kvantového výpočtu a kryptografie veřejných klíčů a popisuje notaci použitou v celé práci. To také vysvětluje, jak lze k rozbití kryptosystému RSA použít realizovatelný algoritmus pro vyhledávání objednávek nebo factoring. Kapitola 3 představuje stavební kameny Shorova algoritmu, včetně kvantové Fourierovy transformace, kvantového odhadu fází, modulární exponentiace a Shorova algoritmu. Zde jsou také uvedeny a porovnány různé varianty optimalizace kvantových obvodů. Kapitola 4 představuje výsledky simulací různých verzí Shorova algoritmu. V kapitole 5 pojednejte o dosažení cílů disertační práce, shrňte výsledky výzkumu a nastíňte budoucí směry výzkumu.

APA, Harvard, Vancouver, ISO, and other styles

8

Popovský, Michal. "Útoky postranními kanály." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218182.

Full text

Abstract:

It is very difficult in real-time breaking the cryptographic algorithms used at present. The Classical cryptoanalysis is based on finding weaknesses in the mathematical structure of the algorithm. Discovery of side channels caused a substantial change in this science. Side-channel attacks are based on incorrect physical implementation of cryptographic algorithms. This new way attack changes notions about cryptography and security of systems. This master´s thesis contains a detailed description of the whole problem of side channels and deals with side-channel attacks on the RSA asymmetric algorithm. This thesis includes the design and realization of laboratory exercise, which is focused on the time attack on the RSA algorithm implementation.

APA, Harvard, Vancouver, ISO, and other styles

9

Zeitoun, Rina. "Méthodes algébriques pour l'analyse de sécurité des implantations d'algorithmes cryptographiques." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066310/document.

Full text

Abstract:

Le 10ème problème de Hilbert, consistant à trouver les solutions entières d'équations polynomiales est un problème crucial en cryptanalyse. Si ce dernier a été prouvé indécidable, Coppersmith publia en 1996 une méthode basée sur la réduction de réseaux permettant de trouver efficacement l'ensemble des petites solutions de certaines équations polynomiales. De nombreuses applications de cette méthode ont vu le jour dans le domaine de la cryptanalyse à clé publique, notamment lorsque le cryptosystème est exécuté sur un système embarqué et qu'une partie de la clé secrète est dévoilée par la réalisation d'attaques physiques sur le dispositif. Dans ce contexte, nous proposons une attaque physique sur le schéma de signature RSA en mode CRT où une application de la méthode de Coppersmith permet de compléter l'information obtenue par l'attaque physique. Nous proposons également un nouvel algorithme déterministe basé sur la méthode de Coppersmith pour factoriser les entiers de la forme $N=p^rq^s$ en temps polynomial lorsque $r$ ou $s$ sont suffisamment grands. Enfin, si les applications de la méthode de Coppersmith sont nombreuses, en pratique, du fait que les réseaux à réduire soient gigantesques, les petites solutions ne peuvent être retrouvées que jusqu'à une borne qui est plus petite que la borne théorique annoncée. Aussi, une autre contribution de cette thèse consiste en la proposition de deux méthodes permettant une accélération du temps d'exécution de l'algorithme de Coppersmith. Lorsque les deux méthodes sont combinées, le nouvel algorithme s'effectue des centaines de fois plus rapidement pour des paramètres typiques, permettant ainsi dans de nombreux cas d'atteindre la borne théorique
The 10th Hilbert problem, which consists in finding integer solutions to polynomial equations is a crucial problem in cryptanalysis, which has been proven to be undecidable. However, Coppersmith published in 1996 a method based on lattice reduction, which allows to efficiently find all small solutions to some polynomial equations. Many applications of this method have risen in public key cryptanalysis, especially when the cryptosystem is executed on embedded systems and part of the secret key is revealed through physical attacks performed on the device. In this context, we propose in this thesis a physical attack on the RSA signature scheme when the CRT mode is used, where an application of Coppersmith's method allows to complete the information previously obtained by the physical attack. We also propose a new deterministic algorithm based on Coppersmith's method for factoring integers of the form $N=p^rq^s$ in polynomial time, under the condition that $r$ and/or $s$ are sufficiently large.Finally, if the applications of Coppersmith's method are numerous, in practice, since the lattices to be reduced are huge, the small solutions can only be recovered until a bound which is smaller than the enounced theoretical bound. Thus, another contribution of this thesis lies in the proposition of two methods which allow to speed up the execution time of Coppersmith's algorithm. When both speedups are combined, the new algorithm performs hundreds of times faster for typical parameters, which allows to reach the theoretical bound in many cases

APA, Harvard, Vancouver, ISO, and other styles

10

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

More sources

Books on the topic "RSA algorithm"

1

Koutincho, S. Vvedenie v teoriju c isel: Algoritm RSA. Moskva: Postmarket, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Schneier, Bruce. Cryptographie appliquée: Protocoles, algorithmes et codes sources en C. 2nd ed. Paris: Vuibert, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Earnshaw, Rae A. Fundamental Algorithms for Computer Graphics: NATO Advanced Study Institute directed by J.E. Bresenham, R.A. Earnshaw, M.L.V. Pitteway. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Steeg, Evan Whitney *. Neural network algorithms for RNA secondary structure prediction. 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Jason T. L., Bruce A. Shapiro, and Dennis Shasha, eds. Pattern Discovery in Biomolecular Data. Oxford University Press, 1999. http://dx.doi.org/10.1093/oso/9780195119404.001.0001.

Full text

Abstract:

Finding patterns in biomolecular data, particularly in DNA and RNA, is at the center of modern biological research. These data are complex and growing rapidly, so the search for patterns requires increasingly sophisticated computer methods. Pattern Discovery in Biomolecular Data provides a clear, up-to-date summary of the principal techniques. Each chapter is self-contained, and the techniques are drawn from many fields, including graph theory, information theory, statistics, genetic algorithms, computer visualization, and vision. Since pattern searches often benefit from multiple approaches, the book presents methods in their purest form so that readers can best choose the method or combination that fits their needs. The chapters focus on finding patterns in DNA, RNA, and protein sequences, finding patterns in 2D and 3D structures, and choosing system components. This volume will be invaluable for all workers in genomics and genetic analysis, and others whose research requires biocomputing.

APA, Harvard, Vancouver, ISO, and other styles

6

Erpen, Mauro Luiz, André Luiz Aquere de Cerqueira e. Souza, Clóvis Neumann, and Maria Cristina Bueno Coelho. Análise de Sucesso na Indústria da Construção Civil Utilizando Redes Neurais Artificiais. Edited by Marcia Alessandra Arantes Marques. Bookerfield Editora, 2021. http://dx.doi.org/10.53268/bkf21090400.

Full text

Abstract:

Na engenharia um eficiente gerenciamento de projeto pode garantir o sucesso e reduzir os impactos de atrasos e mudanças que ocorrem durante a execução do empreendimento. Para tal, existem os Fatores Críticos de Sucesso (FCS). Com a identificação dos FCS, mais eficientes serão as medidas a tomar, evitando-se projetos mal sucedidos. O objetivo foi criar um modelo para análise dos FCS que afetam ao Gerenciamento de Projetos na indústria da Construção civil com o uso de Redes Neurais Artificiais. Depois de identificados os potenciais fatores de sucesso (FS) que afetam o Gerenciamento de Projetos, foi preparado um questionário para avaliar o efeito de cada fator. A análise das respostas foi feita pelo Índice de Importância Relativa (RII). A RNA foi utilizada para avaliar os fatores de sucesso mais significativos usando o software Neuro4 com o algoritmo Resilient Propagation para otimização de processos na obtenção de RNA satisfatórias. Foram calculados os índices relativos de importância e confeccionada a matriz que foi inserida no Neuro4 para obtenção de pesos para determinação dos FCS com uso do Algoritmo de Garson. O fator: Inspeção irrealista e os métodos de ensaio propostos no contrato foi o mais crítico no gerenciamento de projetos nos dois tempos considerados, Tempo de Pesquisa e Tempo de Experiência dos respondentes. As RNAs produzem subsídios para se conhecer a relevância das variáveis de entrada adotadas, são eficientes para ordenar e transferir conhecimento não estruturado e se constituem um meio rápido e preciso para modelagem de variáveis não lineares.

APA, Harvard, Vancouver, ISO, and other styles

7

Erpen, Mauro Luiz, André Luiz Aquere de Cerqueira e. Souza, Clóvis Neumann, and Maria Cristina Bueno Coelho. Análise de Sucesso na Indústria da Construção Civil Utilizando Redes Neurais Artificiais. Edited by Marcia Alessandra Arantes Marques. Bookerfield Editora, 2021. http://dx.doi.org/10.53268/bkf21090400.

Full text

Abstract:

Na engenharia um eficiente gerenciamento de projeto pode garantir o sucesso e reduzir os impactos de atrasos e mudanças que ocorrem durante a execução do empreendimento. Para tal, existem os Fatores Críticos de Sucesso (FCS). Com a identificação dos FCS, mais eficientes serão as medidas a tomar, evitando-se projetos mal sucedidos. O objetivo foi criar um modelo para análise dos FCS que afetam ao Gerenciamento de Projetos na indústria da Construção civil com o uso de Redes Neurais Artificiais. Depois de identificados os potenciais fatores de sucesso (FS) que afetam o Gerenciamento de Projetos, foi preparado um questionário para avaliar o efeito de cada fator. A análise das respostas foi feita pelo Índice de Importância Relativa (RII). A RNA foi utilizada para avaliar os fatores de sucesso mais significativos usando o software Neuro4 com o algoritmo Resilient Propagation para otimização de processos na obtenção de RNA satisfatórias. Foram calculados os índices relativos de importância e confeccionada a matriz que foi inserida no Neuro4 para obtenção de pesos para determinação dos FCS com uso do Algoritmo de Garson. O fator: Inspeção irrealista e os métodos de ensaio propostos no contrato foi o mais crítico no gerenciamento de projetos nos dois tempos considerados, Tempo de Pesquisa e Tempo de Experiência dos respondentes. As RNAs produzem subsídios para se conhecer a relevância das variáveis de entrada adotadas, são eficientes para ordenar e transferir conhecimento não estruturado e se constituem um meio rápido e preciso para modelagem de variáveis não lineares.

APA, Harvard, Vancouver, ISO, and other styles

8

Lehmann, Nielsen Kåre, ed. Serial analysis of gene expression (SAGE): Methods and protocols. Totowa, N.J: Humana Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "RSA algorithm"

1

Smart, Nigel P. "The “Naive” RSA Algorithm." In Cryptography Made Simple, 295–311. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21936-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Shaheen, Bushra, and Farheen Siddiqui. "Comparison Between RSA Algorithm and Modified RSA Algorithm Used in Cloud Computing." In Inventive Computation Technologies, 218–24. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33846-6_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sahoo, Aradhana, Pratyasha Mohanty, and Purna Chandra Sethi. "Image Encryption Using RSA Algorithm." In Intelligent Systems, 641–52. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-0901-6_56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chang, Zhenghui, and Pengfei Gong. "Optimization of Prime Decision Algorithm in RSA Algorithm." In Proceedings of the 11th International Conference on Computer Engineering and Networks, 277–83. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6554-7_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Yang, Shang-Yi, Po-Chun Kuo, Bo-Yin Yang, and Chen-Mou Cheng. "Gauss Sieve Algorithm on GPUs." In Topics in Cryptology – CT-RSA 2017, 39–57. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52153-4_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Qiao, Guopei, and Kwok-Yan Lam. "RSA Signature Algorithm for Microcontroller Implementation." In Lecture Notes in Computer Science, 353–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10721064_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

May, Alexander. "Using LLL-Reduction for Solving RSA and Factorization Problems." In The LLL Algorithm, 315–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02295-1_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Joux, Antoine, and Vanessa Vitse. "A Variant of the F4 Algorithm." In Topics in Cryptology – CT-RSA 2011, 356–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19074-2_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Patarin, Jacques, Nicolas Courtois, and Louis Goubin. "FLASH, a Fast Multivariate Signature Algorithm." In Topics in Cryptology — CT-RSA 2001, 298–307. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45353-9_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jiao, Lin, Dengguo Feng, Yonglin Hao, Xinxin Gong, and Shaoyu Du. "FAN: A Lightweight Authenticated Cryptographic Algorithm." In Topics in Cryptology – CT-RSA 2021, 299–325. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75539-3_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "RSA algorithm"

1

Aiswarya, P. M., Archana Raj, Dona John, Liya Martin, and G. Sreenu. "Binary RSA encryption algorithm." In 2016 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT). IEEE, 2016. http://dx.doi.org/10.1109/iccicct.2016.7987940.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rui, Wang, Chen Ju, and Duan Guangwen. "A k-RSA algorithm." In 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN). IEEE, 2011. http://dx.doi.org/10.1109/iccsn.2011.6013537.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Aswathy, B. G., and R. Resmi. "Modified RSA public key algorithm." In 2014 First International Conference on Computational Systems and Communications (ICCSC). IEEE, 2014. http://dx.doi.org/10.1109/compsc.2014.7032657.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dhakar, Ravi Shankar, Amit Kumar Gupta, and Prashant Sharma. "Modified RSA Encryption Algorithm (MREA)." In Communication Technologies (ACCT). IEEE, 2012. http://dx.doi.org/10.1109/acct.2012.74.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Al-Hamami, Alaa Hussein, and Ibrahem Abdallah Aldariseh. "Enhanced Method for RSA Cryptosystem Algorithm." In 2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT). IEEE, 2012. http://dx.doi.org/10.1109/acsat.2012.102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chhabra, Aayush, and Srushti Mathur. "Modified RSA Algorithm: A Secure Approach." In 2011 International Conference on Computational Intelligence and Communication Networks (CICN). IEEE, 2011. http://dx.doi.org/10.1109/cicn.2011.117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chittala, Aarti, Preethi Mummini, and P. Suresh Verma. "Secure Autonomic Communication using RSA Algorithm." In 2006 International Conference on Advanced Computing and Communications. IEEE, 2006. http://dx.doi.org/10.1109/adcom.2006.4289860.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Savić, Dragan, and Slobodan Damjanović. "The Attacks on the RSA Algorithm." In Sinteza 2016. Belgrade, Serbia: Singidunum University, 2016. http://dx.doi.org/10.15308/sinteza-2016-131-136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Thombre, Ritu, and Babita Jajodia. "Experimental Analysis of Attacks on RSA & Rabin Cryptosystems using Quantum Shor’s Algorithm." In International Conference on Women Researchers in Electronics and Computing. AIJR Publisher, 2021. http://dx.doi.org/10.21467/proceedings.114.74.

Full text

Abstract:

In this world of massive communication networks, data security and confidentiality are of crucial importance for maintaining secured private communication and protecting information against eavesdropping attacks. Existing cryptosystems provide data security and confidentiality by the use of encryption and signature algorithms for secured communication. Classical computers use cryptographic algorithms that use the product of two large prime numbers for generating public and private keys. These classical algorithms are based on the fact that integer factorization is a non-deterministic polynomial-time (NP) problem and requires super-polynomial time making it impossible for large enough integers. Shor’s algorithm is a well-known algorithm for factoring large integers in polynomial time and takes only O(b3) time and O(b) space on b-bit number inputs. Shor’s algorithm poses a potential threat to the current security system with the ongoing advancements of Quantum computers. This paper discusses how Shor’s algorithm will be able to break integer factorization-based cryptographic algorithms, for example, Rivest–Shamir–Adleman (RSA) and Rabin Algorithms. As a proof of concept, experimental analysis of Quantum Shor’s algorithm on existing public-key cryptosystems using IBM Quantum Experience is performed for factorizing integers of moderate length (seven bits) due to limitations of thirty-two qubits in present IBM quantum computers. In a nutshell, this work will demonstrate how Shor’s algorithm poses threat to confidentiality and authentication services.

APA, Harvard, Vancouver, ISO, and other styles

10

Divya, S., B. Deepthi Reddy, and D. Sravanthi. "Cipher Text Design with Asymmetric RSA Algorithm." In National Conference on Computer Security, Image Processing, Graphics, Mobility and Analytics. AI Publications, 2016. http://dx.doi.org/10.22161/ijaers/si.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "RSA algorithm"

1

Randall, J., B. Kaliski, J. Brainard, and S. Turner. Use of the RSA-KEM Key Transport Algorithm in the Cryptographic Message Syntax (CMS). RFC Editor, September 2010. http://dx.doi.org/10.17487/rfc5990.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sury, O. Use of the SHA-256 Algorithm with RSA, Digital Signature Algorithm (DSA), and Elliptic Curve DSA (ECDSA) in SSHFP Resource Records. RFC Editor, April 2012. http://dx.doi.org/10.17487/rfc6594.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, June 2021. http://dx.doi.org/10.18235/0003313.

Full text

Abstract:

This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.

APA, Harvard, Vancouver, ISO, and other styles

4

Jones, M. Using RSA Algorithms with CBOR Object Signing and Encryption (COSE) Messages. RFC Editor, September 2017. http://dx.doi.org/10.17487/rfc8230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jansen, J. Use of SHA-2 Algorithms with RSA in DNSKEY and RRSIG Resource Records for DNSSEC. RFC Editor, October 2009. http://dx.doi.org/10.17487/rfc5702.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schaad, J., B. Kaliski, and R. Housley. Additional Algorithms and Identifiers for RSA Cryptography for use in the Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC Editor, June 2005. http://dx.doi.org/10.17487/rfc4055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Amela, R., R. Badia, S. Böhm, R. Tosi, C. Soriano, and R. Rossi. D4.2 Profiling report of the partner’s tools, complete with performance suggestions. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.023.

Full text

Abstract:

This deliverable focuses on the proling activities developed in the project with the partner's applications. To perform this proling activities, a couple of benchmarks were dened in collaboration with WP5. The rst benchmark is an embarrassingly parallel benchmark that performs a read and then multiple writes of the same object, with the objective of stressing the memory and storage systems and evaluate the overhead when these reads and writes are performed in parallel. A second benchmark is dened based on the Continuation Multi Level Monte Carlo (C-MLMC) algorithm. While this algorithm is normally executed using multiple levels, for the proling and performance analysis objectives, the execution of a single level was enough since the forthcoming levels have similar performance characteristics. Additionally, while the simulation tasks can be executed as parallel (multi-threaded tasks), in the benchmark, single threaded tasks were executed to increase the number of simulations to be scheduled and stress the scheduling engines. A set of experiments based on these two benchmarks have been executed in the MareNostrum 4 supercomputer and using PyCOMPSs as underlying programming model and dynamic scheduler of the tasks involved in the executions. While the rst benchmark was executed several times in a single iteration, the second benchmark was executed in an iterative manner, with cycles of 1) Execution and trace generation; 2) Performance analysis; 3) Improvements. This had enabled to perform several improvements in the benchmark and in the scheduler of PyCOMPSs. The initial iterations focused on the C-MLMC structure itself, performing re-factors of the code to remove ne grain and sequential tasks and merging them in larger granularity tasks. The next iterations focused on improving the PyCOMPSs scheduler, removing existent bottlenecks and increasing its performance by making the scheduler a multithreaded engine. While the results can still be improved, we are satised with the results since the granularity of the simulations run in this evaluation step are much ner than the one that will be used for the real scenarios. The deliverable nishes with some recommendations that should be followed along the project in order to obtain good performance in the execution of the project codes.

APA, Harvard, Vancouver, ISO, and other styles

8

Fluhr, Robert, and Volker Brendel. Harnessing the genetic diversity engendered by alternative gene splicing. United States Department of Agriculture, December 2005. http://dx.doi.org/10.32747/2005.7696517.bard.

Full text

Abstract:

Our original objectives were to assess the unexplored dimension of alternative splicing as a source of genetic variation. In particular, we sought to initially establish an alternative splicing database for Arabidopsis, the only plant for which a near-complete genome has been assembled. Our goal was to then use the database, in part, to advance plant gene prediction programs that are currently a limiting factor in annotating genomic sequence data and thus will facilitate the exploitation of the ever increasing quantity of raw genomic data accumulating for plants. Additionally, the database was to be used to generate probes for establishing high-throughput alternative transcriptome analysis in the form of a splicing-specific oligonucleotide microarray. We achieved the first goal and established a database and web site termed Alternative Splicing In Plants (ASIP, http://www.plantgdb.org/ASIP/). We also thoroughly reviewed the extent of alternative splicing in plants (Arabidopsis and rice) and proposed mechanisms for transcript processing. We noted that the repertoire of plant alternative splicing differs from that encountered in animals. For example, intron retention turned out to be the major type. This surprising development was proven by direct RNA isolation techniques. We further analyzed EST databases available from many plants and developed a process to assess their alternative splicing rate. Our results show that the lager genome-sized plant species have enhanced rates of alternative splicing. We did advance gene prediction accuracy in plants by incorporating scoring for non-canonical introns. Our data and programs are now being used in the continuing annotation of plant genomes of agronomic importance, including corn, soybean, and tomato. Based on the gene annotation data developed in the early part of the project, it turned out that specific probes for different exons could not be scaled up to a large array because no uniform hybridization conditions could be found. Therefore, we modified our original objective to design and produce an oligonucleotide microarray for probing alternative splicing and realized that it may be reasonable to investigate the extent of alternative splicing using novel commercial whole genome arrays. This possibility was directly examined by establishing algorithms for the analysis of such arrays. The predictive value of the algorithms was then shown by isolation and verification of alternative splicing predictions from the published whole genome array databases. The BARD-funded work provides a significant advance in understanding the extent and possible roles of alternative splicing in plants as well as a foundation for advances in computational gene prediction.

APA, Harvard, Vancouver, ISO, and other styles

9

Gur, Amit, Edward Buckler, Joseph Burger, Yaakov Tadmor, and Iftach Klapp. Characterization of genetic variation and yield heterosis in Cucumis melo. United States Department of Agriculture, January 2016. http://dx.doi.org/10.32747/2016.7600047.bard.

Full text

Abstract:

Project objectives: 1) Characterization of variation for yield heterosis in melon using Half-Diallele (HDA) design. 2) Development and implementation of image-based yield phenotyping in melon. 3) Characterization of genetic, epigenetic and transcriptional variation across 25 founder lines and selected hybrids. The epigentic part of this objective was modified during the course of the project: instead of characterization of chromatin structure in a single melon line through genome-wide mapping of nucleosomes using MNase-seq approach, we took advantage of rapid advancements in single-molecule sequencing and shifted the focus to Nanoporelong-read sequencing of all 25 founder lines. This analysis provides invaluable information on genome-wide structural variation across our diversity 4) Integrated analyses and development of prediction models Agricultural heterosis relates to hybrids that outperform their inbred parents for yield. First generation (F1) hybrids are produced in many crop species and it is estimated that heterosis increases yield by 15-30% globally. Melon (Cucumismelo) is an economically important species of The Cucurbitaceae family and is among the most important fleshy fruits for fresh consumption Worldwide. The major goal of this project was to explore the patterns and magnitude of yield heterosis in melon and link it to whole genome sequence variation. A core subset of 25 diverse lines was selected from the Newe-Yaar melon diversity panel for whole-genome re-sequencing (WGS) and test-crosses, to produce structured half-diallele design of 300 F1 hybrids (MelHDA25). Yield variation was measured in replicated yield trials at the whole-plant and at the rootstock levels (through a common-scion grafted experiments), across the F1s and parental lines. As part of this project we also developed an algorithmic pipeline for detection and yield estimation of melons from aerial-images, towards future implementation of such high throughput, cost-effective method for remote yield evaluation in open-field melons. We found extensive, highly heritable root-derived yield variation across the diallele population that was characterized by prominent best-parent heterosis (BPH), where hybrids rootstocks outperformed their parents by 38% and 56 % under optimal irrigation and drought- stress, respectively. Through integration of the genotypic data (~4,000,000 SNPs) and yield analyses we show that root-derived hybrids yield is independent of parental genetic distance. However, we mapped novel root-derived yield QTLs through genome-wide association (GWA) analysis and a multi-QTLs model explained more than 45% of the hybrids yield variation, providing a potential route for marker-assisted hybrid rootstock breeding. Four selected hybrid rootstocks are further studied under multiple scion varieties and their validated positive effect on yield performance is now leading to ongoing evaluation of their commercial potential. On the genomic level, this project resulted in 3 layers of data: 1) whole-genome short-read Illumina sequencing (30X) of the 25 founder lines provided us with 25 genome alignments and high-density melon HapMap that is already shown to be an effective resource for QTL annotation and candidate gene analysis in melon. 2) fast advancements in long-read single-molecule sequencing allowed us to shift focus towards this technology and generate ~50X Nanoporesequencing of the 25 founders which in combination with the short-read data now enable de novo assembly of the 25 genomes that will soon lead to construction of the first melon pan-genome. 3) Transcriptomic (3' RNA-Seq) analysis of several selected hybrids and their parents provide preliminary information on differentially expressed genes that can be further used to explain the root-derived yield variation. Taken together, this project expanded our view on yield heterosis in melon with novel specific insights on root-derived yield heterosis. To our knowledge, thus far this is the largest systematic genetic analysis of rootstock effects on yield heterosis in cucurbits or any other crop plant, and our results are now translated into potential breeding applications. The genomic resources that were developed as part of this project are putting melon in the forefront of genomic research and will continue to be useful tool for the cucurbits community in years to come.

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!