Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 3,749 papers for “cryptosystem security”
Luo Yi · 2006
The vulnerabilities in security of the information transmitting through the Internet have brought some negative influence to the development of Electronic-Commerce,which has put the security issue in the Electronic-Commerce to people's attention.After analyzing the security model of Electronic-Commerce,the essay discusses the application of the Cryptosystem in the security model of Electronic-Commerce.
Cited by 0
Daqing Gu, Jinyun Zhang, Qiang Huang et al. · 2004
Time-sensitive mobile commerce is vulnerable to message authentication delays. Significant power consumption incurred by cryptography is another limiting factor of most mobile devices.
Cited by 0
Xiaofei Tong, Jingguo Bi, Yufei Duan et al. · Entropy · 2022
DBTRU was proposed by Thang and Binh in 2015. As a variant of NTRU, the integer polynomial ring is replaced by two binary truncated polynomial rings GF(2)[x]/(xn+1). DBTRU has some advantages over NTRU in terms of security and performance. In this paper, we propose a polynomial-time linear algebra attack against the DBTRU cryptosystem, which can break DBTRU for all recommended parameter choices. The paper shows that the plaintext can be achieved in less than 1 s via the linear algebra attack on a single PC.
Cited by 0Open access
Ashok Kumar Nanda, Lalit Kumar Awasthi · International Journal of Engineering and Technology · 2012
Cited by 3
Chuanming Li, Tzonelih Hwang, Narn-Yih Lee · Informatica · 2007
A generalized group-oriented cryptosystem (GGOC) based on ElGamal cryptosystem was proposed by Yang et al. in 2003. This study shows that if the authorized decryption sets of users are not properly predetermined in Yang et al.'s GGOC, an unauthorized decryption set of users can recover the encrypted message without difficulty. This study also presents an improved protocol to resist such an attack.
Cited by 6Open access
Hung–Min Sun · Electronics Letters · 1999
Recently, a secure broadcasting scheme was proposed which requires fewer broadcasting messages than other existing schemes. It is shown that in order to provide security, the operation of this proposed broadcasting cryptosystem becomes infeasible because a very large amount of information (~271 bits) must be kept by each user, and be sent for each broadcast.
Cited by 8
Abod, Zaid A., Abbas, Mustafa S., Bermani, Ali kadhim · Periodicals of Engineering and Natural Sciences (International University of Sarajevo) · 2020
Cited by 0Open access
2012
The public key cryptosystem RSA is considered to be the first algorithm for public key encryption and decryption method for saving data confidentially over the network. However, several successful attacks are developed to break this algorithm due to certain limitations assumed in its derivation. The algorithm's security is primarily based on the problem of factoring large number. If the process factorization is done then the whole algorithm can become breakable. This paper presents a methodology to change the original modulus (product of two prime numbers). The changed modulus value will be publicly announced which might be the fake value. Even if the hacker factorizes this new modulus value, he can't be searched out the original decryption key (d). Inability to find the original decryption key, the factorization is worthless. This scheme helps to overcome the weaknesses of factorization found in RSA.
Cited by 1
Ashwani Kumar Yadav, Aakash Chauhan, R.C. Mittal et al. · 2025
Multimodal biometric systems offer several benefits over unimodal systems, including broader population coverage, enhanced recognition accuracy, and reduced error rates. However, multimodal systems must preserve biometric data’s integrity, security, and privacy since they include more than one biometric attribute linked to each user. This paper uses optical encryption to present an efficient framework for securing multimodal biometrics such as fingerprints, face, and iris scans. In the proposed scheme, we integrate the discrete wavelet transform (DWT) and the phase truncated Fourier transform (PTFT) to increase security and maintain the privacy of multimodal biometrics throughout the process. The involvement of the DWT allows fusion analysis to combine multimodal biometrics, and the PTFT process offers an optical encryption strategy. This approach enhances the security of multimodal biometric modality by ensuring high robustness against unauthorized attempts and attacks. Computer simulation shows the feasibility and efficacy of the idea.
Cited by 0
Étienne Burle, Hervé Talé Kalachi, Freddy Lende Metouke et al. · arXiv (Cornell University) · 2024
The LG cryptosystem is a public-key encryption scheme in the rank metric using the recent family of $\lambdav-$Gabidulin codes and introduced in 2019 by Lau and Tan. In this paper, we present a cryptanalysis showing that the security of several parameters of the scheme have been overestimated. We also show the existence of some weak keys allowing an attacker to find in polynomial time an alternative private key.
Cited by 0Open access
玄次 西岡 · Medical Entomology and Zoology · 2012
Cited by 0
Zaid A. Abod, Mustafa S. Abbas, Ali Kadhim Bermani · Periodicals of Engineering and Natural Sciences (PEN) · 2025
This work presents and describes a novel method to hide messages in images in a hybrid manner, assteganography is combined with quantum cryptography. Through stimulating and implementing thishybrid approach, the least significant bit (LSB) substitution is employed for hiding secret messages withincover images that consist of three bands (Red, Green and Blue), after which the output is encrypted usingquantum one-time pad encryption. The models are illustrated explicitly and tested. In addition, the testanalysis uses a steganalysis tool called StegExpose to detect LSB steganography in images. Theexperimental results proved that the image hiding is reliably secure and undetectable, and hence theproposed new hybrid model provides a sufficient security level as well as we have tested the proposedsystem using robust state-of- the-art steganalysis techniques and found the low payload thresholdmaintained in the proposed system produces a high margin of communication security safety. No payloadfiles were detected (0% detections), despite each file containing the entire content of the information asembedded text.
Cited by 0Open access
Rakesh Kumar, Allu Swamy Naidu, Ajeet Singh et al. · International Journal of Computing Science and Mathematics · 2020
While symmetric key cryptosystems utilise single private key at both ends for encryption and decryption purposes and this mentioned scenario gives advantages of better speed-up as compare to public key cryptosystems. Still, security is a challenge while performing compatibly efficient key distribution and secure private data transfer among entities in an untrusted environment. McEliece cryptosystem, designed in 1978, is a public key based cryptosystem whose security is based on some unknown natured error-correcting codes. This paper gives state-of-the-art detailed overview on this cryptosystem, its component-wise algorithmic description and implementation. Various attacks on McEliece cryptosystem are discussed separately. The experimental results employing Goppa codes are also presented in the paper where the simulations are performed on various extension degrees. Based on the simulations performed, we concluded the results along with the various issues faced while implementation.
Cited by 10
Étienne Burle, Hervé Talé Kalachi, Freddy Lende Metouke et al. · Applicable Algebra in Engineering Communication and Computing · 2024
Cited by 0
Christian Tobias · Lecture notes in computer science · 2002
Cited by 10Open access
Gireesh Pandey, Indivar Gupta · Cryptologia · 2025
Cited by 0
Appala Naidu Tentu, Ajeet Singh, Rakesh Kumar et al. · International Journal of Computing Science and Mathematics · 2020
While symmetric key cryptosystems utilise single private key at both ends for encryption and decryption purposes and this mentioned scenario gives advantages of better speed-up as compare to public key cryptosystems. Still, security is a challenge while performing compatibly efficient key distribution and secure private data transfer among entities in an untrusted environment. McEliece cryptosystem, designed in 1978, is a public key based cryptosystem whose security is based on some unknown natured error-correcting codes. This paper gives state-of-the-art detailed overview on this cryptosystem, its component-wise algorithmic description and implementation. Various attacks on McEliece cryptosystem are discussed separately. The experimental results employing Goppa codes are also presented in the paper where the simulations are performed on various extension degrees. Based on the simulations performed, we concluded the results along with the various issues faced while implementation.
Cited by 1
Kenji Koyama · Electronics Letters · 1986
The security of the Okamoto public-key cryptosystem is analysed. If some secret keys of this system are chosen inadequately, the known-plaintext attack is applicable to obtain all secret keys. To prevent the proposed cryptanalysis, the necessary condition for the secret keys is shown.
Cited by 1
Sayandeep Sen, Shahed Hossain, Khandaker Mashrukul Islam et al. · 2003
This paper reports a cryptosystem designed for security of embedded systems. It is based on the theory of Cellular Automata (CA). The Cellular Automata based Cryptosystem (CAC) employs a series of transforms - simple, moderately complex, complex - all generated with different classes of CA. The code size of CAC can be found to be less than that of any other scheme published in the literature. Cryptanalysis of the proposed scheme is reported along with similar analysis for two popular systems - DES and AES. Experimental results confirm that the security of the system is significantly better than DES and comparable to that of AES. Hardware-software co-design of CAC with a simple CA hardware is also reported to establish the efficiency in terms of small code size and high speed of execution.
Cited by 8
Kunikatsu Kobayashi, Masaki Kimura · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 1997
Cited by 1