A method for obtaining digital signatures and public-key cryptosystems

Rivest, Ronald L.; Shamir, Adi; Adleman, Leonard M.

doi:10.1145/357980.358017

Cited by 3,814 publications

(451 citation statements)

References 12 publications

Supporting

Mentioning

439

Contrasting

Unclassified

Order By: Relevance

“…This will increase the number of computations which in turn increases power consumption. The most widely known example of such a cryptosystem is RSA [36].…”

Section: Hardware Requirements Analysismentioning

confidence: 99%

“…This will increase the number of computations which in turn increases power consumption. The most widely known example of such a cryptosystem is RSA [36].In the case of larger IMDs, we can assume them to have their own power source designed to last for significant amount of time, up to several years. This gives the possibility of using more robust protocols for increased security.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Specification Analysis for Secure RFID Implant Systems

Moosavi¹,

Hakkala²,

Isoaho³

et al. 2014

IJTEF

View full text Add to dashboard Cite

Abstract-In this paper we derive an engineering specification for functionality, security, and implementation demands for RFID Implantable Medical Devices (IMD) requiring medical data storage and wireless communication. We illustrate the specification by sketching a secure communication protocol for RFID IMDs. The specification follows from our requirements analysis of application characteristics, legal restrictions, security requirements and ethical concerns of IMDs. In our analysis we have recognized three main types of IMD applications: identification, financial and medical/emergency. The hardware implementation constraints and security level requirements of IMD systems differ from mainstream applications of RFID. The presented specification that considers the special operating environment, delicate use cases and safety-critical functionality of IMD systems is aimed to be a conceptual platform for designing robust security schemes and long-term functional and physical reliability.Index Terms-RFID implant systems, security and privacy, hardware limitations, ethical concerns, lightweight cryptography. I. INTRODUCTIONThe developments of mobile and wireless technologies have set the infrastructure for the communication systems universally. Radio Frequency Identification (RFID), one of the recent new wireless technologies, can be used to identify items tagged with an RFID tag. The identification process of RFID is executed by three major modules: an RFID tag, an RFID reader, and a back-end database system. An RFID tag communicates with an RFID reader wirelessly to identify it. The information required to complete the identification process is provided by the back-end database system, which the readers access through the Internet.Currently RFID technology is deployed in widespread applications, such as electronic passports, asset tracking, toll payments, and entrance access control. RFID tags have for some time been used for identifying animals, and analogous solutions for humans are emerging.RFID enabled implants are medical devices implanted into a human body through a surgical procedure. One of the prominent implant brands is Positive ID (formerly VeriChip). It was approved by the U.S. Food and Drug Administration (FDA) read from a distance of up to 10-15 cm. Other essential data associated to the owner of the tag is kept in a centralized database. VeriMed, the commercial application of VeriChip RFID implants, is designed to be used for patient identification in healthcare.Like all wireless applications and devices, also RFID is vulnerable to interception or eavesdropping by unauthorized parties. This quite justifiably raises privacy and security concerns. If no countermeasures are in place, it is possible to read some or even all information on an RFID tag without consent, and subsequently acquire relevant information on the item bearing the tag. It is also possible to track an individual tag if its ID is known. Once a tag has been read by an attacker, if the same tag ID is identified later, it is very likel...

show abstract

“…This will increase the number of computations which in turn increases power consumption. The most widely known example of such a cryptosystem is RSA [36].…”

Section: Hardware Requirements Analysismentioning

confidence: 99%

mentioning

confidence: 99%

Specification Analysis for Secure RFID Implant Systems

Moosavi¹,

Hakkala²,

Isoaho³

et al. 2014

IJTEF

View full text Add to dashboard Cite

show abstract

“…Elliptic Curve Cryptosystem (ECC), which was originally proposed by Niel Koblitz andVictor Miller in 1985 (Koblitz, 1987;Miller, 1986), is seen as a serious alternative to RSA (Rivest et al, 1978) with much shorter key size. ECC with key size of 128-256 bits is shown to offer equal security to that of RSA with key size of 1-2K bits.…”

Section: Elliptic Curve Cryptosystemsmentioning

confidence: 99%

“…ECCs have gained popularity for cryptographic applications because of the short key compared with earlier public key cryptosystems such as RSA (Rivest et al, 1978) and ElGamal (ElGamal, 1985 …”

Section: Elliptic Curve Cryptosystemsmentioning

confidence: 99%

Hardware/Software Co-Design Implementations of Elliptic Curve Cryptosystems

Al-Somani¹,

Khan²,

Qamar-ul-I³

et al. 2009

Information Technology J.

View full text Add to dashboard Cite

This paper presents a survey of hardware/software co-design implementations of elliptic curve cryptosystems. A critical study of the underlying finite field, the representation basis, and the partitioning schemes of these implementations is conducted. The study shows that all implementations are implemented over binary fields GF(2 m ) and the implementations that use polynomial basis are more than implementations that use normal basis for finite field arithmetic. The study also shows that the best partitioning scheme, among the surveyed implementations, 2 implements the finite field arithmetic on hardware and the remaining operations of the Elliptic Curve Cryptosystem (ECC) on software.

show abstract

“…An algorithm described by Ronald Rivest, Adi Shamir and Leonard Adleman or commonly known as RSA [9] is the pioneer in brand-new asymmetric-key cryptography, used mainly to consolidate key-agreement protocol. Together with lengthy secret key, the former utilizes substitutionpermutation network which creates confusion and diffusion for secure cryptography, whereas the later makes use of infeasibility to factor large numbers in retrieving key via classical computer for the same purpose [10].…”

Section: Introductionmentioning

confidence: 99%

A Novel Error Correction Scheme In Quantum Key Distribution (Qkd) Protocol

Lee

Mokhtar

2017

MJCS

View full text Add to dashboard Cite

Ideally, in any quantum key distribution (QKD) Keywords: Hamming code, error correction, QKD, reconciliation protocol. INTRODUCTIONConfidentiality, integrity, authentication and non-repudiation are four significant criteria specified to ensure secrecy in communication between legitimate parties nowadays [1 -6]. In order to achieve these requirements, several measures based on cryptography have long since been practiced. Previously confidentiality is secured via encryption by transforming ordinary message into scrambled text prior to dissemination, thus concealing information in the message. Meanwhile, one-way cryptographic hash function was exploited to corroborate the correctness of a received message without undue amendment in transit, thus contributing towards the verification of message integrity. Surpassing the hash function, the utilization of message authentication code allows authentication to justify user identity besides safeguarding message's integrity. Lastly, digital signature is utilized to address nonrepudiation, deterring refutability of forgeable actions like financial transaction consummated via electronic payment [1].The Advanced Encryption Standard (AES) [7,8] is a symmetric-key cryptography which has been adopted worldwide today to protect classified information. An algorithm described by Ronald Rivest, Adi Shamir and Leonard Adleman or commonly known as RSA [9] is the pioneer in brand-new asymmetric-key cryptography, used mainly to consolidate key-agreement protocol. Together with lengthy secret key, the former utilizes substitutionpermutation network which creates confusion and diffusion for secure cryptography, whereas the later makes use of infeasibility to factor large numbers in retrieving key via classical computer for the same purpose [10].

show abstract

A method for obtaining digital signatures and public-key cryptosystems

Cited by 3,814 publications

References 12 publications

Specification Analysis for Secure RFID Implant Systems

Specification Analysis for Secure RFID Implant Systems

Hardware/Software Co-Design Implementations of Elliptic Curve Cryptosystems

A Novel Error Correction Scheme In Quantum Key Distribution (Qkd) Protocol

Contact Info

Product

Resources

About