Relevant bibliographies by topics / RSA signature

Contents

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

Academic literature on the topic 'RSA signature'

Author: Grafiati
Published: 4 June 2021
Last updated: 10 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 'RSA signature.'

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 "RSA signature"

1

Jose, G. Jai Arul, and Dr C. Suyambulingom Dr. C. Suyambulingom. "Possible Attacks on RSA Signature." Indian Journal of Applied Research 3, no. 5 (October 1, 2011): 359–61. http://dx.doi.org/10.15373/2249555x/may2013/107.

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

HS, Christnatalis, and Amir Mahmud Husein. "Digital Signs Security System using AES-Blowfish-RSA Hybrid Cryptography Approach." SinkrOn 4, no. 1 (October 11, 2019): 185. http://dx.doi.org/10.33395/sinkron.v4i1.10244.

Full text
Abstract:
Increasing application of digital signatures in legitimate authentication of administrative documents in both public and private environments is one of the points of concern, especially the issue of security and integrity of ownership of signatures. Digital signature is a mathematical scheme, which a unit to identify and prove the authenticity of the owner of the message or document. The study aims to analyze security patterns and identification of digital signatures on documents using the RSA-AES-Blowfish hybrid cryptographic method approach for securing digital signatures, while the Kohonen SOM method is applied to identify ownership recognition of signature images. The analysis framework used in this study is each signature will be stored in the form of a digital image file that has been encrypted using hybrid method of AES-Blowfish with the SHA 256 hash function. Process of forming private keys and public keys in the signature image using the RSA algorithm. Authentic verification of the use of digital signatures on the document has 2 (two) stages, the first stage is signature will be valid used on the document if the result of hashing the selected signature image is the same based on the private key and public key entered by the user, while the second stage identification is done using the Kohonen SOM method to validate the similarity of the chosen signature with the ownership of the signature.
APA, Harvard, Vancouver, ISO, and other styles
3

Gu, Bao-jun, Yi Zhou, and Wei-nong Wang. "Batch RSA signature scheme." Journal of Shanghai Jiaotong University (Science) 14, no. 3 (June 2009): 290–92. http://dx.doi.org/10.1007/s12204-009-0290-1.

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

Ihwani, Mohamad. "INFORMATION SECURITY MODEL BASED DIGITAL SIGNATURE ALGORITHM WITH RSA ALGORITHM." Computer Engineering, Science and System Journal 1, no. 1 (January 31, 2016): 15–20. http://dx.doi.org/10.24114/cess.v1i1.4037.

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

Vidakovic, Dragan, Dusko Parezanovic, Olivera Nikolic, and Jelena Kaljevic. "Rsa Signature: Behind The Scenes." Advanced Computing: An International Journal 4, no. 2 (March 31, 2013): 27–40. http://dx.doi.org/10.5121/acij.2013.4203.

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

Deng, Lunzhi, Jiwen Zeng, and Yunyun Qu. "Certificateless Proxy Signature from RSA." Mathematical Problems in Engineering 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/373690.

Full text
Abstract:
Although some good results were achieved in speeding up the computation of pairing function in recent years, it is still interesting to design efficient cryptosystems with less bilinear pairing operation. A proxy signature scheme allows a proxy signer to sign messages on behalf of an original signer within a given context. We propose a certificateless proxy signature (CLPS) scheme from RSA and prove its security under the strongest security model where the Type I/II adversary is a super Type I/II adversary.
APA, Harvard, Vancouver, ISO, and other styles
7

LEE, S. "Efficient Identification of Bad Signatures in RSA-Type Batch Signature." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A, no. 1 (January 1, 2006): 74–80. http://dx.doi.org/10.1093/ietfec/e89-a.1.74.

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

Wei, Yan Na, Y. T. Jin, and J. W. Zhou. "Design and Realization of RSA Digital Signature System Based on Digital Certificate." Applied Mechanics and Materials 743 (March 2015): 698–701. http://dx.doi.org/10.4028/www.scientific.net/amm.743.698.

Full text
Abstract:
Digital signature plays a more and more important role in e-commerce. The basic methods of digital signature are introduced and a digital signature scheme based on digital certificate is proposed in this paper. Digital certificate is generated after personal information is written. The effective data, RSA parameters and signature results are included in digital certificate. The related RSA parameters of private key certificate are encrypted by private key password. The digital digest is gotten through hash algorithm in this scheme. Digital signature is operated by using RSA parameters in private key certificate and the signature is verified by RSA parameters in public key certificate by verifier.
APA, Harvard, Vancouver, ISO, and other styles
9

Pradhan, Sushma, and Birendra Kumar Sharma. "Improved Semantically Secured Variant of RSA Public Key Cryptosystem." International Journal of Informatics and Communication Technology (IJ-ICT) 4, no. 3 (December 1, 2015): 91. http://dx.doi.org/10.11591/ijict.v4i3.pp91-97.

Full text
Abstract:
<p>Boneh and Shacham gave a nice survey on four variants (Batch RSA, Multi-Prime RSA, Multi-Power RSA, and Rebalanced RSA). Batch RSA and Multi-Prime RSA were then combined to increase the decryption/signature generation performance. Here in this paper we further tried to increase the encryption/ signature verification performance. The proposed scheme is semantically secure also.</p>
APA, Harvard, Vancouver, ISO, and other styles
10

Duo, Chun Hong. "A Multibank E-Cash System Based on Group Signature Scheme." Applied Mechanics and Materials 321-324 (June 2013): 2987–90. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.2987.

Full text
Abstract:
Group signatures allow members of a group to sign messages anonymously on behalf of the group. Only a designated group manager is able to identify the group member who issued a given signature. In this paper we propose a new group signature scheme based on RSA, which is a blind signature algorithm. A multibank E-cash system has been presented based on the proposed scheme. A general design scheme including withdrawal, payment and deposit process is discussed particularly.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "RSA signature"

1

Misarsky, Jean-Francois. "Cryptanalyse et specification de schemas de signature rsa avec redondance." Caen, 1999. http://www.theses.fr/1999CAEN2043.

Full text
Abstract:
Plus de vingt ans se sont ecoules depuis l'invention par rivest, shamir et adleman de l'algorithme rsa. Aujourd'hui, c'est l'algorithme a cle publique le plus utilise dans le monde. Sans pour autant le remettre en cause en tant que tel, des attaques sur son utilisation en chiffrement et en signature sont apparues. Cette these les passe en revue, puis en presente de nouvelles. Les nouvelles attaques concernent les schemas de signature rsa avec redondance, c'est-a-dire ne faisant appel a aucune fonction de hachage. La premiere, basee sur une version affine de l'algorithme d'euclide etendu, l'algorithme d'okamoto-shiraishi, permet d'attaquer des schemas utilisant une fonction de redondance affine. De plus, cette attaque reste applicable lorsque de la redondance modulaire est utilisee. La seconde, basee sur la theorie des reseaux, fait appel a l'algorithme lll et permet d'attaquer des schemas de signature dispersant la redondance, qu'elle soit ou non modulaire, a l'interieur du message. De plus, de simples modifications dans la definition du reseau utilise permettent d'attaquer les schemas de signature faisant appel a differentes redondances modulaires, pour le message en entier, ou pour differentes parties du message. Afin de contrer ces deux attaques et celles recensees precedemment, deux nouveaux schemas de signature avec redondance sont proposes. Bases sur de nouveaux concepts, ils permettent d'abaisser le niveau de redondance a un tiers du nombre de bits du module rsa.
APA, Harvard, Vancouver, ISO, and other styles
2

Koshta, Prashant Kumar, and Shailendra Singh Thakur. "A Novel Authenticity of an Image Using Visual Cryptography." IJCSN, 2012. http://hdl.handle.net/10150/219514.

Full text
Abstract:
Information security in the present era is becoming very important in communication and data storage. Data transferred from one party to another over an insecure channel (e.g., Internet) can be protected by cryptography. The encrypting technologies of traditional and modern cryptography are usually used to avoid the message from being disclosed. Public-key cryptography usually uses complex mathematical computations to scramble the message.
A digital signature is an important public-key primitive that performs the function of conventional handwritten signatures for entity authentication, data integrity, and non-repudiation, especially within the electronic commerce environment. Currently, most conventional digital signature schemes are based on mathematical hard problems. These mathematical algorithms require computers to perform the heavy and complex computations to generate and verify the keys and signatures. In 1995, Naor and Shamir proposed a visual cryptography (VC) for binary images. VC has high security and requires simple computations. The purpose of this thesis is to provide an alternative to the current digital signature technology. We introduce a new digital signature scheme based on the concept of a non-expansion visual cryptography. A visual digital signature scheme is a method to enable visual verification of the authenticity of an image in an insecure environment without the need to perform any complex computations. We proposed scheme generates visual shares and manipulates them using the simple Boolean operations OR rather than generating and computing large and long random integer values as in the conventional digital signature schemes currently in use.
APA, Harvard, Vancouver, ISO, and other styles
3

Seyed, Saboonchi Nima. "Hardware Security Module Performance Optimization by Using a "Key Pool" : Generating keys when the load is low and saving in the external storage to use when the load is high." Thesis, KTH, Radio Systems Laboratory (RS Lab), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-158122.

Full text
Abstract:
This thesis project examines the performance limitations of Hardware Security Module (HSM) devices with respect to fulfilling the needs of security services in a rapidly growing security market in a cost-effective way. In particular, the needs due to the introduction of a new electronic ID system in Sweden (the Federation of Swedish eID) and how signatures are created and managed. SafeNet Luna SA 1700 is a high performance HSM's available in the current market. In this thesis the Luna SA 1700 capabilities are stated and a comprehensive analysis of its performance shows a performance gap between what HSMs are currently able to do and what they need to do to address the expected demands. A case study focused on new security services needed to address Sweden's e Identification organization is presented. Based upon the expected performance demands, this thesis project proposes an optimized HSM solution to address the identified performance gap between what is required and what current HSMs can provide. A series of tests were conducted to measure an existing HSM's performance. An analysis of these measurements was used to optimize a proposed solution for selected HSM or similar HSMs. One of the main requirements of the new signing service is the capability to perform fifty digital signatures within the acceptable response time which is 300 ms during normal hours and 3000 ms during peak hours. The proposed solution enables the HSM to meet the expected demands of 50 signing request per second in the assumed two hours of peak rate at a cost that is 1/9 of the cost of simply scaling up the number of HSMs. The target audience of this thesis project is Security Service Providers who use HSMs and need a high volume of key generation and storing. Also HSM vendors consider this solution and add similar functionality to their devices in order to meet the desired demands and to ensure a better future in this very rapidly growing market.
Detta examensarbete undersöker prestandabegränsningar för Hardware Security Module (HSM) enheter med avseende på att uppfylla behov av säkerhetstjänster i en snabbt växande marknad och på ett kostnadseffektivt sätt. I synnerhet på grund av de säkerhetskrav som nu existerar/tillkommit efter införandet av ett nytt elektroniskt ID-system i Sverige (Federationen för Svensk eID) och hur underskrifter skapas och hanteras. SafeNet Luna SA 1700 är en högpresterande HSM enhet tillgänglig på marknaden. I den här avhandlingen presenteras nuvarande HSM kapacitet och en omfattande analys av resultatet visar ett prestanda gap mellan vad HSMS för närvarande kan göra och vad som behöver förbättras för att ta itu med de förväntade kraven. En fallstudie fokuserad på nya säkerhetstjänster som krävs i och med Sveriges nya e-Identifiering presenteras. Baserat på resultatet i den här avhandlingen föreslås en optimerad HSM lösning för att tillgodose prestanda gapet mellan vad HSM presterar och de nya krav som ställs. Ett flertal tester genomfördes för att mäta en befintlig HSM prestanda. En analys av dessa mätningar användes för att föreslå en optimerad lösning för HSMS (eller liknande) enheter. Ett av de huvudsakliga kraven för den nya signeringstjänsten är att ha en kapacitet av 50 digitala signaturer inom en accepterad svarstidsintervall, vilket är 300ms vid ordinarie trafik och 3000ms vid högtrafik. Förslagen i avhandlingen möjliggör HSM enheten att tillgodose kraven på 50 signeringen per sekund under två timmars högtrafik, och till en 1/9 kostnad genom att skala upp antalet HSMs. Målgruppen i den här avhandlingen är användare av HSMs och där behovet av lagring och generering av nycklar i höga volymer är stort. Även HSM leverantörer som kan implementera den här optimeringen/lösningen i befintlig funktionalitet för att tillgodose det här behovet i en alltmer växande marknad.
APA, Harvard, Vancouver, ISO, and other styles
4

Magri, Bernardo Caraponale. "Assinatura digital Rabin-Williams - sem randomização e com prova eficiente de segurança." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-10092012-165253/.

Full text
Abstract:
Com o surgimento da criptografia de chave pública, muito esforço foi feito para a criação de protocolos de criptografia e de assinatura que fossem comprovadamente seguros contra indivíduos maliciosos. Existem várias definições de segurança, tanto para protocolos de criptografia como para protocolos de assinatura, e também existem vários modelos de adversários, que simulam um indivíduo malicioso tentando corromper o protocolo. A família de protocolos de assinatura Rabin possui os recordes de velocidade de vericação da assinatura, chegando a ser até 100 vezes mais rápida do que o RSA. Este trabalho apresenta uma redução eficiente de segurança no modelo do oráculo aleatório para uma variante do protocolo de assinatura Rabin descrito por Bernstein, onde não é necessário o uso de nenhuma função para geração de bits pseudo-aleatórios, o que torna o protocolo mais robusto. A redução apresentada é uma redução polinomial e eficiente do problema da fatoração de inteiros para o problema de quebrar o protocolo Principal Rabin-Williams B = 0.
With the development of public-key cryptography, many efforts were made to build encryption and signature protocols that were provably secure against malicious adversaries. There are many definitions of security for encryption and signature protocols, and there are many adversary models to simulate the behaviour of a malicious adversary against a given protocol. The Rabin family of signature protocols has the speed records for verification of signature, being up to 100 times faster than RSA. This work presents a tight security proof in the random oracle model for a variant of the Rabin signature protocol presented by Bernstein, that does not require the use of pseudo-random bits, making the protocol more robust. The proof presented here is a polynomially tight reduction for the problem of integer factorization to the problem of breaking the Principal Rabin-Williams B = 0 protocol.
APA, Harvard, Vancouver, ISO, and other styles
5

Valkaitis, Mindaugas. "Efektyvios šifravimo bei skaitmeninio parašo sistemos." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2012~D_20140704_171717-30545.

Full text
Abstract:
Šio darbo tikslas – apžvelgti šiuo metu naudojamas klasikines viešojo rakto šifravimo ir skaitmeninio parašo sistemas bei naujos kartos Signcryption kriptosistemą ir atlikti dedikuotos pasirašymo ir šifravimo kriptosistemos efektyvumo palyginimą su pasirašymo arba šifravimo kriptosistemų kompozicija bei pasiūlyti praktinio pritaikymą naujos kartos Signcryption kriptosistemai. Darbe apžvelgtos šios kriptosistemos: 1. RSA (Rivest, Shamir, Adleman) – klasikinė viešojo rakto pasirašymo arba šifravimo kriptosistema, kurios saugumas paremtas didelių skaičių faktorizacijos uždavinio sprendimo sudėtingumu, 2. ElGamalio – klasikinė viešojo rakto pasirašymo arba šifravimo kriptosistema, kurios saugumas paremtas diskretaus logaritmo problemos sprendimo sudėtingumu, 3. Signcryption – naujos kartos viešojo rakto pasirašymo ir šifravimo kriptosistema, realizuota modifikuotos ElGamalio skaitmeninio parašo schemos pagrindu. Minėtos kriptosistemos apžvelgtos teoriškai, sukurta praktinė jų realizacija ir apžvelgti rezultatai bei palygintas jų efektyvumas, kuris apibrėžiamas dviem parametrais: 1. Pranešimo pasirašymo, šifravimo, dešifravimo ir parašo patikrinimo operacijų trukmė, 2. Perduodamos perteklinės informacijos kiekis – pranešimo ilgio padidėjimas atlikus pasirašymo ir šifravimo operacijas. Taip pat apžvelgtos kriptosistemų realizacijoje naudotos papildomos funkcijos bei algoritmai, tokie kaip AES blokiniai šifrai, SHA maišos funkcijų šeima, HMAC kontrolinis parašas bei pasiūlyti du... [toliau žr. visą tekstą]
This submission called “Efficient encryption and digital signature schemes” consists of three parts. I. In Part I theoretical analysis of popular public key cryptosystems RSA (Rivest, Shamir, Adleman) with security based on the large integer factorization problem and ElGamal with security based on the discrete logarithm problem, along with new cryptographic primitive termed as "signcryption" proposed by Y. Zheng which simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step, and with a cost significantly smaller than that required by "signature followed by encryption" using popular public key cryptosystem composition is done. For the completeness of analysis description of supplemental algorithms and functions such as AES block cipher, SHA hash functions, HMAC keyed hash function is present. II. In Part II the results of the practical implementation done in Python programming language are analyzed. Effectiveness is described by two factors: 1. Total computation time of signing – encryption – decryption – verification operations; 2. Communication overhead – signed and encrypted message length increase compared to the original plaintext. III. In Part III two effective Signcryption implementation algorithms are proposed: secret sharing without threshold and (k, n) threshold schemes. Results of analysis prove Signcryption being secure and extremely effective signature and encryption cryptosystem. It has very low... [to full text]
APA, Harvard, Vancouver, ISO, and other styles
6

Kratochvíl, Martin. "Zabezpečený přenos dat pomocí čarových kódů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-412838.

Full text
Abstract:
The goal of this thesis was to create a system for visual data transmition using bar codes. It focuses mainly on the protection of the system against abuse. A mechanism was designed for the data transmition itself and the various security concepts. The most appropriate bar code for data transmition was selected on the basis of the analysis.
APA, Harvard, Vancouver, ISO, and other styles
7

Balaževič, Lukáš. "Mechanismy zabezpečení OS Android s využitím jazyka Kotlin." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413001.

Full text
Abstract:
Mobilné zariadenia sú v rámci technologickej histórie novinka a pri technológii, ktorá sa vyvíja tak rapídnym tempom a rastom používania je nutné dbať na zabezpečenie. Táto diplomová práca sa zaoberá rozborom bezpečnostných mechanizmov používaných v Android OS a komunikáciou medzi OS Android a vzdialeným serverom. Cieľom je preskúmať tieto mechanizmy a otestovať aké kryptografické metódy a postupy je najvýhodnejšie používať z hľadiska bezpečnosti s ohľadom na efektivitu. Tieto znalosti boli použité pre vytvorenie demonštračného systému, ktorý využíva vybrané zabezpečovacie mechanizmy a kryptografické postupy.
APA, Harvard, Vancouver, ISO, and other styles
8

Beran, Martin. "Elektronická podatelna VUT 2." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-412777.

Full text
Abstract:
This dissertation thesis attends to problems of electronic registry for VUT. It deals with the principal of electronic registry functioning, electronic signature and it compares offer of the commercial registries. It goes in for the proposal and implementation of the electronic registry for VUT. Since the using of the e- registry on all public service Office was legalized the people can avoid long queues and the employees are avoided from the stress before dead lines. By the communication through the electronic registry is very important the electronical signature. It is almost a full-valued and lawful alternative to the physical signature. For its safety and utility this system employes asymmetric codes and hash algorithm. Presently in many states, where the electronical signature is legalized it is used together with standard X 509 which defines the format of certificates, organization and action of certification authorities. The certification autority ensures safe connection of the person and general key for using of the electronical signature.
APA, Harvard, Vancouver, ISO, and other styles
9

Tomaz, Antonio Emerson Barros. "Resgate de autoria em esquemas de assinatura em anel." reponame:Repositório Institucional da UFC, 2014. http://www.repositorio.ufc.br/handle/riufc/10842.

Full text
Abstract:
TOMAZ. A. E. B. Resgate de autoria em esquemas de assinatura em anel. 2014. 67 f. Dissertação (Mestrado em Engenharia de Teleinformática) - Centro de Tecnologia, Universidade Federal do Ceará, Fortaleza, 2014.
Submitted by Marlene Sousa (mmarlene@ufc.br) on 2015-02-27T18:29:04Z No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5)
Approved for entry into archive by Marlene Sousa(mmarlene@ufc.br) on 2015-03-04T16:09:55Z (GMT) No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5)
Made available in DSpace on 2015-03-04T16:09:55Z (GMT). No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5) Previous issue date: 2014-05-23
The proposal presented in this thesis represents an expansion of the original concept of ring signature. A ring signature scheme allows a member of a group to publish a message anonymously, so that each member of the group can be considered the author of the message. The main idea of a ring signature is to guarantee the anonymity of the subscriber also ensure the authenticity of information, showing that the message came from one of the members of that group. This thesis presents a signature scheme based on (RIVEST et al., 2001), where the subscriber can later revoke anonymity presenting secret values that prove that he would only be able to generate such a signature. This property will be referred to here as rescue of authorship. The main difference to the proposal of Rivest et al. (2001) is presented before we even begin signature generation. The values used as input to the trapdoor function are message authentication codes - MACs generated by the HMAC algorithm, an algorithm for message authentication based on hash function collision resistant. This simple modification will allow, in the future, the subscriber to reveal itself as the true author of the message by showing the secret values to generate those MACs.
A proposta apresentada nesta dissertação representa uma expansão do conceito original de assinatura em anel. Um esquema de assinatura em anel permite que um membro de um grupo divulgue uma mensagem anonimamente, de tal forma que cada um dos membros do grupo seja considerado o possível autor da mensagem. A ideia principal de uma assinatura em anel é garantir o anonimato do assinante e ainda garantir a autenticidade da informação, mostrando que a mensagem partiu de um dos membros do referido grupo. Esta dissertação apresenta um esquema de assinatura em anel baseado no esquema de Rivest et al. (2001), em que o assinante pode, mais tarde, revogar seu anonimato apresentando valores secretos que provam que somente ele seria capaz de gerar tal assinatura. Esta propriedade será chamada aqui de resgate de autoria. A principal diferença em relação ao trabalho de Rivest et al. (2001) é apresentada antes mesmo de começar a geração da assinatura. Os valores utilizados como entrada para a função trapdoor serão códigos de autenticação de mensagem - MACs gerados pelo algoritmo HMAC, um algoritmo de autenticação de mensagem baseado em função hash resistente à colisão. Essa modificação simples permitirá que, no futuro, o assinante revele-se como o verdadeiro autor da mensagem apresentando os valores secretos que geraram os MACs.
APA, Harvard, Vancouver, ISO, and other styles
10

Krisell, Martin. "Elliptic Curve Digital Signatures in RSA Hardware." Thesis, Linköpings universitet, Informationskodning, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81084.

Full text
Abstract:
A digital signature is the electronic counterpart to the hand written signature. It can prove the source and integrity of any digital data, and is a tool that is becoming increasingly important as more and more information is handled electronically. Digital signature schemes use a pair of keys. One key is secret and allows the owner to sign some data, and the other is public and allows anyone to verify the signature. Assuming that the keys are large enough, and that a secure scheme is used, it is impossible to find the private key given only the public key. Since a signature is valid for the signed message only, this also means that it is impossible to forge a digital signature. The most well-used scheme for constructing digital signatures today is RSA, which is based on the hard mathematical problem of integer factorization. There are, however, other mathematical problems that are considered even harder, which in practice means that the keys can be made shorter, resulting in a smaller memory footprint and faster computations. One such alternative approach is using elliptic curves. The underlying mathematical problem of elliptic curve cryptography is different to that of RSA, however some structure is shared. The purpose of this thesis was to evaluate the performance of elliptic curves compared to RSA, on a system designed to efficiently perform the operations associated with RSA. The discovered results are that the elliptic curve approach offers some great advantages, even when using RSA hardware, and that these advantages increase significantly if special hardware is used. Some usage cases of digital signatures may, for a few more years, still be in favor of the RSA approach when it comes to speed. For most cases, however, an elliptic curve system is the clear winner, and will likely be dominant within a near future.
En digital signatur är den elektroniska motsvarigheten till en handskriven signatur. Den kan bevisa källa och integritet för valfri data, och är ett verktyg som blir allt viktigare i takt med att mer och mer information hanteras digitalt. Digitala signaturer använder sig av två nycklar. Den ena nyckeln är hemlig och tillåter ägaren att signera data, och den andra är offentlig och tillåter vem som helst att verifiera signaturen. Det är, under förutsättning att nycklarna är tillräck- ligt stora och att det valda systemet är säkert, omöjligt att hitta den hemliga nyckeln utifrån den offentliga. Eftersom en signatur endast är giltig för datan som signerades innebär detta också att det är omöjligt att förfalska en digital signatur. Den mest välanvända konstruktionen för att skapa digitala signaturer idag är RSA, som baseras på det svåra matematiska problemet att faktorisera heltal. Det finns dock andra matematiska problem som anses vara ännu svårare, vilket i praktiken innebär att nycklarna kan göras kortare, vilket i sin tur leder till att mindre minne behövs och att beräkningarna går snabbare. Ett sådant alternativ är att använda elliptiska kurvor. Det underliggande matematiska problemet för kryptering baserad på elliptiska kurvor skiljer sig från det som RSA bygger på, men de har en viss struktur gemensam. Syftet med detta examensarbete var att utvärdera hur elliptiska kurvor presterar jämfört med RSA, på ett system som är designat för att effektivt utföra RSA. De funna resultaten är att metoden med elliptiska kurvor ger stora fördelar, även om man nyttjar hårdvara avsedd för RSA, och att dessa fördelar ökar mångfaldigt om speciell hårdvara används. För några användarfall av digitala signaturer kan, under några år framöver, RSA fortfarande vara fördelaktigt om man bara tittar på hastigheten. För de flesta fall vinner dock elliptiska kurvor, och kommer troligen vara dominant inom kort.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "RSA signature"

1

Schneier, Bruce. Cryptographie appliquée: Protocoles, algorithmes et codes sources en C. 2nd ed. Paris: Vuibert, 2001.

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

Steele, E. J. Lamarck's signature: How retrogenes are changing Darwin's natural selection paradigm. Reading, Mass: Perseus Books, 1998.

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

A, Lindley Robyn, and Blanden Robert V, eds. Lamarck's signature: How retrogenes are changing Darwin's natural selection paradigm. St Leonards, NSW: Allen & Unwin, 1999.

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

Martin, Keith M. Digital Signature Schemes. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788003.003.0007.

Full text
Abstract:
In this chapter, we discuss digital signature schemes. We start by considering the general requirements of a digital signature scheme. We show first that a digital signature scheme could be established using symmetric techniques. We then consider the more conventional use of public-key cryptography to create digital signature schemes. We compare two different approaches to building a digital signature scheme and illustrate how to manifest these using RSA. We then discuss practical issues concerning digital signature schemes, including different aspects of their security. We close by providing a detailed comparison between digital signatures and handwritten signatures which serves to both illustrate the strengths and vulnerabilities of digital signature schemes.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "RSA signature"

1

Vaudenay, Serge. "Deniable RSA Signature." In Cryptography and Security: From Theory to Applications, 132–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28368-0_11.

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

Kaliski, Burt. "RSA Digital Signature Scheme." In Encyclopedia of Cryptography and Security, 1061–64. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_432.

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

Micali, Silvio, and Ronald L. Rivest. "Transitive Signature Schemes." In Topics in Cryptology — CT-RSA 2002, 236–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45760-7_16.

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

Johnson, Robert, David Molnar, Dawn Song, and David Wagner. "Homomorphic Signature Schemes." In Topics in Cryptology — CT-RSA 2002, 244–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45760-7_17.

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

Wang, Guilin, Sihan Qing, Mingsheng Wang, and Zhanfei Zhou. "Threshold Undeniable RSA Signature Scheme." In Information and Communications Security, 221–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45600-7_25.

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

Kang, Bo Gyeong, Je Hong Park, and Sang Geun Hahn. "A Certificate-Based Signature Scheme." In Topics in Cryptology – CT-RSA 2004, 99–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24660-2_8.

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

Canard, Sébastien, and Amandine Jambert. "On Extended Sanitizable Signature Schemes." In Topics in Cryptology - CT-RSA 2010, 179–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11925-5_13.

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

Ferrara, Anna Lisa, Matthew Green, Susan Hohenberger, and Michael Østergaard Pedersen. "Practical Short Signature Batch Verification." In Topics in Cryptology – CT-RSA 2009, 309–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00862-7_21.

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

Abdalla, Michel, Sara Miner, and Chanathip Namprempre. "Forward-Secure Threshold Signature Schemes." In Topics in Cryptology — CT-RSA 2001, 441–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45353-9_32.

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

Katz, Jonathan. "Signature Schemes Based on the (Strong) RSA Assumption." In Digital Signatures, 87–119. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-0-387-27712-7_4.

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

Conference papers on the topic "RSA signature"

1

Ping, Zhao Li, Shu Qi Liang, and Lai Xiao Liang. "RSA Encryption and Digital Signature." In 2011 International Conference on Computational and Information Sciences (ICCIS). IEEE, 2011. http://dx.doi.org/10.1109/iccis.2011.245.

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

Zhao, Wei, Yong Peng, Feng Xie, and Jingjing Wang. "RSA-based Convertible Nominative Signature Scheme." In 2012 International Conference on Computer Science and Service System (CSSS). IEEE, 2012. http://dx.doi.org/10.1109/csss.2012.218.

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

Dejian Fang, Na Wang, and Chenglian Liu. "An enhanced RSA-based partially blind signature." In 2010 International Conference On Computer and Communication Technologies in Agriculture Engineering (CCTAE). IEEE, 2010. http://dx.doi.org/10.1109/cctae.2010.5544900.

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

Hong, Xuan, and Mi Wen. "Further simplified servers assisted threshold RSA signature." In Education (ICCSE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccse.2010.5593694.

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

Dou, Bennian, Hong Zhang, Chungen Xu, and Mu Han. "Identity-Based Sequential Aggregate Signature from RSA." In 2009 Fourth ChinaGrid Annual Conference (ChinaGrid). IEEE, 2009. http://dx.doi.org/10.1109/chinagrid.2009.20.

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

Fu, Chong, and Zhi-Liang Zhu. "An Efficient Implementation of RSA Digital Signature Algorithm." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.2914.

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

Cao, Ying-yu, and Chong Fu. "An Efficient Implementation of RSA Digital Signature Algorithm." In 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA). IEEE, 2008. http://dx.doi.org/10.1109/icicta.2008.398.

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

Chen, Yan-Hua, Cheng-Qing Ye, and Peng Zhang. "Efficient group signature scheme based on RSA cryptosystem." In 2006 International Conference on Computing & Informatics. ICOCI 2006. IEEE, 2006. http://dx.doi.org/10.1109/icoci.2006.5276587.

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

Chang, Ya-Fen, Yen-Cheng Lai, and Mu-Yen Chen. "Further Remarks on Identity-Based RSA Multi-signature." In 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP). IEEE, 2009. http://dx.doi.org/10.1109/iih-msp.2009.137.

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

Ezziri, Salma, and Omar Khadir. "Amelioration of a proxy signature using RSA encryption." In the 2nd International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3320326.3320372.

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

Reports on the topic "RSA signature"

1

Blaze, M., J. Ioannidis, and A. Keromytis. DSA and RSA Key and Signature Encoding for the KeyNote Trust Management System. RFC Editor, March 2000. http://dx.doi.org/10.17487/rfc2792.

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

Sury, O. Use of the SHA-256 Algorithm with RSA, Digital Signature Algorithm (DSA), and Elliptic Curve DSA (ECDSA) in SSHFP Resource Records. RFC Editor, April 2012. http://dx.doi.org/10.17487/rfc6594.

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

Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, June 2021. http://dx.doi.org/10.18235/0003313.

Full text
Abstract:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.
APA, Harvard, Vancouver, ISO, and other styles
4

Liao, Dezhong. RNA Chimeras as a Gene Signature of Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, June 2014. http://dx.doi.org/10.21236/ada612049.

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

Liao, D. J. RNA Chimeras as a Gene Signature of Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, May 2013. http://dx.doi.org/10.21236/ada582144.

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

Weis, B. The Use of RSA/SHA-1 Signatures within Encapsulating Security Payload (ESP) and Authentication Header (AH). RFC Editor, January 2006. http://dx.doi.org/10.17487/rfc4359.

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