All Questions

1
vote
1answer
22 views

Hash collision using the leading 40-bits of SHA-1

I am trying to implement Floyd's cycle finding algorithm for finding a leading 40-bit hash collision in the SHA-1 algorithm. However, my code will not find a repetition even with 800,000,000 hashes. ...
2
votes
1answer
31 views

Committing Bilinear equation in Groth-Sahai framework

Groth-Sahai framework enables us to commit to QE, MSME, PP equations. Now, is the equation below committable in GS framework? A bilinear map $e: G_1 \times G_2 \rightarrow G_T$. $g_1 \in G_1$ and ...
1
vote
1answer
63 views

Encryption of big files in Java with AES/GCM

I have to encrypt big files. Say their size ranges from 500mb to several of gigabytes. I would like to use AES/GCM/NoPadding as provided by Java 1.8 since that gives me automatic authentication and ...
0
votes
1answer
37 views

Java: How to handle authenticated encryption for big files

First I need to mention that I can't use BouncyCastle to implement this solution. I have to encrypt files into the file system. Those files are not going to be tranfered over the wire to any other ...
0
votes
0answers
6 views

CBC-MAC, possible attack that violates computational resistance

received this question in an assignment and figured the wizards of crypto.stackexchange could give me some useful and relevant input. Suppose an attacker knows three message/CBC-MAC pairs $(M_1 , ...
0
votes
1answer
24 views

Proving correctness of a decryption of a homomorphically summed ciphertext?

I would like to take some additively homomorphic cryptosystem - don't care much which one for now - and encrypt a series of numbers with it. I would then like to (in public) take these numbers, add ...
3
votes
0answers
84 views

What informal indicators exist for estimating the computational infeasibility of cryptographic problems?

When assuming a block cipher primitive is secure, or a number theoretic problem is hard, this assumption is usually based on how far we are from breaking the primitive or solving the problem using ...
1
vote
0answers
16 views

Hybrid fair exchange protocol

A gradual fair exchange (layman term) is a form of fair exchange protocol where Alice will transfer 1 bit to Bob then Bob will transfer 1 bit to Alice. The flaw with this protocol is that the party ...
2
votes
0answers
26 views

Are all binary-additive stream ciphers reciprocal?

I'm writing a thesis focused on Maurer's provably-secure stream cipher. Long story short, this cipher works by expanding a short key into a long keystream and then XORring this keystream with the ...
2
votes
1answer
48 views

What is the difference between order of base point and curve order in EC?

When I was read about the elliptic curve cryptography I found some definition about domain parameter of elliptic curve like the follow. But I did not understand something $p$: prime number. $a, b$: ...
2
votes
1answer
84 views

Calculate the security of a cascade cipher

I’m reading “The Security of Multiple Encryption in the Ideal Cipher Model” and I’m having a hard time understanding something. How do I calculate the bounds of cascade cipher from the following ...
0
votes
0answers
26 views

Cryptographic Operations and Security

sign((M’, TAlice, sign(( encrypt(( encrypt(M, KpbBob), M’), K), TBob), KsBob)), KsAlice) Can you tell me six security-related facts ...
2
votes
2answers
141 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 ...
2
votes
0answers
25 views

Verbatim of early work on public-key cryptography?

In late 1997, the history of public-key cryptography was turned around with the announcement by the CESG (April 2000 archive) that public-key cryptography was theorized in a 1970 note [1] by James ...
0
votes
0answers
11 views

Is there a Javascript and Java implementation of a good CSPRNG

I need to use a cryptographically secure pseudo random number generator in my client running Javascript and in my server running Java. Is there a well-known implementation of a good CSPRNG in both ...
1
vote
1answer
54 views

To prove $r \cdot f_1 +f_2 \cdot (s+1)$ is secure

We define the polynomials $r, f_1,f_2,s \in R[x]$. Where $r$ is a random degree 1 polynomial and $s$ is a random polynomial such that: $degree(s)=degree(f_1)=degree(f_2)$, let $R$ be $\mathbb{Z}_p$ ...
0
votes
0answers
24 views

Difference between signing with SHA256 vs. signing with RSA-SHA256

I play with digital signatures using node.js (server side JavaScript, built on Google's V8 JS engine). There is a "crypto" module included. For test purpose, I created a digital signature of some XML ...
0
votes
1answer
34 views

What happens when cbc+hmac get a replay attack?

If it use AES-CBC and HMAC-SHA256 for message send online, and someone try to replay attack on this message. Can the attack be successful? what will be happen when attacking?
0
votes
2answers
57 views

Availability of a simple limited PRNG algorithm

I am in need of a really simple limited PRNG, that either exists or can easily be created in virtually any language on any platform. It takes only the initial seed, and is only expected to generate a ...
6
votes
1answer
607 views

Elliptic curves for ECDSA

I'm trying to implement parameters generation for ECDSA according to SEC1 v2.0: ...
0
votes
1answer
53 views

AES - Encrypting multiple blocks of files

On my site, users can download files which are stored on public hosting, so I need to encrypt them. A downloaded file is divided into blocks of 1 kB and I want encrypt them individually, using the ...
3
votes
3answers
173 views

How to perform frequency analysis of a substitution cipher using a Base64 alphabet

Let's imagine a cipher that works like the following: Plaintext is encoded to Base64. The characters in the encoded plaintext are substituted with a randomly shuffled character set(A-z, 0-9, -, _, ...
0
votes
0answers
42 views

Is there an “additive” proof-of-work?

I'm trying to find a proof-of-work algorithm with the following properties: If A(1) is a proof of work with Difficulty(A(1))=n (requires n basic operations on average), then one can find a proof of ...
2
votes
1answer
303 views

Forge CBC-MAC given the MAC of two messages and of their concatenation

I found this question about CBC-MAC forging and want to make sure I understand it: Let a and be be two strings of block length one. Suppose the sender sends $(a, \text{CBC-MAC}(a)), (b, ...
2
votes
1answer
216 views

Generalizing a CBC-MAC collision with a common final message block

I found this question from a textbook but I don't really understand what it is asking: Suppose $c$ is $1$ block long, $a$ and $b$ are strings that are a multiple of the block length, and ...
0
votes
0answers
40 views

Should I study advanced abstract algebra and more than elementary number theory to pursue a career in cryptography?

Do I need to study advanced abstract algebra and more than elementary number theory in order to pursue a career in cryptography ? I've already taken a course in abstract algebra, but I'm wondering ...
0
votes
1answer
68 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
38 views

Simple encoding function mapping integers [on hold]

I am trying to analyse the following function. From an integer inputs it generates a series of 5 numbers. When looking at the some valid samples, clearly I can recognize some patterns (42 is ...
0
votes
0answers
22 views

homomorphic paillier cryptosystem vs Elliptic curve cryptosystem

what are the pros and cons of homomorphic paillier cryptosystem compare to Elliptic curve cryptosystem??
1
vote
0answers
44 views

Modes of encryption for hard drives?

What are the currently recommended modes of encryption for large disks? Basic requirements would seem to be that you can update an encrypted sector independently of others, which rules out most ...
0
votes
1answer
75 views

Where have all the cypherpunks gone?

In 1992, cypherpunks was created as a mailing list for activists advocating for cryptography. Arguably, the cypherpunks mailing list was the foundation for the movement and the centre of it all. ...
0
votes
1answer
61 views

DHE key exchange. Is it really secure?

Context I recently came across a video on the net showing the process of key exchange in Diffie Hellmann. Alice and Bob want to communicate. Eve is the (wo)man in the middle. This video is the ...
0
votes
1answer
72 views
+50

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 ...
0
votes
1answer
52 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 ...
0
votes
0answers
21 views

Should I use a key store to keep my symmetric keys

I'm maintaining an application which handles several keys to encrypt/decrypt information. Some keys are used to encrypt text (user passwords, some sensitive data in the db, etc). Some other keys are ...
2
votes
1answer
39 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 ...
0
votes
0answers
17 views

if using cbc+hmac dealing with small size of data(less than 128bit) , will it cause any problem?

if use AES-cbc,HMAC-SHA256, and there is some txt needed to be enc, and I divide this txt into small packages with variable length, then enc them. some of these package can be less than 128bit. Is ...
0
votes
1answer
603 views

Is it possible to determine a PGP public key from encrypted data?

Is it possible to find out which public key was used to generate the message? Scenario is like this : I got data which is encrypted with a public key. Now a "bad guy" hast the encrypted data, and ...
1
vote
1answer
36 views

Is the output of AES-CBC + MAC the same size as the input?

I use AES-CBC and HMAC-SHA256 to encrypt a text file. Will the output be larger in size than the input or will it be the same size? Is it more secure secure if the size of the output is larger?
1
vote
2answers
265 views

What does $\Pi$ represent in cryptography?

I am doing a project in cryptography and while reading a tag generation algorithm for files, I got stuck with the meaning of $\Pi$. The screenshot of the algorithm is inserted below. Here the ...
0
votes
0answers
27 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
0answers
38 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 ...
2
votes
2answers
113 views

How well does breaking multiple DH key exchanges over the same group scale?

Suppose you are running a server with the Diffie-Hellman parameters (so the group G and generator g) generated once. There are ...
0
votes
0answers
28 views

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

While I look for how many characters that can be encrypted using the The elliptic curve ElGamal cryptosystem. of each block found for these lines. But I can not understand Actually in our case we ...
-1
votes
0answers
40 views

Which Encryption Method is used for this stream cipher? [on hold]

Plaintext: 378734493671000 Encrypted: +VZyZlAHP6HAgoaPBrBz +VZ is common on all data there, so encrypted data might be yZlAHP6HAgoaPBrBz I think this is stream cipher? Could anyone tell me which ...
0
votes
0answers
27 views

Find the encryption method from the cipher and plaintext [on hold]

I have been given iogdaybDfD which is a cipher of the word narcolepsy. I need to find the type of encryption that has been applied to narcolepsy to encrypt it to iogdaybDfD. Could anyone advise on how ...
5
votes
0answers
62 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
0answers
15 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 ...
0
votes
0answers
20 views

Java RSA/ECB/PKCS1Padding encryption with .NET [on hold]

I need to encrypt a password on a web site developped in .NET using a public key. The public key is delivered through a Java web service with the information: The key is a RSA key to be used with ...
-1
votes
1answer
54 views

Full Disk Encryption Alternative [on hold]

Since developers of TrueCrypt discontinued their software, i'm looking for a alternative. It should be pre-OS, so that just after Bios, the Password is requested. Like in TrueCrypt. I took a look ...

15 30 50 per page