2
votes
2answers
138 views

System parameters in identity-based encryption

In IBE schemes, the system parameters are $(q, \mathbb{G}, F, \hat{e}, P, Q, T, H_1)$. I don't know $\hat{e}$. For example, in type A pairing… ...
3
votes
2answers
115 views

Best attack on double DES followed by XOR with third key

What is the best attack here? $E_k(m)=DES_{k1}(DES_{k2}(m)) \oplus k3$
3
votes
1answer
91 views

How to correctly encrypt data with proper authentication using AES-256-CBC in php?

I have been using the openssl function for encrypting data with AES-256-CBC in php. I have been able to encrypt it using an unique IV (by generating with openssl_random_pseudo_bytes)for each new ...
-3
votes
1answer
80 views

How to encrypt a number using AES?

How to do padding to input giving to encrypt using AES algorithm if the input is less than 128 bits? I need to encrypt a decimal number such as 10.
4
votes
2answers
157 views

Security of encrypting many short values with AES in GCM mode

We intend to encrypt certain values in a database which holds personal information such as addresses so as to prevent data leakage should the database be compromised. The intention is that each field ...
2
votes
1answer
85 views

Plaintext and ciphertext block sizes

How can you determine the largest plaintext block size and smallest ciphertext size if you used RSA with $n=59768553302699443$ using an alphabet with $27$ characters?
0
votes
1answer
64 views

Can BPS be used to encrypt a single integer, and restrict the output to a certain range?

As per specifications document, "We have the natural restriction that at least two characters must be ciphered, i.e. $b \geq 2$" where each character is represented by an integer of certain ...
5
votes
1answer
176 views

Finding the subgroup in isogeny-based cryptography

Isogeny-based cryptography is one of the newest post-quantum cryptography. Hardness of this system is based on finding isogeny between two elliptic curves. Also this is theorem: Elliptic curves ...
8
votes
5answers
328 views

Which cryptography technique does not increase the size of the plain data?

I want to encrypt some data(text/voice/video) but it is essential that the size of the cipher data remains the same as the plain data. Which techniques can I use, and how secure are these techniques ...
1
vote
1answer
67 views

How to split up $GF(2^{128})$ into smaller fields?

I've heard that it's possible to split up $GF(2^{128})$ into copies of several smaller fields like $GF(4)$ so as to make the math easier in some cases. How do you do that? I know how it works for ...
4
votes
1answer
87 views

How to generate fingerprint for PGP public key

I would like to know how to generate a fingerprint for an openPGP public key. To be clear, I'm interested in how the fingerprint is generated. I'm aware that I can get the fingerprint with a ...
4
votes
1answer
101 views

How does the Flickr length extension attack work?

I am currently reading about the length extension attack on Flickr (pdf) but not understanding what's going on there. ...
2
votes
1answer
71 views

Preserving Confidentiality and Integrity in a Public channel

Let's say I've got two people that are trying to talk in a public channel $A$ and $B$ and they want to preserve their confidentiality and integrity. Which cryptographic algorithm would they want to ...
1
vote
1answer
93 views

What happens if a nonce is reused in ChaCha20-Poly1305?

In ChaCha20-Poly1305, I know that reusing a nonce loses confidentiality and integrity for all messages encrypted with the (key, nonce) pair. However, is security affected for those messages encrypted ...
4
votes
1answer
84 views

Why are obfuscators generally defined to be probabilistic algorithms, rather than deterministic ones?

One possible explanation is, randomness is not going to hurt you, so might as well use it. Also, if we are hoping to prove impossibility, it only makes the result stronger. One other explanation is ...
1
vote
1answer
82 views

Setting up of polynomials for CP-ABE or KP-ABE Access Trees

My question I guess is how the selection is done. A brief explanation with a simple access tree will be very helpful.
4
votes
1answer
169 views

Full encryption of IDs, partial decryption with customer specific key

I am looking for a "partial" encryption/decryption algorithm. Let's say I am encrypting the following List of IDs (long values) $[1,2,3,4]$ (with a secret key) to an encrypted string $e$, I would ...
2
votes
1answer
116 views

Are there any successful preimage attacks?

Are there any successful preimage attacks on any serious cryptographic hash algorithm or at least on serious-looking non-cryptographic hashes (like MurmurHash)?
5
votes
0answers
40 views

An MPC protocol from Elgamal is a good solution a homomorphic multiplication?

I want to compute a multiplication between many secret values and then distribute the result to everyone involved. For this, I thought about an MPC protocol built from Threshold Homomorphic Elgamal. ...
0
votes
0answers
44 views

Solving ADFGVX decoding with only ciphertext

Hi I'm new to the world of crypto and I'm trying to decode a message. I know it is encrypted using the ADFGVX cipher. I also have a ciphertext, but I have no other information given to me. My question ...
0
votes
1answer
35 views

Lagrange Coefficients & Polynomial in KP-ABE

My question is how these concepts relate in ABE. I am assuming that the attributes are used to share the master secret key and only a user with the right attributes for a particular access tree is ...
0
votes
1answer
30 views

What does this advantage statement signify?

In many Attribute Based Encryption papers I see this line... The advantage of an adversary A in this game is defined as Pr[b' = b] − 1/2. Can someone explain what it means to me? I assume it means ...
4
votes
0answers
140 views

Zero-knowledge proof for the product of additive Paillier ciphers

Suppose that Alice received the cipher values: $E(x_1), E(x_2), ..., E(x_n)$ that are encrypted using Paillier cryptosystem by $n$ entities with Bob's public key. Alice computes $E(\sum x_i)$ from ...
4
votes
1answer
152 views

Understanding ransomware – What makes plain-text-attacks or brute-forcing so hard?

Say I have four files. Two are completely unencrypted, while the other two are the exact same files other than that they have been encrypted with (apparently) the same public key (via a ransomware ...
0
votes
0answers
119 views

Complexity using RSA

You encrypt a message using the RSA encryption system as $t^e \pmod n$ , where $t, e < n$ and $t$ is the numerical equivalent of the message. The message is written in a $27$-letter alphabet and is ...
1
vote
1answer
79 views

Perfect Secrecy in Symmetric Key Systems

For symmetric key systems does perfect secrecy imply that all ciphers in the cipher space are equiprobable? I would think not, but I am finding it hard to come up with a counter example.
2
votes
1answer
108 views

Using e-ID Number for Encryption and Digital Signing

I want to use e-ID number for performing Encryption/Decryption and Digital Signing - and in order to do so, I've opted a PGP-oriented approach which goes a bit like this. Generating PGP key-pair ...
1
vote
0answers
20 views

If you use an AES key just once, do you need to use IV, and/or pad the message? [duplicate]

I am developing an application that is going to use AES encryption. Since it is going to use a different key for every message encrypted... Would it be secure to use a constant IV? (i.e null bytes) ...
2
votes
1answer
153 views

Is F' a pseudorandom function when F is composed with G, a pseudorandom generator?

If $F$ is a pseudorandom function, is $F'$ also a pseudorandom function in the following: $$ F'_k(x)=F_k(G(x)) \space \space \text, $$ where $G$ is $a$ pseudorandom generator? Also, does the other ...
4
votes
3answers
125 views

Why are there $2^{56}$ possible DES keys when there are 64 key bits?

On forums I read DES has $2^{56}$ possible keys so it takes x times to brute force it with hardware x. But there are 64 total bits of which are 8 parity bits. But those parity bits are a ...
0
votes
0answers
39 views

Symmetric encryption vulnerable when encrypting and decrypting are the same?

To my understanding, symmetric encryption is where encrypting and decrypting data can occur with the same key. It's possible for symmetric encryption that the encrypting and decrypting algorithms are ...
-1
votes
1answer
49 views

Understanding the cryptography used in a file [closed]

I use a software that stores a raw binary file with information, and exports it to a text file. I have access to the data in the original binary file. You can find a sample of the contents of the raw ...
2
votes
0answers
41 views

Example of Projective Coordinates

Given the affine form of coordinates $(x,y)$ such as $(5,3)$, if I want to convert $(5,3)$ to projective coordinates $(x,y,z)$, should the form of point be $(5,3,1)$? It is triplet not a point, right? ...
1
vote
1answer
86 views

Cycling hashing in PBKDF's and their limitations in strength?

I hope this question isn't too similar to one that's already been asked. I also want to point out I know part the answer already, AFAIK: I just want some expert input on this. Let's model a hash that ...
1
vote
0answers
65 views

Convert projective to affine coordinates in ECC? [closed]

I am working with my project. I use projective coordinates but when I convert to affine coordinates, I can't get it. Can anyone help me? Projective Coordinates $(X,Y,Z)$ to Affine Coordinates ...
1
vote
1answer
72 views

Non-numeric Diffie-Hellman?

It may seem that this is a programming question, but I just need advice on the cryptography side of the question. I want to implement the Diffie-Hellman key exchange algorithm on iOS (since no free ...
1
vote
1answer
43 views

XOR or add in one time pads? [duplicate]

Is there any difference in adding the plain text and key vs using xor instead(apart from the performance improvements)?
1
vote
2answers
152 views

Recommendation for lightweight algorithm for partial message encryption

I have designed a specific client and server program, which sends a file from client to server in 32k chunks. I want to encrypt only part of the data. More specifically: in each 32k chunk passing ...
0
votes
0answers
123 views

Strength of TripleDES (DESede) in Java (Sun JCE)?

I'm introducing Jasypt to a spring-boot project. The default algorithm for storing passwords with it is PBEWithMD5AndDES. Since I've got some reservations on using that cipher, I'm looking into ...
4
votes
0answers
81 views

How can I implement decryption for NTRU homomorphic encryption scheme?

I have come across this paper On-the-fly multiparty computation via on-the-cloud Multikey from Fully Homomorphic Encryption by Lopez-Alt et al., where authors describe a NTRU-based homomorphic ...
4
votes
1answer
102 views

Could we share a secret key using the Birthday problem?

I stumbled upon this code on-line, it seems obvious to me that generating all 2^40 keys in trivial time can always be achieved as can hashing each and everyone of them, using the SHARED Salt that ...
6
votes
2answers
139 views

The difficulty of computing discrete logs

I understand that in Diffie-Hellman it should be hard to compute $a$ given $g$ and $g^a$. In computational Diffie-Hellman, it appears to be hard to compute $(g^{ab})$ from $g^a$ and $g^b$. As for ...
3
votes
1answer
444 views

Should AES.decrypt(ct, wrong_key) return blank or wrong result?

I am trying to use AES as cipher for an application I am building. I am using a JavaScript library (https://code.google.com/p/crypto-js/) to perform encryption and decryption with AES. When I ...
5
votes
1answer
134 views

Encryption scheme like RSA where encryption is the inverse of decryption

In RSA, it is basically equivalent to use the private key $d$ to encrypt as it is to use the public key $e$ to encrypt. They are exactly inverses: $e=d^{-1}$. I need to know, are there other public ...
1
vote
1answer
78 views

SHA256 for large files

I have a hardware engine for SHA256 which can process 64K of data, but the input data size I am getting is around 1MB. What should I do to process 1MB size. What should be my input after 1st 64KB ...
1
vote
0answers
61 views

Diffie-Hellman, RSA and the types of public key cryptography

Are these schemes fundamentally different? Are other schemes fundamentally different in the sense that you can do different operations with them (or the same operations, but needing different ...
0
votes
0answers
33 views

How to calculate unicity distance of Fleissner grille?

I need to calculate unicity distance of Fleissners grille of $M \times M$ size. All I know is that plaint text redundancy equals $2$. The alphabet is not specified. Is it possible to calculate its ...
0
votes
0answers
91 views

splitting the plaintext and ciphertext into blocks

Say I was to use RSA with a given value of n. I choose to split the plaintext and ciphertext written in a 27 letter alphabet into blocks with k and m characters resp. How would I find the largest ...
5
votes
0answers
30 views

OTR AKE protocol implementations security

While looking at the different versions of OTR protocol I discovered a strange thing: there is no trace of the patch for the weaknesses that were noted in “Finite-State Security Analysis of OTR ...
4
votes
1answer
135 views

Determining if Server/Client's TLS configuration is Vulnerable to SLOTH

In the context of SSL/TLS protocol and SLOTH vulnerability. I want to find out if certain websites(webservers) or applications that use TLS are vulnerable. I need some guidance for this. My idea is ...

15 30 50 per page