2
votes
1answer
91 views

Do data-dependent rotations have any advantage over fixed rotations?

There are many ARX ciphers, however most use fixed rotations. I know data-dependent compared to fixed rotations are: patented harder to implement constant time more expensive in hardware harder to ...
2
votes
2answers
237 views

Is there a way to systematically calculate the public exponent $e$ in RSA?

I'm learning RSA in one of my classes and we were given a problem: $p = 5$, $q = 11$ I have done the following steps: $n = 5 \cdot 11 = 55$ $\phi = (5-1)\cdot(11-1) = 40$ I know that to ...
0
votes
0answers
59 views

Elliptic curve trapdoor function without modular arithmetic?

From what I understand, an elliptic contains a set points satisfying the equation $y^2=x^3 + ax + b$ together with the point at infity. It seems clear how multiplication with a scalar and a point ...
0
votes
1answer
101 views

How many characters per block in an El Gamal ECC cryptosystem?

Looking for the number of characters that can be encrypted using the The elliptic curve ElGamal cryptosystem of each block, I found these lines. But I cannot understand them: Actually in our case ...
0
votes
0answers
84 views

CP-ABE: structure of the secret key SK

I am working on Ciphertext-Policy Attribute based Encryption (CP-ABE) and I need to understand how a secret key looks like. For example, assume that the universe of attributes is defined to be ...
1
vote
0answers
101 views

Interactive assumptions not falsifiable?

Can someone explain why an interactive assumption is not falsifiable? Maybe I'm misunderstanding what the statement means, but isn't even a non-interactive assumption interactive, but just with a zero ...
7
votes
1answer
152 views

Malicious DH groups

Can an attacker construct a DH group, large enough to be considered secure (say, a modulus of 2048-bits), such that the group appears safe, but the attacker is able to solve the DLP in the group ...
0
votes
1answer
57 views

special public keys and modulo n

I just picked up cryptography and have some questions on RSA cryptosystem: Say there are two public keys (n, e1), (n, e2), e1 is coprime to e2. They share the same n. Is it possible to find the ...
2
votes
0answers
133 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 ...
0
votes
0answers
85 views

proving the security of 1 out of 2 oblivious transfer using AND function

Hello ladies & gentlemen, I need to improve the security of 1-out of 2 oblivious transfer using AND function method with a given info. use one-out-of-two oblivious transfer as building block, ...
0
votes
2answers
80 views

Bouncy jdk 1.51 Serpent KAT tests vs Nessie vectors

Having a little trouble getting Nessie vectors working with the Bouncy Castle SerpentEngine. Do the Nessie vectors require a mode or some pre-processing? Nessie Serpent 128, set 1, vector 0 reads: ...
0
votes
1answer
56 views

what does rsaSha512Sign do?

I have the following function: ...
0
votes
0answers
85 views

Key generation in Digital Signature Algorithm

In DSA, one needs to generate two primes $p$ and $q$ such that $q$ is $256$-bit and $p$ is $3072$-bit and $p-1$ is a multiple of $q$. Question: How to generate such $p$ and $q$. Attempt: First, use ...
1
vote
1answer
84 views

Many single-time use keys encryption scheme (not Shamir's Shared Secret)

I'm looking for encryption scheme with the following properties: There's a sequence of keys that can be used to decrypt the message Strictly only one key from the sequence is required to decrypt the ...
-1
votes
1answer
379 views

Collision resistant hash functions

Let (Gen1,H1) and (Gen2,H2) be two hash functions. Define (Gen,H) so that Gen runs Gen1 and Gen2 to obtain keys s1 and s2, respectively. Then define Hs1,s2(x)=Hs1(x)||Hs2(x). a) Prove that if at ...
0
votes
1answer
191 views

Solving a quadratic equation for a variant of Rabin

My understanding of Rabin We have $p$ and $q$ which are distinct primes congruent to $3 \pmod 4$. Then we have $n = pq$. Encryption is done as $e(m) = m^2 \pmod n$, where $m$ is our message. ...
0
votes
1answer
160 views

Secure Multiparty Sum in malicious model using threshold encryption

Suppose $n$ actors each hold a plaintext $p_i$. We wish to find $\sum p_i$, without leaking any information about individual $p_i$. Any actor (or any link in the network) could be controlled by an ...
1
vote
1answer
336 views

BruteForcer XOR (bfxor.exe) to attack 64-bit keys and longer

First of all, this is not a beginner's question since I already know a good deal about encryption and brute-force attacks. This is also no question on how to code programs for brute-force attacks ...
0
votes
1answer
151 views

OpenSSL RSA same plaintext but different ciphertext

how OpenSSL RSA work ? I generate public (n,e) and private key (n,d) then I encypted a file by : ...
0
votes
1answer
61 views

plaintext distribution ,perfect secrecy cryptosystem

I have been trying to solve the next problem: let pi be a perfect secrecy cryptosystem with specific plaintext probability distribution. How to prove pi will have perfect secrecy for all other ...
1
vote
1answer
187 views

fully homomorphic encryption (FHE)

Please, I would like to find some hints or solution to my following problem, I would appreciate your assistance to walk with me throughout the solution Given fully homomorphic encryption (FHE) ...
0
votes
1answer
224 views

Why sorting is needed for Meet-in-the-middle attack

The weakness of double DES, E (k1, E(k2, M)) is that Meet-in-the-middle attack is possible. When performing Meet-in-the-middle ...
0
votes
0answers
95 views

Importance of ShiftRows in AES

If ShiftRows is excluded from AES, then an attacker can attack the modified AES by simply treating $128$-bit input as $4$ $32$-bits blocks. The attacker can attack these $4$ blocks separately. ...
1
vote
1answer
148 views

extract ciphertext from encrypted SMIME file

the main question of this message is how to get the true ciphertext from S/MIME file? I created RSA keys and encrypted a message with S/MIME as follow : ...
1
vote
2answers
97 views

Secure symmetric encryption algorithm for any-size base62 data

I am searching for a secure algorithm to encrypt base62 (or any other base) data for ids in urls. It should feature: No blocksize etc, limiting the length of the message to a factor of n If you ...
2
votes
1answer
181 views

Block cipher to encrypt 8 bytes/64 bits - Use 64 or 128 bit cipher?

Here's the problem: I have a transport stream that I have been requested to encrypt between the transmitter and receiver. The data size is at most 8 bytes so it seems I can only use ECB as I only have ...
2
votes
2answers
67 views

Checking both Quadratic residuosity and Jacobi symbol simultaneously and efficiently

I have to randomly generate a number $u$ such that $u \in J(N)-Q(N)$ where $J(N)$ denotes the set of elements less than $N$, whose Jacobi symbol value is equal to 1; and $Q(N)$ denotes the set of ...
9
votes
2answers
180 views

Why is Poly1305 popular given its 'sudden death' properties?

ECDSA has the undesirable property that if a key pair reuses a nonce in a signing operation, the cryptosystem experiences catastrophic failure in the form of private key leakage. I've heard this ...
0
votes
0answers
324 views

Decrypting A Cipher Text without knowing the key or plaintext

i'm new to cryptography and i am doing a research based on cryptanalysis of vigenere cipher. If i have a ciphertext which is encrypted using vigenere cipher, is it possible for me to decrypt the ...
0
votes
1answer
99 views

How does chosen ciphertext attack on Elgamal work?

Can it be proven that attacker can obtain the full message if he knows some plain-ciphertext pairs?
1
vote
0answers
97 views

Complexity to find an preimage of a hash function

Suppose a hash function based on Merkle-Damguard construction. Its compression function is given as $H_i=E_{m_i}(H_{i-1})$, where $E_{m_i}()$ denotes the encryption of an ideal block cipher with ...
3
votes
2answers
4k views

Why we can't implement AES 512 key size?

Out of curiosity why we can't implement AES 512 key size? Please explain somehow i can understand! I'm not an expert.
1
vote
1answer
181 views

Key derivation for AES-Encryption key and HMAC

Okay so I have two options for how I would derive two keys for AES encryption and HMAC they are as follows: Run BCrypt on a users passphrase and then use the bouncy castle implementation of HKDF in ...
2
votes
1answer
102 views

How many of primitive point on the elliptic curve?

In elliptic curves for cryptography, I know $nG=O$, where $G$ is a base point represented by $G=(x_g,y_g)\ on\ E(F_P)$, where $n$ is Order of point $G$. For example, $P(0,6)$ is a primitive point on ...
0
votes
1answer
99 views

Best practices (if any) to add metadata to encrypted files

I am encrypting files using AES/CBC/PKCSPadding, with 256 bits long keys. So far the first 16 bytes of each encrypted file are the IV. I would like to store some more information regarding the ...
1
vote
1answer
133 views

How can CBC-MAC be secure when message length is fixed?

I was doing some self-initiated knowledge gathering about digests, signatures and hmacs and I ran across the fact that you can use CBC as a MAC, but if the message size is not fixed; then it is not ...
0
votes
1answer
99 views

Fairness in cryptography [closed]

Two users A and B decided to share a file of same size and transfer data bit by bit. And at the end of exchange, A will have B's data and B will have A's data. Assuming, A starts to transfer the ...
0
votes
0answers
95 views

CCA security of a system that splits messages and encrypts each packet

Propose a symmetric key based crypto-system for implementing a secure email system. This system is based on AES and CCA secure. Suppose that you have to encrypt a large message and that this message ...
0
votes
0answers
109 views

The Inhomogeneous Short Integer Solution (ISIS) problem with a clue

The Inhomogeneous Short Integer Solution (ISIS) problem is as follows: given an integer $q$, a matrix $A \in \mathbb Z^{n\times m}_q$, a vector $b\in \mathbb Z^n_q$, and a real $\beta$, find an ...
2
votes
2answers
114 views

What is primary security in ECC?

I read the following paragraph in a book about Elliptic Curve Cryptography, but didn't understand it: The primary security in ECC is the parameter $n$; where $n$ is Order of point $G$, that is $n$ ...
2
votes
0answers
177 views

Consequences of AES without any one of its operations

Suppose AES-$128$. There are $4$ operations in AES's encryption, they are SubByte, Shift Row, MixColumns and AddRoundKey. Question: If I remove one of the following opearations, what will happen to ...
8
votes
5answers
1k views

Perfectly secret cipher can leak about the key?

As defined by Shannon, a cipher is perfectly secure if ciphertext leaks no information about the plain text. Under this definition, can ciphertext leak something about the key? Are there any ciphers ...
1
vote
2answers
46 views

Condition on Vector Boolean Function to be Bijective

Suppose the vector boolean function be $$\begin{align} f:F^n_2 \longrightarrow F_2^n \\ (x_1,\dots ,x_n) \longrightarrow (x_2,\dots x_n,g) \\ \\ g:F^n_2 \longrightarrow F_2 \\ (x_1,\dots ,x_n) ...
3
votes
2answers
116 views

Strange MAC algorithm

I'm working with a payment provider which uses the following algorithm for signing messages: The merchant is securely given a secret key k, known to them and the ...
3
votes
1answer
404 views

AES with weak keys

Suppose that the key generation is insecure; each key bit is independently generated, but the value of each key bit is '$1$' with probability $0.90$. These keys are used in AES. What is an efficient ...
7
votes
1answer
126 views

Verifiable, Distributed Secret Santa Assignments

My family was planning a secret santa and I thought about how I might write a little web app to dole out these secret assignments. But the downsides to this approach are obvious: there's no way for ...
0
votes
1answer
211 views

Blowfish ECB mode: Tools for known-plaintext attack?

I'm currently dealing with multiple blowfish-encrypted files that share the same key. All are encrypted using ECB mode judging from their appearance. I don't know what the key is but I know 64 byte ...
4
votes
1answer
195 views

Are post-quantum cryptographic ciphers *also* secure if the P=NP conjecture holds true?

First of all, I only understand the P versus NP debate on a rather shallow level as I am not a computer scientist. So perhaps the answer to the question is straightforward but if not, I would be ...
1
vote
3answers
104 views

How a file is encrypted?

I thought encryption algorithms(like AES) are used to encrypt texts,so how a file or folder(containing pictures,videos,...) is encrypted?What is encrypted exactly?
0
votes
0answers
26 views

Hokkaido (proof-of-Work system) and pseudo-random permutation table

This question is regarding a proof-of-work system suggested in this article "Cryptology ePrint Archive: Report 2005/356". The outset goal of the Hokkaido algorithm is to provide a task to somebody's ...

15 30 50 per page