Thematische Bibliographien / Eliptic curve

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen

Auswahl der wissenschaftlichen Literatur 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 den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen 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.

Zeitschriftenartikel zum Thema "Eliptic curve"

Latifah, Ummu Wachidatul, and Puguh Wahyu Prasetyo. "IMPLEMENTASI KRIPTOGRAFI KURVA ELIPTIK ELGAMAL DI LAPANGAN GALOIS PRIMA PADA PROSES ENKRIPSI DAN DEKRIPSI BERBANTUAN SOFTWARE PYTHON." Journal of Fundamental Mathematics and Applications (JFMA) 4, no. 1 (2021): 45–60. http://dx.doi.org/10.14710/jfma.v4i1.9278.

Der volle Inhalt der Quelle

Annotation:

Perkembangan teknologi memberikan dampak terhadap kemajuan di segala bidang kehidupan manusia terutama dalam bidang informasi. Hal ini memberikan dampak positif dan negatif. Salah satu dampak positifnya adalah mudahnya bertukar informasi dari yang bersifat umum atau rahasia melalui internet. Dampak negatifnya adalah data yang bersifat rahasia menjadi kurang aman dan dapat disalahgunakan oleh pihak yang tidak berwenang. Kriptografi kurva eliptik El-Gamal (ECC: Eliptic Curve Cryptosystem) memberikan solusi untuk keamanan suatu informasi. ECC merupakan salah satu metode kriptografi kunci publik y

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pomykała, Jacek, and Sławomir Barabasz. "Eliptic Curve Based Threshold Proxy Signature Scheme with Known Signers." Fundamenta Informaticae 69, no. 4 (2006): 411–25. https://doi.org/10.3233/fun-2006-69403.

Der volle Inhalt der Quelle

Annotation:

In the article we present a new (t,n) threshold proxy signature scheme with known signers. It is based on the elliptic curve cryptosystem whose security refers to the discrete logarithm problem (DLP) in the group E(E _p ) of rational points of elliptic curve over the finite field. In comparision to similar schemes based on the RSA or DSS systems our solution requires application of significantly shorter cryptographic keys. The scheme is relatively simple in construction, has the property of unforgeability, non-repudation and admits the proactive security.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Miao, Xiao Yu, and Guang Guo Han. "Cryptanalysis of an Eliptic Curve Based Threshold Proxy Signature Scheme." Advanced Materials Research 926-930 (May 2014): 3604–7. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.3604.

Der volle Inhalt der Quelle

Annotation:

In 2006, Pomykala et al. proposed an elliptic curve based threshold proxy signature scheme as well as a proxy-protected version. They claimed that their scheme had the properties of secrecy, unforgeability, non-repudiation and signer’s identification, and the proxy-protected version could assure the proxy-protection property. In this paper, we show attacks on the basic scheme and we also point out that even if the central authority is engaged, the basic model is not proxy-protected.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Miao, Xiao Yu. "Improvement of an Eliptic Curve Based Threshold Proxy Signature Scheme." MATEC Web of Conferences 44 (2016): 02017. http://dx.doi.org/10.1051/matecconf/20164402017.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Weku, Winsy. "Model Proyeksi (X/Z2, Y/Z2) pada Kurva Hesian Secara Paralel Menggunakan Mekanisme Kriptografi Kurva Eliptik." JURNAL ILMIAH SAINS 12, no. 1 (2012): 65. http://dx.doi.org/10.35799/jis.12.1.2012.404.

Der volle Inhalt der Quelle

Annotation:

MODEL PROYEKSI (X/Z2, Y/Z2) PADA KURVA HESIAN SECARA PARALEL MENGGUNAKAN MEKANISME KRIPTOGRAFI KURVA ELIPTIKABSTRAK Suatu kunci publik, Elliptic Curve Cryptography (ECC) dikenal sebagai algoritma yang paling aman yang digunakan untuk memproteksi informasi sepanjang melakukan transmisi. ECC dalam komputasi aritemetika didapatkan berdasarkan operasi inversi modular. Inversi modular adalah operasi aritmetika dan operasi yang sangat panjang yang didapatkan berdasar ECC crypto-processor. Penggunaan koordinat proyeksi untuk menentukan Kurva Eliptik/ Elliptic Curves pada kenyataannya untuk memastikan

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sibarani, Edy Budi Harjono, M. Zarlis, and Rahmat Widya Sembiring. "ANALISIS KRIPTO SISTEM ALGORITMA AES DAN ELLIPTIC CURVE CRYPTOGRAPHY (ECC) UNTUK KEAMANAN DATA." InfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan) 1, no. 2 (2017): 106–12. http://dx.doi.org/10.30743/infotekjar.v1i2.71.

Der volle Inhalt der Quelle

Annotation:

Kriptografi merupakan salah satu solusi atau metode pengamanan data yang tepat untuk menjaga kerahasiaan dan keaslian data, serta dapat meningkatkan aspek keamanan suatu data atau informasi. Metode ini bertujuan agar informasi yang bersifat rahasia dan dikirim melalui suatu jaringan, seperti LAN atau Internet, tidak dapat diketahui atau dimanfaatkan oleh orang atau pihak yang tidak berkepentingan. Kriptografi mendukung kebutuhan dua aspek keamanan informasi, yaitu perlindungan terhadap kerahasiaan data informasi dan perlindungan terhadap pemalsuan dan pengubahan informasi yang tidak diinginkan

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Putra, Eko. "Implementation Of Eliptic Curve Cryptography Using The Elgamald Algorithm And Primary Number Generating Method Rabin-Miller For Text File Security." Journal Basic Science and Technology 11, no. 1 (2022): 32–39. http://dx.doi.org/10.35335/jbst.v11i1.1773.

Der volle Inhalt der Quelle

Annotation:

The biggest weakness of Elliptic Curve Cryptography is the difficulty of points counting in elliptic curve which affects the process time. This paper considers a method of simplifying the counting in Elliptic Curve Cryptography and quickening the process time without decreasing the security level. Using ElGamal Algorithm as method of encryption, the implementation also involves Rabin-Miller Prime Number Generator to generate the public key. The system is tested using five different text files with different sizes and lengths. The result shows that by limiting the value of a and b to 1 in the e

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Carita, Sa'aadah Sajjana, and Evie Sri Wahyuni. "Modifikasi Tanda Tangan Digital Pada Skema Esign Berbasis Kurva Eliptik." Jurnal Ilmiah SINUS 20, no. 2 (2022): 33. http://dx.doi.org/10.30646/sinus.v20i2.625.

Der volle Inhalt der Quelle

Annotation:

Digital signature has an important role in the digital era, where more and more people are joining the paperless life. Many cryptographic researchers support digital development by creating cryptographic schemes that are safe to use, and one of them is digital signature. This paper proposes a digital signature scheme based on an elliptic curve defined over with , where and are private keys of prime number elements. This scheme utilizes the advantages of elliptic curve cryptography in terms of security by using points that satisfy the elliptic curve equation. Additionally, the shorter key size

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tama, Yanuar Bhakti Wira, and Muhammad Firdhausi Fahmi. "Sistem Kriptografi Klasik Dengan Memanfaatkan Orde Dari Grup Titik Pada Kurva Eliptik Bentuk Montgomery." Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi 11, no. 2 (2023): 361–71. http://dx.doi.org/10.37905/euler.v11i2.23009.

Der volle Inhalt der Quelle

Annotation:

Elliptic curve cryptography is one of the application fields of algebra and number theory concepts. One form of elliptic curve cryptography is Montgomery elliptic curve cryptography. In this paper, a method for a classical cryptographic system be formulated, consisting of encryption and decryption involving twenty-six alphabetical letters which are mapped to points on an elliptic curve by utilizing the order of the point group on the Montgomery elliptic curve. Several examples of implementation in simple cases are given to verify the results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Saepulrohman, Asep, and Teguh Puja Negara. "IMPLEMENTASI ALGORITMA TANDA TANGAN DIGITAL BERBASIS KRIPTOGRAFI KURVA ELIPTIK DIFFIE-HELLMAN." Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika 18, no. 1 (2021): 22–28. http://dx.doi.org/10.33751/komputasi.v18i1.2569.

Der volle Inhalt der Quelle

Annotation:

In data communication systems, digital signatures are a form of electronic signature security services based on the Elliptic Curve Digital Signature Algorithm (ECDSA) which are considered resistant to certain types of attacks. Attacks on digital signature schemes aim to fake a signature or are called forgery which is said to be successful if the key pair and signature generated by the attacker are accepted by the verifier. Mathematical schemes used to prove the authenticity of messages or digital documents or guarantees that the data and information actually come from the correct source. ECDSA

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Eliptic curve"

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

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 Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica 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 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

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 Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Computação 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 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

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 Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação 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 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

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*. 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

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

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

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

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) 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

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

Mehr Quellen

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!