Relevant bibliographies by topics / Algorytm ElGamala

Contents

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

Academic literature on the topic 'Algorytm ElGamala'

Author: Grafiati
Published: 24 April 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorytm ElGamala.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algorytm ElGamala"

1

Andrian, Yudhi. "Perbandingan Penggunaan Bilangan Prima Aman Dan Tidak Aman Pada Proses Pembentukan Kunci." Creative Information Technology Journal 1, no. 3 (2015): 194. http://dx.doi.org/10.24076/citec.2014v1i3.21.

Full text
Abstract:
Algoritma ElGamal merupakan algoritma dalam kriptografi yang termasuk dalam kategori algoritma asimetris. Keamanan algoritma ElGamal terletak pada kesulitan penghitungan logaritma diskret pada bilangan modulo prima yang besar sehingga upaya untuk menyelesaikan masalah logaritma ini menjadi sangat sukar. Algoritma ElGamal terdiri dari tiga proses, yaitu proses pembentukan kunci, proses enkripsi dan proses dekripsi. Proses pembentukan kunci kriptografi ElGamal terdiri dari pembentukan kunci privat dan pembentukan kunci public. Pada proses ini dibutuhkan sebuah bilangan prima aman yang digunakan sebagai dasar pembentuk kunci public sedangkan sembarang bilangan acak digunakan sebagai pembentuk kunci privat. Pada penelitian sebelumnya digunakan bilangan prima aman pada proses pembentukan kunci namun tidak dijelaskan alasan mengapa harus menggunakan bilangan prima aman tersebut. Penelitian ini mencoba membandingkan penggunaan bilangan prima aman dan bilangan prima tidak aman pada pembentukan kunci algoritma elgamal. Analisa dilakukan dengan mengenkripsi dan dekripsi sebuah file dengan memvariasikan nilai bilangan prima aman dan bilangan prima tidak aman yang digunakan untuk pembentukan kunci public dan kunci privat. Dari hasil analisa dapat disimpulkan bahwa dengan menggunakan bilangan prima aman maupun bilangan prima tidak aman, proses pembentukan kunci, enkripsi dan dekripsi tetap dapat berjalan dengan baik, semakin besar nilai bilangan prima yang digunakan, maka kapasitas cipherteks juga semakin besar.Elgamal algorithm is an algorithm in cryptography that is included in the category of asymmetric algorithms. The security of Elgamal algorithm lies in the difficulty in calculating the discrete logarithm on large number of prime modulo that attempts to solve this logarithm problem becomes very difficult. Elgamal algorithm is consists of three processes, that are the key generating, encryption and decryption process. Key generation of elgamal cryptography process is consisted of the formation of the private key and public key. In this process requires a secure prime number is used as the basis for forming public key while any random number used as forming of the private key. In the previous research is used secure prime number on key generating process but does not explain the reasons of using the secure primes. This research tried to compare using secure and unsecure primes in elgamal key generating algorithm. The analysis is done by encrypting and decrypting a file by varying the value of secure and unsecure of prime numbers that are used on generating of a public and a private key. From the analysis it can be concluded that using secure and unsecure of prime numbers, the process of key generating, encryption and decryption can run well, the greater value of prime numbers are used, the greater the capacity of the ciphertext.
APA, Harvard, Vancouver, ISO, and other styles
2

Neyman, Shelvie, and Selfi Qisthina. "Pengamanan Internet of Things untuk Tanda Tangan Digital Menggunakan Algoritme Elgamal Signature Scheme." Jurnal Ilmu Komputer dan Agri-Informatika 8, no. 1 (2021): 69–78. http://dx.doi.org/10.29244/jika.8.1.69-78.

Full text
Abstract:
Internet of Things (IoT) memungkinkan suatu objek menghasilkan data dan bertukar data. Pengaplikasian IoT menggunakan mikrokontroler seperti Arduino belum memiliki fitur untuk menjaga keamanan data di dalamnya. Selain itu, Arduino memiliki kapabilitas komputasi terbatas. Oleh karena itu, perlu diterapkan kriptografi dengan algoritme yang memiliki komputasi rendah pada Arduino untuk menjaga keamanan data. Penjagaan keamanan data terutama pada keaslian asal data, dilakukan dengan menggunakan tanda tangan digital. Penerapan tanda tangan digital dapat dilakukan salah satunya dengan algoritme Elgamal signature scheme. Penerapan tanda tangan digital menggunakan algoritme Elgamal signature scheme berhasil diterapkan pada perangkat Arduino Uno untuk melakukan tanda tangan digital dan verifikasi. Kinerja algoritme Elgamal signature scheme dilihat dari analisis waktu eksekusi dan analisis keamanan algoritme. Waktu eksekusi proses tanda tangan digital membutuhkan waktu lebih lama dibandingkan dengan waktu eksekusi proses verifikasi. Algoritme Elgamal signature scheme membutuhkan waktu dua kali lebih lama karena banyaknya perhitungan sistematis pada perangkat Arduino Uno. Proses verifikasi terbukti gagal jika ada perubahan data dan pasangan tanda tangan digital.
 Kata Kunci: Arduino, Elgamal signature scheme, internet of things, kriptografi, tanda tangan digital.
APA, Harvard, Vancouver, ISO, and other styles
3

Ramadani, Suci. "HYBIRD CRYPTOSYSTEM ALGORITMA HILL CIPHER DAN ALGORITMA ELGAMAL PADA KEAMANAN CITRA." METHOMIKA Jurnal Manajemen Informatika dan Komputerisasi Akuntansi 4, no. 1 (2020): 1–9. http://dx.doi.org/10.46880/jmika.vol4no1.pp1-9.

Full text
Abstract:
Perkembangan Teknologi pada saat ini memungkinkan setiap orang untuk saling bertukar informasi tanpa ada batasan waktu dan jarak. Kemungkinan yang akan terjadi adanya kebocoran data pada saat proses pertukaran informasi yang dilakukan, oleh karena itu dalam pengiriman data khususnya citra, aspek keamanan, kerahasiaan dan efesiensi penyimpanan data sangat diperlukan. Jika informasi penting tersebut jatuh ke tangan orang yang salah, maka akan menyebabkan hal yang tidak diinginkan, contohnya manipulasi gambar dengan bentuk yang negatif dan dapat merugikan pemilik gambar. Salah satu metode yang digunakan untuk menjaga keamanan data tersebut adalah kriptografi dengan menggunakan salah satu teknik yaitu Elgamal. Kekuatan algoritma ini terletak pada sulitnya menghitung algoritma diskrit pada bilangan bulat prima yang didalamnya dilakukan operasi pekalian. Dalam penelitian ini, penulis menggabungkan antara Hill Cipher untuk melakukan penyandian enkripsi citra dan Algoritma Elgamal untuk mendekripsi kunci dari Hill Cipher. Citra pertama kali dienkripsi menggunakan Hill Cipher, kemudian kunci Hill Cipher tersebut dienkripsi dengan menggunakan Algoritma Elgamal. Implementasi sistem menggunakan bahasa pemograman Visual Basic Net 2010. Hasil implementasi dengan citra awal dienkrip memiliki waktu 4282.85 Milidetik dengan hasil gambar yang beracak-acak sedangkan citra yang sudah dienkrip akan kembali di deskripsikan yang memiliki waktu 20442.84 Milidetik dengan hasil citra kembali ke awal.
APA, Harvard, Vancouver, ISO, and other styles
4

Saputro, Triyas Hevianto, Nur Hidayati Hidayati, and Erik Iman H. Ujianto. "SURVEI TENTANG ALGORITMA KRIPTOGRAFI ASIMETRIS." Jurnal Informatika Polinema 6, no. 2 (2020): 67–72. http://dx.doi.org/10.33795/jip.v6i2.345.

Full text
Abstract:
Keamanan merupakan salah satu faktor penting dalam penyimpanan dan pengiriman data atau pesan. Salah satu cara untuk mengamankan dokumen adalah dengan menggunakan algoritma kriptografi. Kriptografi berdasarkan jenis kuncinya dibedakan menjadi dua yaitu kriptografi simetris dan asimetris. Algoritma enkripsi asimetris termasuk Rivest–Shamir–Adleman (RSA), Diffie-Hellman, Digital Secure Algorithm (DSA), XTR, Elliptic Curve Cryptography (ECC), dan Elgamal Encryption System (ESS). Dalam makalah ini akan melakukan survei paper terkait algoritma-algoritma enkripsi asimetris. Implementasi kriptografi asimetris dapat dikembangkan menggunakan algoritma-algoritma tersebut.
 
 Kata kunci : cryptography, encryption, decryption, public key
APA, Harvard, Vancouver, ISO, and other styles
5

Ramadani, Suci. "Hybird Cryptosystem Algoritma Hill Cipher Dan Algoritma ElGamal Pada Keamanan Citra." METHOMIKA: Jurnal Manajemen Informatika dan Komputerisasi Akuntansi 4, no. 1 (2020): 1–9. http://dx.doi.org/10.46880/jmika.v4i1.138.

Full text
Abstract:
The development of technology at this time allows everyone to exchange information without any limitation of time and distance. The possibility that data leakage will occur during the process of exchanging information is carried out, therefore in sending data especially images, security aspects, confidentiality and efficiency of data storage is very necessary. If the important information falls into the wrong hands, it will cause unwanted things, for example manipulation of images with negative shapes and can harm the owner of the image. One method used to maintain data security is cryptography using one of the techniques, Elgamal. The strength of this algorithm lies in the difficulty of calculating discrete algorithms on prime integers in which multiplication operations are performed. In this research, the writer combines Hill Cipher to do image encryption and Elgamal Algorithm to decrypt the key of Hill Cipher. The image is first encrypted using the Hill Cipher, then the Hill Cipher key is encrypted using the Elgamal Algorithm. The implementation of the system uses the programming language Visual Basic Net 2010. The results of the implementation with the initial encrypted image has 4282.85 milliseconds with random images, while the encrypted image will be re-described as having 20442.84 milliseconds with the image returned to the beginning.
APA, Harvard, Vancouver, ISO, and other styles
6

Khatri, Shefali, Punit Sharma, Arvind Negi, and Himanshu Gupta. "Thwarting Sybil Attack using ElGamal Algorithm." International Journal of Computer Applications 121, no. 21 (2015): 44–48. http://dx.doi.org/10.5120/21828-5085.

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

Nguyen Duc, Toan, and Hong Bui The. "Building Background to the Elgamal Algorithm." International Journal of Mathematical Sciences and Computing 3, no. 3 (2017): 39–49. http://dx.doi.org/10.5815/ijmsc.2017.03.04.

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

Sann, Zarni, Thi thi Soe, Kaythi Wyut Mhone Knin, and Zin May Win. "Performance Comparison of Asymmetric Cryptography (Case study- Mail message)." APTIKOM Journal on Computer Science and Information Technologies 4, no. 3 (2019): 105–11. http://dx.doi.org/10.11591/aptikom.j.csit.147.

Full text
Abstract:
Encryption is a well known technology for protecting sensitive data. ElGamal encryption and RSA algorithm is made before storing mails to mail server. ElGamal decryption and RSA decryption is made after retrieving mails from mail server. This system is implemented to secure mail server system for local government’s important mail messages. These algorithms consume a considerable amount of time and resources such as memory, CPU time, and computation time to encrypt and decrypt data. In this paper, the results are comparison of these algorithms in term of encryption time, decryption time, and memory usage over variable file sizes. After processing, it is proven that RSA performs a faster encryption process than ElGamal. However, ElGamal decryption process is faster than RSA. This system is also expressed comparison of storage Size between RSA and ElGamal. Both of these algorithms are cryptographic public-key algorithms but have functions in different ways. This system is using C# programming language and SQL Server to store mail messages.
APA, Harvard, Vancouver, ISO, and other styles
9

Widarma, Adi. "COMBINATION AES, RC4 AND ELGAMAL ALGORITHM IN HYBRID SCHEME FOR DATA SECURITY." Computer Engineering, Science and System Journal 1, no. 1 (2016): 1–8. http://dx.doi.org/10.24114/cess.v1i1.4040.

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

Atmaja, Niko Surya. "Kerahasiaan Teks Basis Data MySQL Menggunakan Algoritma Elgamal." Jurnal Sistim Informasi dan Teknologi 1, no. 4 (2019): 65–71. http://dx.doi.org/10.35134/jsisfotek.v1i4.17.

Full text
Abstract:
The common method used to secure a MySQL database is in access control. The technique is the use of a password. To better secure the data sent cryptographic techniques need to be done. This study uses the Elgamal method in conducting cryptography. The results of this study generate MySQL databases in random form during safer delivery and can only be accessed by parties who have a password. So this research can further improve MySQL data security
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algorytm ElGamala"

1

Morais, Glauber Dantas. "A Matemática Via Algoritmo de Criptografia El Gamal." Universidade Federal da Paraíba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/7479.

Full text
Abstract:
Submitted by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-05-19T15:20:50Z No. of bitstreams: 2 arquivototal.pdf: 1103922 bytes, checksum: fee5e8830b60905917fc3ab1fb8c2aae (MD5) license_rdf: 22190 bytes, checksum: 19e8a2b57ef43c09f4d7071d2153c97d (MD5)<br>Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-05-19T15:21:56Z (GMT) No. of bitstreams: 2 arquivototal.pdf: 1103922 bytes, checksum: fee5e8830b60905917fc3ab1fb8c2aae (MD5) license_rdf: 22190 bytes, checksum: 19e8a2b57ef43c09f4d7071d2153c97d (MD5)<br>Made available in DSpace on 2015-05-19T15:21:56Z (GMT). No. of bitstreams: 2 arquivototal.pdf: 1103922 bytes, checksum: fee5e8830b60905917fc3ab1fb8c2aae (MD5) license_rdf: 22190 bytes, checksum: 19e8a2b57ef43c09f4d7071d2153c97d (MD5) Previous issue date: 2013-08-13<br>The encryption algorithm written by Egyptian Taher ElGamal computes discrete logarithms with elements of a finite group G Cyclical. These elements have properties that during the study Chapter 1. Knowing the definitions and some properties studied, we can define and compute discrete logarithms, using knowledge of arithmetic and congruence of Remains and Theorem Remainder of Chinese. We will study public key algorithms, in particular the algorithm written by ElGamal, seeking to understand the diffculties presented by it and show its applications in the field of cryptography. We present a sequence of activities, aimed at students of the first grade of high school, targeting the learning of some subjects covered at work.<br>O algoritmo de criptografia escrito pelo egípcio Taher ElGamal calcula logaritmos discretos com elementos de um Grupo Cíclico finito G. Esses elementos possuem propriedades que estudaremos no decorrer do capítulo 1. Conhecendo as definições e algumas propriedades estudadas, poderemos definir e calcular logaritmos discretos, utilizando conhecimentos da Aritmética dos Restos e Congruências, bem como o Teorema Chinês dos Restos. Vamos estudar algoritmos de chave pública, em particular o algoritmo escrito por ElGamal, buscando entender as dificuldades apresentadas por ele e mostrar suas aplicações no campo da Criptografia. Apresentaremos uma sequencia de atividades, voltadas para estudantes do primeiro ano do Ensino Médio, visando o aprendizado de alguns assuntos abordados no trabalho.
APA, Harvard, Vancouver, ISO, and other styles
2

Ragazzini, Laura. "Applicazioni del problema del logaritmo discreto in crittografia." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23061/.

Full text
Abstract:
L'obiettivo della tesi è quello di introdurre il logaritmo discreto al fine di analizzare nel dettaglio alcuni dei principali algoritmi basati su di esso. Nel primo capitolo verranno descritte la crittografia a chiave privata e la crittografia a chiave pubblica, definite le funzioni unidirezionali e la firma digitale. Nel secondo capitolo, dopo un'introduzione sui gruppi finiti, viene definito il logaritmo discreto, le sue proprietà e le soluzioni del DLP in Z*_p. Inoltre verranno descritti i principali algoritmi basati sul problema del logaritmo discreto (DLP): il protocollo di scambio di chiavi di Diffie-Hellman, l'algoritmo di ElGamal e firma digitale con ElGamal. Nel terzo capitolo viene trattato il problema del logaritmo discreto su curve ellittiche (ECDLP), e le relative applicazioni. Come prima cosa verranno introdotte le curve ellittiche e definita l'operazione di somma tra i suoi punti, che induce una struttura di gruppo abeliano su di esse. Inseguivo verranno definite le curve ellittiche su campi finiti e il logaritmo discreto su di esse. Infine verranno analizzati gli algoritmi di Diffie-Hellman, ElGamal e firma con ElGamal su curve ellittiche.
APA, Harvard, Vancouver, ISO, and other styles
3

Abu-Mahfouz, Adnan Mohammed. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices." Diss., University of Pretoria, 2004. http://hdl.handle.net/2263/25330.

Full text
Abstract:
Data security will play a central role in the design of future IT systems. The PC has been a major driver of the digital economy. Recently, there has been a shift towards IT applications realized as embedded systems, because they have proved to be good solutions for many applications, especially those which require data processing in real time. Examples include security for wireless phones, wireless computing, pay-TV, and copy protection schemes for audio/video consumer products and digital cinemas. Most of these embedded applications will be wireless, which makes the communication channel vulnerable. The implementation of cryptographic systems presents several requirements and challenges. For example, the performance of algorithms is often crucial, and guaranteeing security is a formidable challenge. One needs encryption algorithms to run at the transmission rates of the communication links at speeds that are achieved through custom hardware devices. Public-key cryptosystems such as RSA, DSA and DSS have traditionally been used to accomplish secure communication via insecure channels. Elliptic curves are the basis for a relatively new class of public-key schemes. It is predicted that elliptic curve cryptosystems (ECCs) will replace many existing schemes in the near future. The main reason for the attractiveness of ECC is the fact that significantly smaller parameters can be used in ECC than in other competitive system, but with equivalent levels of security. The benefits of having smaller key size include faster computations, and reduction in processing power, storage space and bandwidth. This makes ECC ideal for constrained environments where resources such as power, processing time and memory are limited. The implementation of ECC requires several choices, such as the type of the underlying finite field, algorithms for implementing the finite field arithmetic, the type of the elliptic curve, algorithms for implementing the elliptic curve group operation, and elliptic curve protocols. Many of these selections may have a major impact on overall performance. In this dissertation a finite field from a special class called the Optimal Extension Field (OEF) is chosen as the underlying finite field of implementing ECC. OEFs utilize the fast integer arithmetic available on modern microcontrollers to produce very efficient results without resorting to multiprecision operations or arithmetic using polynomials of large degree. This dissertation discusses the theoretical and implementation issues associated with the development of this finite field in a low end embedded system. It also presents various improvement techniques for OEF arithmetic. The main objectives of this dissertation are to --Implement the functions required to perform the finite field arithmetic operations. -- Implement the functions required to generate an elliptic curve and to embed data on that elliptic curve. -- Implement the functions required to perform the elliptic curve group operation. All of these functions constitute a library that could be used to implement any elliptic curve cryptosystem. In this dissertation this library is implemented in an 8-bit AVR Atmel microcontroller.<br>Dissertation (MEng (Computer Engineering))--University of Pretoria, 2006.<br>Electrical, Electronic and Computer Engineering<br>unrestricted
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algorytm ElGamala"

1

Koç, Çetin Kaya, Funda Özdemir, and Zeynep Ödemiş Özger. "ElGamal Algorithm." In Partially Homomorphic Encryption. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87629-6_5.

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

Pal, Prashnatita, Bikash Chandra Sahana, S. Ghosh, Jayanta Poray, and Amiya Kumar Mallick. "Voice Password-Based Secured Communication Using RSA and ElGamal Algorithm." In Advances in Intelligent Systems and Computing. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-4299-6_32.

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

Othman, Soufiene Ben, Abdelbasset Trad, Hani Alzaid, and Habib Youssef. "Performance Evaluation of EC-ElGamal Encryption Algorithm for Wireless Sensor Networks." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37893-5_31.

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

Mogollon, Manuel. "Confidentiality." In Cryptography and Security Services. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-837-6.ch005.

Full text
Abstract:
Asymmetric encryption is a form of cryptography in which one key is used to encipher and the other to decipher. The two keys are mathematically related, and if it is possible to make one of the keys public and still maintain the algorithm security, then the system is called public-key. The most used public-key ciphers, the Pohlig-Hellman algorithm, the RSA algorithm, the ElGamal algorithm, and Diffie-Hellman, are discussed in this chapter.
APA, Harvard, Vancouver, ISO, and other styles
5

Mogollon, Manuel. "Elliptic Curve Cryptograpy." In Cryptography and Security Services. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-837-6.ch008.

Full text
Abstract:
For the same level of security that public-key cryptosystems such as RSA have, elliptic curve cryptography (ECC) offers the benefit of smaller key sizes, hence smaller memory and processor requirements. The Diffie-Hellman key exchange, ElGamal encryption, digital signatures, and the Digital Signature Algorithm (DSA) can all be implemented in ECC. This makes ECC a very attractive algorithm for wireless devices such as handhelds and PDAs, which have limited bandwidth and processing power. Running on the same platform, ECC runs more TLS/SSL transactions per second than RSA. This chapter describes the basic concepts and definitions of elliptic curve cryptography.
APA, Harvard, Vancouver, ISO, and other styles
6

Krishna, A. V. N. "A Randomized Cloud Library Security Environment." In Cloud Security. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8176-5.ch056.

Full text
Abstract:
Cloud computing is leading the technology development of today's communication scenario. This is because of its cost-efficiency and flexibility. In Cloud computing vast amounts of data are stored in varied and distributed environments, and security to data is of prime concern. RSA or Elliptic Curve Cryptography (ECC) provides a secure means of message transmission among communicating hosts using Diffie Hellman Key Exchange algorithm or ElGamal algorithm. By having key lengths of 160 bits, the ECC algorithm provides sufficient strength against crypto analysis and its performance can be compared with standard algorithms like RSA with a bit length of 1024 bits. In the present work, the plain text is converted to cipher text using RSA or ECC algorithms. As the proposed model is intended to be used in Cloud environment, a probabilistic mathematical model is also used. While the data is being retrieved from the servers, a query is being used which uses the mathematical model to search for the data which is still in encryption form. Final decryption takes place only at user's site by using the private keys. Thus the security model provides the fundamental security services like Authentication, Security, and Confidentiality to the transmitted message and also provides sufficient strength against crypto analysis in Cloud environment.
APA, Harvard, Vancouver, ISO, and other styles
7

Krishna, A. V. N. "A Randomized Cloud Library Security Environment." In Advances in Library and Information Science. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-4631-5.ch016.

Full text
Abstract:
Cloud computing is leading the technology development of today’s communication scenario. This is because of its cost-efficiency and flexibility. In Cloud computing vast amounts of data are stored in varied and distributed environments, and security to data is of prime concern. RSA or Elliptic Curve Cryptography (ECC) provides a secure means of message transmission among communicating hosts using Diffie Hellman Key Exchange algorithm or ElGamal algorithm. By having key lengths of 160 bits, the ECC algorithm provides sufficient strength against crypto analysis and its performance can be compared with standard algorithms like RSA with a bit length of 1024 bits. In the present work, the plain text is converted to cipher text using RSA or ECC algorithms. As the proposed model is intended to be used in Cloud environment, a probabilistic mathematical model is also used. While the data is being retrieved from the servers, a query is being used which uses the mathematical model to search for the data which is still in encryption form. Final decryption takes place only at user’s site by using the private keys. Thus the security model provides the fundamental security services like Authentication, Security, and Confidentiality to the transmitted message and also provides sufficient strength against crypto analysis in Cloud environment.
APA, Harvard, Vancouver, ISO, and other styles
8

Peng, Kun. "Theory and Practice of Secure E-Voting Systems." In Theory and Practice of Cryptography Solutions for Secure Information Systems. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-4030-6.ch017.

Full text
Abstract:
Electronic voting is a popular application of cryptographic and network techniques to e-government. Most of the existing e-voting schemes can be classified into two categories: homomorphic voting and shuffling-based voting. In a homomorphic voting, an encryption algorithm with special homomorphic property (e.g. ElGamal encryption or Paillier encryption) is employed to encrypt the votes such that the sum of the votes can be recovered without decrypting any single vote. An advantage of homomorphic voting is efficient tallying. Tallying in homomorphic voting only costs one single decryption operation for each candidate. In this chapter, the existing e-voting solutions in both categories are surveyed and analysed. The key security properties in both categories are presented and then the existing e-voting schemes in each category are checked against the corresponding security properties. Security and efficiency of the schemes are analysed and the strongest security and highest efficiency achievable in each category is estimated. Problems and concerns about the existing solutions including vulnerability to malicious voters and (or) talliers, possible failure of complete correctness, imperfect privacy, dependence on computational assumptions, and exaggerated efficiency are addressed. New approaches will be proposed in both kinds of solutions to overcome the existing drawbacks in them. In homomorphic e-voting, the authors deal with possibly malicious voters and aim at efficient vote validity check to achieve strong and formally provable soundness and privacy. It can be implemented through new zero knowledge proof techniques, which are both efficient and provably secure. In mix-network-based e-voting, the authors deal with possibly deviating operations of both voters and talliers and aim at efficient proof of validity of shuffling, which guarantees the desired security properties and prevent attacks from malicious participants. It can be based on inspiring linear algebra knowledge and the new zero knowledge proof of existence of secret permutation.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorytm ElGamala"

1

Sharma, Prashant, Sonal Sharma, and Ravi Shankar Dhakar. "Modified Elgamal Cryptosystem Algorithm (MECA)." In 2011 2nd International Conference on Computer and Communication Technology (ICCCT). IEEE, 2011. http://dx.doi.org/10.1109/iccct.2011.6075141.

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

Wu, Zengqiang, Di Su, and Gang Ding. "ElGamal algorithm for encryption of data transmission." In 2014 International Conference on Mechatronics and Control (ICMC). IEEE, 2014. http://dx.doi.org/10.1109/icmc.2014.7231798.

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

Xu, Dewu, and Wei Chen. "3G communication encryption algorithm based on ECC-ElGamal." In 2010 2nd International Conference on Signal Processing Systems (ICSPS). IEEE, 2010. http://dx.doi.org/10.1109/icsps.2010.5555894.

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

Iswari, Ni Made Satvika. "Key generation algorithm design combination of RSA and ElGamal algorithm." In 2016 8th International Conference on Information Technology and Electrical Engineering (ICITEE). IEEE, 2016. http://dx.doi.org/10.1109/iciteed.2016.7863255.

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

Kacaribu, Alexander Edi Suranta, and Ratnadewi. "Multiplying cipher images on visual cryptography with ElGamal algorithm." In 2015 2nd International Conference on Information Technology, Computer, and Electrical Engineering (ICITACEE). IEEE, 2015. http://dx.doi.org/10.1109/icitacee.2015.7437790.

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

Bing-cheng, Qiu, Yao Yang-xin, Zhang Xi-min, and Chen Yin-dong. "Iterative Composite Encryption Algorithm Based on Tea and Elgamal." In 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.744.

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

Arpit and Ashwini Kumar. "Verification of elgamal algorithm cryptographic protocol using linear temporal logic." In 2011 International Conference on Multimedia Technology (ICMT). IEEE, 2011. http://dx.doi.org/10.1109/icmt.2011.6002114.

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

Atiqah Rosly, Nurul, Abdul Aziz Mohd Zafran, Hashim Habibah, Syed Adnan Syed Farid, and Mat Isa Mohd Anuar. "Cryptographic Computation Using ElGamal Algorithm in 32-bit Computing System." In Third International Conference on Control, Automation and Systems Engineering (CASE-13). Atlantis Press, 2013. http://dx.doi.org/10.2991/case-13.2013.16.

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

Xiao-fei, Li, Shen Xuan-jing, and Chen Hai-peng. "An Improved ElGamal Digital Signature Algorithm Based on Adding a Random Number." In 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing. IEEE, 2010. http://dx.doi.org/10.1109/nswctc.2010.190.

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

Ajeena, Ruma Kareem K., and Sarah Jabbar Yaqoob. "The integer sub-decomposition method to improve the elliptic elgamal digital signature algorithm." In 2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT). IEEE, 2017. http://dx.doi.org/10.1109/crcsit.2017.7965554.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorytm ElGamala' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography