Public Key Cryptosystem Research Papers (original) (raw)

• Top Papers

• Most Cited Papers

• Most Downloaded Papers

• Newest Papers

• People

• • by
  • •
  • Internet Security, Performance Analysis, Power Consumption, Performance Improvement
• • by Jeffrey Lagarias
  • •
  • Integer Program, Public Key Cryptosystem

E-commerce has presented a new way of doing transactions all over the world using internet. The success of ecommerce depends greatly on how its information technology is used. Over the years the rate at which ecommerce sensitive... more

E-commerce has presented a new way of doing transactions all over the world using internet. The success of ecommerce depends greatly on how its information technology is used. Over the years the rate at which ecommerce sensitive information is sent over the internet and network has increased drastically. It is for this reason that every company wants to ensure that its ecommerce information is secured. There is need for ecommerce information transmitted via the internet and computer networks to be protected. There is substantial growth in the areas of credit card fraud and identity theft because the internet is a public network with thousands of millions of users. Amongst users are crackers or hackers that carry out the credit card fraud and identity theft in numerous ways facilitated by poor internet security; a concern regarding the exchange of money securely and conveniently over the internet increases. The criticality, danger, and higher priority importance of any e-commerce money transfer makes it a hot area of research interest in modern computer science and informatics. E-commerce industry is slowly addressing security issues on their internal networks but security protection for the consumers is still in its infancy, thus posing a barrier to the development of e-commerce. There is a growing need for technological solutions to globally secure ecommerce transaction information by using appropriate data security technology. The technology solution proposed for solving this security problem is the RSA cryptosystem. This research paper focuses on securing ecommerce information sent through the computer network and internet using RSA cryptography. It elucidates the implementation of RSA algorithm and shows that ecommerce security powered with RSA cryptography is very important in ecommerce transaction. While many attacks exist, the system has proven to be very secure.

• • by IJIRIS Journal Division and +1
  • •
  • Implementation of RSA Cryptosystem Using Verilog, E-commerce Security, Computer Security , Information Security , E Commerce, E-Commerce Security Techniques

This report presents a brief survey on secret key and public key cryptography algorithms. These include: block ciphers, stream ci- phers, RSA, ElGamal and Elliptic Curve Cryptosystems (ECC). Since ECC achieved security levels comparable... more

This report presents a brief survey on secret key and public key cryptography algorithms. These include: block ciphers, stream ci- phers, RSA, ElGamal and Elliptic Curve Cryptosystems (ECC). Since ECC achieved security levels comparable to those of traditional public key cryptosystems using smaller keys (160 bits), this work focus more on ECC. Finally, this work also presents a survey on

• • by Turki al-Somani
  • •
  • Literature Review, Public key cryptography, High performance, Block Cipher
• • by Jean-jacques Quisquater
  • •
  • Computer Software, Public key cryptography, High Speed, Very high throughput

Security has become one of the key features of data transmission on large database. RDBMS are used for storage purposes but with applications generating enormous amount of data, RDBMS is no longer efficient because RDBMS doesn't support... more

Security has become one of the key features of data transmission on large database. RDBMS are used for storage purposes but with applications generating enormous amount of data, RDBMS is no longer efficient because RDBMS doesn't support quick data access and computations as it do not support processing of data in distributed manner. NoSQL databases are nowadays popular in handling the unstructured data that are available as open source databases such as MongoDB, Cassandra, etc. This paper make a detailed study on the encryption techniques of NoSQL databases especially MongoDB which becomes popular in data management. Since encryption features are not applied on handling the data in MongoDB, In this paper, security for users data is provided by using additive homomorphic asymmetric cryptosystem which encrypts the users data in MongoDB(CryptMDB) and achieve strong user's data privacy protection. This also supports the database operations over the encrypted data.

• • by IJIRAE - International Journal of Innovative Research in Advanced Engineering
  • •
  • Databases, NoSQL, RDBMS, Database Design

We have designed a new class of public key algorithms based on quasigroup string trans- formations using a speciflc class of quasigroups called multivariate quadratic quasigroups (MQQ). Our public key algorithm is a bijective mapping, it... more

We have designed a new class of public key algorithms based on quasigroup string trans- formations using a speciflc class of quasigroups called multivariate quadratic quasigroups (MQQ). Our public key algorithm is a bijective mapping, it does not perform message expansions and can be used both for encryption and signatures. The public key consist of n quadratic polynomials with n variables where n = 140;160;:::. A particular characteristic of our public key algorithm is that it is very fast and highly parallelizable. More concretely, it has the speed of a typical modern symmetric block cipher { the reason for the phrase "A Public Key Block Cipher" in the title of this paper. Namely the reference C code for the 160{bit variant of the algorithm performs decryption in less than 11,000 cycles (on Intel Core 2 Duo { using only one processor core), and around 6,000 cycles using two CPU cores and OpenMP 2.0 library. However, implemented in Xilinx Virtex-5 FPGA that is running on ...

• • by Svein Knapskog
  • •
  • Block Cipher, Public Key Cryptosystem

In this paper we propose an ecient multivariate public key cryptosystem based on per- mutation p-polynomials over finite fields. We first characterize a class of permutation p- polynomials over finite fields Fqm and then construct a... more

In this paper we propose an ecient multivariate public key cryptosystem based on per- mutation p-polynomials over finite fields. We first characterize a class of permutation p- polynomials over finite fields Fqm and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is O(m3) multiplication which is equivalent to other multivariate public key cryptosystems. However the decryption is much faster than other multivariate public key cryptosystems. In decryption we need O(m2) left cyclic shifts and O(m2) xor operations.

• • by Rajesh Singh
  • •
  • Public key cryptography, Finite Field, Public Key Cryptosystem
• • by Jean-jacques Quisquater
  • •
  • Computer Software, Public key cryptography, High Speed, Very high throughput
• • by Nabil Ismail
  • •
  • Computer Architecture, Digital Signature, Software Architecture, Encryption
• • by Benjamin Fine
  • •
  • Number Theory, Applied Mathematics, Group Theory, Diffie-Hellman-DSA
• • by Shehzad Ashraf
  • •
  • Digital Signature, Resource Allocation, Public key cryptography, Authorisation

In current scenario everything is being transferred on the web and other communication medium. So that we need to make our data secure from all other attacker and unauthorized person. So that we have to give lot of protection to the... more

In current scenario everything is being transferred on the web and other communication medium. So that we need to make our data secure from all other attacker and unauthorized person. So that we have to give lot of protection to the transmitting data. For that we have lots of cryptography algorithm .But all of then do not provide level best protection in today‟s world as there are lots of ways to make that algorithm cracked and the cryptanalyst can retrieve the plain text so easily. So that with reference to the RSA and other famous algorithms as Diffie Hellman and N-prime RSA we have tried to give one more level of security by the use of Magic Rectangle. And by the use of Magic Rectangle we can have different cipher text for the same character. So by these many reasons this approach give enhancement to the public key cryptosystem. And Magic Rectangle have different approach that can unable to get the plain text without the knowledge of generation of Magic Rectangle.

• • by IJIRST - International Journal for Innovative Research in Science and Technology
  • •
  • Mr, RSA, Magic Rectangle, Public Key Cryptosystem
• • by Emanuel Popovici
  • •
  • Computer Hardware, Cryptography, FPGA implementation, Arithmetic
• • by Oscar Moreno
  • •
  • Information Theory, Pure Mathematics, Propulsion, Gaussian processes
• • by Abdelmalek Azizi and +1
  • •
  • Number Theory, Distributed Computing, Model Checking, Quantum Information
• • by vipul Gupta
  • •
  • Internet Security, Performance Analysis, Power Consumption, Performance Improvement
• • by Ibrahim Gad
  • •
  • Information Security, Parallel Algorithm, Integer Factorization, Public Key Cryptosystem

Using passwords only has rapidly become a security risk. Another approach to security is visual cryptography (VC), which divides paper documents into several encrypted papers managed by multiple people. Decryption occurs by stacking these... more

Using passwords only has rapidly become a security risk. Another approach to security is visual cryptography (VC), which divides paper documents into several encrypted papers managed by multiple people. Decryption occurs by stacking these papers, i.e., they cannot be decrypted individually. In our work, we consider a system for decrypting text encrypted by VC on digital devices. Furthermore, we propose a method for automatically recognizing encrypted portions using images captured by a digital device's camera. Our system has several advantages, including no actual text in communication and enabling users to use different passwords or secret questions at each use. Furthermore, our method is implementable on wearable glasses-like devices, thus enabling wearers to decrypt text simply by looking at encrypted portions. We conducted experiments regarding recognition accuracy and performance and obtained results showing that our proposed method was able to achieve a high recognition rate at a low cost.

• • by International Journal of Computer Science, Engineering and Applications (IJCSEA)
  • •
  • Computer Science, Information Technology, Image Processing, Web Services

This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides a high perfor- mance for both RSA and Elliptic Curve... more

This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides a high perfor- mance for both RSA and Elliptic Curve Cryptography (ECC). In addi- tion, we introduce another reconfigurability for the flip-flops in order to make the best of hardware resources. The results of FPGA implemen- tation

• • by Nele Mentens
  • •
  • Electronics, Cryptography, FPGA implementation, Reconfigurable Hardware

Over the past few years, much research attention has been afforded to the application of remote patient monitoring using embedded mobile devices. However, relatively little research has been done to investigate the security aspects of... more

Over the past few years, much research attention has been afforded to the application of remote patient monitoring using embedded mobile devices. However, relatively little research has been done to investigate the security aspects of such scenarios. The present work describes the implementation of a cryptographic algorithm based on elliptic curves on an embedded mobile device useful for healthcare purposes. A personal digital assistant (PDA) has been chosen to be the hardware platform for the implementation as it is particularly suitable for remote patient monitoring applications. The motivation for this paper was to formulate a secure protocol which comprises of signature, encryption and authentication (SEA) as a combined ingredient of secure remote patient monitoring application using mobile devices. This needed to be easy to use and computationally efficient in order to be acceptable to both clinicians and patients and the results indicate a positive outcome.

• • by Stephen Gardner
  • •
  • Cryptography, Power Analysis, Software Implementation, Patient Monitoring
• • by Ernst Gabidulin
  • •
  • Public key cryptography, Decoding, Electrical And Electronic Engineering, Public Key Cryptosystem
• • by Roberto Giorgi
  • •
  • Handheld Device Use, Mobile Device, Computational Efficiency, Public key cryptography
• • by c m
  • •
  • Privacy, Security, Digital Signature, Cryptography
• • by Berna Ors Yalcin
  • •
  • FPGA, FPGA implementation, Hardware Implementation of Algorithms, Multiplication
• • by niansheng liu
  • •
  • Internet Security, Neural Network, Java Programming, Security Analysis

The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and implementation of a reconfigurable Galois field multiplier,... more

The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and implementation of a reconfigurable Galois field multiplier, which is implemented using field programmable gate arrays (FPGAs). The multiplier of Galois field based on karatsuba’s divide and conquer algorithm allows for reasonable speedup of the top-level public key algorithms. Binary Karatsuba multiplier is more efficient if it is truncated at n-bit multiplicand level and use an efficient classic multiplier algorithm. In these work three levels to truncate Binary karatsuba algorithm (4 bits, 8 bits and 16 bits) are chosen showing that 8 bits is the best level for minimum number of slices and time delay to truncate Binary karatsuba algorithm which is designed on a Xilinx VirtexE XCV2600 FPGA device. The VHDL hardware models are building using Xilinx ISE foundation software. This work is able to compute GF(2191) multiplication in 45.889 ns.

• • by Sameh Shohdy
  • •
  • Time Delay, Field Programmable Gate Array, Elliptic Curve Cryptography, Design and Implementation
• • by Berna Ors Yalcin
  • •
  • Network Security, Hardware Design, Hardware Implementation of Algorithms, Montgomery multiplication

Abstract:-We propose a public key cryptosystem based on block upper triangular matrices. This system is a variant of the Discrete Logarithm Problem with elements in a finite group, capable of increasing the difficulty of the problem while... more

Abstract:-We propose a public key cryptosystem based on block upper triangular matrices. This system is a variant of the Discrete Logarithm Problem with elements in a finite group, capable of increasing the difficulty of the problem while maintaining the key size. We also ...

• • by Leandro Tortosa and +2
  • •
  • Digital Signature, Finite Group Theory, Finite Field, AA
• • by Ian Witten
  • •
  • Computer Science, Privacy, Digital Signature, Public Understanding Of Science
• • by Abdelkader Ouda
  • •
  • Cryptographic Hash Function, Public Key Cryptosystem
• • by Julio Cesar
  • •
  • Distributed Computing, Computer Arithmetic, Computer Hardware, Computer Software
• • by Giovanni Di Crescenzo
  • •
  • Provable Security, Cryptology, Zero-Knowledge Proofs, Proof of knowledge
• • by Phú Lê
  • •
  • Statistical Analysis, Probability, Public key cryptography, Public Key Cryptosystem
• • by JAVAD malekian
  • •
  • Non-commutative Geometry, Symmetric group, Theoretical Foundation, Public Key Cryptosystem
• • by Sorin Huss
  • •
  • Information Systems, Digital Signature, ECDSA, Computer Software
• • by Juan Manuel
  • •
  • Pure Mathematics, Provable Security, Standard Model, Public Key Encryption
• • by Jennifer Seberry
  • •
  • Distributed Computing, Electrical And Electronic Engineering, Public Key Cryptosystem
• • by Leonardo Oliveira
  • •
  • Mathematics, Applied Mathematics, Distributed Computing, Information Security

We propose a practical scheme based on factoring and semantically secure (IND-CPA) in the standard model. The scheme is obtained from a modi.cation of the so called RSA-Paillier [5] scheme. This modification is reminiscent of the ones... more

We propose a practical scheme based on factoring and semantically secure (IND-CPA) in the standard model. The scheme is obtained from a modi.cation of the so called RSA-Paillier [5] scheme. This modification is reminiscent of the ones applied by Rabin [22] and Williams [25] to the well-known RSA cryptosystem. Thanks to the special properties of such schemes, we obtain efficiency similar to that of RSA cryptosystem, provably secure encryption (since recovering plaintext from ciphertext is as hard as factoring) and indistinguishability against plaintext attacks. We also construct a new trapdoor permutation based on factoring, which has interest on its own. Semantic security of the scheme is based on an appropiate decisional assumption, named as Decisional Small 2e-Residues assumption. The robustness of this assumption is also discussed. Compared to Okamoto-Uchiyama's scheme [18], the previous IND-CPA cryptosystem in the standard model with onewayness based on factoring, our scheme is drastically more efficient in encryption, and presents higher bandwith, achieving the same expansion factor as Paillier or El Gamal schemes. We believe the new scheme could be an interesting starting point to develop efficient IND-CCA schemes in the standard model with one-wayness based on factoring.

• • by David Galindo
  • •
  • Semantics, Cryptography, Provable Security, Standard Model
• • by Darlington Nwambo
  • •
  • Encryption, Authentication, Computer Network, Protocols
• • by Awais Malik
  • •
  • Privacy, Security, Digital Signature, Cryptography
• • by Nabil Ismail
  • •
  • Network Security, Time Delay, Hardware Implementation of Algorithms, Elliptic Curve Cryptography
• • by Sorin Huss
  • •
  • Modular multiplication, Public Key Cryptosystem
• • by Zbigniew Kotulski
  • •
  • Graph Theory, Graph Coloring, Public key cryptography, Secret Sharing
• • by Yasir Malik
  • •
  • Mathematics, Applied Mathematics, Distributed Computing, Information Security

McEliece proposed a public-key cryptosystem based on algebraic codes, in particular binary classical Goppa codes. Actually, his scheme needs only a class of codes with a good decoding algorithm and with a huge number of inequivalent... more

McEliece proposed a public-key cryptosystem based on algebraic codes, in particular binary classical Goppa codes. Actually, his scheme needs only a class of codes with a good decoding algorithm and with a huge number of inequivalent members with given parameters. In the present paper we look at various aspects of McEliece's scheme using the new and much larger class of q-ary algebraic-geometric Goppa codes.

• • by oscar moreno
  • •
  • Information Theory, Pure Mathematics, Propulsion, Gaussian processes

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the... more

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.

• • by Robert Brouzet
  • •
  • Image Encryption, Security Analysis, Lossy Compression, Optical physics