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)

2
votes
0answers
46 views

Attribute Based Encryption [duplicate]

Could someone explain the main differences between Key Policy Attribute Based Encryption (KP-ABE) and Ciphertext Policy Attribute Based Encryption using an example? I know that KP-ABE depends on the ...
2
votes
0answers
124 views

How to break this PRNG encryption scheme? [closed]

Suppose we have the following symmetric algorithm: key = random bits G = PRNG(seed: key) input = [0,1,1,0,1,0,0,0, 0,1,1,0,1,0,0,1] // "hi" in ascii The key can ...
2
votes
1answer
221 views

RSA - PKCS#1 padding - overall correction of algorithm

From PKCS#1, page 24: After we create the EM byte string and convert it to an integer, we then encrypt that integer with RSAEP (page 10) to get the ciphertext (as an integer). My question arrives ...
2
votes
0answers
212 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 ...
2
votes
0answers
58 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 ...
2
votes
0answers
104 views

Is there a mental poker algorithm that does not rely on commutative encryption?

The algorithm for mental poker that I saw on Wikipedia and everywhere else relies on an encryption algorithm such that $E_k(E_j(P)) = E_j(E_k(P))$, but I can't find a modern and secure algorithm for ...
2
votes
2answers
419 views

Elliptic Curve Cryptography Encryption 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 ...
2
votes
0answers
63 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
0answers
66 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. ...
2
votes
0answers
170 views

How can I start the following crypto project? [closed]

(Cryptography: encrypting files before storage in the cloud): The project consists of a software implementation of a method to pre-process a file before storing it on a cloud storage server so that ...
2
votes
0answers
152 views

Multi-round Transposition/Playfair as a secure hand cipher in the computer age

Given that computers can be easily compromised, there is a need for a hand cipher that can withstand computer attack. Clearly the traditional hand ciphers fail. One time pads work. They also have ...
2
votes
0answers
66 views

How good is middle cube method with jumbled digits?

I had to make my own prng for a stream cipher for an inter school science project (I am mentioning that a lot). So I thought of cubing the seed instead of squaring it (like in the middle square method)...
2
votes
0answers
185 views

Encrypted database: how to deal with general queries?

My question is quite related to the concept of homomorphic encryption, which is not practical at all nowadays. In short, I would like to know how to query encrypted databases. Simple queries which ...
2
votes
0answers
110 views

Cipher built from GPU primitives [closed]

Is it feasible to build a cipher (or hash) out of GPU or DSP primitives (e.g. big matrix multiplication, Fast Fourier Transform, big block SIMD, or hardware H.264/AVC codec)? Preferably those are slow ...
2
votes
2answers
405 views

RSA-KEM construction

"Create a random key for CCPA2 scheme, encrypt m, send it along with a PK encryption of the symmetric key. " Say in the process, the KDF is HMAC, then: get a random key (128-bit) C1 = encrypt ...
2
votes
0answers
183 views

RSA encryption and signature padding flaw

This is Oxford's computer security exam question: Suppose that Bob has published an RSA encryption key $ke$ (retaining in secret the corresponding decryption key $kd$), and Alice has published a ...
2
votes
0answers
70 views

Index of coincidence for completely random text over k alphabets

I'm confused about /Friedman's method 2 (using a table with column of k size of key, and n/k rows, n is the total size for cipher text) \begin{equation} m = \Bigl(\varphi(l)-\varphi(o)\Bigr)/\Bigl(\...
2
votes
0answers
578 views

An example of Knapsack Cryptosystem cracks/attacks? [closed]

I have been studying papers on various ways to crack the knapsack cryptosystem, unfortunately the mathematics in these papers involves lattices and LLL which is over my head. The paper "New Attacks ...
2
votes
0answers
68 views

Machine Learning with Encryption [duplicate]

Machine Learning is sometimes associated with cryptography. Many of such cross field studies have been majorly done in use of machine learning for cryptanalysis/decryption. I am interested in knowing ...
2
votes
0answers
93 views

how to truncate a PRF on n bits to PRF on t bits where t < n? [closed]

Dan Boneh's courersa lecture on format preserving encryption at 5.50 mins , talks about truncating a PRF on $n$ bits to PRF on $t$ bits. The approach is by appending $(n-t)$ zeros to input $t$ bits ...
2
votes
1answer
325 views

Bellovin 96' attack on IPsec ESP protocol on encryption only option

Can you explain the actual attack? Why does the attacker need to firstly send some arbitrary UDP packet? How can the attacker break the privacy between A and B? Link: The article of Bellovin I'm ...
2
votes
0answers
124 views

Cryptanalysis not based on method used to encrypt? [closed]

When doing cryptanalysis on RSA or something number theory based, there are various attacks that all seem to involve number theory (Wikipedia: RSA_(algorithm) ~ Attacks_against_plain_RSA). Similarly, ...
2
votes
0answers
837 views

How do I enable AES-NI (hardware acceleration) for Node.js crypto on Linux? [closed]

I wrote a basic function to test the speed of the AES-256-CBC mode of the Node.js built-in crypto functions. These functions use OpenSSL, so they should support AES-NI, but when I correctly enable ...
2
votes
0answers
139 views

Ideal system for an encryption scheme

What is the ideal system for an encryption scheme? For a pseudorandom permutation the ideal one is a random permutation, for a pseudorandom function the ideal one is a random function. For an ...
2
votes
0answers
103 views

Is this any recognizable encoding or cipher? [closed]

I've been watching the Marble Hornets videos on YouTube (basically, an independent film series about a group of kids chased by the "Slender Man"), and in this video I saw something interesting. ...
2
votes
0answers
127 views

How well analyzed are giant block length ciphers?

I have heard about ciphers that have a block length of 256 megabytes... That is huge. How well are they understood by the encryption community? I'm referring to PMC Ciphers. Has anyone used such a ...
2
votes
0answers
180 views

How can I prove that this encryption scheme from a random oracle is secure?

I am reading this example: A random oracle is an ideal object. What makes a random oracle convenient for proofs is the part about knowing nothing on the output for a given input if you do not ...
2
votes
1answer
205 views

Messages of different lengths and one-time computationally-secret

I'm preparing myself to exam, but I have a lot of troubles with rigorous proofs. Let $\Pi=(Gen,Enc,Dec)$ be an efficient secret-key encryption scheme that is not fixed-length. That is, for any $n$ ...
2
votes
2answers
256 views

How to construct a variable length IND-CPA cipher from a fixed length one?

Suppose we can construct a secure (IND-CPA) encryption scheme for fixed length messages. I was wondering if there is a natural way to extend this construction for messages of variable length such that ...
2
votes
0answers
202 views

How do I encrypt with the private key? [duplicate]

Possible Duplicate: RSA encryption with private key and decryption with a public key This wording is creeping everywhere (e.g. there): "I encrypt with the private key" and even sometimes, "I ...
2
votes
1answer
76 views

How to construct the blind factors in practice?

I'm Implementing a protocol that uses masking techniques (or blinding factors), so we can mask a value $y_0$ as $m_0=y_0 \cdot r_0$ where $y_0 \in \mathbb{Z}_p$ and $r_0 \stackrel {R}\leftarrow \...
2
votes
1answer
484 views

problem with “one time pad” [closed]

I am a french student and I read the post on the forums (How does one attack a two-time pad (i.e. one time pad with key reuse)?). I need your help if possible. I 'm 11 encrypted messages , all ...
2
votes
2answers
324 views

Reordering non-block-aligned parts with DES in ECB mode

I was given a ciphertext file which was encrypted using DES in ECB mode. It is known that the plainttext that was encrypted has the following form: Each line of text consists of a payroll followed ...
2
votes
2answers
855 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
3answers
1k views

Does knowing common prefixes help crack blowfish?

I have strings that are if the form: {static data}{changing data} The beginning static data part is around 20 characters and is common to all strings. The last ...
1
vote
3answers
149 views

Any benefit to writing a message as a mix of 2 languages before encryption?

For example, imagine a message that is a mix of Japanese and English words; Japanese in unicode, English in ASCII. Japanese doesn't use spaces between words. The sentence structures, anything ...
1
vote
3answers
710 views

Brute-force attacking One Time Pads feasible?

I have a ciphertext encoded with One Time Pad. I do not know the key. How can I find the possible keys which when decoded, will result in a meaningful plain text?
1
vote
2answers
1k views

Custom crypto library in C

I will be making (in the near future) an app that will contain some pretty heavy crypto. As it is possible that my app will be ported to different devices (initially it will be iOs only, but Mac, ...
1
vote
4answers
2k views

“Padless” One-time-Pad encryption

I have just read about the perfect security of an OTP encryption and what came to my mind was that what if the Pad used for encryption/decryption did not have to be transported separately from the ...
1
vote
3answers
2k views

Which attacks can be avoided by the use of OFB instead of ECB?

For a file encryption program, I was told to use Output Feedback mode (OFB) instead of ECB (Electronic code book) mode. Which attacks can I avoid by this choice?
1
vote
4answers
147 views

Is it safe to use XOR to encrypt data key using master key

I am implementing a hierarchical key system with a randomly generated master key and many randomly generated data keys that should be encrypted using the master key. I am wondering what the best way ...
1
vote
2answers
90 views

What does the comma mean in m, c := E(K, m)

Disclaimer: I'm a beginner to cryptography. Background: I'm reading Cryptography Engineering by Ferguson, Schneier, and Kohno, where the authors use this image: Question: What do the commas mean ...
1
vote
2answers
88 views

Concerns about use of MAC in my specification

Here is the pseudocode for a routine I am designing: ...
1
vote
1answer
408 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?
1
vote
2answers
496 views

ElGamal: Generation of “g” value?

I haven't been able to find a clear explanation on this (and I'm probably just confused in general). I have the following parameters of ElGamal signatures: $p$ = safe prime $q = (p-1)/2$ $g$ = an ...
1
vote
4answers
328 views

Message exchange with textbook RSA

I am working on this exercise but can't work out the answer to the question b. I have solved the question (a) by decrypting the ciphertext $C = 2$ using the formula: $$ M = C^d \bmod n = 2^{17} \bmod ...
1
vote
1answer
313 views

If you encrypt an image (AES), is it still an image and can you view it?

Can you encrypt an image (with AES) such that you can open it as a png/jpeg?
1
vote
1answer
67 views

Plaintext for randomness evaluation of cryptographic algorithms?

I’m running an experiment to test the randomness output of many cryptographic algorithms based on INST test suite to measure the randomness of their outcome. However I’m searching to a sample data ...
1
vote
1answer
40 views

Why does OpenPGP encryption produce different ciphertexts from the same plain text?

With the same plain text to be encrypted and the same public key, OpenPGP tends to produce a different ciphertext every time I run the encryption operation. Why is this?
1
vote
2answers
69 views

Theoretical security of bit rotation for encyption

This is a theoretical question. I have a idea, encryption by bit rotation in byte. Do not know if something like this already exists. General concept is: First n bytes is rotated to left or right ...