Public Key Cryptosystem Research Papers (original) (raw)

65 Followers

Recent papers in Public Key Cryptosystem

• Top Papers

• Most Cited Papers

• Most Downloaded Papers

• Newest Papers

• People

• • by Amer Hassan
  • •
  • Electrical And Electronic Engineering, Public Key Cryptosystem
• • by Chris Hall
  • •
  • Public Key Cryptosystem, Error Correction Code
• • by Zbigniew Kotulski
  • •
  • Graph Theory, Graph Coloring, Public key cryptography, Secret Sharing

This paper proposes a security architecture for optical code division multiple access networks based on lattice cryptography. Unlike existing approaches, which have mainly focused on optical components such as phase masks and delay lines,... more

This paper proposes a security architecture for optical code division multiple access networks based on lattice cryptography. Unlike existing approaches, which have mainly focused on optical components such as phase masks and delay lines, our cryptosystem encompasses a secure code construction process. In fact, given a set of optical orthogonal codewords, we associate a pair of bases (a public basis and a private basis) to every user and we show that the projection of a codeword on the public basis of the receiver and the addition of a random error enhances the confidentiality performance of the code. The proposed public key cryptosystem is based on lattice cryptography. The security of this scheme relies mainly on the complexity of the closest vector-problem in an integer lattice. We found that our technique performs better than the existing approaches in terms of robustness to cryptanalysis. We also study the security of our lattice cryptosystem with regard to the properties of the bases pairs and the error vectors.

• • by Walid Abdallah
  • •
  • Optical Fiber Communications, Optical Communication, Optical Code Division Multiple Access, Public key cryptography
• • by Sameh Shohdy
  • •
  • Network Security, Time Delay, Hardware Implementation of Algorithms, Elliptic Curve Cryptography
• • by Sorin Huss
  • •
  • Modular multiplication, Public Key Cryptosystem
• • by Abdelkader Ouda
  • •
  • Cryptographic Hash Function, 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

Coba fikirkan hal apa yang tidak dapat diretas hari ini ? Apakah demikian juga halnya dahulu ? apakah esok dan masa depan kita masih akan terus mengalami semua kekacauan ini ? Coba jawab dalam diri anda berapa banyak informasi yang anda... more

Coba fikirkan hal apa yang tidak dapat diretas hari ini ? Apakah demikian juga halnya dahulu ? apakah esok dan masa depan kita masih akan terus mengalami semua kekacauan ini ? Coba jawab dalam diri anda berapa banyak informasi yang anda ijinkan untuk diketahui dan tidak oleh oranglain, ada beberapa cara agar tetap bisa menjaga rahasia yang kita miliki dalam era teknologi serba canggih ini. Tidak ada yang benar-benar aman di dunia maya, sudah marak terjadi aksi pembobolan bank melalui saluran internet, peretasan akun internet juga hal-hal yang bersifat pribadi dengan mudah dicuri dan disebarkan oleh pihak-pihak yang tidak bertanggung jawab secara sengaja dan tidak. Lalu apakah kita akan membiarkan hal ini terus terjadi ? Tetaplah berhati-hati, pada buku ini akan dibahas hal mengenai sandi namun penuh dengan kata-kata/kalimat yang mudah dimengerti, bagaimana anda dapat membuat sandi anda sendiri, merusak dan bahkan meretasnya. Dan untuk yang lebih menarik akan dibahas mengenai apa dan bagaimana sandi RSA melakukan enkripsinya.

• • by Matius C E L C I U S Sinaga
  • •
  • Computer Security, Cryptography, Python, Public Key Crypto systems

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

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

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 rafael alvarez
  • •
  • Applied Mathematics, Numerical Analysis and Computational Mathematics, Public Key Cryptosystem
• • by A. Surya
  • •
  • VLSI, Elliptic curves, Very Large Scale Integration, Arithmetic
• • by c m
  • •
  • Privacy, Security, Digital Signature, Cryptography

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
• • by Lech Jóźwiak
  • •
  • Image Processing, Video Processing, Computer Software, Look up Table
• • by Emanuel Popovici
  • •
  • Computer Hardware, Cryptography, FPGA implementation, Arithmetic

In order to achieve the security for the e-business application, generally, the organizations follow the cryptographic methods. The two widely accepted and used cryptographic methods are symmetric and asymmetric. The DES ideally belongs... more

In order to achieve the security for the e-business application, generally, the organizations follow the cryptographic methods. The two widely accepted and used cryptographic methods are symmetric and asymmetric. The DES ideally belongs to the category of symmetric key cryptosystem and RSA, NTRU(3) belongs to the category of asymmetric key cryptosystem. NTRU (Nth degree truncated polynomial ring units) is a collection of mathematical algorithms based on manipulating lists of very small integers. NTRU is the first secure public key cryptosystem not based on factorization or discrete logarithmic problems. The keys are generated by having small potent polynomials from the ring of truncated polynomials. NTRU can also be implemented using matrices instead of polynomials (4, 5). We proceed with the encryption and decryption of the plain text required by implementing the algorithms of both the approaches of NTRU cryptosystems. It is already shown that the matrix approach is algorithmically...

• • by Jayaram Pradhan
  • •
  • Polynomial Ring, AAPS PharmSciTech, Public Key Cryptosystem
• • by Benjamin Fine
  • •
  • Number Theory, Applied Mathematics, Group Theory, Diffie-Hellman-DSA
• • by Antonella Violante
  • •
  • Public Management, Business and Management, Text Messaging, Partial Information
• • by Nicolas Gama
  • •
  • Computer Security, Algorithmics, Cryptology, Arithmetics
• • by Jean-jacques Quisquater
  • •
  • Computer Software, Public key cryptography, High Speed, Very high throughput
• • by Nabil Ismail
  • •
  • Computer Architecture, Digital Signature, Software Architecture, Encryption

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 Pierre Valarcher
  • •
  • Multivariate Tutte polynomial, Boolean Satisfiability, Finite Field, Boolean function
• • by Berna Ors Yalcin
  • •
  • Ubiquitous Computing, Power Consumption, Low Power, Public key cryptography
• • by Sachar Paulus
  • •
  • Pure Mathematics, Cryptology, Numerical Analysis and Computational Mathematics, Key Distribution

Abstract. Elliptic Curve Public Key Cryptosystems (ECPKC) are be-coming increasingly popular for use in mobile appliances where band-width and chip area are strongly constrained. For the same level of secu-rity, ECPKC use much smaller key... more

Abstract. Elliptic Curve Public Key Cryptosystems (ECPKC) are be-coming increasingly popular for use in mobile appliances where band-width and chip area are strongly constrained. For the same level of secu-rity, ECPKC use much smaller key length than the commonly used ...

• • by Jean-jacques Quisquater
  • •
  • Reconfigurable Hardware, Elliptic Curve Cryptography, Modular multiplication, Public Key Cryptosystem
• • by Sorin Huss
  • •
  • Distributed Computing, Computer Hardware, Quantum Cryptography, Field-Programmable Gate Arrays
• • by JAVAD malekian
  • •
  • Non-commutative Geometry, Symmetric group, Theoretical Foundation, Public Key Cryptosystem
• • by Irina Branović
  • •
  • Distributed Computing, Information Security, Computer Hardware, Performance Evaluation
• • by Oded Goldreich
  • •
  • Crypto, Cryptology, Oblivious Transfer, Public Key Cryptosystem
• • by Yasir Malik
  • •
  • Mathematics, Applied Mathematics, Distributed Computing, Information Security
• • by Juan Manuel
  • •
  • Pure Mathematics, Provable Security, Standard Model, Public Key Encryption
• • by Meng Zhan
  • •
  • Applied Mathematics, Coupled Oscillator, Chaos, Chaotic Dynamics
• • by Gwoboa Horng
  • •
  • Computational Complexity, Public Key Infrastructure, Watermarking, Computer Software

The McEliece and the Niederreiter public key cryptosystems (PKC) are supposed secure in a post quantum world (4) because there is no ecient quantum algorithm for the underlying problems upon which these cryptosystems are built. The CFS,... more

The McEliece and the Niederreiter public key cryptosystems (PKC) are supposed secure in a post quantum world (4) because there is no ecient quantum algorithm for the underlying problems upon which these cryptosystems are built. The CFS, Stern and KKS signature schemes are post-quantum secure because they are based on hard problems of coding theory. The purpose of this article is to describe what kind of attacks have been proposed against code-based constructions and what is missing.

• • by Pierre-Louis Cayrel
  • •
  • Coding Theory, Quantum Cryptography, Side Channel attacks, Signature Scheme
• • by Berna Ors Yalcin
  • •
  • Network Security, Hardware Design, Hardware Implementation of Algorithms, Montgomery multiplication
• • by billy bob
  • •
  • Distributed Computing, Computer Hardware, Field-Programmable Gate Arrays, Microcontrollers
• • by Robert Brouzet
  • •
  • Image Encryption, Security Analysis, Lossy Compression, Optical physics
• • by Oscar Moreno
  • •
  • Information Theory, Pure Mathematics, Propulsion, Gaussian processes
• • by Abdelmalek Azizi and +1
  • •
  • Number Theory, Distributed Computing, Model Checking, Quantum Information
• • by Alberto Pizzirani
  • •
  • Compute Unified Device Architecture NVIDIA CUDA, Data Communication, Elliptic Curve Cryptography, High performance computer
• • by Shehzad Ashraf
  • •
  • Digital Signature, Resource Allocation, Public key cryptography, Authorisation

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 Giovanni Parodi
  • •
  • Electrical And Electronic Engineering, Montgomery multiplication, Public Key Cryptosystem
• • by Gerhard Rosenberger
  • •
  • Number Theory, Applied Mathematics, Group Theory, Diffie-Hellman-DSA
• • by Massimo Caboara
  • •
  • Public key cryptography, Lattice, Grobner bases, Multivariate Tutte polynomial
• • by Darlington Nwambo
  • •
  • Encryption, Authentication, Computer Network, Protocols

Log In