Questions tagged [encryption]

a transformation of information to make it unreadable to outside observers

Filter by
Sorted by
Tagged with
0
votes
0answers
27 views

Image Processing (Encryption/Decryption) system using Residue Number System [on hold]

I'm preparing for my final year project in school and i plan on working on the implementation of Residue Number System in Image Processing. I found this thesis online by Pallab Maji here: http://...
1
vote
1answer
17 views

Weaknesses arising from using same key in both channel directions

I came across the following question: Which of the following risk may arise, when same key is used to encrypt both directions of a communication channel, that are not present if using different keys ...
5
votes
1answer
61 views

Perfect Probabilistic Encryption still requires key length about as long as message

Let $(E,D)$ be a probabilistic encryption scheme with $n$-length keys (given a key $k$, we denote the corresponding encryption function by $E_k$) and $n+10$-length messages. Then, show that there ...
1
vote
2answers
37 views

RSA cryptosystem: Encrypting a signed message

I've started to read the section about the RSA cryptosystem in CLRS (page 958) and I don't understand the way it describes how to encrypt a signed message. If Bob wants to send a message $M$ to Alice:...
1
vote
0answers
65 views

A tree-like data structure with rights delegation for distributed computing

Every actor can create a root node and delegate a right to add a child node. Every node contains name of its’ creator or who added it, and value S. Sum of all values S at the same level of the tree ...
1
vote
0answers
15 views

Structure Preserving Continuous Hash Function

This question was originally posted on super user, but redirected here based on some suggestions. I am completely new with computer science, and not only recently did I run into the notion of hashing....
2
votes
2answers
49 views

Why don't most websites I visit seem to use TLS with Ephemeral Diffie-Hellman?

When I click "view certificate," under Public Key Algorithm it usually says "RSA Encryption" or "Elliptic Curve Public Key." I assume this is the algorithm used to agree on a premaster secret (...
1
vote
1answer
25 views

Why does Feistel encryption algorithm encode half block every time?

Why does Feistel encryption algorithm encode half block every time? What would happen if the entire block is encrypted in each step?
5
votes
3answers
1k views

What is the point in hashing a value?

I apologise if this is not the right place for this question... I didn't want to ask on Stackoverflow or CodeReview as it will closed in minutes as "too broad". A client of mine is writing an API ...
-1
votes
2answers
49 views

Finding small-length RSA private key

I was wondering if there is an algorithm to derive $p$ and $q$ or is it simply trial and error? Consider the following RSA crypto-system with public key $(437,13)$. Since the numbers are so small, ...
1
vote
1answer
28 views

DES encryption - what happens if all sub-keys are the same?

What will happen if we change the DES encryrption algorithm to use the same key in each round ? How will it affect the encryption - will it only make the encryption same as decryption or are the more ...
1
vote
1answer
69 views

fully homomorphic encryption with information-theoretic security?

An encryption algorithm with information-theoretic security is one which even with infinite amount of computation cannot be broken. That is, given only the ciphertext, no amount of computation can ...
0
votes
2answers
58 views

How can a fully encrypted homomorphic program resist copying?

Let's say that we have an original homomorphically encrypted program with any possible code inside. What methods can it use to ensure that it is impossible to create an exact copy of it? Are there ...
2
votes
1answer
60 views

Finding $d$ in RSA Encryption mathematically and by hand

I'm working on this RSA encryption problem and the catch is that it must be done by hand and mathematically. Let's say $p=11$, $q=13$ $$N=p \cdot q=11 \cdot 13=143$$ I chose $e$ to be relatively ...
7
votes
3answers
2k views

Problem with the pseudo random number generator One-Time-Pad

I've started learning cryptography in class and we've come across One-Time-Pads, in which the key (uniformally agreed upon) is as long as the message itself. Then you turn the message into bits, do $...
0
votes
0answers
28 views

Is it possible to retrive the Hash from an encrypted folder?

So first of all I've a software which basically locks/encrypts a folder with a given password. Afterwards it's almost impossible to open the folder without entering the password through the software. ...
1
vote
1answer
77 views

Why do we use RSA if it is not secure against chosen ciphertext attack?

I am reading RSA cryptosystem from Farouzan book on network security. The author has mentioned that RSA encryption is prone to chosen ciphertext attack. Then why is this algorithm still so popular?
0
votes
1answer
61 views

Finding a trapdoor function for the 3-partition problem

I am working on a cryptography project. Let's say I want to build a public key cryptosystem using the 3-partition problem, which is NP-Complete, as a basis (just like RSA uses integer factorization). ...
1
vote
1answer
28 views

Asynchronous Encryption with wordlists

As I understand it encrypted emails have a high profile (detectable through pgp header / attachment). Would it be possible to match the encrypted data with a wordlist to hide the fact that the email ...
0
votes
0answers
18 views

Are there cs methods to uniquely create an ID, that prevent masquerading

I'm not sure if this is the right place, but I have an idea for a database kind of like a wiki, that would NOT have editors, and would have the following requirements: Any user can start with using ...
2
votes
1answer
240 views

RSA Encryption Explanation

In Khan Academy's RSA Encryption 2 video, I can't understand how they have got from $$m^e\bmod N\equiv c$$ to $$c^d\bmod N\equiv m\,.$$ The transcript says, 01:39 some piece of information that ...
2
votes
1answer
116 views

Equivalent expression in English: Set Notation $\{0,1\}^K$

I am overviewing this expression given in set notation. Could someone translate what M "Element of" $\{{0,1}\}^k$ stands for? Im looking for an explanation in English like what I did below. $K_e = \...
5
votes
1answer
260 views

Can I prove that I have x such that f(x) < c without revealing x?

I'm interested in applications to verifiable computing. Let's say Alice would like to find an x such that f(x) < c for some real-valued function f and some c of Alice's choosing, so she hires Bob ...
2
votes
3answers
232 views

Can software itself be encrypted?

Imagine that I need to install my server in a remote location, so my algorithm can do something fancy (collocation of server at a financial exchange is how I thought of this question, but it applies ...
2
votes
3answers
149 views

Given a string, is it possible to determine which hashing algorithm has produced it, if any?

Given a string, is it possible to determine which hashing algorithm has produced it, if any? For example, the MD5 hash of "string" is b45cffe084dd3d20d928bee85e7b0f21. Is it possible to determine ...
0
votes
2answers
852 views

What are the flaws in this encryption algorithm?

Let $A$ be a randomly generated matrix. Let $I$ be the identity matrix. $\times$ is the matrix multiplication operation, $/$ is matrix division (multiplying the first matrix by the inverse of the ...
0
votes
0answers
451 views

Is my interpretation of the SSL process correct?

Firstly, which of the two diagrams below is the more accurate or more well-explained (if both are accurate) representation of the SSL process (at a beginner's level)? Diagram 1 Diagram 2 Also where ...
0
votes
1answer
268 views

One-time-pad possible solutions

I am having a very difficult time trying to understand what exactly this question is asking. How many valid English plaintexts are there for the ciphertext message CJU using a length-3, one-time ...
0
votes
0answers
20 views

Data Compression Algorithm for Less repetitive pattern (redundancy) [duplicate]

Context: Lossless Data compression (source coding) algorithms heavily rely on repetitive pattern (redundancy) Questions Which data compression method/algorithm deals with less repetitive pattern (...
13
votes
2answers
2k views

If P=NP, are there cryptosystems that would require n^2 time to break?

If P does equal NP, will it still be possible do design a cryptosystem where the optimal cryptanalysis algorithm takes, say, the square of the time taken up by the legitimate encryption and decryption ...
2
votes
2answers
180 views

Monoalphabetic Cipher Key

I am not sure how to get the key for the following Monoalphabetic Cipher question. This is a textbook question and I know the answer, but I juts dont know how they got the key. Question: Decrypt ...
-2
votes
1answer
56 views

Encryption on a compressed file

Can I do encryption on a compressed file and again decompress the file after decryption to get the original data?
2
votes
2answers
741 views

What if p and q are not distinct in RSA Crypto System? What could go wrong?

In RSA Crypto System we choose p and q such that they are distinct primes. Calculate n=pq and phi=(p-1)(q-1). Then e is chosen for public key (n,e) s.t. gcd(e,phi)=1
1
vote
1answer
35 views

Issues in RSA setup

Suppose we have public key: $$n= 1015, e= 3$$ and private key: $$d= 635, p= 35, q= 29, \phi(n)= 952$$ For $m = 100$, we have $$c = m^e ~mod~n = 100^3 mod~1015 = 225.$$ To decipher this, let us ...
2
votes
1answer
159 views

How to revert a carryless polynomial multiplication?

In the carryless multiplication of two polynomials in a 8-bit environment, is it possible to obtain the original 8-bit values from the result? As an example: $$\begin{align} (x^{11} + x^{10} + x^9 ) ...
8
votes
2answers
87 views

Running an algorithm on data remotely and ensuring answer has not been tampered with

I´ve been thinking about this particular computing/crypto/database problem for years and I just want to know if there are already solutions to it. To be honest I don´t even know what field this ...
2
votes
1answer
110 views

RSA Encryption & Anonymity

Considering plain RSA encryption, assume we have B who wants to send 10 messages to either A1 or A2. The recipients' public key, namely the exponent e1, e2 and prime product n1, n2 for A1/A2 ...
2
votes
3answers
306 views

Formula for sufficiently lengthy encryption key?

As you add length to an encryption key, at some point the message becomes impossible to brute-force decrypt. This is because at that point, if you go through all the possible keys, you'll get many ...
0
votes
1answer
262 views

RSA Decryption from Simple Public Key Values

I'm a little stuck trying to figure out how to decrypt some messages and could use some hints as to what I may be doing wrong. I was given a series of integer values that make up my cipher text. Here ...
4
votes
2answers
1k views

Is running AES NI in parallel possible (one encryption per core/thread)?

AES NI seems to perform AES operations much faster than doing in software. However, if I have a machine with a large number of cores (say 32 cores), can I perform 32 AES encryptions using AES NI ...
4
votes
3answers
183 views

Data Compression: Which one is Better “Compress before Encrypt” or “Encrypt before Compression”

Which one is better approach do data compression before encrypting it or Encrypt data before compression ? I think it is biased towards the application requirement. Please share your views.
2
votes
1answer
1k views

One time pad, get plaintext using ciphers encoded with the same key

I'm trying to solve a problem: I have 11 ciphers encoded with the same key. My aim is to decode target cipher. If I do xor C1, C2 (ciphers encoded with the same key) I do get M1 xor M2 (where M1, M2 ...
6
votes
4answers
591 views

After implementing a novel encryption algorithm, how would one go about analyzing its security or get help from others in doing so?

Preface: This question was originally asked on Theoretical Computer Science, and the kind people there referred me to this web site. It is being repeated here in an attempt to find a satisfying answer....
8
votes
5answers
417 views

How can encryption involve randomness?

If an encryption algorithm is meant to convert a string to another string which can then be decrypted back to the original, how could this process involve any randomness? Surely it has to be ...
8
votes
3answers
1k views

Key secrecy vs Algorithm secrecy

it's a well known statement that "Cryptographic security must rely on a secret key instead of a secret algorithm." I would like to ask about some details about it. And which are their differences? ...
14
votes
4answers
592 views

Is it possible to create a “Time Capsule” using encryption?

I want to create a digital time capsule which will remain unreadable for some period of time and then become readable. I do not want to rely on any outside service to, for instance, keep the key ...
12
votes
2answers
4k views

How does a wifi password encrypt data using WEP and WPA?

How does the password that we enter (to connect to a wireless network) encrypt the data on the wireless network? Through my reading I am not sure if the password that we enter is the same as the ...
12
votes
5answers
562 views

How is the key in a private key encryption protocol exchanged?

Windows NT used a point-to-point protocol where a client can communicate "securely" with a server by using a stream cipher to encrypt an array of messages with some key $k$. The server also encrypts ...
109
votes
5answers
10k views

Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?

Most of today's encryption, such as the RSA, relies on the integer factorization, which is not believed to be a NP-hard problem, but it belongs to BQP, which makes it vulnerable to quantum computers. ...
19
votes
5answers
12k views

Why is encrypting with the same one-time-pad not good?

To encrypt a message $m_1$ with a one-time-pad key $k$ you do $Enc(m_1,k) = m_1 \oplus k$. If you use the same $k$ to encrypt a different message $m_2$ you get $Enc(m_2,k) = m_2 \oplus k$, and if ...