Relevant bibliographies by topics / Curve-key

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Curve-key'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 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 'Curve-key.'

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 "Curve-key"

1

Krishna, Addepalli V. N., and Addepalli Hari Narayana. "Cubic spline curve public key cryptography." Journal of Discrete Mathematical Sciences and Cryptography 20, no. 2 (February 17, 2017): 453–61. http://dx.doi.org/10.1080/09720529.2015.1112512.

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

Baer, Wolfram. "Key Curve-Einprobenverfahren zur Ermittlung dynamischer Risswiderstandskurven." Materials Testing 47, no. 11-12 (November 2005): 666–73. http://dx.doi.org/10.3139/120.100701.

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

Aljamaly, Karrar Taher R., and Ruma Kareem K. Ajeena. "The KR-Elliptic Curve Public Key Cryptosystem." Journal of Physics: Conference Series 1879, no. 3 (May 1, 2021): 032046. http://dx.doi.org/10.1088/1742-6596/1879/3/032046.

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

Vasundhara, Dr S. "Elliptic curve Cryptography and Diffie- Hellman Key exchange." IOSR Journal of Mathematics 13, no. 01 (January 2017): 56–61. http://dx.doi.org/10.9790/5728-1301015661.

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

Simonsohn, Uri, Leif D. Nelson, and Joseph P. Simmons. "P-curve: A key to the file-drawer." Journal of Experimental Psychology: General 143, no. 2 (2014): 534–47. http://dx.doi.org/10.1037/a0033242.

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

Zhang, Yong Hong, L. H. Wang, and De Jin Hu. "Key Technologies of Image Measurement for Curve Accurate Grinding." Key Engineering Materials 329 (January 2007): 533–38. http://dx.doi.org/10.4028/www.scientific.net/kem.329.533.

Full text
Abstract:
Image analysis was used to evaluate the curve grinding process. The measurement system organization and its principle of operation were introduced. Some key technologies that influence the system precision were also studied in details. Real-time image of work piece and wheel grinding can be gathered while using CCD camera. For image de-noising, a kind of wavelet threshold function was presented to calculate the new wavelet coefficients. Local threshold algorithm was used to compute different scale threshold, another threshold is suggested when MSE is minimum. Image signals are reconstructed through invert discrete wavelet transformation with the new wavelet coefficients. For the purpose of increasing the measurement precision, a closed mathematical model of sub-pixel edge detection operator was founded according to the gray moment operator’s invariant characteristics and Tabatabai’s first three sample gray moments. An application of system validity and the comparison results of work piece were also given. From experiments it can be said that the proposed method in this paper is effective, and its detection precision and results are reasonable.
APA, Harvard, Vancouver, ISO, and other styles
7

Reddy, P. Vasudeva, and M. Padmavathamma. "An authenticated key exchange protocol in elliptic curve cryptography." Journal of Discrete Mathematical Sciences and Cryptography 10, no. 5 (October 2007): 697–705. http://dx.doi.org/10.1080/09720529.2007.10698150.

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

C., Sivakumar Chellappan. "Efficient Group Key Management Using Whale Optimization Algorithm based Elliptic Curve Cryptography for Dynamic Multicast Groups." Journal of Advanced Research in Dynamical and Control Systems 12, SP3 (February 28, 2020): 1078–92. http://dx.doi.org/10.5373/jardcs/v12sp3/20201354.

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

Ernst, M., B. Henhapl, S. Klupsch, and S. Huss. "FPGA based hardware acceleration for elliptic curve public key cryptosystems." Journal of Systems and Software 70, no. 3 (March 2004): 299–313. http://dx.doi.org/10.1016/s0164-1212(03)00075-x.

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

B.J., Santhosh Kumar, and Kruthika Vijay. "Symmetric Key based Encryption and Decryption using Lissajous Curve Equations." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 1 (February 1, 2017): 285. http://dx.doi.org/10.11591/ijece.v7i1.pp285-288.

Full text
Abstract:
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Curve-key"

1

Bommireddipalli, Nithesh Venkata Ramana Surya. "Tutorial on Elliptic Curve Arithmetic and Introduction to Elliptic Curve Cryptography (ECC)." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1511866832906148.

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

Varga, Ondrej. "Efektivní schémata digitálních podpisů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219303.

Full text
Abstract:
Digital signatures, which take the properties of classical signatures, are used to secure the actual content of documents, which can be modified during transmission over an insecure channel. The problems of security and protection of communicating participants are solved by cryptographic techniques. Identity verification, message integrity, credibility, the ownership of documents, and the secure transmission of information over an unsecured channel, are all dealt with in secure communications - Public Key Infrastructure, which uses digital signatures. Nowadays digital signatures are often used to secure data in communication over an unsecured channel. The aim of the following master’s thesis is to familiarize readers with the necessary technological aspects of digital signatures, as well as their advantages and disadvantages. By the time digital signatures are being used they will have to be improved and modified to be secure against more sophisticated attacks. In this paper, proposals of new efficient digital signature schemes and their comparison with current ones are described. Also are examined their implications for computationally weak devices, or deployment in low speed channel transmission systems. After an explanation of cryptography and a description of its basic subjects, digital signatures are introduced. The first chapter describes the possible formatting and architecture of the digital signature. The second part of this master’s thesis is about current digital signature schemes and their properties. Chapter 3 describes some proposals of new efficient digital signature schemes and their comparison to those currently in use. In the practical part, the implementations (in the environment .NET in C#) of two effective digital signature schemes as part of a client-server application are presented and described (Chapter 4). In the last chapter the comparison and analysis of the implemented signature schemes are provided.
APA, Harvard, Vancouver, ISO, and other styles
3

Gebremichael, Teklay. "Lightweight Cryptographic Group Key Management Protocols for the Internet of Things." Licentiate thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-35607.

Full text
Abstract:
The Internet of Things (IoT) is increasingly becoming an integral component of many applications in consumer, industrial and other areas. Notions such as smart industry, smart transport, and smart world are, in large part, enabled by IoT. At its core, the IoT is underpinned by a group of devices, such as sensors and actuators, working collaboratively to provide a required service. One of the important requirements most IoT applications are expected to satisfy is ensuring the security and privacy of users. Security is an umbrella term that encompasses notions such as confidentiality, integrity and privacy, that are typically achieved using cryptographic encryption techniques. A special form of communication common in many IoT applications is group communication, where there are two or more recipients of a given message. In or-der to encrypt a message broadcast to a group, it is required that the participating parties agree on a group key a priori. Establishing and managing a group key in IoT environments, where devices are resources-constrained and groups are dynamic, is a non-trivial problem. The problem presents unique challenges with regard to con-structing protocols from lightweight and secure primitives commensurate with the resource-constrained nature of devices and maintaining security as devices dynamically leave or join a group. This thesis presents lightweight group key management protocols proposed to address the aforementioned problem, in a widely adopted model of a generic IoT network consisting of a gateway with reasonable computational power and a set of resource-constrained nodes. The aim of the group key management protocols is to enable the gateway and the set of resource-constrained devices to establish and manage a group key, which is then used to encrypt group messages. The main problems the protocols attempt to solve are establishing a group key among participating IoT devices in a secure and computationally feasible manner; enabling additionor removal of a device to the group in a security preserving manner; and enabling generation of a group session key in an efficient manner without re-running the protocol from scratch. The main challenge in designing such protocols is ensuring that the computations that a given IoT device performs as part of participating in the protocol are computationally feasible during initial group establishment, group keyupdate, and adding or removing a node from the group. The work presented in this thesis shows that the challenge can be overcome by designing protocols from lightweight cryptographic primitives. Specifically, protocols that exploit the lightweight nature of crypto-systems based on elliptic curves and the perfect secrecy of the One Time Pad (OTP) are presented. The protocols are designed in such a way that a resource-constrained member node performs a constant number of computationally easy computations during all stages of the group key management process. To demonstrate that the protocols are practically feasible, implementation resultof one of the protocols is also presented, showing that the protocol outperforms similar state-of-the-art protocols with regard to energy consumption, execution time, memory usage and number of messages generated.

Vid tidpunkten för framläggningen av avhandlingen var följande delarbete opublicerat: delarbete 3 (manuskript).

At the time of the defence the following paper was unpublished: paper 3 (manuscript).


SMART (Smarta system och tjänster för ett effektivt och innovativt samhälle)
APA, Harvard, Vancouver, ISO, and other styles
4

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 as 1024 bit RSA. Also, the level of security provided by an ECC increases faster with key size than for integer based discrete logarithm (dl) or RSA cryptosystems. ECCs can also provide a faster implementation than RSA or dl systems, and use less bandwidth and power. These issues can be crucial in lightweight applications such as smart cards. In the last few years, ECCs have been included or proposed for inclusion in internationally recognized standards. Thus elliptic curve cryptography is set to become an integral part of lightweight applications in the immediate future. This thesis presents an analysis of several important issues for ECCs on lightweight devices. It begins with an introduction to elliptic curves and the algorithms required to implement an ECC. It then gives an analysis of the speed, code size and memory usage of various possible implementation options. Enough details are presented to enable an implementer to choose for implementation those algorithms which give the greatest speed whilst conforming to the code size and ram restrictions of a particular lightweight device. Recommendations are made for new functions to be included on coprocessors for lightweight devices to support ECC implementations Another issue of concern for implementers is the side-channel attacks that have recently been proposed. They obtain information about the cryptosystem by measuring side-channel information such as power consumption and processing time and the information is then used to break implementations that have not incorporated appropriate defences. A new method of defence to protect an implementation from the simple power analysis (spa) method of attack is presented in this thesis. It requires 44% fewer additions and 11% more doublings than the commonly recommended defence of performing a point addition in every loop of the binary scalar multiplication algorithm. The algorithm forms a contribution to the current range of possible spa defences which has a good speed but low memory usage. Another topic of paramount importance to ECCs for lightweight applications is whether the security of fixed curves is equivalent to that of random curves. Because of the inability of lightweight devices to generate secure random curves, fixed curves are used in such devices. These curves provide the additional advantage of requiring less bandwidth, code size and processing time. However, it is intuitively obvious that a large precomputation to aid in the breaking of the elliptic curve discrete logarithm problem (ECDLP) can be made for a fixed curve which would be unavailable for a random curve. Therefore, it would appear that fixed curves are less secure than random curves, but quantifying the loss of security is much more difficult. The thesis performs an examination of fixed curve security taking this observation into account, and includes a definition of equivalent security and an analysis of a variation of Pollard's rho method where computations from solutions of previous ECDLPs can be used to solve subsequent ECDLPs on the same curve. A lower bound on the expected time to solve such ECDLPs using this method is presented, as well as an approximation of the expected time remaining to solve an ECDLP when a given size of precomputation is available. It is concluded that adding a total of 11 bits to the size of a fixed curve provides an equivalent level of security compared to random curves. The final part of the thesis deals with proofs of security of key exchange protocols in the Canetti-Krawczyk proof model. This model has been used since it offers the advantage of a modular proof with reusable components. Firstly a password-based authentication mechanism and its security proof are discussed, followed by an analysis of the use of the authentication mechanism in key exchange protocols. The Canetti-Krawczyk model is then used to examine secure tripartite (three party) key exchange protocols. Tripartite key exchange protocols are particularly suited to ECCs because of the availability of bilinear mappings on elliptic curves, which allow more efficient tripartite key exchange protocols.
APA, Harvard, Vancouver, ISO, and other styles
5

Carnellosi, Cristiany Fosquiani. "Aporte de sedimentos, nutrientes e microorganismos no Rio Portuguesa." Universidade Estadual do Oeste do Parana, 2007. http://tede.unioeste.br:8080/tede/handle/tede/274.

Full text
Abstract:
Made available in DSpace on 2017-05-12T14:47:41Z (GMT). No. of bitstreams: 1 Cristiany Fosquiani.pdf: 1334289 bytes, checksum: 9235d563e3a64368c95f17fc02f96891 (MD5) Previous issue date: 2007-07-13
The goal of this research was to quantify the amount of liquid, the drop of sediments, nutrients and micro-organisms from Portuguesa river hydrografical basin, Piquiri tributary in Ubiratã/PR. The river basin has an area of 40,819 km2, and from this total 6% is inside the urban area and 94% in the rural area. It was analyzed the physical-chemical parameters, microbiologicals the amount of sediments and quantify of flow. Every datas was about the flow, the use and the soil occupied. The evaluated of water quality from the Portuguesa river trough the analysis of parameters physical-chemical and biologics; the dissolved oxygen, electrical conductivity, pH, water temperature, turbidity, color, total kjeldahl nitrogen, nitrate, nitrite, total phosphorus, total coliforms and thermotolerant coliforms and solids in suspension. There were chosen 3 points at Portuguesa river called P1, P2 and P3 to the realization of the cross-section. The collection was done between a couple of weeks, or with the meaning increase of the amount of liquid. The parameters physical-chemical were analyzed in agreement of metodology described by Standard Methods for the Examination of Water and Wastewater (APHA-AWWA-WEF, 1995) and the bacteriologicals parameters were studied trough the subtract method COLILERT (cellophanes). The results show us the water temperature had a fluctuation, could have being associated with the time and the period of the year when sample was done such as the soil accupation. There were relations between electric conduction and dissolved oxygen. The parameter pH was closed to the neutrality in the whole studied points. The electric conduction, color and turbidity had the relation with flow such as increase or decrease of it. The variable dissolved oxygen showed the degrees less than 5mg.L-1 in all points between 08/03/2007 and 03/04/2007, having a relation to the temperature and flow. In relation of variability from nutrients (total phosphorus, nitrite and nitrate) exception to total kjeldahl nitrogen, that doesn t have relation to the flow, the smaller values found were associated with smaller flow. About the total coliforms, the P1 showed the biggest concentration associated to the increase of flow. Thermotolerant coliforms, P2 and P3 showed the biggest concentration, these points are localized next to the urban area. The key-curve of solid flush in suspension and flow, bring up good correlation among the three monitored points, shows up the worth of flow and sediments obtained are about the flush of basic flow by inecessability to the control stages of rain. About the production of sediments trough the analysis of the solids values in suspension and the bigger flows. To help the future use of water from Portuguesa river, was compared the parameters analyzeds to the stabilished limits from resolution CONAMA 357/2005, to put them in the class and use. Some parameters set the Portuguesa river in class 2 and others in class 3.
O presente trabalho teve como objetivo quantificar a vazão líquida, o aporte de sedimentos, de nutrientes e de microorganismos da bacia hidrográfica do rio Portuguesa, tributário do Piquiri, no município de Ubiratã/PR. A bacia possui uma área de 40,819 km2, sendo que deste total, 6% está inserido na área urbana e 94% na área rural. Foram realizadas análises referentes a parâmetros físico-químicos, microbiológicos, carga de sedimentos quantificação de vazão. Todos os dados foram correlacionados com a vazão e com o uso e ocupação do solo. Avaliou-se a qualidade das águas do rio Portuguesa através da análise de parâmetros físico-químicos e biológicos: oxigênio dissolvido, condutividade elétrica, pH, temperatura da água, turbidez, cor, nitrato, nitrito, nitrogênio total kjeldahl, fósforo total, coliformes totais e termotolerantes e sólidos em suspensão. Foram escolhidos para realização da amostragem, 3 pontos localizados no rio Portuguesa, denominados P1, P2 e P3. As coletas foram realizadas com periodicidade de 15 dias, ou com aumento significativo da vazão. Os parâmetros físico-químicos foram analisados de acordo com as metodologias descritas no Standard Methods for the Examination of Water and Wastewater (APHA-AWWA-WEF, 1995) e os parâmetros bacteriológicos foram analisados através do método substrato COLILERT (Cartelas). Os resultados obtidos demonstraram que a temperatura da água apresentou uma oscilação, podendo estar associado com o horário, a época do ano que foi realizada amostragem e o uso e ocupação do solo. Houve ainda uma relação com a condutividade elétrica e oxigênio dissolvido. O parâmetro pH manteve-se próximo a neutralidade em todos os pontos estudados. Condutividade elétrica, cor e turbidez tiveram relação com a vazão, tanto com o aumento quanto com diminuição da mesma. A variável oxigênio dissolvido apresentou valores abaixo de 5 mg. L-1 em todos os pontos nos dias 08/03/2007 e 03/04/2007, havendo uma relação com temperatura e vazão. Em relação as variáveis nutrientes (fósforo total, nitrito e nitrato) com exceção do nitrogênio total kjeldhal, que não teve relação com a vazão, os menores valores encontradas estiveram associados com baixas vazões. Em relação a coliformes totais, o P1 apresentou maiores concentrações associados ao aumento da vazão. Coliformes termotolerantes, P2 e P3 apresentaram maiores concentrações, estes pontos localizam-se próximos a área urbana. A curva-chave de descarga sólida em suspensão e vazão, apresentou boa correlação nos três pontos monitorados, destaca-se que os valores de vazão e sedimentos obtidos referem-se ao fluxo de vazão básica, pela inacessibilidade às secções de controle durante a chuva. Em relação à produção de sedimentos, através das análises de sólidos em suspensão pode-se observar que P1 apresentou os maiores valores de sólidos em suspensão e maiores vazões. Como auxílio no uso futuro das águas do rio Portuguesa, comparou-se os parâmetros analisados aos limites estabelecidos pela Resolução CONAMA 357/2005, a fim de enquadra-lo na classe de uso. Alguns parâmetros enquadraram o rio Portuguesa em classe 2 e outros em classe 3.
APA, Harvard, Vancouver, ISO, and other styles
6

Iost, Caroline. "Produção de sedimentos e qualidade da água de uma microbacia hidrográfica rural." Universidade Estadual do Oeste do Parana, 2008. http://tede.unioeste.br:8080/tede/handle/tede/285.

Full text
Abstract:
Made available in DSpace on 2017-05-12T14:47:46Z (GMT). No. of bitstreams: 1 Caroline Iost.pdf: 1234608 bytes, checksum: d5a0ddd1cd06d5366dc84b88a138a1dc (MD5) Previous issue date: 2008-02-12
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
The objective of this work was to evaluate the influence of land use in the production of sediment and water quality of the micro basin of river Mandarina micro basin, located in the city of Cascavel-PR. The liquid discharge, the suspended sediment and the physic-chemical parameters dissolved oxygen (DO), electrical conductivity, pH, temperature of the water, turbidity, color, nitrate, nitrite, total nitrogen, total phosphorus was monitoring between the months January and August 2007 at the river's main. It was determined the curve-key of the liquid discharge and discharge of suspended solid, which showed good correlation (R2 equal to 0.98 and 0.93, respectively). The results indicated a low production of sediment, average of 0,27 t dia-1 and good water quality, because the parameters have not gone beyond the limits praised by Resolution 345/05 of CONAMA for rivers, Class 2, with the exception of dissolved oxygen in some collections was below 5 mg L-1, color and total phosphorus which also exceeded the limits stipulated. Agriculture is the predominant activity in the micro basin (88%) and water courses have about 79% of the area of riparian forest required by law. It is believed that the soil management in the area of agriculture with practices such as tillage and system of terraces, as well as the presence of riparian forest in rivers, influenced for the good quality water and low production sediment on the water.
O objetivo deste trabalho foi verificar a influência do uso do solo na produção de sedimento e na qualidade da água da microbacia hidrográfica da sanga Mandarina, localizada no município de Cascavel-PR. A vazão, o sedimento em suspensão e os parâmetros físico-químicos da água, oxigênio dissolvido (OD), condutividade elétrica, pH, temperatura da água, turbidez, cor, nitrato, nitrito, nitrogênio total e fósforo total foram monitorados entre os meses de janeiro e agosto de 2007, no principal rio da microbacia. Determinou-se a curva-chave da vazão e da descarga sólida em suspensão, as quais apresentaram boa correlação (R2 igual a 0,98 e 0,93, respectivamente). Os resultados indicaram uma baixa produção, média de 0,27 t dia-1 de sedimento e uma boa qualidade da água, pois os parâmetros não ultrapassaram os limites regidos pela Resolução 345/05 do CONAMA para rios de Classe 2, com exceção do oxigênio dissolvido que em algumas coletas esteve abaixo de 5 mg L-1, cor e fósforo total que também ultrapassaram os limites estipulados. A agricultura é a atividade predominante na microbacia (88%) e os cursos d água apresentam cerca de 79% da área de mata ciliar exigida por lei. Acredita-se que o manejo do solo na área agricultável com práticas como o plantio direto e sistema de terraços, assim como a presença de mata ciliar nos rios influenciaram para o boa qualidade da água e baixa produção de sedimento no curso d água.
APA, Harvard, Vancouver, ISO, and other styles
7

Shoaib, Naveed. "A Portable and Improved Implementation of the Diffie-Hellman Protocol for Wireless Sensor Networks." Connect to resource online, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1253597142.

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

Pönisch, Jens. "Kryptoggraphie mit elliptischen Kurven." Universitätsbibliothek Chemnitz, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-156488.

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

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.
Dissertation (MEng (Computer Engineering))--University of Pretoria, 2006.
Electrical, Electronic and Computer Engineering
unrestricted
APA, Harvard, Vancouver, ISO, and other styles
10

Perzynová, Kateřina. "Hypereliptické křivky a jejich aplikace v kryptografii." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2010. http://www.nusl.cz/ntk/nusl-229028.

Full text
Abstract:
Cílem této práce je zpracovat úvod do problematiky hypereliptických křivek s důrazem na konečná pole. T práci je dále popsán úvod do teorie divizorů na hypereliptických křivkách, jejich reprezentace, aritmetika nad divizory a jejich využití v kryptografii. Teorie je hojně demonstrována příklady a výpočty v systému Mathematica.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Curve-key"

1

Menezes, Alfred. Elliptic Curve Public Key Cryptosystems. Boston, MA: Springer US, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Menezes, A. J. Elliptic curve public key cryptosystems. Boston: Kluwer Academic Publishers, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Menezes, Alfred. Elliptic Curve Public Key Cryptosystems. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2.

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

Elliptic Curve Public Key Cryptosystems. Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Martin, Keith M. Public-Key Encryption. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788003.003.0005.

Full text
Abstract:
In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.
APA, Harvard, Vancouver, ISO, and other styles
6

Harrison, Mark. Normal distribution. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780198765875.003.0063.

Full text
Abstract:
This chapter describes normal distribution as it applies to Emergency Medicine, and in particular the Primary FRCEM examination. The chapter outlines the key details of the bell-shaped curve, standard deviation, and confidence intervals. This chapter is laid out exactly following the RCEM syllabus, to allow easy reference and consolidation of learning.
APA, Harvard, Vancouver, ISO, and other styles
7

Hrushovski, Ehud, and François Loeser. Curves. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691161686.003.0007.

Full text
Abstract:
This chapter proves the iso-definability of unit vector C when C is a curve using Riemann-Roch. Recall that a pro-definable set is called iso-definable if it is isomorphic, as a pro-definable set, to a definable set. If C is an algebraic curve defined over a valued field F, then unit vector C is an iso-definable set. The topology on unit vector C is definably generated, that is, generated by a definable family of (iso)-definable subsets. In other words, there is a definable family giving a pre-basis of the topology. The chapter explains how definable types on C correspond to germs of paths on unit vector C. It also constructs the retraction on skeleta for curves. A key result is the finiteness of forward-branching points.
APA, Harvard, Vancouver, ISO, and other styles
8

F, Blake Ian, Seroussi G. 1955-, and Smart Nigel P. 1967-, eds. Advances in elliptic curve cryptography. Cambridge, UK: Cambridge University Press, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Guide to Elliptic Curve Cryptography (Springer Professional Computing). Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

(Editor), Ian F. Blake, Gadiel Seroussi (Editor), and Nigel P. Smart (Editor), eds. Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series). 2nd ed. Cambridge University Press, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Curve-key"

1

Menezes, Alfred. "The Elliptic Curve Logarithm Problem." In Elliptic Curve Public Key Cryptosystems, 61–81. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_5.

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

Menezes, Alfred. "Implementation of elliptic Curve cryptosystems." In Elliptic Curve Public Key Cryptosystems, 83–100. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_6.

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

Menezes, Alfred. "Introduction to Public Key Cryptography." In Elliptic Curve Public Key Cryptosystems, 1–14. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_1.

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

Hankerson, Darrel, and Alfred Menezes. "Elliptic Curve Key Agreement Schemes." In Encyclopedia of Cryptography and Security, 400–401. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_247.

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

Hankerson, Darrel, and Alfred Menezes. "Elliptic Curve Key Agreement Schemes." In Encyclopedia of Cryptography, Security and Privacy, 1–2. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-642-27739-9_247-2.

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

Menezes, Alfred. "Introduction to Elliptic Curves." In Elliptic Curve Public Key Cryptosystems, 15–34. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_2.

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

Menezes, Alfred. "Isomorphism Classes of Elliptic Curves Over Finite Fields." In Elliptic Curve Public Key Cryptosystems, 35–48. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_3.

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

Menezes, Alfred. "The Discrete Logarithm Problem." In Elliptic Curve Public Key Cryptosystems, 49–59. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_4.

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

Menezes, Alfred. "Counting Points on Elliptic Curves Over F2m." In Elliptic Curve Public Key Cryptosystems, 101–16. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3198-2_7.

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

Hankerson, Darrel, and Alfred Menezes. "Elliptic Curve Public-Key Encryption Schemes." In Encyclopedia of Cryptography and Security, 406–7. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_250.

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

Conference papers on the topic "Curve-key"

1

Naik, R. Mohan, SV Sathyanarayana, and TK Sowmya. "Key Management Using Elliptic Curve Diffie Hellman Curve 25519." In 2020 Third International Conference on Multimedia Processing, Communication & Information Technology (MPCIT). IEEE, 2020. http://dx.doi.org/10.1109/mpcit51588.2020.9350454.

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

Maria Celestin Vigila, S., and K. Muneeswaran. "Elliptic curve based key generation for symmetric encryption." In 2011 International Conference on Signal Processing, Communication, Computing and Networking Technologies (ICSCCN). IEEE, 2011. http://dx.doi.org/10.1109/icsccn.2011.6024664.

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

Jiangyuan Mei, Yulin Si, H. R. Karimi, and Huijun Gao. "Unsupervised low-key image segmentation using curve evolution approach." In 2013 IEEE International Conference on Mechatronics (ICM). IEEE, 2013. http://dx.doi.org/10.1109/icmech.2013.6518535.

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

Guangming Yang, Qi Wang, Qian Zhu, Jian Xu, Jin Chang, and Long Yan. "An Improved Group Key Agreement Based on Elliptic Curve." In 2010 Fourth International Conference on Genetic and Evolutionary Computing (ICGEC 2010). IEEE, 2010. http://dx.doi.org/10.1109/icgec.2010.114.

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

Yuan, Ke, Dafang He, Xiao Yang, Zhi Tang, Daniel Kifer, and C. Lee Giles. "Follow The Curve: Arbitrarily Oriented Scene Text Detection Using Key Points Spotting And Curve Prediction." In 2020 IEEE International Conference on Multimedia and Expo (ICME). IEEE, 2020. http://dx.doi.org/10.1109/icme46284.2020.9102770.

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

Zijian Zhang and Qijian Zhang. "Verifier-based password authenticated key exchange protocol via elliptic curve." In 2010 IEEE International Conference on Information Theory and Information Security (ICITIS). IEEE, 2010. http://dx.doi.org/10.1109/icitis.2010.5689582.

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

Mehibel, Nissa, and M'Hamed Hamadouche. "A new approach of elliptic curve Diffie-Hellman key exchange." In 2017 5th International Conference on Electrical Engineering - Boumerdes (ICEE-B). IEEE, 2017. http://dx.doi.org/10.1109/icee-b.2017.8192159.

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

Shin, Seonghan, Kazukuni Kobara, and Hideki Imai. "Elliptic Curve based Authenticated Key Agreement Protocol for Wireless Security." In 2006 International Conference on Computational Intelligence and Security. IEEE, 2006. http://dx.doi.org/10.1109/iccias.2006.295431.

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

Byrne, Daniel, Nilufer Onder, and Zhenlin Wang. "mPart: miss-ratio curve guided partitioning in key-value stores." In ISMM '18: The International Symposium on Memory Management 2018. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3210563.3210571.

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

Yooni, Eun-Jun, and Kee-Young Yoo. "A new elliptic curve diffie-hellman two-party key agreement protocol." In 2010 7th International Conference on Service Systems and Service Management (ICSSSM 2010). IEEE, 2010. http://dx.doi.org/10.1109/icsssm.2010.5530179.

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

Reports on the topic "Curve-key"

1

Turner, S., and D. Brown. Elliptic Curve Private Key Structure. RFC Editor, June 2010. http://dx.doi.org/10.17487/rfc5915.

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

Turner, S., D. Brown, K. Yiu, R. Housley, and T. Polk. Elliptic Curve Cryptography Subject Public Key Information. RFC Editor, March 2009. http://dx.doi.org/10.17487/rfc5480.

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

Ito, T., and S. Turner. Clarifications for Elliptic Curve Cryptography Subject Public Key Information. RFC Editor, August 2020. http://dx.doi.org/10.17487/rfc8813.

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

Turner, S. Elliptic Curve Algorithms for Cryptographic Message Syntax (CMS) Encrypted Key Package Content Type. RFC Editor, April 2011. http://dx.doi.org/10.17487/rfc6161.

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

Turner, S. Elliptic Curve Algorithms for Cryptographic Message Syntax (CMS) Asymmetric Key Package Content Type. RFC Editor, April 2011. http://dx.doi.org/10.17487/rfc6162.

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

Herzog, J., and R. Khazan. Use of Static-Static Elliptic Curve Diffie-Hellman Key Agreement in Cryptographic Message Syntax. RFC Editor, June 2011. http://dx.doi.org/10.17487/rfc6278.

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

Zhu, L., K. Jaganathan, and K. Lauter. Elliptic Curve Cryptography (ECC) Support for Public Key Cryptography for Initial Authentication in Kerberos (PKINIT). RFC Editor, September 2008. http://dx.doi.org/10.17487/rfc5349.

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

Merkle, J., and M. Lochter. Using the Elliptic Curve Cryptography (ECC) Brainpool Curves for the Internet Key Exchange Protocol Version 2 (IKEv2). RFC Editor, July 2013. http://dx.doi.org/10.17487/rfc6954.

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

Nir, Y. Using the Edwards-Curve Digital Signature Algorithm (EdDSA) in the Internet Key Exchange Protocol Version 2 (IKEv2). RFC Editor, August 2018. http://dx.doi.org/10.17487/rfc8420.

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

Housley, R. Use of the Elliptic Curve Diffie-Hellman Key Agreement Algorithm with X25519 and X448 in the Cryptographic Message Syntax (CMS). RFC Editor, August 2018. http://dx.doi.org/10.17487/rfc8418.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Curve-key' for particular source types:
Journal articles Dissertations / Theses Books
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