Log in

Relevant bibliographies by topics / Digital Signature Algorithm confidentiality / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Digital Signature Algorithm confidentiality.

Dissertations / Theses on the topic 'Digital Signature Algorithm confidentiality'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the top 18 dissertations / theses for your research on the topic 'Digital Signature Algorithm confidentiality.'

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

Kouchaki, Barzi Behnaz. "Points of High Order on Elliptic Curves : ECDSA." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-58449.

Full text

Abstract:

This master thesis is about Elliptic Curve Digital Signature Algorithm or ECDSA and two of the known attacks on this security system. The purpose of this thesis is to find points that are likely to be points of high order on an elliptic curve. If we have a point P of high order and if Q = mP, then we have a large set of possible values of m. Therefore it is hard to solve the Elliptic Curve Discrete Logarithm Problem or ECDLP. We have investigated on the time of finding the solution of ECDLP for a certain amount of elliptic curves based on the order of the point which is used to create the digi

APA, Harvard, Vancouver, ISO, and other styles

2

Kirlar, Baris Bulent. "Isomorphism Classes Of Elliptic Curves Over Finite Fields Of Characteristic Two." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606489/index.pdf.

Full text

Abstract:

In this thesis, the work of Menezes on the isomorphism classes of elliptic curves over finite fields of characteristic two is studied. Basic definitions and some facts of the elliptic curves required in this context are reviewed and group structure of elliptic curves are constructed. A fairly detailed investigation is made for the isomorphism classes of elliptic curves due to Menezes and Schoof. This work plays an important role in Elliptic Curve Digital Signature Algorithm. In this context, those isomorphism classes of elliptic curves recommended by National Institute of Standards and Tech

APA, Harvard, Vancouver, ISO, and other styles

3

Min, Menglei. "Evaluation and Implementation for Pushing Automatic Updates to IoT Devices." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-31483.

Full text

Abstract:

In recent years, Internet of Things has developed rapidly, and now has penetrated into human life and industrial production. It is speculated that the internet of things will become ubiquitous in the future, which will bring a series of problems. First, the large number of things will lead to operated system and software updates consuming a lot of manpower and resources. Another problem is the Internet of things facing security issues, in recent years for the means of Internet of things and tools have been increasing largely. Therefore, to achieve a secure automatic update on the Internet of T

APA, Harvard, Vancouver, ISO, and other styles

4

Guzý, Ladislav. "Elektronický podpis a jeho využití v účetnictví." Master's thesis, Vysoká škola ekonomická v Praze, 2013. http://www.nusl.cz/ntk/nusl-197614.

Full text

Abstract:

Diploma thesis is focused on matters of electronic signatures and their possible usage in accounting and business process. The paper is divided into two parts. Subject of the first part is general analysis of terminology and characteristics of electronic signature, certificates and certification authorities and time stamps, including analysis of strengths and weaknesses of these services. At the end of this theory part are outlined some of the most common choices of using electronic signature in accounting system. In second part are analysed results of research, which was performed by sending

APA, Harvard, Vancouver, ISO, and other styles

5

Du, Rong. "Secure electronic tendering." Thesis, Queensland University of Technology, 2007. https://eprints.qut.edu.au/16606/1/Rong_Du_Thesis.pdf.

Full text

Abstract:

Tendering is a method for entering into a sales contract. Numerous electronic tendering systems have been established with the intent of improving the efficiency of the tendering process. Although providing adequate security services is a desired feature in an e-tendering system, current e-tendering systems are usually designed with little consideration of security and legal compliance. This research focuses on designing secure protocols for e-tendering systems. It involves developing methodologies for establishing security requirements, constructing security protocols and using formal

APA, Harvard, Vancouver, ISO, and other styles

6

Du, Rong. "Secure electronic tendering." Queensland University of Technology, 2007. http://eprints.qut.edu.au/16606/.

Full text

Abstract:

Tendering is a method for entering into a sales contract. Numerous electronic tendering systems have been established with the intent of improving the efficiency of the tendering process. Although providing adequate security services is a desired feature in an e-tendering system, current e-tendering systems are usually designed with little consideration of security and legal compliance. This research focuses on designing secure protocols for e-tendering systems. It involves developing methodologies for establishing security requirements, constructing security protocols and using formal

APA, Harvard, Vancouver, ISO, and other styles

7

Hitchcock, Yvonne Roslyn. "Elliptic curve cryptography for lightweight applications." Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15838/1/Yvonne_Hitchcock_Thesis.pdf.

Full text

Abstract:

Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security

APA, Harvard, Vancouver, ISO, and other styles

8

Hitchcock, Yvonne Roslyn. "Elliptic Curve Cryptography for Lightweight Applications." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15838/.

Full text

Abstract:

Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security

APA, Harvard, Vancouver, ISO, and other styles

9

Liao, Hung-Zih, and 廖宏梓. "On the Elliptic Curve Digital Signature Algorithm." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/07305284059963403821.

Full text

Abstract:

碩士<br>東海大學<br>數學系<br>94<br>In this thesis, we propose a variant of the ANSI X9.62 ECDSA. We give a brief introduction to the digital signature algorithm in chapter 2, and then give the basic concepts of the elliptic curve cryptosystems in chapter 3. The next chapter includes the elliptic curve version of DSA, and finally a variant of ECDSA will be given in chapter 5.

APA, Harvard, Vancouver, ISO, and other styles

10

Kumar, Pranav, and Binay Prakash Dungdung. "An extension of elgamal digital signature algorithm." Thesis, 2012. http://ethesis.nitrkl.ac.in/3769/1/THESIS_108CS025_%26_108CS072.pdf.

Full text

Abstract:

As for the problem that ElGamal digital signature scheme’s security is constantly being challenged and is becoming more and more serious, an improved ElGamal digital signature algorithm was proposed. As the original ElGamal algorithm has its own security disadvantages that only one random number is used, in order to improve its security, the proposed scheme improved this demerit by adding a random number to the original one and increasing difficulty of deciphering key. The security of the improved signature scheme is the same with the ElGamal signature scheme which is based on the difficult co

APA, Harvard, Vancouver, ISO, and other styles

11

Yu-Shian, Chen. "Threshold Elliptic Curve Digital Signature Algorithm (Threshold ECDA)." 2005. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-1507200514381000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Chen, Yu-Shian, and 陳煜弦. "Threshold Elliptic Curve Digital Signature Algorithm (Threshold ECDA)." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/09044909312626110196.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電機工程學研究所<br>93<br>ECDSA is a widely adopted standard. We present a (t,2t,n) threshold Elliptic Curve Digital Signature Algorithm (ECDSA) scheme. In our scheme, the regular ECDSA signer is distributed into a $n$-participant group which shares the elliptic curve private key by Secret Sharing (SS) with the parameter 2t<n. To sign a valid signature with no one''s secret revealed, it takes at least 2t participants of the group to collaborate. Coalition of less than t participants can not forge any signature nor require other''s partial private keys. Even when some cheaters try to s

APA, Harvard, Vancouver, ISO, and other styles

13

Nakai, Eduardo Yuzo. "Evaluation and implementation of the Ed25519 digital signature algorithm in rust." Master's thesis, 2021. http://hdl.handle.net/10198/24067.

Full text

Abstract:

Mestrado de dupla diplomação com a UTFPR - Universidade Tecnológica Federal do Paraná<br>Cryptography can be classified as secret-key and public-key cryptography. Both have distinct features and differs in performance, complexity, flexibility and security. Secret-key cryptography, considering its simplicity and performance, is commonly used for securing communications. The invention of public-key cryptography made it possible to develop more flexible cryptographic schemes and algorithms, such as key exchanges and digital signatures, hence extending the possibilities and the field of crypt

APA, Harvard, Vancouver, ISO, and other styles

14

Lin, Jhih-Yun, and 林志耘. "The Implementation of Elliptic Curve Diffie-Hellman and Elliptic Curve Digital Signature Algorithm on Altera DE2-70." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/bvjpkm.

Full text

Abstract:

碩士<br>逢甲大學<br>資訊工程學系<br>103<br>Abstract—In recent years, Elliptic Curve Cryptography (ECC) to be attracted the attention of researcher and product developer. There are two reasons, first is having powerful mathematical structure; attackers need to know background of elliptic curve arithmetic will be easy attack. Second, for using less bit of key to reach the same safety with RSA encryption algorithm, therefore, to keep enough safety, when bit of key increase gradually, relative to RSA encryption algorithm, process time of ECC will reduce, with this characteristic, when we keep same safety in r

APA, Harvard, Vancouver, ISO, and other styles

15

Das, Saptarsi. "A Polymorphic Finite Field Multiplier." Thesis, 2011. https://etd.iisc.ac.in/handle/2005/2100.

Full text

Abstract:

Cryptography algorithms like the Advanced Encryption Standard, Elliptic Curve Cryptography algorithms etc are designed using algebraic properties of finite fields. Thus performance of these algorithms depend on performance of the underneath field operations. Moreover, different algorithms use finite fields of widely varying order. In order to cater to these finite fields of different orders in an area efficient manner, it is necessary to design solutions in the form of hardware-consolidations, keeping the performance requirements in mind. Due to their small area occupancy and high utilization,

APA, Harvard, Vancouver, ISO, and other styles

16

Das, Saptarsi. "A Polymorphic Finite Field Multiplier." Thesis, 2011. http://hdl.handle.net/2005/2100.

Full text

Abstract:

Cryptography algorithms like the Advanced Encryption Standard, Elliptic Curve Cryptography algorithms etc are designed using algebraic properties of finite fields. Thus performance of these algorithms depend on performance of the underneath field operations. Moreover, different algorithms use finite fields of widely varying order. In order to cater to these finite fields of different orders in an area efficient manner, it is necessary to design solutions in the form of hardware-consolidations, keeping the performance requirements in mind. Due to their small area occupancy and high utilization,

APA, Harvard, Vancouver, ISO, and other styles

17

Yoshida, Kayo. "Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem." Thesis, 2009. http://hdl.handle.net/10012/4219.

Full text

Abstract:

The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model.

APA, Harvard, Vancouver, ISO, and other styles

18

DRDÁK, František. "Rozbor a návrh aplikace pro digitální měnu Bitcoin." Master's thesis, 2015. http://www.nusl.cz/ntk/nusl-188109.

Full text

Abstract:

The thesis is focused on the topic of virtual cryptocurrency Bitcoin. The theoretical part is divided into several chapters. First of all, there is a chapter containing basic information about the currency's history, its development to the present, as well as principles of operation of this currency. Because it is a currency based on cryptographic principles next chapter summarizing cryptographic techniques, which is necessary to know for subsequent analysis of this currency. In other parts is elaborated a detailed analysis of the principles of Bitcoin. The main point of this analysis is a sys

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!