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)

1
vote
0answers
38 views

Email: Degrees of Security [closed]

It has been explained to me by IT that there is no such thing as totally secure email - but rather a spectrum. If systems are secured via https and SSL what degree of encryption/security are we ...
4
votes
0answers
61 views

Additive homomorphic encryption scheme without change in operator

I'm looking for an additive homomorphic encryption that the addition operator (+) in its plaintext space be the same as addition operator in its ciphertext space. (Schemes like Paillier do addition in ...
0
votes
0answers
93 views

Envelope Encryption with asymmetric keys vs KMS

In Envelope encryption a symmetric secret key is used to sign the data and then another key is used to encrypt the secret to produce an encrypted secret key. The encrypted messages is packaged with ...
-2
votes
1answer
217 views

Having plaintext and ciphertext, how can I learn more about key/encryption?

I have an OLD work database that seems to have a simple encryption on the PW. I have one users whose pw is 7777 the cipher text is ...
1
vote
1answer
346 views

Knowing pre-encryption data, can we find the private key CryptoWall used?

I'm just repurposing a question already asked about Cryptolocker for CryptoWall: "If we know exact contents of some of the files prior to them being encrypted, would it be feasible to use those ...
1
vote
1answer
87 views

How can I handle the situation if key size is less than 64 bits in DES?

If the data is not a multiple of 64 bits, then I can use padding. I know that it is not secure. But if the key is less than or more than 64 bits, should I ask the user to enter the key again, or ...
0
votes
0answers
37 views

Is double encryption using AES using different key lengths (128 bit and then 256 bit) vulnerable? [duplicate]

I know that AES 256 bit is far more than enough to secure a file. I just want to know if there are any vulnerabilities or known attacks which can make such this combination less secure "double ...
3
votes
1answer
117 views

How can you produce visual cryptography?

I would like to be able to "code" images such as the one seen here on Wikipedia. Is this generally produced with software, or does this require complex programming? Ideally, I would love to be able ...
1
vote
1answer
88 views

Is there a standard for public key encrypting and signing short messages?

Some systems, that operate over flaky bearers, need to send signed, encrypted messages that are entirely self contained - i.e. send a single 300 byte UDP rather than have a 10Kb, two-way, certificate ...
2
votes
1answer
72 views

What is this encryption system called?

Let's say you want to break down a message, for simplicity it is just a bit $0$ or $1$, $m$ into two messages $(m_1, m_2)$ as follows: If $m =0$, then $(m_1, m_2) = (0, 0)$ with probability $1/2$ and ...
2
votes
1answer
117 views

Why isn't a table used to solve the large number factoring problem?

Lots of modern encryption (RSA comes to mind) are based on the fact that factoring large numbers is hard. However, multiplying large numbers is much easier, and table lookups are very easy. Since ...
8
votes
4answers
1k views

Is it possible to get an RSA encryption key by comparing the unencrypted and encrypted file?

Exactly what the title says. If I have a RSA encrypted file, and the exact same file but decrypted, can I tell the key that was used from that information?
0
votes
2answers
364 views

Triple-DES DUKPT CBC PIN variant vs Data variant

Does any know the difference between triple des dukpt decryption algorithm with PIN variant and Data variant? I have done Triple DES DUKPT PIN variant, which generate session key from KSN and BDK. ...
0
votes
2answers
196 views

DES hardware implementation of substitution lookup table [ ReWorked ]

I'm a crypto enthusiastic and student of cryptography. I'm developing a project with other students titled "A hardware implementation of a DES cryptography for educational purposes", our idea was to ...
3
votes
1answer
193 views

public key cryptography and authentication for cross-platform network application

I'm developing network based application for control and telemetry on Linux based embedded system. I'm using ZMQ network library and Google Protocol Buffers serialization library for communication ...
4
votes
1answer
417 views

How hard is the Solitaire cipher to crack?

Assuming your deck is completely random and that it is not retrivable, how hard would it be for a casual person to decrypt a message encrypted with the Solitaire cipher?
2
votes
2answers
67 views

How badly does disclosing an M-bit prefix of an N-bit private key compromise security?

I apologize profusely for knowing nothing about cryptography, please go easy on me! I'm working on a project where I have a 2048-bit RSA private key and a public certificate generated from the ...
1
vote
0answers
129 views

Example describing Baek and Zheng’s threshold identity-based decryption scheme

I am trying to work through an example of Baek and Zheng’s “threshold identity-based decryption scheme” and I tried a lot to solve this, but somewhere I’m doing something wrong. I hope someone can ...
1
vote
2answers
44 views

Validate per round rather than cycle-walking in FPE

I was thinking about FPE specifically for numbers, CC, phone, SS #, etc. and I thought of some small "optimization" that could be implemented. Can I validate the string length after each round in the ...
3
votes
1answer
132 views

Secure method of encrypting data within a database

I'm designing a program which makes queries to a database stored locally which could potentially contain a lot of sensitive information. As such the information must be kept secure as possible from ...
1
vote
1answer
134 views

Secret Sharing Encryption

Suppose Alice shares a secret block cipher key, $K_{AB}$ with Bob, and a different secret block cipher key, $K_{AC}$ with Charlie. Describe a method for Alice to encrypt an m block message such that ...
3
votes
1answer
274 views

Standard format to encode AES cipher and random IV

As far as I understood, a secret key (same length as CBC block size) and an initialization vector (IV) are needed to decrypt a AES-256-CBC encrypted string. As the IV should better be random, it has ...
0
votes
0answers
80 views

How do we generate AES S-BOX?

I am new to AES and I am too much confused about the generation of S-box in AES. I don't have any idea of $GF(2)^8$ field and how the things are happening around. Please answer this question with a ...
0
votes
0answers
22 views

Defining correct secured channel from endpoint to server

I'm new to cryptography and have a question regarding encryption usage. The scenario is as follows: I have an endpoint hardware device (CPU - ARM A7 1.2 ghz) which runs Ubuntu 14.04. This hardware ...
3
votes
1answer
104 views

Why would you use a weaker hash function than cipher strength?

Some cryptographic libraries (like “Bouncy Castle”) support many modes where the maximum number of bits which can be produced by the hash are significantly fewer than the cipher strength. For ...
2
votes
0answers
169 views

What are the constraints on using GCM with a tag size of 96 and 128 bits

Say we want to use AES (or any other secure 128 bit block cipher) with GCM and a tag size of 96 or 128 bits. I'm assuming an AES key size of 128 bits and an IV size of 96 bits (the default). NIST ...
3
votes
1answer
92 views

How can recovered 5-letters plain text help me to recover reused OTP key

I have 10 cipher texts ciphered with One Time Pad (OTP) using the same key. I need to recover the key (or in other words, to recover the 11th cipher text which I assumed would require me to recover ...
2
votes
1answer
169 views

Mathematical formula for switching the key for OTP?

Instead of generating the random key for the one time pad cipher over and over again, is there a mathematical formula that allows you to switch the key to a new key? The new key must be as random and ...
1
vote
1answer
123 views

SSL pinning - how to safely hide the certificate?

We are doing an iPhone app and read multiple forums which says SSL pinning makes it possible to avoid man in the middle as we trust our web services server through the certificate which will be pre ...
2
votes
1answer
185 views

Simulation Based Proof: How the Corrupted Party's Input is Given To Simulator

Imagine we have a 3-party protocol, including client $A$,client $B$ and a server. In this protocol client $B$ encrypts its input under its public key and sends it to the server. The server performs ...
2
votes
1answer
117 views

Is Cramer-Shoup backdoorable?

We recently had the question whether it's possible to have multiple private keys with one public key for the cramer-shoup cryptosystem. There it was stated that finding such "secondary" private keys ...
0
votes
1answer
48 views

Can a Cramer-Shoup public key have two different private keys?

Since I am new to the Cramer-Shoup algorithm, I would like to know: Is it possible to have two different private keys for a public key due the key pair generation algorithm that Cramer-Shoup uses? I ...
0
votes
1answer
57 views

Is constructing IND-CCA2 public key encryption schemes particularly easy with the KEM/DEM approach?

After the introduction of McBits, I was interested what security notions are neccessary for IND-CCA2 security of integrated encryption schemes (IES, following the key encapsulation mechanism / data ...
2
votes
1answer
268 views

Is the GOST block cipher broken?

Is the GOST cipher broken or known to be weak and insecure? Please try to simplify your answer since I am a programmer and not a cryptographer and please consider this web page and tell me if the ...
1
vote
0answers
15 views

Are there any paper/human strong crypto systems? [duplicate]

Are there any paper/human executed crypto systems that have reasonable strength? I am aware of a few candidates so far Solitare from Cryptonomicon https://en.wikipedia.org/wiki/Solitaire_(cipher) ...
-2
votes
1answer
51 views

In which step does AES use the key to encrypt data?

AES has the following steps in encryption: SubBytes, ShiftRows, MixColumns, and AddRoundKey and the following steps in decryption: InvSubBytes, InvShiftRows, InvMixColumns, and Inverse of AddRoundKey. ...
2
votes
1answer
75 views

Permuting Small Sized Set in Practice

Imagine we have a set $S$ of $m$ elements and we wants to permutes the set elements. Thus the original position of each element should be unknown after permuting. If we define a permutation function ...
4
votes
2answers
80 views

Is there a signature scheme for the Cramer-Shoup cryptosystem?

I have a project that I have to use cryptosystem and signature scheme for it. I've read about Cramer-Shoup cryptosystem and I want to use it since it is more secure the ElGamal cryptosystem, but, I ...
2
votes
0answers
57 views

search of patterns in key schedules

I am developing a new key schedule, and there is this article (Enhanced Key Expansion for AES-256 by Using Even-Odd Method) where the authors also propose a new algorithm and one of the objectives is ...
0
votes
0answers
42 views

Implementation of digit serial rotators for SIMON cipher?

I am working on architecture of SIMON cipher where I have to use either bit serial, parallel or digit serial to implement the algorithm for each round function and also for sub-key generation. So I ...
2
votes
0answers
97 views

How can I design a cryptographically secure, key-dependent s-box?

I would like to design a cryptographically secure, key-dependent s-box, but I am not sure how. Mainly, because I am unsure about the difference in design compared to a random s-box. What is the ...
4
votes
0answers
122 views

Explanation of part of a visual cryptography algorithm

I have been working on a project involving visual cryptography and I am stuck with the following problem. My question is related to this paper, AN IMPROVED VISUAL CRYPTOGRAPHY SCHEME FOR SECRET ...
2
votes
2answers
202 views

Question about the key in RC4

I am planning to develop a more secure version of the RC4 algorithm. Since I´m not an encryption expert, I´ld like you to help me find answers to the following questions: Does the value of the key ...
-1
votes
1answer
59 views

i cant understand the meaning and the difference between linearity equation and affine and non linearity? [closed]

i cant understand the meaning and the difference between linearity and affine and non linearity equations and what is the meaning of the free term in affine form and how it make the equation non ...
4
votes
4answers
555 views

Are specially designed fonts sometimes used in cryptography?

As a font designer, I was thinking that it would be very easy to design a special font that could either jumble characters of a language (or of a code) or simply (with the features offered by the OTF ...
3
votes
1answer
96 views

Implementing forward secrecy in OpenPGP with public key authentication

I am trying to consider the feasibility of implementing an encrypted file sharing system, which both provides forward secrecy but also allows public key verification. I am stuck on the marriage ...
5
votes
1answer
175 views

Can Alice send Bob a secure message with only DSA and no key exchange?

Suppose Bob has a DSA key pair, and Alice has Bob's public key. Is there any secure way that Alice can send Bob a message only he can read if Bob can not send any reply? I think the answer is no, ...
2
votes
1answer
81 views

Finding keys of modified DES encryption

This is a question I had in my exam today, and I'll be glad if someone can help me to find the answer. A student built an encryption algorithm (something between DES and 3DES), in which the ...
3
votes
1answer
179 views

Why don't use random padding in RSA?

Consider the following scenario: Sender S sends a message to receiver R. He uses a hybrid encryption scheme with RSA as key-encapsulation algorithm and AES-256-CTR (4byte-counter) and SHA256-HMAC. ...
3
votes
1answer
301 views

Has anyone heard of matrix-based “Russian Doll” encryption techniques?

I've been told that prime-number factoring is based on a "russian-doll" sequence of matrices, where a seed matrix of height Y and width X exists consisting of all zeros except for a single 1 at row Y ...