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

2
votes
2answers
161 views

Is Encryption without knowing the input directly possible at all?

I know the question is rather unusual, but let me clarify what I'm searching for: There is one person, lets call her $Alice$. $Alice$ has $n$ plaintexts $t_1..t_n$ and $n$ public keys $pk_1..pk_n$ of ...
0
votes
2answers
48 views

Elliptic Curve Cryptography Encrytion and text representation implementation

I'm writing a coursework and right now I've implemented the ECDSA algorithm, but I also need to encrypt and decrypt small text files (.txt) using elliptic curve cryptography. The problem is that I do ...
0
votes
1answer
115 views

Decrypting an encrypted text file

I have encrypted a text file which contains few lines of text. After performing the encryption process, the encrypted text is saved into a text file. The Cipher text for the word "Inform" is "24 102 ...
1
vote
2answers
152 views

P10 to P8 in S-DES

I am new to cryptography. During my learning I am facing a problem with S-DES. I am confused where P10 to P8 come from, and I’m ...
1
vote
1answer
137 views

Building a combined encryption scheme from two encryption schemes that's secure if at least on of them is secure

Any thoughts on how this can be done? Let $\Pi_1 = (\mathrm{Gen}_1, \mathrm{Enc}_1, \mathrm{Dec}_1)$ and $\Pi_2 = (\mathrm{Gen}_2, \mathrm{Enc}_2, \mathrm{Dec}_2)$ be two encryption schemes for ...
1
vote
2answers
115 views

Is One Time Pad considered Chosen-Plaintext Attack Secure?

If we're considering Chosen-Plaintext Attack setting, then the adversary has access to the Encryption Oracle right, and we know that OTP is only considered secure if we use the key only once. How ...
0
votes
0answers
27 views

prevent padding oracle attack on key exchange process

I found in my searches that the padding oracle attack can be used against the RSA with PKCS1PAdding or OAEP padding, and I used this algorithm for a symmetric key exchange. How can I prevent a padding ...
0
votes
0answers
21 views

Is sending encrypted message and signed message a secure way of transmitting data? [duplicate]

I know that the industrial standard is normally sending data in the following format: Send Encr(msg, Sign(msg)) Is the following way a secure as well? ...
1
vote
1answer
30 views

Does failure of indistinguishability of encryptions imply lack of CPA-security?

Suppose we have an encryption scheme that fails the indistinguishability of encryptions test. That is, given messages $m_0, m_1$ and a ciphertext $c_b = Enc_k(m_b)$, where $b \in \{0, 1\}$, the ...
0
votes
0answers
32 views

Encryption on mobile devices? [on hold]

I have studied the basics of cryptography, so it would be okay to say that I am familiar with the concepts of Cryptography (Theoretical). I have surfed the net for days to implement my theoretical ...
2
votes
1answer
38 views

On composition of encryption schemes

If we composed (as in function composition) multiple CPA-secure encryption schemes would the result also be CPA-secure?
0
votes
0answers
24 views

Finding patterns in a gambling game [closed]

I'm working on a program that I hope it will help me to get better chances on a gambling game. I have a very large database of numbers how occur in this game and my program pass through those numbers ...
0
votes
0answers
25 views

Signing a pdf document [closed]

I want to read a pdf document through an android application developed my me .Then i want to sign it through an certficate recorded in the smartphone.There is someone who know how to do it and thanks ...
0
votes
0answers
37 views

Enigma algorithm Question about the Ringstellung

This might be a stupid question but I need to implement the Enigma algorithm and I don't fully understand how it works. I've googled the subject and I am confused about what the Ringstellung is and ...
0
votes
1answer
59 views

AES process candidates implementations and usages

There were fifteen candidates in the AES selection and I suppose that Rijndael wasn't the single good algorithm. I know that Camellia is an evolution of E2 candidate and can be used as symetric ...
1
vote
1answer
111 views

Generate a list of valid ASCII codes

I have read many pages about encryption but I am really stuck on this. For access control to a building I want to print a 10 character ASCII code on a ticket (as a barcode). The barcode reader ...
2
votes
0answers
23 views

Proposed unidirectional authentication scheme

I've been looking around for a way to authenticate a client to the server and deliver a message, but in a unidirectional fashion - that is, the client sends messages to the server, but the server ...
2
votes
1answer
38 views

Does the plaintext have to be at least as long as the key in Polyalphabetic substituion cipher

In polyalphabetic substitution cipher, if we have a key $k$ (a string of letters) of length $n$ does the plaintext $m$ (also a string of letters) have to satisfy $|m| \geq n$? Also, side question, ...
0
votes
0answers
12 views

AES GCM Mode Client Side [closed]

I am implementing browser side cryptography in my project. I want to implement the AES-GCM in both client side and server side. I am using nodejs for that. I have researched on the net but I found ...
2
votes
1answer
60 views

How do we guarantee plaintext is coprime in RSA?

The specifications for RSA state: $P^{\phi(N)} \equiv 1 ~mod~N$ if and only if $P$ and $N$ are coprime. Here $P$ is the plaintext and $N$ is the product of two suitable primes $x_1, x_2$. My question ...
-1
votes
0answers
32 views

We are trying to decode a mysterious website, need help from experts [closed]

Here is the link of our investigation - http://www.reddit.com/r/gateway71 We are currently stuck on gif with blinking boxes and voice that appears to say the same what is happening on the gif. Here ...
-1
votes
2answers
131 views

General questions about cryptography for password security [closed]

I'm pretty new to this and find it quite interesting, but my brain won't process how it works so I have to ask some questions :) Why is cryptography used? Is it for extra security once the password ...
0
votes
1answer
73 views

Why cant Public Key Encryption be perfectly secure? [duplicate]

I would be very grateful for any help. I cant figure out why (probabilistic) public key encryption schemes can never provide perfect secrecy? Any Ideas? Excerpt: In contrast to the private-key ...
-3
votes
0answers
35 views

What's your favourite privacy tool? [closed]

we're currently working a community project that provides knowledge and tools to protect your privacy against global mass surveillance. Since the project is driven on user suggestions I came here to ...
-2
votes
1answer
28 views

Durability of the crypto container and there old copies / backups [closed]

Do durability of the crypto container decrease if I will store near that old copies of this container / backups? If yes, how much it falls? I feel that when I do backups it reduce resistance of ...
2
votes
2answers
507 views

Computing p and q from private key

We are given n (public modulus) where n=pq and e (encryption exponent). Then I was able to crack the private key d, using Wieners attack. So now, I have (n,e,d). My question is, is there a way to ...
1
vote
0answers
37 views

Avoiding known plaintext attacks with an additional XOR-Layer

Can a cipher that is vulnerable to an known plaintext attack be made secure by adding an additional XOR-encryption? That is: suppose I have an (w.l.o.g. symmetric) encryption algorithm E were the ...
-1
votes
3answers
52 views

with RSA encryption, how do I find the md5sum of the private key from the public key?

This is a purely mathematical question on RSA encryption. Having $e$ as the public key exponent and $n$ the modulus of a public key. Can I recover the md5sum of the private key $d$ (inverse of $d$ ...
14
votes
2answers
5k views

What is the main difference between a key, an IV and a nonce?

What are the main differences between a nonce, a key and an IV? Without any doubt the key should be kept secret. But what about the nonce and the IV? What's the main difference between them and their ...
0
votes
1answer
32 views

Segmenting encryption to get the same results with the same key

The given examples below are dummy and in English. They are mainly for place holding as this is a concept question rather specific example based Given AES has a block size of 128 bit (16 letters of ...
1
vote
1answer
44 views

Turning data into seemingly random noise

I am currently working on a python script that does image steganography, altering the least significant bit on each channel of the image. Now imagine encrypting a file with a bunch of null bytes, or ...
2
votes
0answers
46 views

How to make PKCS conformation oracle for trying Bleichenbacher’s RSA attack?

I was trying to understand Bleichenbacher’s CCA attack and thought of work it out in python. Can some one throw some light on the the logic behind the oracle used to check PKCS conformation? Will a ...
7
votes
3answers
334 views

At what point can you you implement crypto algorithms?

First off, this feels like it should be a common question, so I'm sorry if I've missed an older thread. Note that in my question, I'm talking about "implementing AES" rather than "designing AES2" or ...
0
votes
1answer
60 views

If someone had a list of all primes, would it be possible for them to factor any integer in polynomial time? [duplicate]

For example, if they somehow got a function that would churn out any arbitrary amount of primes in a row. Could they break the RSA problem then?
0
votes
1answer
71 views

How does the certificate authority generate a signature F?

E=encrypt(K,M) - is message M encrypted with key K gives encrypted text E M=decrypt(K,E) - is encrypted text E decrypted with key K gives message M KCA−pub,KCA−priv - is the private-public key pair ...
2
votes
1answer
55 views

Algorithm for n-of-m keys with partial results

Is there any known and proven algorithm which allows n-of-m keys en/decryption, but doesn't require the keys to be in one location? That is, it allows the plaintext (or ciphertext) to be encrypted (or ...
1
vote
1answer
109 views

Is encryption time greater than decryption time?

Is encryption time always greater than decryption time for all encryption techniques (AES / DES / RSA / DNA), or is there a mistake somewhere in my implementation?
0
votes
1answer
84 views

How many characters per block in an El Gamal ECC cryptosystem?

While I look for how many characters that can be encrypted using the The elliptic curve ElGamal cryptosystem. of each block found for these lines. But I can not understand Actually in our case we ...
0
votes
1answer
31 views

DSA: Authentication and assurance of authorized parties

When dealing with Asymmetric cryptographic algorithms, usually the sender of the critical data asks the listener for a Public Key for encrypting the data and sending them. This is while the private ...
-2
votes
1answer
62 views

How difficult is homomorphic encryption? [closed]

I want to learn more about homomorphic encryption and eventually make a career from it. Currently, I'm thinking to have my bachelor degree in this field. What background should I have for this ? How ...
0
votes
0answers
27 views

Can I submit an encrypted message to see if its breakable here? [migrated]

For some reason I have been thinking a lot about encryption lately. I'm a CS major, but an encryption novice. The skeptic in me feels making a code that uses a fairly simple algorithm would be a lot ...
2
votes
0answers
58 views

Energy necessary for brute-forcing or decryption

I am trying to understand how the physical limits of computation apply to crytography, and came up with the scenario below as a sort of gedanken. I would be grateful to see how others answer it. ...
0
votes
1answer
102 views

Are there any quantum-resistant symmetric encryption schemes?

It seems that quite a few currently available encryption schemes will possibly be broken by quantum computing. Are there any symmetric encryption schemes that will remain unbroken (either because of ...
0
votes
2answers
67 views

Can I use the output from a DRBG directly as K for AES, or do I need to use a key generator algorithm?

NIST has 3 validated "Recommendation for Random Number Generation Using Deterministic Random Bit Generators" (DRBG's) that are based on NIST SP 800-90A: Hash_DRBG (based on hash functions) ...
1
vote
1answer
47 views

Can Winternitz be easily converted to a many-time encryption scheme?

The Winternitz scheme is typically cited as being an OTS scheme. Can it also be used as a one-time encryption scheme? If it can be used as a one-time encryption scheme, then is it possible to easily ...
1
vote
1answer
40 views

Reducing the keyspace for a brute force attack on a chained 64-bit xor

I have a block of data which I know is encrypted using a chained 64-bit xor (sorry if that makes no sense, I'm not familiar with crypto lingo). I know a little bit about what the plaintext should look ...
-4
votes
0answers
42 views

encryption system ElGamal

Construct an encryption system ElGamal at the group $\mathbb{Z}_{19}^{\star}$. As base, we can use $g=\overline{2}$, that generates the group. Describe the construction of a pair private/public key ...
1
vote
0answers
72 views

Paillier Encryption: problems with double encryption

Given have two public keys $k1$ and $k2$, $E_{k1}(E_{k2}(m_1))$ and $m_2$. Is it possible to calculate $E_{k1}(E_{k2}(m_1 + m2))$? (or with multiplication instead of addition) At a first glance, I ...
0
votes
1answer
51 views

Adding a Random component to CBC MAC in order to enlarge the tag space

CBC MAC that is using AES as the underlying block cipher, has tag space of 2^128. If we add a random single block, concatenating it with the tag, and encrypt it again in AES CBC mode, with additional ...
0
votes
1answer
97 views

Encryption of plain text using stream cipher algorithm

We know that in stream cipher algorithms plain text and generated key are Xored byte by byte. Generated key depends on how much plain text there is and on that basis key will generate and plain text ...