Remote Digital Signing for Mobile Commerce

2011 ◽  
pp. 263-284 ◽  
Author(s):  
Oguz Kaan Onbilger ◽  
Randy Chow ◽  
Richard Newman
Keyword(s):  
Mobile Commerce ◽  
Public Key ◽  
Battery Life ◽  
Secret Key ◽  
Agent Model ◽  
Public Key Cryptosystems ◽  
Disconnected Operation ◽  
Multi Agent ◽  
Physical Limitations ◽  
Contract Signing

Mobile agents (MAs) are a promising technology which directly address physical limitations of mobile devices such as limited battery life, intermittent and low-bandwidth connections, with their capability of providing disconnected operation. This chapter addresses the problem of digital contract signing with MAs, which is an important part of any mobile commerce activity and one special challenging case of computing with secrets remotely in public. The authors use a multi-agent model together with simple secret splitting schemes for signing with shares of a secret key carried by MAs, cooperating to accomplish a trading task. In addition to known key splitting techniques of RSA, authors introduce similar techniques for El Gamal and DSS public key cryptosystems. The objective is to achieve a simple and ubiquitous solution by using the well-known public-key cryptosystem implementations, which conform to the established standards.

scholarly journals Design of a Modular Multiplier for Public-Key Cryptography Applications Using Residue Number System and Signed-Digit Representation

2020 ◽  
Author(s):  
Mohammad Hizzani
Keyword(s):  
Public Key Cryptography ◽  
Number System ◽  
Residue Number System ◽  
Public Key ◽  
Modular Multiplication ◽  
Secret Key ◽  
Public Key Cryptosystems ◽  
Number Systems ◽  
Wide Range ◽  
Residue Number

Public-Key Cryptosystems are prone to wide range of cryptanalyses due to its property of having key pairs one of them is public. Therefore, the recommended length of these keys is extremely large (e.g. in RSA and D-H the key is at least 2048 bits long) and this leads the computation of such cryptosystems to be slower than the secret-key cryptosystems (i.e. AES and AES-family). Since, the key operation in such systems is the modular multiplication; in this research a novel design for the modular multiplication based on the Montgomery Multiplication, the Residue Number Systems for moduli of any form, and the Signed-Digit Representation is proposed. The proposed design outperforms the current designs in the literature in terms of delay with at least 28% faster for the key of 2048 bits long. Up to our knowledge, this design is the first design that utilizes Signed-Digit Representation with the Residue Number System for moduli of any form.

scholarly journals Hyper Elliptical Curve Cryptography (Hecc) For Cloud

2019 ◽  
Vol 8 (4) ◽  
pp. 11771-11776
Keyword(s):  
Elliptic Curve ◽  
Public Key ◽  
Secret Key ◽  
Public Key Cryptosystems ◽  
Cryptographic Algorithm ◽  
Hash Algorithm ◽  
Cryptographic Algorithms ◽  
User Friendly ◽  
Hashing Algorithm ◽  
Hyper Elliptic Curve

This system provides an insight into developing a distributed system which is secure, robust and user friendly. This thesis suggests a design and implementation of a digital envelope that combines the hashing algorithm of MD5, the symmetric key algorithm of AES and the asymmetric key algorithm of Hyper Elliptic Curve. A hybrid algorithm is designed, combining the best of both AES and ECC over GF(p) cryptography. The MD5 hash algorithm is adopted to ensure integrity of the data. Cryptography (HECC). This paper discusses securing the data in clouds through implementing the key for encryption and decryption using hyper elliptical curve cryptography. The focus is on Advanced Encryption Standard (AES), the most commonly used secret key cryptographic algorithm, and Hyper Elliptic Curve Cryptography (HECC), public key cryptographic algorithms which have gained popularity in the recent years and are replacing traditional public key cryptosystems, such as RSA and ECC. Such techniques are necessary in order to use high security cryptographic algorithms in real world applications.

Research on multi-agent model based on track methodology of ontology building

2009 ◽  
Vol 29 (2) ◽  
pp. 412-415
Author(s):  
Qiang LU ◽  
Ming CHEN ◽  
Zhi-guang WANG
Keyword(s):  
Agent Model ◽  
Model Based ◽  
Multi Agent ◽  
Ontology Building

Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

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.

scholarly journals Group ring based public key cryptosystems

2021 ◽  
pp. 1-22
Author(s):  
Gaurav Mittal ◽  
Sunil Kumar ◽  
Shiv Narain ◽  
Sandeep Kumar
Keyword(s):  
Group Ring ◽  
Public Key ◽  
Public Key Cryptosystems

scholarly journals A Novel Multi-Agent Model for Robustness with Component Failure and Malware Propagation in Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4873
Author(s):  
Biao Xu ◽  
Minyan Lu ◽  
Hong Zhang ◽  
Cong Pan
Keyword(s):  
Wireless Sensor ◽  
Component Reliability ◽  
Agent Based ◽  
Agent Model ◽  
Cross Domain ◽  
Malware Propagation ◽  
Network Topologies ◽  
Multi Agent ◽  
Agent Characteristics ◽  
Information Domain

A wireless sensor network (WSN) is a group of sensors connected with a wireless communications infrastructure designed to monitor and send collected data to the primary server. The WSN is the cornerstone of the Internet of Things (IoT) and Industry 4.0. Robustness is an essential characteristic of WSN that enables reliable functionalities to end customers. However, existing approaches primarily focus on component reliability and malware propagation, while the robustness and security of cascading failures between the physical domain and the information domain are usually ignored. This paper proposes a cross-domain agent-based model to analyze the connectivity robustness of a system in the malware propagation process. The agent characteristics and transition rules are also described in detail. To verify the practicality of the model, three scenarios based on different network topologies are proposed. Finally, the robustness of the scenarios and the topologies are discussed.

ENCRYPTION-DECRYPTION TECHNIQUES FOR PICTURES

1989 ◽  
Vol 03 (03n04) ◽  
pp. 497-503
Author(s):  
RANI SIROMONEY ◽  
K. G. SUBRAMANIAN ◽  
P. J. ABISHA
Keyword(s):  
Public Key ◽  
Two Dimensional ◽  
Chain Code ◽  
Dimensional Array ◽  
Public Key Cryptosystems ◽  
Encryption Decryption ◽  
A Chain

Language theoretic public key cryptosystems for strings and pictures are discussed. Two methods of constructing public key cryptosystems for the safe transmission or storage of chain code pictures are presented; the first one encrypts a chain code picture as a string and the second one as a two-dimensional array.

Sign in / Sign up

Export Citation Format

Share Document