Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 7,420 papers for “Cryptosystem”

RSA CRYPTOSYSTEM

LI MINGYANG · National University of Singapore · 2014

Cited by 0

Hyperelliptic cryptosystem

최영주 · Open Access System for Information Sharing (Pohang University of Science and Technology) · 2018

Cited by 0

Homomorphic Cryptosystem

Alisha Rohilla, Mehak Khurana, Meena Kumari · International Journal of Computer Network and Information Security · 2017

In 2009 Craig Gentry proved that Fully Homomorphic Encryption can be applied and realized in principle. Homomorphism allowed us to perform arbitrary computations and calculations on encrypted data. With RSA being the first cryptosystem to hold homomorphic properties, there came other additive and multiplicative cryptosystems. However, fully Homomorphic encryption proved to be the ultimate cryptographic solution to ensure security of data on cloud. It enables processing and computing arbitrary functions over the encrypted data thereby reducing the probability of accessing the plain text.

Cited by 4Open access

Rabin's Cryptosystem

Huynh, Evan · DiVA (Linnaeus University) · 2021

In this paper we will explore Rabin's cryptosystem, one of the cryptographic algorithm that is similar to RSA developed by Michael O. Rabin based on the quadratic residue problem. We will introduce the background theory, the scheme and the security of Rabin and a basic padding scheme to use for Rabin's system. Also, there is another exploration of picking different type of primes and an algorithm to solve the quadratic residue problem when the prime <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?p%20%5Cnot%20%5Cequiv%203%20%5Cpmod%7B4%7D" data-classname="equation" data-title=" /> and the experiment to measure the performance of that algorithm.

Cited by 0Open access

Compression Cryptosystem

Yoav Gross, Shmuel T. Klein, Elina Opalinsky et al. · The Computer Journal · 2025

Abstract A compression cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering both Huffman and arithmetic coding, this paper proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decrypted only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.

Cited by 0Open access

Chess Cryptosystem

Gatej, Alexandru Miron · Journal of Mobile, Embedded and Distributed Systems (JMEDS) - Journal of Mobile, Embedded and Distributed Systems · 2010

Cited by 0Open access

RSA Cryptosystem

Chenyang Shi · Apress eBooks · 2025

When you enter a password at a website or make online purchases, have you ever wondered how the data is securely transmitted over the Internet? Yes, you guessed it right – the modern browsers use security protocols such as HTTPS to protect our data in transit. In this chapter, we will review one of the well-known public key cryptography methods called the RSA Cryptosystem, named after its inventors, Ron Rivest, Adi Shamir, and Leonard Adleman. In RSA, both sender and receiver (even the attacker) know the public key beforehand. The sender uses the public key to encrypt the message, and the receiver uses the private key known only to himself/herself to decrypt the message. The RSA involves a bit of math, including finding the greatest common divisor of two integers and a primality test using Fermat’s Little Theorem. Fret not, let us unpack it slowly.

Cited by 0