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
1answer
102 views

IV = Filename XOR CipherKey?

i want to encrypt transparently using Rijndael. So this is, what I thought of and I would like to have an opinion from "Experts" whether this will harm encryption strenght. I am using chunks of 1MB ...
0
votes
1answer
2k 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 ...
0
votes
2answers
662 views

If I have the unencrypted text and the encrypted text, can I calculate the key?

If I have the unencrypted text and the encrypted text, can I calculate the key? It seems logical based on my limited knowledge of encryption that I should be able to... but it also seems like too ...
0
votes
1answer
804 views

Implementing OpenSSL padding

I'm conducting an experiment dealing with differences in padding across different aes operations for my Intro to Crypto class, and the question says OpenSSL uses PKCS5 padding, and that I need to ...
0
votes
1answer
181 views

What does the cipher-text overhead means?

I have two questions here. What does the cipher-text overhead means? Why we were suggested not to encrypts the plain-text itself instead just encrypts only the key (i.e random number)
0
votes
1answer
110 views

what actually the function for e(g,g)^xy

I doing a project using ABE "Attribute-Based-Encryption" but i didn't understand what actually the function for $e(g,g)^xy$. Just tell what's the calculation need to perform here. I gone through no of ...
0
votes
2answers
145 views

Physical Level Encryption

What types of algorithms that are capable of signing a message are out there that run on a physical level, e.g. lacking the infrastructure of a standard PC, no memory, processor or motherboard in the ...
0
votes
1answer
1k views

GPG vs PGP vs OpenSSH and management of them [closed]

What is the main difference of the three? Can I use only one of them for everything (e.g. GPG for SSH authentication) If I encrypt my private key with a pass-phrase, is it strong enough so that if ...
0
votes
1answer
328 views

Matrix Multiplication of Bits

How to multiply the matrix of bits example I have two 4x4 matrices of bits ...
0
votes
1answer
611 views

How to implement order preserving encryption or order preserving hashing [closed]

Does anybody know any free implementation of either order preserving encryption or order preserving hashing? I've found some codes like CMPH but I need to dynamically add new DATA and that's why most ...
0
votes
1answer
30 views

blowfish ecb with openssl doesn't give the expected result

I do the following via the Linux CLI: ...
0
votes
1answer
72 views

A variant of Shamir secret sharing

Suppose implement the Shamir secret sharing as following: we select a degree $d$ polynomial $P$ with a zero coefficient of 0, and all other coefficents selected randomly from $Z_p$; and to this ...
0
votes
1answer
53 views

What cryptographic paradigm is appropriate for this use case?

This is a very newbie question... I have to quickly implement a solution for our application that works like this... We have a binary executable that is given a configuration file. I need to encrypt ...
0
votes
1answer
246 views

Decrypting a small Message using RSA with a Private Key [closed]

If I have a private key of (43, 341). What would be the steps I need to take to decrypt a small message using RSA? I have looked ...
0
votes
1answer
91 views

Is substitution with random prefix codes secure? [closed]

The following paper interests me very much: D. W. Gillman, M. Mohtashemi, R. I. Rivest, On breaking a Huffman code. IEEE Trans. Inf. Th. Vol.42 (1996), pp 972-976. However, unfortunately due to my ...
0
votes
2answers
129 views

Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?

In one of the exercises in [KL] Book I need to tell whether an encryption scheme is secure under an eavesdropper of only one message. Given a PRG $G: \{0,1\}^n \rightarrow \{0,1\}^{n+1}$. The ...
0
votes
1answer
92 views

ElGamal encryption with private key [closed]

Does the encryption with a private key and decryption with a public key works in ElGamal likewise what is done when we use RSA for sender authentication?
0
votes
1answer
111 views

How to store keys for a cascading encryption?

What is the best way to implement a cascade encryption? I'm trying to figure out how to cipher a string (or message) using Serpent-Twofish-AES and then store the keys. I'll provide an explanation, ...
0
votes
1answer
348 views

WIN LM Password Hashes (using John the ripper) [closed]

In a problem set, we've been asked to use John The Ripper to crack a list of Win LANMAN passwords. They are of the following form: 953A55E36AB85C0B9DA92C18555E42E1:0169295E0A6A6B35B2DD9932D10C1978 ...
0
votes
1answer
928 views

My encryption message system & question about security

I made this small tool for make & read easily an encrypted message without nothing to install, just a simple private key like a word or a couple of words to share. (Without say it directly of ...
0
votes
1answer
281 views

How does certificate-based encryption solve key revocation problem?

How does certificate-based encryption solve key revocation problem? For example, if a user accidentally reveals its secret key or an attacker compromises it, the user may request revocation of its ...
0
votes
1answer
85 views

How to choose the appropriate public (i, m) and private (j, m) keys?

I studied some encryption and decryption and I have found some very interesting problem to solve on the internet. I hope I am writing to right site - there are so many in StackExchange otherwise I ...
0
votes
1answer
170 views

Solving congruences using PARI

I'm having trouble finding info in the docs about how to solve a system of congruences. The closest I can find is 'matsolvemod' in here: ...
0
votes
1answer
981 views

AES encryption for images [closed]

Why AES based encryption is not recommended for encrypting images with high redundancy in their content? for example, the encryption of an image which shows a bird in the blue sky. Most of the pixels ...
0
votes
1answer
55 views

Encrypt a Zip File with Caesar Cipher

I'm trying to understand, why the Filesize of a Caesar Cipher encrypted foo.txt.zip File is smaller than a Caesar cipher encrypted foo.txt File. For example: Foo.txt size: 90bytes foo.txt.Caesar.enc ...
0
votes
1answer
25 views

Most efficient conceivable padding mode, and with no padding oracle

When plaintext padding is required, there are various commonly-used padding techniques. It seems the two most used approaches are : Always add at least one byte of padding, and have every byte of ...
0
votes
1answer
153 views

Fast AES-128 on 32 bits encryption

Suppose in AES-128, there are $5$ tables, namely Te0, Te1, Te2, Te3, Te0 which help in fast encryption on $32$ bits CPU. Each table contains 256 numbers, where each number is $4$ bytes. Te4's ...
0
votes
1answer
64 views

GPG & Mcrypt - difference?

in short I'm learning GUI programming in python and thought it could be interesting to make a small GUI for symmetric encryption. Not being mad/mathematical/experienced (take your pick) enough to try ...
0
votes
1answer
144 views

Known plaintext attack on ElGamal encryption

Assume that Alice uses Bob’s ElGamal public key ( = 2, Yb = 8) to send two messages $M = 17$ and $M' = 37$ using the same random integer $k = 9$. Eve intercepts the ciphertext and somehow she finds ...
0
votes
2answers
167 views

RSA decrypting of a huge file by parts [closed]

I need to decrypt a huge file that I own previously encoded by myself with a RSA public key (it's possible for this step using a symmetric algorithm key). Problem is that I can't load it in my ...
0
votes
1answer
96 views

ECDSA: Retrieving non-random k [duplicate]

I have a question regarding the random $k$ number of ECDSA encryption. As far as I know, it is possible to retrieve $k$ (and thus the private key) from two signed messages if both used the same $k$. ...
0
votes
2answers
100 views

Size of p in ElGamal cryptosystem?

In the ElGamal cryptosystem, I was wondering whether the $m$ (message) should be less than $p$ (large prime). Because on decryption, we are getting $m \bmod p$. For $m \bmod p$ to be equal to $m$, ...
0
votes
1answer
150 views

Demonstrating Diffie-Hellman key exchange using only p, A, B;

I'm trying to figure out how to demonstrate DH key exchange using what is given to me. I'm unsure of how to tackle the problem. Question: Demonstrate Diffie-Hellman key exchange. Given p=104933, ...
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 ...
0
votes
1answer
87 views

Biometric authentication [closed]

I see in some “Authentication schemes with biometric” papers that those authors wrote a phase as password and biometric update phase. My question is that why we may needs biometric update phase? Is ...
0
votes
1answer
76 views

Different patterns of different paterns, wildcard [closed]

I'm not realy experienced with programming and such but I am wondering if the following could be implemented in, lets say, python we have the following ciphertext sequence ...
0
votes
1answer
162 views

RSA - Ecrypting the same data with the same public key = same ciphertext?

If an adversary knows my public key and guesses what was my plaintext, can he test for it somehow? The most obvious way is encrypting the guessed plaintext with my public key and the same parameters ...
0
votes
1answer
187 views

RSA Signature - Multiple Use Weakness

I cite from Fundamentals of Computer Security (Chapter 7 on Digital Signature, Paragraph 7.3 on RSA Signatures, page 289): Multiple uses of the RSA Signature scheme tend to weaken it. The way out ...
0
votes
0answers
16 views

Verify signed file using GPG by passing in signature hosted online rather than stored locally (i.e. in keyring)? [migrated]

Is it possible to pass the URL of a GnuPG signature when executing a verify query against a signed file? For example, instead of: gpg --verify file.txt Is there ...
0
votes
0answers
41 views

Need help solving a shift cipher problem?

A three letter alphabet {a, b, c} has probabilities p(a) = .5 and p(b) = p(c) = .25. A shift cipher is applied to pairs of letters. More precisely: plaintexts consist of two-letter sequences of ...
0
votes
1answer
12 views

FEAL-4 Fk Function 4 Rounds

As I understood in FEAL-4 it needs 4 pair of round keys. Which means that we need to launch Fk function 4 times, but the problem occures on the 2nd round. At first round we have original 64 bits key ...
0
votes
0answers
34 views

Is Attribute based encryption sub-class of Identity based encryption [duplicate]

I have a basic question related to Identity and Attribute based encryption. Construction of IBE scheme was first shown by Boneh et al. in 2001 and I think in 2004 Sahai and Waters introduced ...
0
votes
0answers
55 views

Don't Understand these Parameters

I don't understand section 3 of the paper Fully Homomorphic Encryption over the Integers. How can one calculate these paramters and make these equations in pictures into code?
0
votes
1answer
46 views

For calculating the index of coincidence for each sequence

I was learning about the finding the key length reading the following web site... http://practicalcryptography.com/cryptanalysis/stochastic-searching/cryptanalysis-vigenere-cipher/ and I really don't ...
0
votes
0answers
64 views

fuzzy commitment implemenation to make secure biometric template

I want implement some ideas from an article that is about making secure biometric templates using fuzzy commitment and fuzzy vault. I need to implement just the fuzzy commitment (fuzzy commitment is a ...
0
votes
0answers
47 views

P = NP security implications [duplicate]

If someone finds an efficient way (ridiculous or not) to turn NP into P (such as creating multiple universes, saving the one with the correct answer), would we have any good algorithms for encryption, ...
0
votes
0answers
61 views

AES/CBC fixed Initial vector use-case [duplicate]

I am using AES/CBC to encrypt my http cookie. I never encrypt the same cookie value twice so my understanding is I don't need to use a random initial vector - using a fixed initial vector is fine for ...
0
votes
0answers
39 views

Does RSA work properly with non prime factors? [duplicate]

I know RSA should not use non prime factors for p and q for security reasons, but still, just out of curiosity, will RSA work 100% accurately i.e. message encrypted with one of the key produces same ...
0
votes
0answers
44 views

Encryption of numeric value using playfair

I am studying in CSE and in my recent exam paper, A question was asked as: Construct a playfair cipher for Plaintext: semester5 and key:technology. Generally as we are taught yet, there is no ...
0
votes
0answers
225 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...$ ...