To see the other types of publications on this topic, follow the link: RSAM.
Dissertations / Theses on the topic 'RSAM'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'RSAM.'
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 dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Bonfim, Daniele Helena. "Criptografia RSA." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06042017-164507/.
Full textAbstract:
Neste trabalho é apresentado um pouco da história da criptografia, assim como sua importância nos dias atuais, a base da teoria dos números e de congruência modular necessárias para compreender a criptografia RSA, que é o foco deste trabalho. A criptografia RSA é a mais usada atualmente por causa da dificuldade em ser decodificada. Foi elaborada e apresentada uma aula aos alunos do ensino fundamental e médio participantes do Programa de Iniciação Científica Júnior da OBMEP, sendo mostrado o porquê ela funciona, os métodos de codificação e decodificação.In this work some of the history of cryptography is presented, as well as its nowadays applications. The RSA encryption is the most widely used because of the difficulty to being decoded. In order to understand the RSA encryption, which is the focus of this work, we recall some basis of number theory and modular congruence. Also, it was prepared and presented a lecture to the students of middle and high school participants in the Program of Junior Scientific Initiation of OBMEP, being shown why it works, methods of encoding and decoding.
2
Sipola, T. (Tapani). "RSA-salausmenetelmä." Bachelor's thesis, University of Oulu, 2017. http://urn.fi/URN:NBN:fi:oulu-201710193003.
Full textAbstract:
Tutkielmassa esitellään lyhyesti salakirjoituksen perusperiaatteita. Tämän jälkeen perehdytään RSA-salauksen periaatteeseen, jonka toimivuus todistetaan. Lisäksi kerrotaan RSA-salauksen käytöstä digitaalisessa allekirjoituksessa. Lopuksi perustellaan RSA-salauksen turvallisuutta tutkimalla mahdollisia heikkouksia ja miten niitä voi välttää. RSA-salaus hyödyntää nopeaa potenssiinkorotusalgoritmia, jota sovelletaan kautta työn.
3
Gafitoiu, Izabela Beatrice. "Polynomial based RSA." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-44771.
Full textAbstract:
The RSA public-key cryptosystem has a major role in information security even today, after more than three decades since it was invented. The reason why is that the security provided by this algorithm relies on the fact that integer factorization is considered to be a hard problem. The day someone finds an efficient algorithm to factor integers, is the day when the RSA cryptosystem, used millions of times every day, will not be secure anymore. A good perspective is to look ahead of that day, and start thinking about alternatives. A polynomial version of the RSA cryptosystem is one such idea someone can think about. The idea will be analyzed from three main points of view, namely whether it is easy to encrypt messages, whether it is correct, that is whether the private key will always restore the plaintext, and the last point to be analyzed is the degree of difficulty of breaking the code, or in other words how secure the algorithm is. The original RSA cryptosystem and the polynomial version will be discussed in parallel all the time.
4
Stacey, Sean D. "Regulating rsmA Expression in Pseudomonas aeruginosa." Digital Commons @ East Tennessee State University, 2013. https://dc.etsu.edu/etd/1232.
Full textAbstract:
Pseudomonas aeruginosa, a Gram-negative bacillus, commonly infects immunocompromised individuals and uses a variety of virulence factors to persist in these hosts. The posttranscriptional regulator, RsmA, plays a role in the expression of many virulence factors in P. aeruginosa. RsmA up regulates virulence factors used in colonizing hosts. However, regulation of rsmA is not well elucidated. Transposon mutagenesis was performed on P. aeruginosa containing a transcriptional rsmA-lacZ fusion to answer this question. Mutants were screened via β-galactosidase assay and transposon insertions identified via arbitrary PCR. A probable MFS transporter, we named mtpX, was one significant transposon mutant identified. A ΔmtpX mutant containing the rsmA-lacZ transcriptional fusion was constructed to confirm our results. Further analysis of rsmA, looking at RNA and protein levels, revealed varying results in nonmucoid versus mucoid backgrounds. Phenotypic assays were performed to characterize this unknown transporter and develop a putative mechanism as to how MtpX affects rsmA expression.
5
Gustafsson, Jonas, and Isac Olofsson. "RSA-kryptografi för gymnasiet." Thesis, Örebro universitet, Akademin för naturvetenskap och teknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-15300.
Full textAbstract:
Denna bok riktar sig till gymnasieelever som vill fördjupa sig i ämnet RSA-kryptografi . RSA-kryptografi är en avancerad metod för att kommunicera med hemliga meddelanden och används flitigt inom t.ex. bankvärlden. När du handlar med ditt kort eller använder din e-legitimation används RSA-kryptogra fi för att allt du gör ska vara skyddat och säkert. Vid stora transaktioner mellan olika banker används också RSA-kryptogra fi för att både den som betalar och den som får betalt ska vara säkra att allt går rätt till.Boken är uppdelad i fyra kapitel. Kapitel 3 och 4 är betydligt mer avancerade än kapitel 1 och 2. Kapitel 1 består mestadels av exempel och övningar som behandlar matematiken som krävs för att kunna utföra RSA-kryptogra fi med små tal. Kapitel 2 använder matematiken i kapitel 1 för att genom exempel och övingar metodiskt lära ut hur RSA-kryptogra fi med små tal går till. Kapitel 3 visar matematiken som ligger till grund för att RSA-kryptografi fungerar. Detta visas med hjälp av exempel, satser, förtydligade bevis samt några enstaka övningar. Kapitel 4 förklarar varför RSA-kryptografi är säkert och enkelt att använda. Primtalstester utgör det viktigaste ämnet i detta sista kapitel.
6
Speaks, Tyler. "AlgR Directly Controls rsmA in Pseudomonas aeruginosa." Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etd/2570.
Full textAbstract:
Pseudomonas aeruginosa is a bacterial pathogen that can infect any human tissue. The lungs of cystic fibrosis patients become chronically infected with Pseudomonas aeruginosa. Virulence factor gene expression is under elaborate regulatory control that remains poorly characterized. Understanding the regulatory hierarchy involved during infection is essential for identifying novel drug targets. RsmA is a post-transcriptional regulatory protein that controls expression of several virulence factors. Previous studies demonstrated alginate regulatory components AlgU and AlgR as regulators of rsmA expression. The aim of this study was to determine how AlgR controls rsmA expression. Western blot analysis of HA-tagged RsmA confirmed lower RsmA levels in an algR mutant. An electrophoretic mobility shift assay using purified AlgR demonstrated direct binding of AlgR to the rsmA promoter. These results indicate AlgR directly controls rsmA expression. We propose a mechanism whereby AlgR and AlgU work together to regulate rsmA.
7
Miller, Ian. "Post-transcriptional Regulation of RsmA In Pseudomonas aeruginosa." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3481.
Full textAbstract:
Pseudomonas aeruginosa is a Gram-negative bacillus found in numerous environments. Gene regulatory mechanisms such as; Two-Component Systems, transcriptional and post-transcriptional regulators, and small non-coding RNAs control the expression of virulence factors that allow P. aeruginosa to initiate acute infections and persist as a chronic infection. A significant post-transcriptional regulator involved in these regulatory networks is the Regulator of Secondary Metabolites (RsmA). In this study, we investigated the contribution of a putative stem-loop on expression of RsmA. We constructed rsmA leader fusions to measure translation with and without the stem-loop present. Secondly, we introduced point mutations to disrupt the formation of the stem-loop. Finally, we performed Site-Directed Mutagenesis on the rsmA leader to examine protein levels in vivo by western blot analysis using an HA-tagged rsmA. Our data suggests that the segment of RNA that contains the putative stem-loop structure serves some function in post-transcriptional regulation of RsmA.
8
Sutherland, Andrew 1980. "Towards RSEAM : resilient serial execution on amorphous machines." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/87884.
Full textAbstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.Includes bibliographical references (p. 94-95).
by Andrew Sutherland.
M.Eng.
9
Hervig, Vidar Eikrem. "RSA krypterings-system for AHEAD." Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10314.
Full textAbstract:
I denne masteroppgaven er det blitt designet en RSA-modul for forskningsprosjektet AHEAD. Dette er en modul som gjennomfører en kryptografialgoritme. RSA-modulen omformer klartekst til chiffertekst, (kryptering), og tilbake igjen til klartekst (dekryptering). Dette gjøres ved å lage en krets som utfører modulær eksponering. Kretsrealiseringen av RSA-algoritmen er gjort ved å benytte venstre til høyre binær metoden og Blakleys algoritme. Simulering med 128 bitskryptering gir korrekt oppførsel. Det er blitt testet med to meldinger som er blitt kryptert og dekryptert igjen. Syntese med 128 bitskryptering bruker 13% av slicene på Spartan 3 FPGA'en med en frekvens på 59Mhz. Ved syntese med 256 og 512 bitskryptering øker antall slicer lineært, mens frekvensen synker. Det prøvd er å tilpasse krypteringsmodulen til utviklingskortet som benyttes innen AHEAD. Arbeidet med utviklingsverktøyene har vært tidkrevende, spesielt har det vært problemer med å laste ned ny bit-fil på kortet. Det har derfor ikke blitt tid til å ferdigstille dette arbeidet. I slutten av denne rapporten er det skissert hvordan dette kan løses, med registertilkoblinger og beskrivelse av programvarens oppgaver på utviklingskortet.
10
Palmieri, Riccardo. "Attacchi a RSA e reticoli." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/5910/.
Full textAbstract:
L'elaborato riguarda uno specifico attacco all'RSA tramite teoremi sui reticoli elaborato da Coppersmith. Dopo una breve introduzione sulla crittografia simmetrica e asimettrica, cioè a chiave pubblica, vengono definiti i reticoli, basi di reticoli, basi ridotte, l'algoritmo LLL.
In seguito viene mostrato come applicare quest'ultimo algoritmo nella risoluzione di equazioni modulari ad una variabili e le sue applicazioni come attacco all'RSA.
11
Diomedi, Stefano. "Attacco di Wiener a RSA." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8708/.
Full textAbstract:
La mia tesi parla di un attacco crittografico ad RSA, ideato da Wiener, basato sulle frazioni continue. Il primo capitolo riguarda RSA, il secondo spiega la teoria delle frazioni continue e nel terzo spiego l'attacco passo per passo.
12
Bragonzoni, Laura <1973>. "RSA dinamica nella cinematica articolare." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2008. http://amsdottorato.unibo.it/1141/.
Full text
13
Okumura, Mirella Kiyo. "Números primos e criptografia RSA." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-04042014-101744/.
Full textAbstract:
Estudamos a criptografia RSA como uma importante aplicação dos números primos e da aritmética modular. Apresentamos algumas sugestões de atividades relacionadas ao tema a serem desenvolvidas em sala de aula nas séries finais do ensino fundamentalWe studied RSA cryptography as an important application to prime numbers and modular arithmetic. We present some suggestions of activities related to the subject to be developed in classrooms of the final years of elementary school vii
14
Howgrave-Graham, Nicholas A. "Computational mathematics inspired by RSA." Thesis, University of Bath, 1998. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299651.
Full text
15
Pereira, Júlio César. "Números primos e criptografia RSA." Universidade Federal de Viçosa, 2017. http://www.locus.ufv.br/handle/123456789/18026.
Full textAbstract:
Submitted by Reginaldo Soares de Freitas (reginaldo.freitas@ufv.br) on 2018-03-02T12:15:07Z
No. of bitstreams: 1
texto completo.pdf: 639149 bytes, checksum: 4b2cd92b220b265090f96f8888849971 (MD5)Made available in DSpace on 2018-03-02T12:15:07Z (GMT). No. of bitstreams: 1 texto completo.pdf: 639149 bytes, checksum: 4b2cd92b220b265090f96f8888849971 (MD5) Previous issue date: 2017-08-07
Este trabalho apresenta uma revisão teórica de alguns conceitos da teoria dos números como o princípio da indução finita, o algoritmo da divisão Euclidiana, o teorema fundamental da aritmética, relações de equivalência, congruência módulo m, classes de equivalência e conjuntos quocientes. O objetivo principal ́e realizar um estudo das propriedades dos números primos, das propriedades da fatoração numérica, noções de máximo divisor comum e aritmética modular, apresentar aplicações práticas destes conceitos e uma aplicação da criptografia RSA. Para isso, ́e apresentado um estudo sistemas de equações lineares utilizando o teorema chinês do resto, que pode ser aplicado como um método de criptografia para partilhas de senhas. Por fim, ́e elaborada uma aplicação de criptografia para alunos de ensino médio
The present study provides a theoretical review of some concepts of the theory of numbers such as the principle of finite induction, Euclidean division algorithm, fundamental theorem of arithmetic, equivalence relations, congruence modulo m, equivalence classes and quotient sets. The primary objective was to perform a study of the properties of prime numbers, properties of numerical factorization, notions of greatest common divisor and modular arithmetic and to present practical applications of these concepts and an application of RSA cryptography. To this end, we report a study of a system of linear equations using the Chinese remainder theorem, which can be applied as a cryptography method for password sharing. Lastly, a cryptography application was devised for high-school students
16
Leite, Helena Ingildo de Sá Queirós. "Ataques ao sistema criptográfico RSA." Master's thesis, Universidade de Aveiro, 2009. http://hdl.handle.net/10773/9356.
Full textAbstract:
Mestrado em Matemática e AplicaçõesO RSA é um sistema criptográfico de chave pública, inventado, em 1978, por Rivest, Shamir e Adleman. Neste trabalho, serão abordadas várias técnicas desenvolvidas desde então para quebrar este sistema. Iremos descrever vários métodos de factorização, de onde destacamos o crivo quadrático, o crivo geral dos corpos de números e o método das curvas elípticas. Iremos também estudar vários ataques ao RSA que, de forma a serem evitados, vieram a permitir uma implementação mais adequada do RSA. Destes ataques destacamos aqueles que quebram o RSA quando o expoente público ou o expoente privado são demasiado pequenos, o ataque dos tempos de Kocher e o ataque com parte da chave privada exposta. Muitos dos métodos descritos são acompanhados, em apêndice, com um algoritmo, construído no software Maple 9.5.
The RSA is a cryptographic system invented in 1978 by Rivest, Shamir and Adleman. In this work, we will study several methods developed since then to break this system. We will describe some factorization methods, of which we highlight the quadratic sieve, the general number field sieve and the elliptic curve method. We will also study several attacks to RSA that, in order to avoid them, a better implementation of the RSA was achieved. In particular, we will describe those that break the RSA when a small public exponent or a small private exponent is used. We will also see the Kocher’s timing attack and partial private key exposure attack. Many of the methods are accompanied, in the appendix, by an algorithm constructed using the software Maple 9.5.
17
Kuhne, Sarah Anna. "RsmA - a global post-transcriptional regulator in Pseudomonas aeruginosa." Thesis, University of Nottingham, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.519398.
Full text
18
Lovelock, Laura Charlotte. "RsmN : a new atypical RsmA homologue in Pseudomonas aeruginosa." Thesis, University of Nottingham, 2012. http://eprints.nottingham.ac.uk/12562/.
Full textAbstract:
The RsmA/CsrA family of global post-transcriptional regulators are small RNA-binding proteins involved in the regulation of a large number of genes such as those involved in quorum sensing, virulence factor production, secondary metabolism, motility and biofilm formation. They bind to target mRNAs and hence modulate their stability and translation rates. Their effects are antagonised by small non-coding regulatory RNAs. The control of expression of target genes via this post-transcriptional regulatory network is mostly operated in Pseudomonas spp. via the GacS/GacA two component system. This study aimed to perform a biophysical analysis of RsmA and to obtain a preliminary understanding of the structure, function and regulation of RsmN, a new atypical RsmA homologue from Pseudomonas aeruginosa. RsmA was purified and biophysical analysis confirmed that RsmA exists as a dimer and is highly stable at high temperatures (75 °C) and low pH (5.2). Although RsmN was found to be structurally similar to RsmA, no functional phenotypes have been identified. Consequently, rsmN was mutated and transcriptional fusions to rsmN and its anti-sense transcript were constructed for expression studies. Phenotypic analysis indicated that RsmN was not involved in the control of swarming, pyocyanin, elastase and protease production or glycogen accumulation. Unlike RsmA, RsmN does not have a control on the restriction modification system of P. aeruginosa. Transcriptional fusions revealed RetS, LadS and GacA all appear to have a 21 significant effect as activators of both the rsmN and nmsR promoters. 2-Alkyl-4(1H)-quinolone (AQ) signalling also modulate rsmN expression possibly via the iron chelating properties of 2-alkyl-3-hydroxy-4(1H)-heptyl-quinolone (PQS). RsmN targets identified from Deep Sequencing include those required for structural outer membrane proteins, transcriptional regulators as well as genes involved in motility, secretion, flagellar structure and biofilms. RsmA, RsmZ and RsmY were all identified as targets together with the small RNAs RgsA (indirectly gac-controlled) and the antagonistic RNA CrcZ (represses catabolite repression control protein Crc). Targets common to both RsmN and RsmA include the transcriptional regulators Vfr, PqsR, MvaT and Anr, regulatory RNAs RsmZ and RsmY together with transcripts corresponding to the pqsABCDE operon, LasB, LecA/B, RhlI, LasR/I, Crc and CrcZ. The identification of many mRNA targets for RsmN which are shared with targets of RsmA provides further evidence that RsmN is involved in global-post-transcriptional regulation of gene expression.
19
Greeff, Yolanda. "Inkomsteverdeling by genoteerde RSA industriele ondernemings." Thesis, Stellenbosch : Stellenbosch University, 1989. http://hdl.handle.net/10019.1/66900.
Full textAbstract:
Thesis (MBA)--Stellenbosch University, 1989.Some digitised pages may appear illegible due to the condition of the original hard copy.
ENGLISH ABSTRACT: see fulltext for abstract
AFRIKAANSE OPSOMMING: sien volteks vir opsomming
20
Shiba, Nomsa. "Published RSA cash value added statements." Thesis, Stellenbosch : Stellenbosch University, 1999. http://hdl.handle.net/10019.1/72015.
Full textAbstract:
Thesis (MBA)--Stellenbosch University, 1999.ENGLISH ABSTRACT: This study project explores cash value added statements (CVAS). a South African innovation. A complete survey is made of all the CV AS published by listed South African industrial companies from 1991 up to 1998. The survey yields a total of 18 listed South African industrials, which started to publish a CV AS in different years. Together, the 18 companies provide a population of 89 cash value added statements for analysis. The aim of the study is to establish how South African companies prepare a CV AS against a background which lacks a formal Accounting Standard on the subject. Secondly. it seeks to unravel any variations and mistakes presentation of published CY AS as measured against a standardized model of CY AS. In order to highlight the variations, a fault bank is created. An analysis of the fault bank reveals a number of differences in the treatment of certain components of a CV AS by listed South African industrial companies. Major deviations from the standardized model of a CVAS involve interest, dividends and taxation.
Please refer to fulltext for Afrikaans abstract
21
León, Lomparte Katia Regina. "Encriptación RSA de archivos de texto." Master's thesis, Pontificia Universidad Católica del Perú, 2005. http://tesis.pucp.edu.pe/repositorio/handle/123456789/131.
Full textAbstract:
En este trabajo se presentará el método desarrollado en 1978 por R. L. Rivest, A. Shamir y L. Adleman y que es conocido como sistema criptográfico RSA por las iniciales de sus autores. Basa su seguridad en la dificultad de factorizar números primos muy grandes aunque como todo sistema de encriptación de clave pública, el RSA puede estar sujeto a ataques con el fin de obtener el mensaje original o descubrir la clave privada.Tesis
22
Molinari, José Robyson Aggio. "NÚMEROS PRIMOS E A CRIPTOGRAFIA RSA." UNIVERSIDADE ESTADUAL DE PONTA GROSSA, 2016. http://tede2.uepg.br/jspui/handle/prefix/1504.
Full textAbstract:
Made available in DSpace on 2017-07-21T20:56:28Z (GMT). No. of bitstreams: 1
Jose Robyson Aggio Molinari.pdf: 837254 bytes, checksum: a577b2742ab4df347179d61529e63767 (MD5)
Previous issue date: 2016-02-03This study presents some of the encryption methods used in antiquity as well as the advance in the way of encrypting. The main objective of this work is the study of RSA Method: its Historical context, the importance of prime numbers, the inefficiency of factorization algorithms, coding, decoding, its security and a study of the Euler function. Some activities with mathematical content related to encryption have been developed. Thus, it is expected that this research can present an auxiliary methodology for teaching certain math content, linked to the utilization of cryptography.
Este trabalho apresenta alguns métodos de criptografia utilizados na antiguidade e também o avanço na maneira de criptografar. O objetivo principal é o estudo do Método RSA: contextualização histórica, a importância dos números primos, a ineficiência dos algoritmos de fatoração, codificação, decodificação, a segurança e um estudo sobre a função de Euler. Desenvolveu-se algumas atividades com conteúdos matemáticos relacionadas à criptografia. Desta maneira, espera-se que esta pesquisa possa apresentar uma metodologia auxiliar para o ensino de certos conteúdos da matemática, articulados com a utilização da criptografia.
23
Souza, Bianca Amoras de. "Teoria dos numeros e o RSA." [s.n.], 2004. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307505.
Full textAbstract:
Orientador: Jose Plinio de Oliveira SantosDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-03T22:18:53Z (GMT). No. of bitstreams: 1 Souza_BiancaAmorasde_M.pdf: 339158 bytes, checksum: 2760b906f8e03ca670c535b6cb45d66a (MD5) Previous issue date: 2004
Resumo: A Teoria dos Números tem sido objeto de estudo desde a antiguidade. Nas últimas duas décadas, este campo da Matemática tem ganho maior interesse devido à sua utilização em criptografia. Os criptossistemas de chave pública têm sua segurança baseada em problemas da Teoria dos Números que são computacionalmente difíceis de resolver. O RSA baseia sua segurança na dificuldade de fatorar números que são produtos de dois primos grandes. Neste trabalho, descreveremos o RSA. Como estamos também interessados na geração de números primos e na fatoração de inteiros, apresentaremos alguns testes de primalidade e métodos de fatoração
Abstract: Number Theory has been subject of study since the ancient years. In the two last decades, this field of Mathematics has gained much interest due to its use in cryptography. The public-key cryptosystems have their security based on number theoretic problems which are computationally hard to solve. The RSA base its security on the difficulty in factoring numbers that are products of two big primes. In this work, we describe the RSA. As we are interested also in the generation of prime numbers and factorization of integers, we present some methods for primality testing and integer factorization
Mestrado
Mestre em Matemática Aplicada
24
Sousa, Antonio Nilson Laurindo [UNESP]. "Criptografia de chave pública, criptografia RSA." Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/94349.
Full textAbstract:
Made available in DSpace on 2014-06-11T19:27:09Z (GMT). No. of bitstreams: 0
Previous issue date: 2013-08-16Bitstream added on 2014-06-13T20:35:15Z : No. of bitstreams: 1
sousa_anl_me_rcla.pdf: 535933 bytes, checksum: 76cd9ddeb4c3e3c566bae5395dfcaa14 (MD5)Este trabalho apresenta a criptografia, que é estudada desde a antiguidade e suas técnicas hoje consistem basicamente em conceitos matemáticos. Os números inteiros prestam um papel importante na criptografia de chave pública RSA, onde são apresentados alguns conceitos importantes, propriedades e resultados desse conjunto, destacando as relações com os números primos, a função de Euler e a operação módulo, conhecida como problema do logaritmo discreto. Apresentam-se os fundamentos da Criptografia de Chave Pública RSA, em que a base é a cifra assimétrica, mostrando a garantia da privacidade e assinatura das mensagens. Finaliza-se com a ideia do protocolo de criptografia RSA, a construção de um sistema de correios eletrônico, cuja essência é o método para estabelecer uma criptografia de chave pública RSA, baseada no conceito apresentado por Diffie e Hellman
This dissertation presents Cryptography, which is studied since the ancient times and whose techniques consist basically of mathematical concepts. The integers play an important role on the Public Key Cryptography RSA, for which are presented some important results and properties of this set, emphasizing its relations with prime numbers, Euler’s totient function and the modulo operation, also known as the problem of discrete logarithm. We present the foundations of the Public Key Cryptography RSA, whose basis is the asymmetric cipher, showing the privacy security of the messages. It ends with the idea of the RSA cryptography protocol, a construction of an electronic mail system, whose gist lies in the method used to establish a Public Key Criptography system RSA, based on the concept presented by Diffie and Hellman
25
Sousa, Antonio Nilson Laurindo. "Criptografia de chave pública, criptografia RSA /." Rio Claro, 2013. http://hdl.handle.net/11449/94349.
Full textAbstract:
Orientador: Eliris Cristina RizziolliBanca: Aldicio José Miranda
Banca: Henrique Lazari
Resumo: Este trabalho apresenta a criptografia, que é estudada desde a antiguidade e suas técnicas hoje consistem basicamente em conceitos matemáticos. Os números inteiros prestam um papel importante na criptografia de chave pública RSA, onde são apresentados alguns conceitos importantes, propriedades e resultados desse conjunto, destacando as relações com os números primos, a função de Euler e a operação módulo, conhecida como problema do logaritmo discreto. Apresentam-se os fundamentos da Criptografia de Chave Pública RSA, em que a base é a cifra assimétrica, mostrando a garantia da privacidade e assinatura das mensagens. Finaliza-se com a ideia do protocolo de criptografia RSA, a construção de um sistema de correios eletrônico, cuja essência é o método para estabelecer uma criptografia de chave pública RSA, baseada no conceito apresentado por Diffie e Hellman
Abstract: This dissertation presents Cryptography, which is studied since the ancient times and whose techniques consist basically of mathematical concepts. The integers play an important role on the Public Key Cryptography RSA, for which are presented some important results and properties of this set, emphasizing its relations with prime numbers, Euler's totient function and the modulo operation, also known as the problem of discrete logarithm. We present the foundations of the Public Key Cryptography RSA, whose basis is the asymmetric cipher, showing the privacy security of the messages. It ends with the idea of the RSA cryptography protocol, a construction of an electronic mail system, whose gist lies in the method used to establish a Public Key Criptography system RSA, based on the concept presented by Diffie and Hellman
Mestre
26
Euzebio, Marcos Jose Candido 1961. "Implementação de um prototipo do RSA." [s.n.], 1987. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276541.
Full textAbstract:
Orientador: Claudio Leonardo LucchesiDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Ciencia da Computação
Made available in DSpace on 2018-07-14T18:03:51Z (GMT). No. of bitstreams: 1 Euzebio_MarcosJoseCandido_M.pdf: 2101753 bytes, checksum: a1464738af508bc0a32d3aec71592a14 (MD5) Previous issue date: 1987
Resumo: O objetivo deste trabalho é apresentar uma descrição da implementação de um protótipo para o RSA: o PRSA. O RSA é um sistema criptográfico de chave pública e tem sido reconhecido como uma das idéias mais brilhantes que apareceram nos últimos anos na área da criptografia. Sua implementação traz uma série de desafios, dentro de um espectro que vai da Teoria dos Números à. Análise de Complexidade de Algoritmos. A implementação de um protótipo para o RSA serve para estudar os gargalos que tornam a utilização prática do sistema inviável hoje em dia, mas além disso, permitiu o estudo de vários problemas correlatos à implementação do RSA, que se apresenta como um fértil campo para pesquisas. Este trabalho está organizado em três capítulos, onde são expostos vários aspectos da implementação do protótipo e cinco apêndices. No capítulo 1 são feitas algumas considerações a respeito de conceitos básicos de criptografia, com intenção de situar o contexto principal em que o trabalho foi feito. São feitas algumas definições gerais de sistemas criptográficos e é apresentado o RSA. O capítulo 2 se constitui dos principais algoritmos utilizados na implementação do programa. Além. dos algoritmos mais de alto nível em geral encontrados em artigos e livros da área, tentou-se apresentar alguns pontos a respeito da geração de números aleatórios e da aritmética de números de precisão múltipla. Já o capítulo 3 contém informações mais específicas do protótipo. É apresentada a organização modular do programa e a forma. de representação interna dos números de precisão múltipla. Além disso são mostrados dois testes de desempenho do protótipo: 1) Velocidade de ciframento e deciframento e 2) Eficiência da geração de números primos. Estas duas operações são as mais importantes na implementação do RSA. É falado também de algumas experiências feitas para permitir uma maior visualização práqca do desempenho do algoritmo de Rabin para teste de primalidade. Finalmente nos apêndices podem ser encontrados demonstrações de uso do PRSA, tabelas de números primos e uma descrição mais pormenorizada dos módulos componentes do programa.
Abstract: The main goal of this work is to present a description of the implementation of a prototype of the RSA criptosystem. The RSA is a public key cipher and has been considered one of the best inventions. in the last years in the criptography area. Its implementation brings a lot of problems, ranging from Number Theory to Analysis of Complexity of AIgorithms. The implemented proiotype was used to investigate some computing bottlenecks that make the practical use of the RSA criptosystem not interesting today, and to study others problems that arise in the implementation. This work is divided in three chapters and tive appendixes. In Chapter 1, in order to show the context where the work was made, are presented some" basic concepts of criptography. The RSA is described in this chapter too. The chapter 2 is formed with the main algorithms that the program use. There are some algorithins more easily found in criptography literature and some commonly found in seminumerical-algorithm literature. Chapter 3 describes other aspects of the program. There are informations about the way multiple precision numbers are represented internally by the program, one overview of the organization of the program modules and some tests made with the prototype in three machines: PC, VAX - 785 and D - 8000. . The appendixes contain some results obtained by the prototype and some demonstrations of its use.
Mestrado
Mestre em Ciência da Computação
27
Bitén, Fredrik, and Michael Lindell. "RSA- och AES-kryptering i Java." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177175.
Full textAbstract:
Kryptering har funnits under en lång tid och används i dagslaget till att göra information ej läsbar och på detta sätt skydda innehållet. Kryptering används också inom autentisering, för att skydda ens identitet. Målet med detta arbete är att utforma att ett verktyg som hanterar kryptering och dekryptering med två valda algoritmer. Då det redan finns ett stort antal välfungerande program som kan utföra detta siktas det att nå upp till denna standard, om inte bättre. Under slutet av arbetet kommer tester att göras i form av prestandajämförelser för att se om verktyget har nått upp till målet. Detta arbete görs i samarbete med Försvarsmakten. Denna rapport är skriven på Svenska.Encryption has been used for a long time and is used nowadays to encode information in such a way that authorized people will only be able to read it. Encryption is also used for authentication, to hide a person’s identity. The goal with this thesis is to create an encryption program which will be able to perform encryption and decryption with two algorithms. There are already a number of encryption programs on market and we hope that our program will be as good as these. Performance tests will be done after the program is finished to see if the goals have been achieved. This thesis is done together with the help from Forsvarsmakten. This thesis is written in Swedish.
28
Asketorp, Jonatan. "Attacking RSA moduli with SAT solvers." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157352.
Full textAbstract:
This thesis aimed to explore how sequential boolean satisability solvers can be used on the integer factorisation problem. The integer factorisation problem is believed to be hard and modern public key cryptography relies on that,note worthily SSL/TSL and SSH support the use of RSA. However, it is not proven that integer factorisation is hard and therefore it is of great importanceto explore dierent attack avenues. The modulus in RSA is a semiprime, e.g.an integer that is the product of two primes. Hence, in this thesis an empiricalstudy of the factorisation of semiprimes with a bit-length of up to 32 bits iscarried out. Randomly selected semiprimes are factorized through six dierent reductions using three dierent solvers (Glucose, Lingeling and PicoSAT) and the result are compared to that of MSieve, an open-source integer factorisationprogram. As seen in the comparison boolean satisability solvers cannot be used as a replacement of an integer factorisation solver. Additionally comparisons between the dierent reductions and boolean satisability solvers show that the combination of solver and reduction greatly aects performance. The implication is that further explorations of the integer factorisation problem with boolean satisability solvers can greatly benet from either avoiding a inadequate solver and reduction pair or from attempting to identify the outliers that signify a inadequate coupling.
29
Barbedo, Inês. "Sistema criptográfico RSA: ataques e variantes." Master's thesis, Universidade do Porto, Faculdade de Ciências, 2003. http://hdl.handle.net/10198/7797.
Full textAbstract:
O RSA é um sistema criptográfico de chave pública, o mais usado nos dias de hoje, que na escolha do módulo N=p.q (p e q primos), na geração das chaves (públicas e privadas) e nos processos de encriptação e desencriptação faz uso de resultados da Teoria de Números. Descreve-se o funcionamento deste sistema, fazendo referência a alguns aspectos a ter em atenção na sua implementação. Apresentam-se dois tipos de ataques que têm por objectivo, uns descobrir a chave privada e outros apenas o texto original sem saber a chave privada. Descrevem-se ainda variantes que não só podem tornar os processos mais rápidos como mais seguros.
30
Lays, Claire. "ARN régulateurs de Staphylococcus aureus : Rôle de RsaA dans la formation du biofilm et de la capsule, niveaux d'expression des ARN dans les prélèvements cliniques." Thesis, Lyon 1, 2012. http://www.theses.fr/2012LYO10344/document.
Full textAbstract:
Staphylococcus aureus est responsable de nombreuses infections nosocomiales etcommunautaires dont la diversité est liée à l’expression de nombreux facteurs de virulence.L’expression de ces facteurs est temporellement coordonnée au cours de l’infection par desfacteurs de transcription, des systèmes à 2 composants et des ARN régulateurs (ARNnc). Ungrand nombre d’ARNnc potentiels a été prédit dans le génome de S. aureus mais leur fonctionreste méconnue.L’objectif premier de ce travail a été de caractériser le rôle dans la régulation de la virulence del’un des ARNnc identifiés par notre équipe, RsaA. Des approches phénotypiques in vitro ontpermis de démontrer que RsaA active la formation du biofilm et réprime la synthèse de lacapsule bactérienne, avec une incidence sur l’opsonophagocytose de la bactérie et sur soninternalisation dans les macrophages. Au niveau moléculaire, RsaA réprime la traduction dufacteur de transcription MgrA, répresseur de la formation de la biofilm et activateur de lacapsule, par un mécanisme de type antisens entre RsaA et l’ARNm mgrA. Parallèlement, RsaAréprimerait l’opéron yabJ-spoVG, activateur de la synthèse de capsule. Ainsi, RsaA active laformation de biofilm et réprime la synthèse de capsule.Le second objectif de ce travail a été de caractériser l’expression in vivo de RsaA, E, G, H ainsique l’ARN III dans des prélèvements d’infections aiguës (abcès cutanés), chroniques (crachatsde patients mucoviscidiques) ou de portages nasales. L’étude de l’expression de ces ARN parRT-PCR, a permis de montrer que tous ces ARN sont exprimés avec une grande variabilité dansles prélèvements infectieux par rapport aux prélèvements de portagesStaphylococcus aureus is responsible for many nosocomial and communityinfections with a diversity linked to the expression of many virulence factors. Their expression istemporally coordinated during infection by transcription factors, two- component systems but alsoregulatory RNAs called non coding RNAs (ncRNAs). A large number of potential ncRNAs waspredicted in the genome of S. aureus but their function remains unknown.The first aim of this thesis was to characterize the role of one ncRNA identified by our team,RsaA, in the regulation of bacterial virulence. Several in vitro approaches allowed todemonstrate that RsaA activates biofilm formation and inhibits the bacterial capsule synthesis,with an impact on the bacterial opsonophagocytosis and internalization into macrophages. RsaArepresses the translation of mgrA mRNA by an antisense mechanism. mgrA codes for atrancriptional regulator known to repress biofilm formation but to activate capsule synthesis. Inparallel, RsaA represses the translation of the yabJ-spoVG operon, an activator of capsuleproduction. In this way, RsaA enhances biofilm formation and represses capsule synthesis.The second objective was to characterize the in vivo expression of RNA III and RsaA, E, G, HsRNAs in samples of acute infections (cutaneous absesses), chronicle infections (cystic fibrosis)and nasal carriage. The expression study (quantitative RT-PCR) allowed to demonstrate that allsRNA are expressed into samples but they have a high expression variability depending ofinfectious samples compared to asymptomatic carriage
31
O'Loughlin, Kerry. "The Role of Respiratory Sinus Arrhythmia Reactivity on the Association between Childhood Adversity, Symptoms of Psychopathology, and Metabolic Health." ScholarWorks @ UVM, 2020. https://scholarworks.uvm.edu/graddis/1113.
Full textAbstract:
Extant literature suggests that experiences of childhood adversity put individuals at increased risk for deleterious emotional-behavioral and metabolic outcomes. However, the precise mechanisms through which early adversity confers risk for such outcomes remains poorly understood. Therefore, this project sought to examine the extent to which Respiratory Sinus Arrhythmia reactivity (RSA-R), a metric of Parasympathetic Nervous System functioning, influences the relationship between adversity exposure and metrics of emotional-behavioral and metabolic health during childhood. Based on prior literature, we hypothesized that RSA-R would significantly moderate the association between exposure to childhood adversity and both emotional-behavioral and metabolic health. This hypothesis was partially supported. Indeed, RSA-R interacted with experiences of childhood adversity to predict internalizing symptoms and metabolic dysfunction. The implications of these findings and directions for future research will be discussed.
32
Ehsas, Nadja. "Introduktion till krypteringsmetoderna RSA och Merkle-Hellman." Thesis, Karlstads universitet, Fakulteten för teknik- och naturvetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-7456.
Full text
33
Krisell, Martin. "Elliptic Curve Digital Signatures in RSA Hardware." Thesis, Linköpings universitet, Informationskodning, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81084.
Full textAbstract:
A digital signature is the electronic counterpart to the hand written signature. It can prove the source and integrity of any digital data, and is a tool that is becoming increasingly important as more and more information is handled electronically. Digital signature schemes use a pair of keys. One key is secret and allows the owner to sign some data, and the other is public and allows anyone to verify the signature. Assuming that the keys are large enough, and that a secure scheme is used, it is impossible to find the private key given only the public key. Since a signature is valid for the signed message only, this also means that it is impossible to forge a digital signature. The most well-used scheme for constructing digital signatures today is RSA, which is based on the hard mathematical problem of integer factorization. There are, however, other mathematical problems that are considered even harder, which in practice means that the keys can be made shorter, resulting in a smaller memory footprint and faster computations. One such alternative approach is using elliptic curves. The underlying mathematical problem of elliptic curve cryptography is different to that of RSA, however some structure is shared. The purpose of this thesis was to evaluate the performance of elliptic curves compared to RSA, on a system designed to efficiently perform the operations associated with RSA. The discovered results are that the elliptic curve approach offers some great advantages, even when using RSA hardware, and that these advantages increase significantly if special hardware is used. Some usage cases of digital signatures may, for a few more years, still be in favor of the RSA approach when it comes to speed. For most cases, however, an elliptic curve system is the clear winner, and will likely be dominant within a near future.En digital signatur är den elektroniska motsvarigheten till en handskriven signatur. Den kan bevisa källa och integritet för valfri data, och är ett verktyg som blir allt viktigare i takt med att mer och mer information hanteras digitalt. Digitala signaturer använder sig av två nycklar. Den ena nyckeln är hemlig och tillåter ägaren att signera data, och den andra är offentlig och tillåter vem som helst att verifiera signaturen. Det är, under förutsättning att nycklarna är tillräck- ligt stora och att det valda systemet är säkert, omöjligt att hitta den hemliga nyckeln utifrån den offentliga. Eftersom en signatur endast är giltig för datan som signerades innebär detta också att det är omöjligt att förfalska en digital signatur. Den mest välanvända konstruktionen för att skapa digitala signaturer idag är RSA, som baseras på det svåra matematiska problemet att faktorisera heltal. Det finns dock andra matematiska problem som anses vara ännu svårare, vilket i praktiken innebär att nycklarna kan göras kortare, vilket i sin tur leder till att mindre minne behövs och att beräkningarna går snabbare. Ett sådant alternativ är att använda elliptiska kurvor. Det underliggande matematiska problemet för kryptering baserad på elliptiska kurvor skiljer sig från det som RSA bygger på, men de har en viss struktur gemensam. Syftet med detta examensarbete var att utvärdera hur elliptiska kurvor presterar jämfört med RSA, på ett system som är designat för att effektivt utföra RSA. De funna resultaten är att metoden med elliptiska kurvor ger stora fördelar, även om man nyttjar hårdvara avsedd för RSA, och att dessa fördelar ökar mångfaldigt om speciell hårdvara används. För några användarfall av digitala signaturer kan, under några år framöver, RSA fortfarande vara fördelaktigt om man bara tittar på hastigheten. För de flesta fall vinner dock elliptiska kurvor, och kommer troligen vara dominant inom kort.
34
May, Alexander. "New RSA vulnerabilities using lattice reduction methods." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=972386416.
Full text
35
Mauland, Atle. "Realizing Distributed RSA using Secure Multiparty Computations." Thesis, Norwegian University of Science and Technology, Department of Telematics, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9065.
Full textAbstract:
This thesis describes the basic theory of multiparty computation (MPC) in addition to a fully functional distributed Rivest-Shamir-Adleman (RSA) protocol for three players implemented in Virtual Ideal Functionality Framework (VIFF) using secure MPC (SMPC). MPC can be used to solve problems where n players, each with a private input xi, wants to compute a function with public output f(x1, x2, , xn) = y, such that the private inputs remains secret for each player, but the output y is public. A cornerstone in MPC is the concept of secret sharing. In secret sharing, a dealer has a secret and gives each participating player a share of the secret in such a way that a certain number of the players are needed in order to reconstruct the secret. The number of players needed to reconstruct the secret is referred to as the threshold of the scheme. VIFF is a high level programming framework that allows programmers to create applications using SMPC for any number of players in an easy, efficient and secure manner. The distributed RSA solution implemented in VIFF includes distributed key generation, decryption and signature, which are the main functions needed for the distributed RSA scheme, and is based on the distributed RSA algorithm proposed by Dan Boneh and Matthew Franklin in 1997. Four improvements compared to Boneh and Franklin's algorithm are described, two related to the run-time and two related to the security of the algorithm. The run-time improvements are regarding the distributed trial division step and the local trial division on the revealed N, both implemented. The security improvements are related to the way a random number is used to secure a revealed number. The first security improvement is related to the distributed trial division, whereas the second security improvement is regarding the alternative step in the biprimality test. The first security improvement, which is also the more important of the two, has been implemented in this thesis. At last some benchmarks regarding the key generation, decryption and signature process are presented, which indicates that the current implementation is best suited for scenarios where the distributed RSA keys can be generated in advance, whereas the decryption and signature process is fast enough for any type of scenario. The key generation process can become much faster with a few adjustments described at the end of the thesis.
36
Kleynscheldt, Rudolph Johannes. "Die vennootskapskonsep in skoolonderwys in die RSA." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/97515.
Full textAbstract:
Thesis (DPhil)--Stellenbosch University, 2002.ENGLISH ABSTRACT: The practice of partnership to the benefit of education is as old as education itself: Partners of education were involved in the most primitive societies. Partners are still of indispensable importance in postmodern societies. This study points out that the conventional partners to education (parent, church and state) have been of importance through the centuries and that partnership involvement should be of increasing importance in times to come. Concurrently, it has become necessary to involve new up-to-date supplementary education partners to address the numerous challenges in the field of education. The parent comes to light as the first and foremost partner in education and is therefore worthy of the connotation primary education partner. History illustrates how certain communities, due to specific perspectives on wond and life, ideologies and educational institutions, tried to scale down the functions of this partner. Nowhere, however, could it be achieved successfully, without serious harmful consequences for the child who is to be educated. The safety and security that the child experiences in the parental home and within the family structure is of the utmost importance for the young child. The proliferation in the number of parentiess children as a result of an increase in the divorce rate, family murders and especially the pandemic MI virus is alarming in this respect. Additional partners will have to be found to address the child's need of security. The anchor provided by participation in religious activities is likewise for the developing child of importance. In addition, the church, in the widest sense of its meaning, emphasizes certain norms and moral values. It provides programmes, which ensure to prevent the youths from derailment along dangerous and destructive routes. The church needs to be admitted and invited to be an essential partner. The state is justly being viewed as a chief partner to education and training, on account of its functions such as the funding of formal education, the provision of a general curriculum and the making of legislation governing education. This important position in the education partnership does not mean that the state should play the dominant role. It does not qualify the state to prescribe to the other partners how they should perform their roles. Partnership presupposes c0- operation and stringent prescriptions by the state would be unacceptable and counter-productive to the respective partners. The conventional partners will have to realise that each has a meaningful contribution to make, which cannot be substituted. by anyone of the others, A comparative study of partnership in Kenya, Cuba and Germany serves as a background study. In an ever-fast changing wortd in which extremely heavy demands are made to education and its partners, it is clear that new education partners have to be found to assist the school. The conventional partners are just not able to fulfit the task by themselves. This study identifies a number of supplementary partners that could, on account of the particular challenges facing· education in South Africa, make a valuable contribution. Partners deserve their position as partners due to the functional role that they could play at a specific stage in the ongoing process of education development. As times change, and new needs come into existence, other partners will have to be identified to support the existing, conventional partners.
AFRIKAANSE OPSOMMING: Die gebruik van vennote wat vir die opvoeding van waarde kan wees, is so oud soos die opvoeding self. Opvoedingsvennote het in die mees primitiewe samelewings voorgekom en is in die postmoderne samelewings steeds van onmisbare belang. Hierdie studie dui aan dat die konvensionele opvoedingsvennote (ouer, kerk, staat) deur die eeue van belang was en dat hul vennootskaplike deelname in die toekoms verhoog behoort te word. Terselfdertyd het dit nodig geword om nuwerwetse, supplementêre opvoedingsvennote te betrek om die talle uitdagings op onderwysgebied die hoof te bied. Die ouer tree na vore as die eerste en vernaamste opvoedingsvennoot en is as sodanig die benaming primêre opvoedingsvennoot waardig. Die geskiedenis toon aan hoedat sekere gemeenskappe op grond van bepaalde partikuliere wêreld- en lewensbeskouings, ideologieë en opvoedingsdoelstellings die rol van hierdie vennoot wou afskaal, maar dat dit nêrens sonder nadelige gevolge vir die opvoedeling gedoen kon word nie. Die veiligheid, sekuriteit en geborgenheid wat die kind in die ouerhuis en binne die gesinstruktuur beleef, is veral vir die jong kind van allergrootse belang. Die groter wordende getalouerlose kinders as gevolg van 'n toename in egskeidings, gesinsmoorde en veral die pandemiese MI-virus, is in hierdie verband kommerwekkend. Supptementêre vennote sal daarom gevind moet word om die kind se behoefte aan geborgenheid aan te spreek. Die verankerdheid wat deelname aan religieuse aktiwiteite bied, is eweneens vir die ontwikkelende kind van belang. Daarbenewens beklemtoon die kerk, in die wydste sin gedefinieer, sekere norme en morele waardes en voorsien hy programme wat verseker dat die jeug se vryetydsbesteding en drang na plesier nie op gevaarlike, afbrekende roetes ontspoor nie. Die kerk sal steeds as noodsaaklike opvoedingsvennoot toegelaat en uitgenooi moet word. Die staat word vanweë funksies soos die befondsing van formele onderwys, die daarstelling van 'n algemene kurrikulum en die neerlê van onderwyswetgewing met reg as hoofvennoot van die opvoeding, onderwys en opleiding beskou. Hierdie posisie in die vennootskap beteken nie dat die staat die oorheersende rol speel en aan ander vennote kan voorskryf hoedanig hul rolle sal wees nie. Vennootskap veronderstel samewerking en streng voorskriftelikhede sal vir medevennote onaanvaarbaar wees. Die konvensionele vennote sal moet besef dat elkeen se bydrae tot die opvoeding belangrik is en nie deur ander vennote vervang kan word nie. 'n Vergelykende studie van vennootskaplikheid in Kenia, Kuba en Duitsland dien as agtergrond tot die studie. In 'n wêreld wat vinnig en voortdurend verander en waar hoë eise aan die opvoeding en sy vennote gestel word, is dit duidelik dat nuwe opvoedingsvennote gevind sal moet word om bystand te ver1een. Die konvensionele vennote is gewoon nie in staat om die mas alleen op te kom nie. Hierdie studie identifiseer 'n aantal supplementêre vennote wat, op grond van die eiesoortige probleme wat in die Suid-Afrikaanse opvoeding ondervind word, van waarde sal kan wees. Soos tye verander en nuwe behoeftes ontstaan, sal ander vennote geïdentifiseer moet word om die konvensienete opvoedingsvennote te ondersteun.
37
Clevenger, Mark Allen. "Data encryption using RSA public-key cryptosystem." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1014844.
Full textAbstract:
The RSA data encryption algorithm was developed by Ronald Rivest, Adi Shamir and Leonard Adelman in 1978 and is considered a de facto standard for public-key encryption. This computer science thesis demonstrates the author's ability to engineer a software system based on the RSA algorithm. This adaptation of the RSA encryption process was devised to be used on any type of data file, binary as well as text. In the process of developing this computer system, software tools were constructed that allow the exploration of the components of the RSA encryption algorithm. The RSA algorithm was further interpolated as a method of providing software licensing, that is, a manner in which authorization to execute a particular piece of software can be determined at execution time. This document summarizes the RSA encryption process and describes the tools utilized to construct a computer system based on this algorithm.Department of Computer Science
38
Magalhães, Inês Monteiro Barbedo de. "O Sistema criptográfico RSA : Ataques e variantes." Dissertação, Universidade do Porto. Reitoria, 2003. http://hdl.handle.net/10216/10365.
Full textAbstract:
Dissertação de Mestrado em Matemática - Fundamentos e Aplicações apresentada à Faculdade de Ciências da Universidade do PortoO RSA é um sistema criptográfico de chave pública, o mais usado nos dias de hoje, que na escolha do módulo N=p.q (p e q primos), na geração das chaves (públicas e privadas) e nos processos de encriptação e desencriptação faz uso de resultados da Teoria de Números. Descreve-se o funcionamento deste sistema, fazendo referência a alguns aspectos a ter em atenção na sua implementação. Apresentam-se dois tipos de ataques que têm por objectivo, uns descobrir a chave privada e outros apenas o texto original sem saber a chave privada. Descrevem-se ainda variantes que não só podem tornar os processos mais rápidos como mais seguros.
39
Gårdlund, Julia. "RSA-systemets sårbarheter idag och i framtiden." Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-40166.
Full textAbstract:
Denna uppsats undersöker sårbarheter relaterade till ett av de äldsta och mest säkra krypteringssystemen som existerar idag; RSA. Med hjälp av primärt kvalitativa litteraturstudier förklaras RSA-algoritmen, i vilka sammanhang RSA implementeras, några av de mest kända attackerna samt vilka framtida utmaningar systemet står inför. Många av attackerna har förklarats förut men syftet med denna studie är att bidra med mer lättförståeliga exempel på ett och samma ställe. De framtida hot som undersöks är relaterade till utvecklingen av kvantdatorer och dess potentiella förmåga att knäcka RSA. I och med att framtiden inte går att förutse baseras resultatet på uppskattningar. En sammanställning av vad olika publikationer anser om kvantdatorers hot mot RSA samt vid vilken tidpunkt de i sådant fall kan skadliggöra RSA är genomförd och presenteras i denna uppsats.
40
Lima, Roberval da Costa. "Criptografia RSA e a Teoria dos Números." Universidade Federal da Paraíba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/7507.
Full textAbstract:
Submitted by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-05-27T15:49:59Z
No. of bitstreams: 1
arquivototal.pdf: 791381 bytes, checksum: 38dd57e91539c2f7bfdaf6d1092eff37 (MD5)Approved for entry into archive by Leonardo Americo (leonardo@sti.ufpb.br) on 2015-05-27T17:33:15Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 791381 bytes, checksum: 38dd57e91539c2f7bfdaf6d1092eff37 (MD5)
Made available in DSpace on 2015-05-27T17:33:15Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 791381 bytes, checksum: 38dd57e91539c2f7bfdaf6d1092eff37 (MD5) Previous issue date: 2013-08-13
In this work we present the concept of cryptography, highlighting the differences between symmetric encryption and asymmetric encryption. We also show how RSA encryption works. Moreover, we study the main mathematical results that justify the operation of this cryptosystem and its security, such as: congruences, Euler's theorem, Fermat's Little Theorem, Wilson's Theorem, Euler's criterion for quadratic residues, Law of Quadratic Reciprocity and primality tests.
Neste trabalho apresentamos o conceito de criptografia, diferenciamos a criptogra fia simétrica da criptografia assimétrica e mostramos como funciona a criptografia RSA. Além disso, destacamos os principais resultados matemáticos que justificam o funcionamento desse criptossistema e sua segurança, tais como: congruências, Teorema de Euler, Pequeno Teorema de Fermat, Teorema de Wilson, Critério de Euler para resíduos quadráticos, Lei de Reciprocidade Quadrática e testes de primalidade.
41
White, Joseph R. "PARIS: A PArallel RSA-prime InSpection tool." DigitalCommons@CalPoly, 2013. https://digitalcommons.calpoly.edu/theses/1003.
Full textAbstract:
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have become increasingly reliant on. As the Internet becomes more ubiquitous, methods of security must be better than ever. Validation tools can be leveraged to help increase our confidence and accountability for methods we employ to secure our systems.
Security validation, however, can be difficult and time-consuming. As our computational ability increases, calculations that were once considered “hard” due to length of computation, can now be done in minutes. We are constantly increasing the size of our keys and attempting to make computations harder to protect our information. This increase in “cracking” difficulty often has the unfortunate side-effect of making validation equally as difficult.
We can leverage massive-parallelism and the computational power that is granted by today’s commodity hardware such as GPUs to make checks that would otherwise be impossible to perform, attainable. Our work presents a practical tool for validating RSA keys for poor prime numbers: a fundamental problem that has led to significant security holes, despite the RSA algorithm’s mathematical soundness.
Our tool, PARIS, leverages NVIDIA’s CUDA framework to perform a complete set of greatest common divisor calculations between all keys in a provided set. Our implementation offers a 27.5 times speedup using a GTX 480 and 33.9 times speedup using a Tesla K20Xm: both compared to a reference sequential implementation for sets of less than 200000 keys. This level of speedup brings this validation into the realm of practicality due to decreased runtime.
42
Wright, Moriah E. "RSA, Public-Key Cryptography, and Authentication Protocols." Youngstown State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1339297480.
Full text
43
Magalhães, Inês Monteiro Barbedo de. "O Sistema criptográfico RSA : Ataques e variantes." Master's thesis, Universidade do Porto. Reitoria, 2003. http://hdl.handle.net/10216/10365.
Full textAbstract:
Dissertação de Mestrado em Matemática - Fundamentos e Aplicações apresentada à Faculdade de Ciências da Universidade do PortoO RSA é um sistema criptográfico de chave pública, o mais usado nos dias de hoje, que na escolha do módulo N=p.q (p e q primos), na geração das chaves (públicas e privadas) e nos processos de encriptação e desencriptação faz uso de resultados da Teoria de Números. Descreve-se o funcionamento deste sistema, fazendo referência a alguns aspectos a ter em atenção na sua implementação. Apresentam-se dois tipos de ataques que têm por objectivo, uns descobrir a chave privada e outros apenas o texto original sem saber a chave privada. Descrevem-se ainda variantes que não só podem tornar os processos mais rápidos como mais seguros.
44
Fischlin, Roger. "Das Faktorisierungsrepräsentationsproblem als Basis kryptographischer Protokolle." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965633993.
Full text
45
Murta, Danillo Velloso Ferreira. "Estudo a campo da vacina recombinante rSBm 7462 anti Rhipicephalus microplus." Universidade Federal de Viçosa, 2015. http://www.locus.ufv.br/handle/123456789/7512.
Full textAbstract:
Submitted by Reginaldo Soares de Freitas (reginaldo.freitas@ufv.br) on 2016-04-18T16:46:40Z
No. of bitstreams: 1
texto completo.pdf: 804756 bytes, checksum: 03a46513826b20470e24b68ca050d076 (MD5)Made available in DSpace on 2016-04-18T16:46:40Z (GMT). No. of bitstreams: 1 texto completo.pdf: 804756 bytes, checksum: 03a46513826b20470e24b68ca050d076 (MD5) Previous issue date: 2015-08-26
Devido à sua capacidade em transmitir diversos agentes infecciosos, os carrapatos são importantes para a saúde pública e para produção animal. Dentre estes, se destaca o carrapato Rhipicephalus microplus, responsável por perdas econômicas nos países das regiões tropicais e subtropicais. Entre as medidas de controle deste ectoparasita, o controle imunológico tornou-se uma alternativa promissora, pois não gera populações de carrapatos resistentes e não há risco de resíduos em produtos de origem animal e contaminação ambiental e melhor bem estar animal. Objetivou-se neste estudo, testar a campo o efeito do peptídeo recombinante rSBm 7462 anti Rhipicephalus microplus. Avaliaram-se as condições climáticas no período de 2010 a 2014, e a dinâmica populacional do carrapato neste período, dividindo as em duas etapas, antes e após a imunização. O peptídeo recombinante foi aplicado em três doses, com intervalos de 30 dias no ano de 2012, e repetido nos anos seguintes de 2013 e 2014. O efeito do controle de carrapatos com uso do imunógeno sobre a dinâmica populacional, os parâmetros produtivos e reprodutivos dos rebanhos, assim como custo de produção, baseando-se no controle de carrapatos, apresentaram resultados satisfatórios.
Due to its ability to transmit various infectious agents, ticks are important to public health and animal production. Among these, it stands out the tick Rhipicephalus microplus, responsible for economic losses in the countries of tropical and subtropical regions. Among the control measures of this ectoparasite, the immune control has become a promising alternative because it does not generate resistant tick populations and there is no risk of residues in animal products and environmental contamination and better animal welfare. The aim of this study, test the field the effect of recombinant peptide RSBM 7462 anti Rhipicephalus microplus. Evaluated the climate conditions in the period 2010-2014, and population dynamics of the tick will be shown, dividing in two stages, before and after immunization. The recombinant peptide was administered in three doses, 30 days in the year ranges from 2012, and repeated in the following years 2013 and 2014. The effect of tick control with use of the immunogen on population dynamics, productive and reproductive parameters of herds, as well as cost of production, based on the control of ticks, showed satisfactory results.
46
Walker, Simon N. "High speed algorithms and architectures for RSA encryption." Thesis, University of Sheffield, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.298054.
Full text
47
Villena, Reynaldo Caceres. "Reconstrução da chave secreta do RSA multi-primo." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13082014-141746/.
Full textAbstract:
Em 2009, N. Heninger e H. Shacham apresentaram um algoritmo de reconstrução que permite recuperar a chave secreta sk do criptossistema RSA básico em tempo polinomial tendo em forma aleatória 27 % dos seus bits. Sabemos que podemos obter uma versão com erros (bits modicados) da chave secreta RSA graças aos ataques cold boot. O algoritmo apresentado por Heninger-Shacham corrige esses erros fazendo uso das relações matemáticas que existe entre as chaves pública e secreta do criptossistema RSA básico. O objetivo deste trabalho é estudar esse algoritmo para implementar e analisar seu análogo para o criptossistema RSA multi-primo. Os resultados obtidos mostram que para reconstruir a chave secreta sk do criptossistema RSA u-primos é preciso ter uma fração de bits corretos maior a 2 - 2^((u+2)/(2u+1)), mostrando assim que a segurança oferecida pelo criptossistema RSA multi-primo (u>/ 3) é maior com relação ao criptossistema RSA básico (u = 2).In 2009, N. Heninger and H. Shacham presented an algoritm for reconstructing the secret key sk of the basic RSA cryptosystem in polynomial time With a fraction of random bits greater or equal to 0.27 of its bits. We know that secret key with errors sk can be obtained from DRAM using cold-boot attacks. The Heninger and Shacham\'s algorithm xes these errors using the redundancy of secret and public key of basic RSA cryptosystem. In this work, the topic is to study this algoritm to implement and analyze its analogous for the multi-prime RSA cryptosystem. Our obtained results show the secret key sk of multi-prime RSA cryptosystem can be Reconstructed having a fraction equal or greater than 2 - 2^((u+2)/(2u+1)) of random bits. therefore the security of multi-prime RSA cryptosystem (u >/ 3) is greater than basic RSA cryptosystem (u = 2).
48
SILVA, Marcelo Gama da. "Grupos pseudo-livres, primos seguros e criptografia RSA." Universidade Federal de Pernambuco, 2007. https://repositorio.ufpe.br/handle/123456789/2668.
Full textAbstract:
Made available in DSpace on 2014-06-12T16:00:04Z (GMT). No. of bitstreams: 2
arquivo5842_1.pdf: 1043558 bytes, checksum: e8d7c13a9fafec9e1a4a7151ae67b6a0 (MD5)
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2007Quando um esquema criptográfico é definido sobre um grupo, criptografar mensagens equivale a fazer com que variáveis de alguma equação tomem valores nesse grupo, enquanto que quebrar esse esquema significa descobrir quais valores as variáveis tomaram. Portanto, a segurança de tais esquemas está associada à dificuldade de se resolver equações sobre grupos. A utilização de grupos livres seria uma possível solução para esse problema; entretanto, apenas equações triviais podem ser resolvidas sobre grupos livres. Além disso, os grupos livres são infinitos, o que não é interessante do ponto de vista computacional. Uma alternativa foi proposta por Susan Hohenberger em 2003, dando origem à noção de grupos pseudo-livres , refinada posteriormente por R. Rivest. Informalmente, um grupo pseudo-livre caracteriza-se por não poder ser distinguido, de modo eficiente, de um grupo livre. Do ponto de vista computacional, isto significa que a probabilidade de que se resolva uma equação não trivial sobre um grupo pseudo-livre é desprezível. Dessa forma, encontramos um ambiente adequado para lidarmos com questões de segurança de esquemas criptográficos. Dois conceitos merecem destaque nesse contexto. O conceito de grupos pseudo-livres, como veremos a seguir, é de fundamental importância para a criptografia moderna, enquanto que o conceito de primos seguros tem sua relevância associada ao criptossistema RSA. Este trabalho tem três objetivos principais. Inicialmente estaremos interessados em estudar alguns dos chamados problemas computacionalmente difíceis e sua utilização na construção de esquemas criptográficos seguros. Um outro objetivo é o estudo detalhado do Teorema de Micciancio sobre grupos pseudo-livres. Finalmente, voltaremos nossas atenções para a geração de primos seguros, pois estes estão diretamente relacionados com a segurança do criptossistema RSA. Em particular, propomos um novo algoritmo para geração de primos seguros que, através de um teorema devido a Euler e Lagrange e da lei de reciprocidade quadrática de Gauss, evita em grande parte os testes de primalidade
49
Breitenbacher, Dominik. "Paralelizace faktorizace celých čísel z pohledu lámání RSA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-234905.
Full textAbstract:
This paper follows up the factorization of integers. Factorization is the most popular and used method for RSA cryptoanalysis. The SIQS was chosen as a factorization method that will be used in this paper. Although SIQS is the fastest method (up to 100 digits), it can't be effectively computed at polynomial time, so it's needed to look up for options, how to speed up the method as much as possible. One of the possible ways is paralelization. In this case OpenMP was used. Other possible way is optimalization. The goal of this paper is also to show, how easily is possible to use paralelizion and thanks to detailed analyzation the source codes one can reach relatively large speed up. Used method of iterative optimalization showed itself as a very effective tool. Using this method the implementation of SIQS achieved almost 100 multiplied speed up and at some parts of the code even more.
50
Pina, Alessia. "RSA in extensions of the ring of integers." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-69554.
Full textAbstract:
The aim of this work is to create a variant of the RSA classical algorithm, through extensions from the ring of integers Z to two Euclidean domains:the domain of Gaussian integers, Z[i], and the domain generated by p2, Z[p2]. To achieve this purpose, the study of the theory behind both these sets becomes necessary, to ensure that all the properties are preserved when moving into extensions and so that the construction of the algorithm is possible. Moreover, a description of modular arithmetic is needed, to see how modules behave inside these new sets, since they are the most important ingredient for the algorithm.