One-Way Function Construction Based on the MQ Problem and Logic Function

2012 ◽  
Vol 220-223 ◽  
pp. 2360-2363
Author(s):  
Yan Jun Sun ◽  
Chang Ming Liu ◽  
Hai Yu Li ◽  
Zhe Yuan
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Logic Function ◽  
The Public ◽  
Relative Safety ◽  
Core Function ◽  
Long Time ◽  
New Type ◽  
One Way Function

Multivariate quadratic based public-key cryptography called MQ problem which based on calculation of a secure cryptography of multivariate equations and MQ cryptography security is based on the difficulty of the solution of multivariate equations. But computer and mathematician scientists put a lot of effort and a long time to research MQ cryptography and they have proved that MQ cryptography is NP complete problem. Therefore, before the P problem Equal to the NP problem we do not figure out selected multivariate equations by random in polynomial time. So we can use this feature to construct the relative safety method of the public key encryption. A new type of public-key cryptosystem has been brought up in this paper that one-way shell core function which has such advantages as more security and flexibility, and provides a more inclusive public-key cryptosystem.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

scholarly journals PKCHD: Towards A Probabilistic Knapsack Public-Key Cryptosystem with High Density

Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 75 ◽  
Author(s):  
Yuan Ping ◽  
Baocang Wang ◽  
Shengli Tian ◽  
Jingxian Zhou ◽  
Hui Ma
Keyword(s):  
Chinese Remainder Theorem ◽  
Success Probability ◽  
High Density ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
The Public ◽  
Attack Model ◽  
Simultaneous Diophantine Approximation ◽  
Subset Sum ◽  
Linearization Attack

By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit attacker has to solve at least two hard number-theoretic problems, namely integer factorization and simultaneous Diophantine approximation problems. In PKCHD, the encryption function is nonlinear about the message vector. Under the re-linearization attack model, PKCHD obtains a high density and is secure against the low-density subset sum attacks, and the success probability for an attacker to recover the message vector with a single call to a lattice oracle is negligible. The infeasibilities of other attacks on the proposed PKCHD are also investigated. Meanwhile, it can use the hardest knapsack vector as the public key if its density evaluates the hardness of a knapsack instance. Furthermore, PKCHD only performs quadratic bit operations which confirms the efficiency of encrypting a message and deciphering a given cipher-text.

scholarly journals Design and development of a secure certificateless proxy signature based (SE-CLPS) encryption scheme for cloud storage

2021 ◽  
Vol 10 (1) ◽  
pp. 57
Author(s):  
Ms. K. Sudharani ◽  
Dr. N. K. Sakthivel
Keyword(s):  
Computational Cost ◽  
Public Key Cryptography ◽  
True Positive Rate ◽  
Proxy Signature ◽  
Attack Detection ◽  
Third Party ◽  
Public Key ◽  
Secret Key ◽  
True Negative ◽  
The Public

Certificateless Public Key Cryptography (CL-PKC) scheme is a new standard that combines Identity (ID)-based cryptography and tradi- tional PKC. It yields better security than the ID-based cryptography scheme without requiring digital certificates. In the CL-PKC scheme, as the Key Generation Center (KGC) generates a public key using a partial secret key, the need for authenticating the public key by a trusted third party is avoided. Due to the lack of authentication, the public key associated with the private key of a user may be replaced by anyone. Therefore, the ciphertext cannot be decrypted accurately. To mitigate this issue, an Enhanced Certificateless Proxy Signature (E-CLPS) is proposed to offer high security guarantee and requires minimum computational cost. In this work, the Hackman tool is used for detecting the dictionary attacks in the cloud. From the experimental analysis, it is observed that the proposed E-CLPS scheme yields better Attack Detection Rate, True Positive Rate, True Negative Rate and Minimum False Positives and False Negatives than the existing schemes.   

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

Multimedia Transcoding in Wireless and Mobile Networks

2011 ◽  
pp. 281-306
Author(s):  
Shadi R. Masadeh ◽  
Walid K. Salameh
Keyword(s):  
Mobile Networks ◽  
Data Exchange ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public And Private ◽  
The Public ◽  
Private Key ◽  
Communications Systems ◽  
Free Air ◽  
Intended Receiver

This chapter presents a keyless self-encrypting/decrypting system to be used in various communications systems. In the world of vast communications systems, data flow through various kinds of media, including free air. Thus the information transmitted is free to anyone who can peer it, which means that there should be a guarding mechanism so the information is transmitted securely over the medium from the sender to the intended receiver, who is supposed to get it in the first place and deter the others from getting the information sent. Many encryption systems have been devised for this purpose, but most of them are built around Public Key Infrastructure (PKI) wherein public key cryptography, a public and private key, is created simultaneously using the same algorithm (a popular one is known as RSA) by a certificate authority (CA). The private key is given only to the requesting party, and the public key is made publicly available (as part of a digital certificate) in a directory that all parties can access. The private key is never shared with anyone or sent across the medium. All of the commonly used encryption systems exchange keys that need to be generated using complex mathematical operations that take noticeable time, which is sometimes done once, and exchanged openly over unsecured medium. We are proposing an expandable keyless self-encrypting/decrypting system, which does not require the use of keys in order o minimize the chances of breaching data exchange security and enhance the data security of everyday communications devices that are otherwise insecured.

Improved Methodology to Detect Advanced Persistent Threat Attacks

2020 ◽  
pp. 184-202
Author(s):  
Ambika N.
Keyword(s):  
Intellectual Property ◽  
Public Key Cryptography ◽  
Public Key ◽  
Sleep Mode ◽  
Data Reliability ◽  
Advanced Persistent Threat ◽  
Hash Code ◽  
Long Time

Cybersecurity is essentials in today's era. An increase in cyberattacks has driven caution to safeguard data. An advanced persistent attack is an attack where the intellectual property of an organization is attempted to be misused. The attacker stays on the network for a long-time intruding into confidential files. The attacker switches into sleep mode, masking himself. Hence, the attacker is quite difficult to trace. The proposed work is suggested to tackle the problem. Public key cryptography is used to encrypt the data. The hash code is affixed to the transmitted message to provide reliability to the transmitted data. The work proves to be 4.9% stronger in authenticating the received packets, provides 4.42% greater data reliability, and decreases the load of the server by 43.5% compared to work.

Network Safety On Blockchain-Based Applications Across Multiple Domains

2020 ◽  
pp. 619-623
Keyword(s):  
Public Key Cryptography ◽  
Cutting Edge ◽  
Public Key ◽  
Parking Spot ◽  
Personally Identifiable Information ◽  
Long Time ◽  
Web Social ◽  
Multiple Domains ◽  
Early Phases ◽  
Social Affairs

The associate surveyed making that endeavors to use blockchain for cutting edge veritable assessment of the most unimaginable constantly followed blockchain disclosure programs. Our exposures as do affiliations and structure affirmation, public-key cryptography, web social affairs, affirmation plans, and the stunning amassing of Personally Identifiable Information (PII). This sensationally organized purposeful assessment in like manner reveals understanding into future headings of studies, preparing, and rehearses in the blockchain and alliance protection space, for example, thriving of blockchain in IoT, the security of blockchain for AI authentic elements, and sidechain consistence. Blockchain has (dependably) end up being one of the most routinely intimated systems for guaranteeing about data parking spot and switch through decentralized, trustless, circumnavigated structures. The vital watchword looks through the presentation that there is a tremendous degree of papers identified with blockchain. The advances of blockchain and truly assigned decentralized structures have best been progressed for a long time and are totally still in their early phases.

ARCN: Authenticated Routing on Cloud Network to Mitigate Insider Attacks on Infrastructure as a Service

2019 ◽  
Vol 16 (9) ◽  
pp. 3945-3954
Author(s):  
Priya Oberoi ◽  
Sumit Mittal ◽  
Rajneesh Kumar Gujral
Keyword(s):  
Research Work ◽  
Public Key Cryptography ◽  
Public Key ◽  
The Internet ◽  
Security Attacks ◽  
Infrastructure As A Service ◽  
Security Vulnerabilities ◽  
The Public ◽  
Prime Concern ◽  
Cloud Network

Cloud security is one of the major issues which are affecting the acceptance of Cloud computing (CC). In spite of the number of benefits offered by CC, it also suffers from a myriad of security vulnerabilities. Security is the prime concern while we are accessing the resources from the Cloud through the Internet. This research work is primarily on IAAS (Infrastructure as a service). Here a protocol called Authenticated Routing on Cloud Network (ARCN) has been proposed, to secure the communication route between the client and service provider. The proposed protocol ARCN uses the public key cryptography to mitigate the various security attacks like malicious insider attacks, Spoofing, Falsified routes, DoS, etc.

scholarly journals Preimage Selective Trapdoor Function: How to Repair an Easy Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-18
Author(s):  
Baocang Wang
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Constructive Method ◽  
Key Recovery ◽  
Public Key Cryptosystems ◽  
Cryptographic Primitive ◽  
The One ◽  
Trapdoor Function ◽  
One Way Function ◽  
Encryption Function

Public key cryptosystems are constructed by embedding a trapdoor into a one-way function. So, the one-wayness and the trapdoorness are vital to public key cryptography. In this paper, we propose a novel public key cryptographic primitive called preimage selective trapdoor function. This scenario allows to use exponentially many preimage to hide a plaintext even if the underlying function is not one-way. The compact knapsack problem is used to construct a probabilistic public key cryptosystem, the underlying encryption function of which is proven to be preimage selective trapdoor one-way functions under some linearization attack models. The constructive method can guarantee the noninjectivity of the underlying encryption function and the unique decipherability for ciphertexts simultaneously. It is heuristically argued that the security of the proposal cannot be compromised by a polynomial-time adversary even if the compact knapsack is easy to solve. We failed to provide any provable security results about the proposal; however, heuristic illustrations show that the proposal is secure against some known attacks including brute force attacks, linearization attacks, and key-recovery attacks. The proposal turns out to have acceptable key sizes and performs efficiently and hence is practical.

Sign in / Sign up

Export Citation Format

Share Document