Encryption is the process of transforming plaintext using a cipher to make it unreadable to anyone except those possessing the key.

learn more… | top users | synonyms

3
votes
1answer
465 views

Java's SecureRandom & plaintext attack?

Java's SecureRandom is meant to be cryptographically secure, and I know part of that means that the output should not be usable to predict further output. Though, ...
1
vote
1answer
210 views

Is it possible to decrypt double-key crypted file knowing public key and a having one or more original files?

I have some encrypted files with double-key. I know public key and don't know private key. Can I obtain the private key (and decrypt all files) using two version of one file - crypted and decrypted? ...
0
votes
1answer
1k views

AES Algorithm processing time in Arduino vs Raspberry Pi

The Arduino employs an 8-bit ATmega series microcontroller whereas the Raspberry Pi is based around a 32-bit ARM processor, and the Arduino is typically clocked at between 8-16MHz and with 2-8kB of ...
5
votes
5answers
436 views

Do I need to prepare plain text before encryption?

When I want to encrypt chat messages (in ASCII) before sending, whether it brings some bit of security if I add some extra bytes to the message or shuffle it in some way? I can even try to make data ...
5
votes
1answer
631 views

Advantages using Diffie-Hellman or Elgamal

For what kind of usage should we prefer using Diffie-Hellman in order to exchange keys instead of Elgamal, and most important why should we use one or the other? I do not see a clear difference ...
4
votes
1answer
1k views

ECDSA vs ECIES vs ECDH

Recently I started studying ECC and I just loved it. I want to transfer some big data (like 3KB), What is the best method, ECDSA, ECIES, or ECDH (and why)? I am confused, how should I choose between ...
1
vote
0answers
98 views

Can you show how that RSA does/doesn't provide anonymity?

Considering a CPA-secure version of RSA where the ciphertext is just a rundom element from $Z^*_N$. Does that meet the anonymity requirement in which an cpa adversary cannot distinguish between a ...
1
vote
1answer
166 views

Short length asymmetric encryption?

I want to send out short messages to the world which listeners could verify to be send from me. The way this is usually done is to encrypt the message with a private key where the readers decrypt it ...
2
votes
1answer
99 views

Would data be secure if a cryptographically secure PRNG was used for encryption?

For example, say you have a client and server. You use asymmetric encryption to securely deliver two seeds from server to client. Each user then seeds two PRNGs (one for incoming data, one for ...
-2
votes
1answer
95 views

is there an algorithm to encrypt all the datatypes?

Is there an algorithm or technique to encrypt all the datatypes such as (video , image , text , fax, audio ,file,etc...) -one algorithm encrypt every thing-? also if I try to build such this ...
3
votes
4answers
330 views

Is there a way to generate sound one-time pads out of public information?

Is there a way to 'mangle' a public data-source (for example, the current date in YYYYMMDD or the top New York Times headline) to form a one-time pad that will sufficiently hide the pad's source? ...
0
votes
1answer
47 views

Digital Signature with Encryption

Hope it will be clear. I need to digitally sign pieces of information. What I'm currently doing is the following (for each piece of information): Run SHA1 on the information Encrypt the result with ...
2
votes
2answers
217 views

How can A pass a message to B, while preventing a third party from sniffing infos?

$A$ has a message that he wants to send to $B$, without a third party being able to learn the contents of the original message. $A$ encrypts the message and sends it to a server. The server decrypts ...
-2
votes
1answer
64 views

function of crypt called “ICE” [closed]

Using exeinfo, I have identified a function of crypt called ICE. What is it? How can I find ...
-3
votes
1answer
124 views

Storing the activation status of a product and expire details Android [closed]

In my Android application, it's required to store the activation status of the software and keep track of the activation expire date. What is the best way to store this information? Is it safe to ...
4
votes
1answer
310 views

Can you explain Bleichenbacher's CCA attack on PKCS#1 v1.5?

I've studied that the Bleichenbacher's CCA attack on PKCS#1 v1.5. is a base to many versions of attacks in the area. I'm trying to understand that attack, but every explanation I saw starts with the ...
6
votes
2answers
392 views

How does Clifford Cocks 'Non-Secret Encryption' work?

I have read Clifford Cocks "A Note on 'Non-secret Encryption'" and thought I would try to implement this, but I don't seem to be able to get it to work. I'm obviously missing something. From the ...
2
votes
2answers
929 views

What characters does AES output?

From what I understand after testing the Crypto-JS file here: http://crypto-js.googlecode.com/svn/tags/3.1.2/build/rollups/aes.js AES creates encrypted strings that contained letters, both ...
5
votes
1answer
645 views

Why does OpenSSL append extra bytes when encrypting with aes-128-ecb?

Plaintext: Attack at dawn!! Hex: 41747461636b206174206461776e2121 Key: ...
2
votes
1answer
92 views

With Encrypt-then-MAC, and flexible protocols, do I need to authenticate the authentication?

Sorry, the question is not easy to state (or wasn't for me, anyhow). So I'm writing a very flexible format for security. It allows for full choice of cipher, key size, and so on, along with key ...
4
votes
2answers
165 views

Can we say that if $P=NP$ there is no CPA secure public key encryption?

I've learned that public key encryption is based on the problem of Discrete Log (as regard to group theory) which believed to be hard. But, can we say that it doesn't matter on which problem our ...
4
votes
1answer
158 views

Solve a Modular Exponentiation

It might be common, but if we had to solve an equation like this $m=s^{e}$ mod $n$ where $m,e,n$ are known. How can we find $s$. What optimisations could be applied? And what would the complexity of ...
-1
votes
1answer
136 views

Guessing encryption algorithm based on key and ciphertext

Is it possible to tell which encryption algorithm was used, assuming I have a key and a encrypted text? To not complicate the situation let assume we are speaking about symmetric algorithms only. ...
2
votes
1answer
131 views

Hierarchical Encryption

Is there a way to setup a hierarchical encryption using public key encryption? Let's say a higher level user can decrypt messages encrypted by lower level users. Is that possible? I guess it is only ...
3
votes
1answer
87 views

Diffie-Hellman for Encryption

In learning how DH works for cryptography applications, I'm coming across some confusing language. For starters, most of the time DH is discussed in the context of "generating" their shared secret. ...
1
vote
1answer
159 views

Diffie-Hellman: Does the size of the prime modulus depend on the potential size of the secret?

I'm writing my own cryptosystem that uses One Time Pad and Diffie-Hellman to generate keys for the OTP. I am using Rails on the server side and Javascript for the client side. Please don't tell me ...
4
votes
1answer
880 views

Can you explain “weak keys” for DES?

A weak key for DES is a key $K$ such that $DES_{k_1}(DES_{k_2}(x))=x$ for all $x$. I don't get why are the 4 keys $k_1||k_2$: $1^{112}$, $0^{112}$, $0^{56}||1^{56}$, $1^{56}||0^{56}$ considered as ...
2
votes
1answer
127 views

Can you help me with this DES variant analysis?

I'm struggling with some DES variant that I got as an exercise (exercise taken from Katz-Lindell Ex5.14). The variant is as follows: The left half of the master key is used to derive all the ...
1
vote
1answer
65 views

PRP representation size

I'm now studying the block cipher substitution-permutation network construction and realized that it uses several small pseudo-random permutations instead a big one for saving memory (or that is one ...
3
votes
1answer
88 views

What is a Message Transmission Scheme?

I've been given as an exercise to show an encryption scheme that is CCA-secure but is not a secure message transmission scheme. What is a message transmission scheme, and how does it differ from a ...
8
votes
2answers
476 views

Why should I use Authenticated Encryption instead of just encryption?

There are various different modes of operation for block cipher use, some of which provide "encryption" and some of which provide authenticated encryption. Why should I use an authenticated ...
3
votes
0answers
153 views

Increasing the diffusion of the AES-CBC encryption algorithm in pycrypto for python

When encryption is done using the AES-CBC algorithm, the encryption can be thought of as chaining the cipher texts with the previous ones and an IV. However, if its on CBC mode, we give our cipher ...
1
vote
1answer
82 views

How do we arrive to the equation for solving D in RSA?

We have been shown that DE is congruent to 1 mod phi(n). How do we arrive to the real equation for figuring out d that is d = e^-1 mod phi(n). I want to know the entire process. I am just curious, ...
0
votes
2answers
215 views

Why are these techniques not feasible to crack RSA?

For $d = e^{-1} \mod \phi(n)$ $$d\cdot e \operatorname{mod} \phi(n)=1$$ $$d = (e^{-1} \operatorname{mod} \phi(n))$$ With having $e$ and $n$, we can calculate the value of $d$ , the private key for ...
6
votes
2answers
573 views

Using the same RSA keypair to sign and encrypt

The RSA signature operation is basically the same as encrypting with the private key. In particular, both operations use the same kind of keys. Is it safe to use the same RSA keypair both for ...
0
votes
0answers
219 views

Blum-Blum-Shub Cryptosystem

I am given $N$, which is Bob's encryption key. I was able to successfully factor $N$ into $N=p*q$. Alice encrypts a messages for bob and sends $a = [1,1,1,0,0,0,1,0,1,1,0,...]$ $b = 1545164156...$ ...
5
votes
1answer
233 views

Can you help me understand hash-preserving encryption?

I have rather simplistic understanding of cryptography, so I have to beg a pardon in advance if the question has internal contradictions. Imagine data $A$ with a hash $hashA$. This data is encrypted ...
1
vote
2answers
210 views

Shamir's Simple Sharing Scheme - preventing partial recovery of data

In SSSS, if you recreate the original secret with one of the decoder inputs being slightly damaged (e.g. one or two chars incorrect), you receive a slightly damaged version of the original secret. So ...
1
vote
0answers
45 views

AES and Known-plaintext attack [duplicate]

Can you help me to finding some papers that shows AES is secure against known-plaintext attack?
2
votes
3answers
142 views

Help me about Advanced Encryption Standard (AES)

Suppose $E_k$$(a, b, c)$ is encryption of values $a, b$ and $c$ with key $k$ through encryption algorithm AES (AES-128) and each $a, b$ and $c$ are 300 bits integer values. Also Suppose this ...
0
votes
0answers
40 views

Merkle-Damgard transform: necessity of the Length block [duplicate]

The Merkel-Damgard transform append the message length (in blocks) to the message itself and then computing the 'chained hash' algorithm. Does the last block (which contains the length of the ...
3
votes
3answers
418 views

Is there a cryptographic method to add noise to a plaintext instead of actually encrypting it?

I'm looking for a cryptographic technique that instead of permuting a cleartext, would add noise to the cleartext to obfuscate the true text among a bunch of garbage. For example, a list of 10 ...
2
votes
2answers
1k views

How to obtain KCV from the key

Simple question: we have AES 128 encryption and a key. How can we calculate the key check value (KCV)? One example: key is 48C3B4286FF421A4A328E68AD9E542A4 and KCV should be 77DC84. I am trying it ...
1
vote
1answer
95 views

Creating a secure key

Imagine that your lecturer and the undergraduate office have conducted a key exchange protocol after which both of them hold the string $X$. Yet, it is possible that a curious student sitting next to ...
1
vote
0answers
95 views

What scheme will allow merging and splitting the result of a function?

I am wondering if it's possible to have a scheme as follows. Here is the scenario: we have a set of objects (e.g. strings) {O1, O2, ..., On} we have a set of users {U1, U2, ..., Um} each user asks ...
1
vote
2answers
102 views

Encoding multiple fields with same AES key and vector?

I'd like some advice on cryptography best practices. I need to store on my web app the users' credentials (login & password) for 3rd-party sites. I'm using AES-256 with random key and ...
2
votes
1answer
100 views

Authentication of machine before installation (to stop piracy) [closed]

I have a web-software project which needs a bit of protection in form of authencitation… This web based software runs on an intranet. There is no access to the internet from these terminal machines. ...
2
votes
0answers
73 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 ...
4
votes
2answers
207 views

Is the following symmetric design secure?

Assume: $O$ be a reversible random permutation oracle on a finite set and $O^{-1}$ the inverse permutation (pretty much equivalent to a random permutation: What is the difference between a bijective ...
2
votes
1answer
214 views

Is CBC mode encryption vulnerable to a reordering attack?

I know that, if CBC-MAC is used in such a way that the tag is the concatenation of all the blocks' outputs (and not just the last one), it's insecure under CPA for the simplest case of 2 blocks ...