0
votes
0answers
22 views

Recipient ID asked whie using Symmetric encryption with GnuPG [migrated]

I'm trying to encrypt a file using AES algo and sign it using my private key in GPG. The command I'm using is gpg --encrypt --symmetric --cipher-algo aes256 --armor --sign input-file It asks me for ...
1
vote
1answer
121 views

Recover plaintext from truncated ciphertext using AES for FPE

I am trying to implement an FPE for a 19-digit long number. I am trying to follow the lecture of Prof. Dan Boneh and here is how I understand it: Get the nearest power of two greater than $10^{19} ...
0
votes
1answer
82 views

Addition / Multiplication modulo 13

I am currently studying Diffie-Helman protocol. In my lecture notes I have a generator g=2 and I'm in group $Z_{13}^*$ . There I calculate a remainder cycle from 1 to 12 with $r =g^i \mod 13 \forall ...
0
votes
1answer
97 views

Python. RSA common modulus attack problem

I have: N = /*500 decimal numbers*/ E1 = 3740453 E2 = 4226171 M^E1 = /*500 decimal numbers*/ M^E2 = /*500 decimal numbers*/ I must use RSA common modulus ...
14
votes
6answers
4k views

Types of Cryptography for a 4-8 bit microcontroller

This is more of a research question. I was wondering what types of crypto algorithms would work best on a small 4-8 bit micro controller. I recently read a paper called Security Considerations for ...
1
vote
0answers
52 views

Recover a secret message in a .wav file [closed]

First, I apologize for my english, I'll do my best. On my computer, I got a .wav audio file that hides a secret message. I want to recover that message. But I'm stuck and I need your help :). My ...
0
votes
0answers
68 views

How does hash function in Elgamal signature scheme prevent existential forgery attack?

I have heard that hashing the message M prevents an existential forgery attack. I was wondering how.
6
votes
0answers
124 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
15 views

Change of axis positions in Vigenere Square

Is there any history of codes in which there have been changes in the normal axis positions of the Vigenere Square? Have been working on a code which has two non-normal positions -- one with the ...
1
vote
2answers
494 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
104 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. ...
1
vote
2answers
166 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 ...
1
vote
1answer
77 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 ...
2
votes
2answers
195 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 ...
1
vote
1answer
58 views

What Java actually stores inside Keystore when generating Keys?

When we use Keytool to generate a Keystore to store Private/Public keys, what Java actually stores inside the Keystore file ? I ...
0
votes
1answer
65 views

Checking the share membership in secret sharing schemes

I was thinking of this since yesterday. Imagine, a secret is split into its respective shares (using any secret sharing scheme) with threshold $t$ and total $n$. Can we find out given any random ...
2
votes
2answers
278 views

Which attacks are possible against raw/textbook RSA?

The PKCS#1 standard defines multiple padding schemes for signature generation/verification (EMSA-PSS and EMSA-PKCS1-v1_5), and encryption/decryption (EME-OAEP and the less safe EME-PKCS1-v1_5). ...
0
votes
0answers
37 views

java.util.Random and Dice Rolls

For this question, a dice roll will be considered two 6 six sided dice, to give a possible output of 2-12. Given a java.util.Random instance r, the output of one roll would be: ...
0
votes
0answers
27 views

Designing hash function in space-efficient identity based encryption

Let $n$ be an RSA-prime and we know prime factorization of $n(=pq)$. The hash function is the current context maps from a given user identity(id) to a positive integer less than $n$, whose jacobi ...
0
votes
1answer
79 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 ...
-1
votes
0answers
29 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 , ...
1
vote
1answer
47 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
89 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
25 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
43 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
75 views

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

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$: ...
0
votes
0answers
76 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 ...
1
vote
0answers
27 views

Is there a Javascript and Java implementation of a good CSPRNG [closed]

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 ...
0
votes
1answer
43 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
71 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
628 views

Elliptic curves for ECDSA

I'm trying to implement parameters generation for ECDSA according to SEC1 v2.0: ...
0
votes
1answer
73 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
202 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
57 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
334 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
219 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
1answer
101 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 ...
1
vote
0answers
59 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 ...
1
vote
1answer
112 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
112 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 ...
0
votes
1answer
54 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
1answer
49 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
22 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
625 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
44 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
273 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
37 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 ...
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
43 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 ...
6
votes
0answers
80 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 ...

15 30 50 per page