Encryption is the process of transforming plaintext using a cipher into ciphertext to make it unreadable to anyone except those possessing the key. Decryption is the process of transforming that ciphertext back into plaintext, using the key.

learn more… | top users | synonyms

0
votes
0answers
71 views

How does multi platform encrypted cloud storage work?

I'm really interested in end-to-end encrypted cloud storage and couldn't find out how following scenario could work: A user of a cloud provider which provides zero-knowledge-authentication (like for ...
0
votes
0answers
65 views

RSA public key exponent generation confusion

Quote from Wiki: $e$ having a short bit-length and small Hamming weight results in more efficient encryption — most commonly $2^{16} + 1 = 65537$. However, much smaller values of $e$ (such as $3$) ...
0
votes
0answers
209 views

Public key encryption and big files with NaCL

I am trying to encrypt big files using NaCL (actually PyNaCL) - see http://nacl.cr.yp.to/box.html After reading some docs, I came up with this prototype : Bob wants to send a big file to Sarah. They ...
1
vote
2answers
164 views

What cryptanalysis is possible against two independent keystreams XORed against plaintext?

If a wise person was unsure about which commercial cryptography standards are truly secure from the fascist powers that be, it would seem the obvious option for companies and individuals is to now use ...
1
vote
2answers
100 views

The perfect way of using IV in CTR mode

I understand that it is necessary to use the same IV for both encryption and decryption in the CTR mode. I'm thinking about the case when I concatenate the secret ...
0
votes
1answer
71 views

Using hash of plaintext as nonce in NaCl secretbox- bad idea?

I need a nonce to encrypt my stuff using NaCl secretbox. I will be transmitting the nonce along with the ciphertext, which I have been told is OK to do. It occurs to me that one could simply use the ...
0
votes
1answer
85 views

How secure is file header encryption for large files?

I'm having trouble location information about whether or not encrypting a file's header is good enough. The files in question are media files that range in size from 500mb to 4GB. If I had no ...
1
vote
1answer
130 views

Montgomery Algorithm

I'm trying to undestand how it works and how to implement the algo described in this paper. The paper shows a methods to compute a modular multiplication where it is used multiplier with a resolution ...
2
votes
1answer
113 views

Deduplication: Encrypting the SHA-256 hash of a file chunk

I'm designing a data storage system that should be both able to deduplicate data that share the same encryption key, and be reasonably secure. I know that this kind of encryption quality can be ...
0
votes
1answer
46 views

Interested in learning cryptography [duplicate]

I'm interested in learning cryptography outside the university(studying civil engineering). I was always interested in computer sciences and programing and in mathematics. I always try to program ...
4
votes
2answers
146 views

Share encrypted files without giving master key

Imagine I have four files I want to encrypt. I have master key, and from that master key I derive four keys, one for each file: ...
3
votes
2answers
89 views

Encryption for a short packet size

I have an 8051 microcontroller with a radio that can send packets with up to 32 bytes and I want to have the messages encrypted. It is a sensor network so I really only want to send one packet per ...
1
vote
1answer
95 views

Transforming a key into a seed with the most entropy

I'm making a very simple encrypter in C# which is basically a Stream cipher. The user enters a key(password), converted to a seed for a pseudo-random generator, and the pseudo-random generator ...
0
votes
4answers
190 views

what is it called when encrypt('a') + encrypt('a') == encrypt('aa')?

So normally if you do encrypt('a') twice in a row you'll get the same result. But sometimes (as is the case in SSH) this is not desirable. You want encrypt('a') + encrypt('a') == encrypt('aa'). What ...
0
votes
1answer
56 views

If I know the salt, can I decrypt the commitment?

Say, I salt my key(K) with y. So, my new Key is K' = Salt(K+y). Now, Alice sends commitment = E[K',M] to Bob. Bob knows the salt(y), but not K nor K'. Can Bob decrypt the message?
0
votes
1answer
57 views

Is it possible to decrypt this message with partially known data? [closed]

The following highlighted text must contains "547a5e0e008be33730158d63ce844e67" data. I don't know about encryption method and key. Is it possible to decrypt it? Or just give me some idea about ...
0
votes
1answer
90 views

Possible to know who is the owner of a message encrypted with RSA public key

Given the scenario in which I want to send 10 messages either to Stalio or Olio. I encrypt these messages with their respective public keys using textbook RSA, before sending the messages to their ...
3
votes
2answers
184 views

Why would an Initialization Vector be supplied externally?

My software uses a 3rd party encryption appliance. One of the capabilities they allow is for the client software to supply an IV while doing CBC encryption. Why would they not generate a random ...
0
votes
1answer
106 views

Encryption and HMAC in a PSKC file

This is the PSKC standard https://tools.ietf.org/rfc/rfc6030.txt In Section 6.1 6.1. Encryption Based on Pre-Shared Keys They have the following ...
0
votes
1answer
83 views

Embedded devices Authentication, Integrity and Confidentiality

Embedded devices send messages to the server. The server occasionally sends messages to individual devices(Reboot, upgrade firmware etc) After some research this is my ad-hoc solution: 1) Each ...
0
votes
3answers
146 views

Brute force against computational security

One-time pad is secure under brute force with respect to either of the definitions \begin{align} \Pr[M = m] &= \Pr[M = m | C = c]\\ \Pr[C = c | M = m_0] &= \Pr[C = c | M = m_1] \end{align} ...
2
votes
1answer
66 views

Encrypting decryption key

What's that property called when a scheme is secure even if you encrypt the decryption key? Some schemes have problems when your plaintext is the decryption key (or just the key if symmetric).
2
votes
1answer
96 views

Is AES-GCM length extension attack possible using authenticated decryption?

I am looking to encrypt a piece of data using AES-GCM with a full 16-byte GCM Tag and send it over the network using UDP. Is it safe to assume using the AEAD nature of AES-GCM that performing ...
8
votes
3answers
2k views

Why shouldn't I use ECB encryption?

I'm using Java to generate encrypted strings, and I get this warning at build time: ECB encryption mode should not be used So I'm wondering why I shouldn't use ECB and what I can use instead?
1
vote
1answer
72 views

Does a cryptosystem provide unconditional security if and only if it provides perfect secrecy?

Is unconditional security and perfect secrecy one and the same thing, i.e a cryptosystem provides unconditional security if and only if it provides perfect secrecy ? I've wondered about the above and ...
2
votes
1answer
55 views

Can a cryptosystem be unconditional secure if the same key $k \in \mathcal K$ is used for more than one encryption?

Can a cryptosystem be unconditional secure if the same key $k \in \mathcal K$ is used for more than one encryption ? I know that the one-time-pad doesn't have perfect secrecy and doesn't provide ...
1
vote
2answers
424 views

How can a cryptosystem be unconditional secure?

How can a cryptosystem be unconditional secure ? The definition of an unconditional secure cryptosystem states that the cryptosystem cannot be broken even with infinitely computational ressources ...
3
votes
1answer
86 views

Formal relationship between encryption and random number generators?

Cryptographically secure random number generators seem to have similar properties to symmetric encryption: initial seed is permuted to produce a random numbers (key and ciphertext) given the seed, ...
1
vote
1answer
71 views

Perfect secrecy of a crypto system

Suppose we have the following crypto system: $P = C = K = \{0, 1, . . . , n − 1\}$, $E_k(x) = (x + k) \bmod n$ and $D_k(y) = (y − k) \bmod n$. Prove that the crytosystem has perfect secrecy. Perfect ...
16
votes
5answers
566 views

Why are primes important for encryption

Why are primes so important? Why can't we just use a random number? My guess is that it's because finding a random prime require more computing power, than finding a random number. Can anybody confirm ...
5
votes
1answer
173 views

Dancing confusion with Daniel J. Bernstein's stream ciphers

I know of Salsa20 which won the ESTREAM competition. This is dated of 25 Dec 2007. There is also the ChaCha20 stream cipher (cr.yp.to/chacha.html). This claims to increase the amount of diffusion ...
1
vote
1answer
83 views

one time pad regarding

If I had two ciphertexts $$c_1 = m_1 \oplus y_1 \text{ and } c_2 = m_2 \oplus y_2$$ will it be possible to obtain $$z_1= (m_1 \lor m_2) \oplus y_1 \oplus y_2 \text{ and } z_2= (m_1 \land m_2) ...
2
votes
1answer
177 views

How to customize a standard encryption algorithm?

I want to modify and customize AES encryption algorithm and develop a variant of it. What factors should I consider so that it does not become weaker? What skill sets would be required to undertake ...
0
votes
2answers
196 views

What would be the best plain text Cryptography method without the use of a computer? [closed]

What would be the best Cryptography method without the use of a computer? This could be a list of the current options available, that could be used without the use of a computer ...
1
vote
0answers
51 views

Asymmetric encryptions' computational complexity [duplicate]

I need to know the computational complexity of the public key encryption (e.g. Paillier), please. (i.e.Paillier in his paper mentions that the computational complexity of most of public key ...
0
votes
1answer
153 views

Secure double encryption using CPA and CCA

Do you mind if you give me any hints, links or ideas about how to improve the security of double regular encryption and decryption, by using CPA game and CCA game, it sounds interesting question, and ...
0
votes
1answer
59 views

Oblivious transfer variation question

Now I am doing a variation of the oblivious transfer, I have to use 2 people, pebbles, and boxes. I need to find out if who has a larger number between Alice and Bob (variation of Yao's Millionaires' ...
0
votes
1answer
56 views

What cipher algorithm is this routine using? [closed]

I transfered a code routine from Java to Python: ...
1
vote
1answer
44 views

Repeating something encrypted and non-encrypted?

If one wants to keep the receiver's name non encrypted, but it also appears in the encrypted message - will it leak information? (other than the receiver's name, of course.) Let's assume a "bad" case ...
0
votes
0answers
35 views

how can I change representation of point to Jacobian coordinates in Edward's Curve

I want to simulate this algorithm but I want to change it's output to Jacobian coordinates. what should I do ? In the other way how can we change extended homogeneous coordinates to Jacobian ...
0
votes
0answers
23 views

How to compare security parameters of different schemes (Sign-Encrypt, Encrypt-Sign, etc)? [duplicate]

How can one compare the security parameters (confidentiality, integrity, non repudiation, etc.) for different schemes (Sign-Encrypt, Encrypt-Sign, Sign-Encrypt-Sign, Encrypt-Sign-Encrypt)? Are there ...
0
votes
0answers
27 views

Encrypt algorithm [duplicate]

Is it possible to encrypt an algorithm? What I mean by this is have a remote/cloud computer execute a program that will process some data... And the remote computer would not be able to know anything ...
8
votes
1answer
273 views

Why there are limitations on using encryption with keys beyond certain length?

I am writing a java program to encrypt a message using 256-bit AES encryption, but I am getting illegal key size error, I have read that I have to use some JCE ...
0
votes
0answers
72 views

RSA OAEP: prevention of partial decryption of ciphertexts

I'm trying to understand RSA encryption (as a beginner in cryptography). go on this wiki page http://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding scroll down to the 2 numbered points: ...
2
votes
1answer
78 views

what are multi-primes and how are they different from semiprimes?

I came to know of semiprimes recently. The simplest explanation of semiprimes is you take any two prime numbers and you multiply them, say 3*11 = 33 in which case 33 would be a semiprime. The numbers ...
0
votes
0answers
122 views

Mifare Classic and crypto1 algorithm

Mifare's Crypto1 algorithm uses a 48-bit LFSR. What does the 48-bit LFSR do exactly ?
3
votes
2answers
153 views

Can a secret message be securely transmitted within a MAC tag?

A sender wants to transmit an ultra secret code $M$ which could be either 'go', 'stop' or 'wait'. This could be any selection of code words really and adopted for any use such as transmitting short ...
1
vote
1answer
307 views

What Java actually stores inside Keystore when generating Keys?

When we use Keytool to generate a Keystore to store Private/Public keys, what Java actually stores inside the Keystore file ? I ...
2
votes
1answer
101 views

To prove $r \cdot f_1 +f_2 \cdot (s+1)$ is secure

We define the polynomials $r, f_1,f_2,s \in R[x]$. Where $r$ is a random degree 1 polynomial and $s$ is a random polynomial such that: $degree(s)=degree(f_1)=degree(f_2)$, let $R$ be $\mathbb{Z}_p$ ...
2
votes
1answer
133 views

Modes of encryption for hard drives?

What are the currently recommended modes of encryption for large disks? Basic requirements would seem to be that you can update an encrypted sector independently of others, which rules out most ...