Einloggen

Thematische Bibliographien / Eliptic curve / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Eliptic curve.

Dissertationen zum Thema „Eliptic curve“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 29. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-22 Dissertationen für die Forschung zum Thema "Eliptic curve" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Vertaľ, Damián. "Bezkontaktní mikropočítačová karta jako skrýš pro geokešing." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442363.

Der volle Inhalt der Quelle

Annotation:

This master’s thesis focuses on the possibility of using contactless smart cards as an electronic hiding place in an activity known as Geocaching. The first part explains the theoretical knowledge about cards, smart card programming, the development of android applications for communication with the smart card using the NFC interface and usage of eliptic curves to sign digital messages. The second part is dedicated to the design of a Java card application and an Android application, which are able to communicate

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Sartori, Karina Kfouri. "Curvas elipticas : algumas aplicações em criptografia e em teoria dos numeros." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306310.

Der volle Inhalt der Quelle

Annotation:

Orientador: Paulo Roberto Brumatti<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica<br>Made available in DSpace on 2018-08-06T03:04:00Z (GMT). No. of bitstreams: 1 Sartori_KarinaKfouri_M.pdf: 722364 bytes, checksum: c380a542b9451e40e6788d0e8987b556 (MD5) Previous issue date: 2006<br>Resumo: O objetivo central de estudo neste trabalho é introduzir o conceito de curvas elípticas. Tal assunto é clássico dentro da geometria algébrica e tem aplicações em Criptografia e Teoria dos Números. Neste trabalho descrevemos algumas

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Silva, Rosemberg André da 1969. "Analise de seleção de parametros em criptografia baseada em curvas elipticas." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276086.

Der volle Inhalt der Quelle

Annotation:

Orientador: Ricardo Dahab<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-11T02:09:49Z (GMT). No. of bitstreams: 1 Silva_RosembergAndreda_M.pdf: 824860 bytes, checksum: 48ed40bc241415f1692ca283d3e1f65b (MD5) Previous issue date: 2006<br>Resumo: A escolha dos parâmetros sobre os quais uma dada implementação de Criptografia sobre Curvas Elípticas baseia-se tem influência direta sobre o desempenho das operações associadas bem como sobre seu grau de segurança. Este trabalho visa analisar a forma como os pa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Dias, Mauricio Araujo. "Um sistema criptografico para curvas elipticas sobre GF(2m) implementado em circuitos programaveis." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260923.

Der volle Inhalt der Quelle

Annotation:

Orientador: Jose Raimundo de Oliveira<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-09T13:54:55Z (GMT). No. of bitstreams: 1 Dias_MauricioAraujo_D.pdf: 794928 bytes, checksum: a328a640d35118ea7fb606ac9f4ab2b2 (MD5) Previous issue date: 2007<br>Resumo: Este trabalho propõe um sistema criptográfico para Criptografia baseada em Curvas Elípticas (ECC). ECC é usada alternativamente a outros sistemas criptográficos, como o algoritmo RSA (Rivest-Shamir-Adleman), por oferecer a menor chave e a maior se

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Bars, Cortina Francesc. "On the Tamagawa number conjecture." Doctoral thesis, Universitat Autònoma de Barcelona, 2001. http://hdl.handle.net/10803/3072.

Der volle Inhalt der Quelle

Annotation:

En la tesis es resolt la conjectura del nombre de Tamagawa en dues situacions: per a corbes el.líptiques E+ definides sobre Q amb multiplicació complexa donada per un cos imaginari quadràtic K, i per a caràcters de Hecke Ak--K*.<br>In the thesis we solve the Tamagawa number conjecture in two situations: for elliptic cuves E+ with complex multiplication an imaginary quadratic field K, where we impose that E+ is defined over Q, and for Hecke characters of the form, Ak--K*.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Fujdiak, Radek. "Kryptografický protokol s veřejným klíčem." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-220309.

Der volle Inhalt der Quelle

Annotation:

The Master thesis is an introduction to cryptology. The Thesis describe cryptosystems and selects one ideal cypher for low-power microcontroler. In thesis provides manual for instal development program COde Composer Studio, basic implementation of selected cryptosystem with small numbers and suggestion for implementation selected cyptosystem with big numbers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Szturc, Jakub. "Softwarová podpora výuky kryptosystémů založených na eliptických křivkách." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218147.

Der volle Inhalt der Quelle

Annotation:

The master‘s thesis is focusing on cryptography based on elliptical curves consists of four main parts. The first part provides an overview of the basic cryptographic and mathematical concepts. A key element of this work is the second part which are described in detail the mechanisms of counting two points on elliptic curve and counting point to themselves over the various fields. On this mechanism is based almost the entire issue. In the third section provides the best-known algorithms and protocols for key exchange, encryption and digital signature. The goal of this paper is to devise softwa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Herbrych, Daniel. "Generování eliptických křivek pro kryptografický protokol." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-401955.

Der volle Inhalt der Quelle

Annotation:

This thesis deals with creation of elliptic curves generator. MIRACL library and C++ language are used. One of important issues is to determine the order of the elliptic curve group. SEA algorithm (Schoof–Elkies–Atkin) is used for point counting on the elliptic curve. Method with this algorithm is called as counting points method, SEA method etc. Next method is CM method. Both methods are available in the generator. The measurements of dependency of basic operations speed on the group size and parameters were done. ECIES hybrid scheme was implemented. It is practical verification of proper fun

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Flose, Vania Batista Schunck [UNESP]. "Criptografia e curvas elípticas." Universidade Estadual Paulista (UNESP), 2011. http://hdl.handle.net/11449/94347.

Der volle Inhalt der Quelle

Annotation:

Made available in DSpace on 2014-06-11T19:27:09Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-11-18Bitstream added on 2014-06-13T18:55:35Z : No. of bitstreams: 1 flose_vbs_me_rcla.pdf: 506170 bytes, checksum: ee89356ded1c14f6f5c21428bb68671a (MD5)<br>Com o crescimento da comunicação nos dias atuais, a segurança na troca de informa- ções tem se tornado cada vez mais importante o que tem dado destaque a Criptografia. A criptografia consiste de técnicas baseadas em conceitos matemáticos que tem por objetivo transmitir informações sigilosas forma segura através de canais monitorados por

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Mravec, Roman. "Elektronické doklady." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-317036.

Der volle Inhalt der Quelle

Annotation:

This master thesis deals with an implementation of Diffie-Hellman protocol on smart card which is based on MULTOS OS. Defines the smart cards based on MULTOS OS and their usage. Output of this thesis are applications for a smart card and for a client using Diffie-Hellman protocol for establishing of a secret key between two communication sides through unsecured communication channel.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Walek, Vladislav. "Moderní asymetrické kryptosystémy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219311.

Der volle Inhalt der Quelle

Annotation:

Asymmetric cryptography uses two keys for encryption public key and for decryption private key. The asymmetric cryptosystems include RSA, ElGamal, Elliptic Curves and others. Generally, asymmetric cryptography is mainly used for secure short messages and transmission encryption key for symmetric cryptography. The thesis deals with these systems and implements selected systems (RSA, ElGamal, McEliece, elliptic curves and NTRU) into the application. The application can test the features of chosen cryptosystems. These systems and their performance are compared and evaluated with the measured valu

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Dzurenda, Petr. "Kryptografická ochrana digitální identity." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403859.

Der volle Inhalt der Quelle

Annotation:

Dizertační práce se zabývá kryptografickými schématy zvyšující ochranu soukromí uživatelů v systémech řízení přístupu a sběru dat. V současnosti jsou systémy fyzického řízení přístupu na bázi čipových karet využívány téměř dennodenně většinou z nás, například v zaměstnání, ve veřejné dopravě a v hotelech. Tyto systémy však stále neposkytují dostatečnou kryptografickou ochranu a tedy bezpečnost. Uživatelské identifikátory a klíče lze snadno odposlechnout a padělat. Funkce, které by zajišťovaly ochranu soukromí uživatele, téměř vždy chybí. Proto je zde reálné riziko možného sledovaní lidí, jejic

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

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.

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Brychta, Josef. "Srovnání kryptografických primitiv využívajících eliptických křivek na různých hardwarových platformách." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-376973.

Der volle Inhalt der Quelle

Annotation:

This master thesis deals with the implementation of variants of cryptographic libraries containing primitives for elliptic curves. By creating custom metering charts to compare each implementation. The main task was not only the implementation of libraries but also the design and implementation of test scenarios together with the creation of measurement methods for different libraries and hardware platforms. As a result, a number of experimental tests were conducted on different curves and their parameters so that the results of the work included complex problems of elliptic curves in cryptogr

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Podhorský, Jiří. "Integer Factorization on the GPU." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-412908.

Der volle Inhalt der Quelle

Annotation:

This work deals with factorization, a decomposition of composite numbers on prime numbers and possibilities of its parallelization. It summarizes also the best known algorithms for factoring and most popular platforms for the implementation of these algorithms on the graphics card. The main part of the thesis deals with the design and implementation of hardware acceleration current fastest algorithm on the graphics card by using the OpenCL framework. Subsequently, the work provides a comparison of speeds accelerated algorithm implemented in this work with other versions of the best known algor

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

SAXENA, ARCHANA. "DATABASE WATERMARKING USING ELLIPTIC CURVE CRYPTOGRAPHY (ECC)." Thesis, 2015. http://dspace.dtu.ac.in:8080/jspui/handle/repository/15549.

Der volle Inhalt der Quelle

Annotation:

The piracy of software, images, video, audio, and text has long been a concern for owners of these digital assets. Protection schemes are usually based upon the insertion of digital watermarks into the data. The watermarking software introduces small errors into the object being watermarked. These intentional errors are called marks, and all the marks together constitute the watermark. The marks are chosen so as to have an insignificant impact on the usefulness of the data and are placed in such a way that a malicious user cannot destroy them without making the data significantly less useful.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Vácha, Petr. "Počítání bodů na eliptických a hypereliptických křivkách." Master's thesis, 2013. http://www.nusl.cz/ntk/nusl-320994.

Der volle Inhalt der Quelle

Annotation:

In present work we study the algorithms for point counting on elliptic and hy- perelliptic curves. At the beginning we describe a few simple and ineffective al- gorithms. Then we introduce more complex and effective ways to determine the point count. These algorithms(especially the Schoof's algorithm) are important for the cryptography based on discrete logarithm in the group of points of an el- liptic or hyperelliptic curve. The point count is important to avoid the undesirable cases where the cryptosystem is easy to attack. 1

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Kozoň, Marek. "Semiklasická energie eliptické Nambuovy-Gotovy struny." Master's thesis, 2018. http://www.nusl.cz/ntk/nusl-392428.

Der volle Inhalt der Quelle

Annotation:

Po zhrnutí potrebných teoretických základov a predošlého výskumu v ob- lasti, prezentujeme semi-klasickú kvantovaciu schému pre uzavretú Nambuovu- Gotovu strunu. Týmto zovšeobecňujeme predošlú prácu, ktorá bola vykonaná pre otvorenú strunu a uzavretú strunu kruhového tvaru. Pomocou metód kvan- tovej teórie po©a v zakrivených priestoročasoch počítame strednú hodnotu vo©- ného Hamiltoniánu struny rotujúcej v dvoch na seba kolmých priestorových rovinách v priestoročase všeobecnej dimenzie. Táto hodnota je priamo úmerná kvantovej korekcii k celkovej energii struny, ktorá má formu tzv. Reggeovho in

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Haníková, Adéla. "Elliptické křivky a testování prvočíselnosti." Master's thesis, 2015. http://www.nusl.cz/ntk/nusl-347196.

Der volle Inhalt der Quelle

Annotation:

The aim of the thesis is to desribe and implement the elliptic curve factorization method using curves in Edwards form. The thesis can be notionally divided into two parts. The first part deals with the theory of Edwards curves especially with properties of elliptic function fields. The second part deals with the factorization algorithm using Edwards form both formally and practically in the way the algorithm is really implemented. The contribution of this thesis is the enclosed implementation of the elliptic curve factorisation algorithm which can be run on a graphic card and which is faster

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Skalický, Jakub. "Efektivní aritmetika eliptických křivek nad konečnými tělesy." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-305115.

Der volle Inhalt der Quelle

Annotation:

The thesis deals with arithmetics of elliptic curves over finite fields and methods to improve those calculations. In the first part, algebraic geometry helps to define elliptic curves and derive their basic properties including the group law. The second chapter seeks ways to speed up these calculations by means of time-memory tradeoff, i.e. adding redundancy. At last, the third part introduces a wholly new curve form, which is particularly effective for such purposes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Skalický, Jakub. "Efektivní aritmetika eliptických křivek nad konečnými tělesy." Master's thesis, 2013. http://www.nusl.cz/ntk/nusl-328581.

Der volle Inhalt der Quelle

Annotation:

The thesis deals with arithmetics of elliptic curves over finite fields and methods to improve those calculations. In the first part, algebraic geometry helps to define elliptic curves and derive their basic properties including the group law. The second chapter seeks ways to speed up these calculations by means of time-memory tradeoff, i.e. adding redundancy. At last, the third part introduces a wholly new curve form, which is particularly effective for such purposes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Luňáčková, Radka. "Weilovo párování." Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-345249.

Der volle Inhalt der Quelle

Annotation:

This work introduces fundamental and alternative definition of Weil pairing and proves their equivalence. The alternative definition is more advantageous for the purpose of computing. We assume basic knowledge of elliptic curves in the affine sense. We explain the K-rational maps and its generalization at the point at infinity, rational map. The proof of equivalence of the two mentioned definitions is based upon the Generalized Weil Reciprocity, which uses a concept of local symbol. The text follows two articles from year 1988 and 1990 written by L. Charlap, D. Robbins a R. Coley, and corrects

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!