2
votes
0answers
26 views

Cryptographic Algorithm [closed]

I'd like to find out the cryptographic algorithm which uses only lowercase letters and numbers to encrypt a message, and it has 256 bits (always). For example: fff51ebcad2c44c75d7d5d4c5184b3e4
1
vote
0answers
29 views

Simple Code Salsa20 in java [closed]

i am doing some simple research in cryptography. i need simple salsa20 in java without libr (in 1 class). can some one give me simple code to encryp and decryp plaintext from byte[] in java?
5
votes
1answer
225 views

ECDSA key recovery - floating point values

I'm currently attempting to recover an ECDSA key. I have $m$, $m'$ and signatures $(r, s)$, $(r', s')$, and I know that $k$ is constant, the curve is NIST P-192 and the hash function of the. As such,...
3
votes
1answer
87 views

How to hash a set of elements

Imagine the following senario. We have $n$ participants. Participant $i$ has a set of elements $S_i$ with the elements being in a random order, possibly different for each participant. The ...
2
votes
1answer
55 views

Term for the ratio of ciphertext to plaintext size?

Is there a term that determines the ratio of size of ciphertext $|c|$ and plaintext $|n|$? I vaguely recollect reading it as scale out factor. Is there a better term? Or a popular term for this?
5
votes
1answer
88 views

Practical multivariate quadratic FHE – how does it compare to other FHEs?

Came across this startup claiming practical FHE and then their blog post going into some additional details on it. It was my understanding that practical FHE is still years/decades off. They said ...
2
votes
2answers
60 views

Probability of hash collision in exhaustive mapping from input to output

Suppose I had a hash function which produced a 256-bits output for any given input (such as SHA-3-256). Now suppose i did an exhaustive mapping from every possible 512-bits input to a given 256-bits ...
5
votes
1answer
74 views

AES with shuffleBytes instead of shiftRows

I was examining how AES provides diffusion and noticed that indices of the shiftRows transposition step can be modeled as inputs/outputs of a 4x4 table: ...
1
vote
1answer
54 views

Comparison on Ciphertext with Helib

Is it possible to do a greater than homomorphic comparison in the form ($c_1 < c_2$) on two ciphertexts using Helib? The equal comparison ($c_1 == c_2$) can be done in modulus 2 by adding both ...
3
votes
0answers
32 views

Combining AES-SIV and a password-derived key

I use the following scheme to encrypt and authenticate a 64-byte piece of data $P$: $$ C = \textrm{AES-SIV}(K, \textit{AAD}, P) $$ where $AAD$ is a string of 48 bytes, of which 21 bytes are a random ...
4
votes
1answer
202 views

PBKDF2 PRF: HMAC or just hash?

I understand the way $\textrm{PBKDF2}$ can be used to 'stretch' a password/passphrase that does not provide full entropy. My question: how does one choose the PRF? A common choice is any well-known ...
1
vote
1answer
252 views

Is there a administrator key that can decrypt all ciphertexts encrypted with different keys by different persons in a group?

here is the scenario: $A, B, C, \ldots, Z$ are in a group with a administrator $Admin$, each of the users in the group has his own key $Key_A, Key_B$, and so on... everyone encrypt his own ...
0
votes
0answers
50 views

What are the most appropriate PKI based cryptographic protocols for peer to peer communicaton?

I've been trying to find out which is the most appropriate PKI based cryptographic protocol for peer to peer communication. I do understand that they vary with respect to the peer to peer architecture ...
3
votes
2answers
69 views

Is it possible to securely combine multiple hashes without hashing them?

Let's say we have 1000 files and 1000 already computed cryptographic hashes for those files. Now we want to derive a single hash that authenticates all of them. Is there a more efficient way to do ...
3
votes
1answer
57 views

If I don't use XOR in Davies–Meyer, does it remain collision resistant?

If I don't use XOR in Davies–Meyer construction like in picture 2, does the function remain collision resistant?
1
vote
0answers
39 views

Key Distribution Center Key Protocol Analysis

As shown in the image, why is Circle 1 to be B and Circle 2 to be A? Why is not the opposite, that is, Circle 1 to be A and Circle 2 to be B? like this picture From my understanding, Notation B in ...
2
votes
2answers
101 views

How does this affine cipher work?

I have a question about how I need to solve the following: A sentence has been changed to ASCII and then encrypted with the formula $E(x) = ax + b \bmod 256256$. All I know is that the first 4 ...
2
votes
1answer
70 views

Where in FIPS documents stated that SHA-1 is not secure?

SHA-1 is not secured for a very long time, but I still can see it here: http://csrc.nist.gov/publications/fips/fips140-2/fips1402annexa.pdf Where in FIPS documents stated that SHA-1 is not secure?
4
votes
1answer
88 views

Is this a better involution S-Box for the Anubis cipher?

After swapping random indexes of trivial involution $S[x] = ¬x$, I found the following involution S-Box with a non-linearity of $98$ and a differential uniformity of $6$. Is there an upper limit to ...
2
votes
1answer
34 views

Am I correctly understanding TLS 1.2 PRF (Pseudorandom Function)?

According to RFC 5246 Section 5 PRF(secret, label, seed) = P_<hash>(secret, label + seed) and ...
2
votes
1answer
29 views

First preimage resistance check

So I have $H: \{0,1\}^* \rightarrow\{0,1\}^n$ a hash function resistant to the second preimage and to collisions. Let there be a function $H' : \{0,1\}^* \rightarrow \{0,1\}^{n+1}$ with the following ...
7
votes
2answers
386 views

Does AAD make GCM encryption more secure?

Does AAD make AES GCM encryption more secure? What if we drop AAD in AES-GCM 256? If we drop it, how will it make the encryption less secure?
1
vote
1answer
62 views

Factorization of RSA modulus using a qubic residue

Suppose that someone uses RSA with $n = pq$, exponent $3$, also $3$ divides $\varphi(n) = (p-1)(q-1)$ and $2$ different roots $y$ and $z$ of the equation: $$x \equiv c \ (mod \ n)$$ are known (for ...
3
votes
0answers
30 views

How feasible is a preimage attack or speedups to brute force a substring of MD5?

Beyond the birthday problem analysis how feasible is a preimage attack or speed up brute force on a substring of MD5. For instance let's say from the 128 bits I decide to strip 24 bits, the first four ...
0
votes
0answers
4 views

Meeting people interested in Crypto and Programing [migrated]

I have done some basic Micro controller programming in the past. I am now just starting to learn C++ and plan to move into Java and SQL eventually. I just got done reading one of Simmons books. It was ...
1
vote
1answer
38 views

Why does OpenPGP encryption produce different ciphertexts from the same plain text?

With the same plain text to be encrypted and the same public key, OpenPGP tends to produce a different ciphertext every time I run the encryption operation. Why is this?
3
votes
1answer
40 views

Is there a difference between $\mathbb{Z}_2^b$, $\text{GF}(2^b)$ and $\text{GF}(2)^b$?

I have read a lot about Galois Fields (GF). They are also presented in The Design of Rinjdael on page 13. In computer memory, the polynomials in $F[x]|_l$ with $F$ a finite field can be stored ...
10
votes
1answer
594 views

Qubit / Qutrit - Is there a theoretical limit on how many orthogonal states a quantum bit has?

Seems like a quantum bit with $3$ orthogonal quantum states is called a qutrit - and they have been demonstrated practically. In comparison with $n$ qubits that have ~$2^{n}$ states, these have ~$3^{n}...
1
vote
0answers
33 views

hash function for elliptic curve co-ordinates

Is there any hash function which takes the co-ordinates of an elliptic curve $E_p(a,b)$ as input and gives an integer value i.e. $h(.) : \{(x,y) \in E_p(a,b)\} \rightarrow \mathbb{Z}$
3
votes
1answer
39 views

Different kind of PGP keys or IDs, how to interpret them?

When people say "Here's my PGP key", they tend to come up with all sorts of different stuff. Sometimes they provide an 8-digit hexadecimal number, which seems to be a key ID (although I'm not sure). ...
4
votes
1answer
44 views

Can you decrypt with 1 round key?

If one has the last round key in an SP or Feistel network (the 16th round key in DES for example), would that someone be able to decrypt the rest of the encryption?
1
vote
0answers
23 views

is Authentication tag always appended at last to ciphertext in AES-GCM 256? [duplicate]

I am using AES GCM 256 to encrypt/decrypt a UUID string,We are using java 7 + bouncy castle library for this,We are getting authentication tag of 128 bit ,i am confused ,whether it's position is ...
6
votes
1answer
956 views

how to prove our algorithm is secure against chosen plaintext attack?

I am working on a topic in cryptography where I have tried to develop an encryption scheme. How could I prove mathematically that my algorithm is secure against chosen plaintext attacks?. Will it ...
1
vote
1answer
34 views

Security Strength of Double Substitution Ciphers

I am wondering why people are using RSA keys when some types of double substitution ciphers seem to be just as secure if not better off. By some types of double substitution ciphers I mean one Which ...
2
votes
1answer
61 views

Why is it that most messages seem to be expanded?

Whenever I have seen a more secure version of a message, the message seems to be expanded by some factor. One example is RSA encryption, but whenever a message does not appear to be expanded it is ...
3
votes
1answer
59 views

Is predictable ciphertext/plaintext bad?

I have a cryptosystem that I'm using for secure chat. It is using AES 256 (with RSA 2048 for key exchange). Would a predictable, and repetitively sent ciphertext plaintext compromise the ...
0
votes
0answers
94 views

Example of Software Security (White Box Cryptography) is not strong as Hardware Security?

I have been reading about White Box Cryptography in the last 2-3 days but I was wondering what are the example of White Box Cryptograhy that are quickly broken by Cracker / Hacker? Would the fact ...
4
votes
0answers
47 views

On a proposition in NTRU original paper: $\gamma_1 |f|_2 |g|_2 \leq |f \circledast g|_\infty \leq \gamma_2 |f|_2 |g|_2$

In the original paper of NTRU cryptosystem, we have the following proposition (that is said to be suggested by Don Coppersmith): For any $\epsilon > 0$, there are constants $\gamma_1,\gamma_2 &...
0
votes
1answer
26 views

El Gamal existential forgery using Pointcheval–Stern signature algorithm

I found that there exists an algorithm that claims to make the El Gamal signature generation more secure. The algorithm can be found here as a pdf. I'm mainly interested in the two-parameter forgery ...
0
votes
0answers
42 views

Can a neural network be trained to simulate a cipher?

I believe there are two problems with this in practice: Choosing the components of the network in such a way as to allow them to simulate the operation of the circuitry of the cipher. These ...
3
votes
0answers
46 views

Calculating probability of finding collisions in an invertible hash function

Assuming we have an invertible hash function H that takes inputs of size 2n and outputs hashes of size n, I use the following algorithm to find collisions: Choose a random M as input. Compute its ...
4
votes
1answer
67 views

Number of Sbox in a Cipher

Camellia has 4 SBOX and so does the TwoFish(key dependent 4 Sboxes). Where as AES uses only one. Would it have made AES more secure if AES had 4 or more SBOX too? Does using more Sbox with similar ...
1
vote
1answer
33 views

Camellia Key Schedule

Camellia is a widely used International standard now. Its Key Schedule seems to be too simple as compared other famous Ciphers like Twofish and CAST-256. What are the per-requisites for the key-...
4
votes
0answers
57 views

Numeric base conversion in cryptosystems?

I have been wondering if numeric base conversion has ever found an application in cryptography. By base conversion, an example that is probably familiar is Base64 encoding. This is an example of ...
1
vote
1answer
39 views

Why Rabin fingerprints assumes data is prefixed with a “1” bit?

(I know that a Rabin fingerprint is not a cryptographic hash, sorry in advance if my question is considered out of topic) In the paper Some applications of Rabin's fingerprinting method, it is ...
0
votes
0answers
15 views

Is normal to take wrong values of the polynomial for given x while applying Horner's rule

I want to evaluate the polynomial $a_0+a_1x+a_2x^2+...a_nx^n$ using Horner's evaluation due to i want to speed up my performance of application written in Java. The problem is that sometimes it gives ...
0
votes
1answer
17 views

How many field operations are needed when you compute kG in elliptic curves with a multiple additions or the double-ans-add-algorithm?

For an assignment, we have to calculate how many field computations are needed to calculate kG in an elliptic curve. They want us to show this for two different ways of calculating kG. The first way: ...
3
votes
1answer
75 views

Combining secure hashes with insecure hashes?

Assuming I'm a bank which seeks for secure hash functions to use in the process of signing on digital contents. I'd like to explain / prove why using each one of the following hash functions might ...
0
votes
0answers
19 views

How to generate an El Gamal signature without knowing the private key x?

Let $x$ be the private key. Let $k$ be a random generated number $< p-1$, with $p$ the large prime. Let $g$ be the generator of $p$ the large prime. Let $r$ be the equality $r=g^k$ Let $m_e$ be an ...
0
votes
0answers
37 views

Message length for aes 256 in ctr, ecb and cbc mode

I want to encrypt a message that have values between 0 and 50. So message have maxim 1 byte. Is possible to encrypt with aes256 in ctr, ecb and cbc mode, messages from 1 byte, not necessary 32 bytes? ...

15 30 50 per page