1
vote
1answer
31 views

Is this the correct procedure for cycle walking using an FPE?

To encrypt a value from a set (say a range of years from 1001 to 2001) Rank the set {0 = 1001, 1 = 1002, 2 = 1003...999 = 2001} Take the value you want to encrypt from the set (year = 1995) and ...
8
votes
1answer
261 views

Why was the Navajo code not broken by the Japanese in WWII?

In reading about this topic recently, to my understanding, the encryption schemes used on top of the Navajo language were very simple and definitely could have been broken (my research shows they ...
1
vote
1answer
53 views

Find the minimum Adversary's Advantage

I am wondering how to solve the problem below: Suppose we have a $MAC$ scheme $I=(S,V)$. There is another algorithm that can find a pair of texts $(m0,m1)$, with $m0≠m1$ such that $S(k,m0)=S(k,m1)$ ...
3
votes
2answers
190 views

What is the difference between SHA-3(Keccak) and previous generation SHA algorithms?

SHA-1 and SHA-2 share the same structure and mathematical operation as their predecessors - SHA-0 and MD5. Both SHA-0 and MD5 have been broken. This is one of the main reasons why SHA-1 is considered ...
1
vote
2answers
77 views

Secure randomized data matching?

This might be a dumb question but I will go for it. Let's say we have a data set $D$ consisting of sensitive data, and we want to be able to match if a new piece of data $S$ already exists in $D$ ...
3
votes
1answer
49 views

Merkle tree (dm-verity) with SHA-256 vs. SHA-1

Is there any knowledge or research on the use of different hash functions within a Merkle tree? My use case is file integrity protection. I am thinking about using different hash functions due to ...
1
vote
0answers
68 views

Data integrity using steganographic methods

I am looking for a lightweight and fast (almost real time) data integrity checker for a very time critical application. Is it possible to provide data integrity using a steganographic method, lets say ...
4
votes
1answer
35 views

Can the backdoor in Dual_EC_DRBG be used to create a public key stream cipher?

Dual_EC_DRBG has the property that if $Q = e\cdot P$, someone who knows $e$ can break the PRNG. This seems to lead to a public-key stream cipher: Alice chooses a random $P, e$, where $P$ is a ...
3
votes
1answer
77 views

Multi-target attacks on AES-CTR with a random nonce

128-bit block ciphers are vulnerable to multi-target attacks where the attacker seeks to attack a collection of keys instead of a single key. A simple example: Generate keys $k_1, k_2, ...
1
vote
3answers
137 views

Security of a parallelizable block cipher mode

This is the scheme of a parallelizable block cipher mode of operation: $IV$ is the initialization vector. $BN$ is the zero-based index number of a block in a stream of data. $BT$ is the tweak that ...
0
votes
2answers
38 views

Is part of an output of secure PRNG also cryptographically secure?

Lets say I generate 192 bits using some secure PRNG. If I now take first 128 bits is it equivalent of generating 128 bits in the first place? P.S. More practical application for me is that I need a ...
0
votes
1answer
69 views

Secure blinding factor switching at malicious server-side (Switching in One Time pad)

Suppose all the values and operations are defined over a finite field $\mathbb{F}_p$ where $p$ is a large prime number. Assume all values are non-zero. Here $(z)^{-1}$ denotes multiplicative inverse ...
0
votes
3answers
115 views

Algorithms for Cyrillic encryption

I am working on a cryptography application which is to be used in my country. I tried looking up to see if there are any algorithms that support the Cyrillic alphabet, but I found none. Do you know of ...
2
votes
1answer
116 views

Block cipher not resistant to collisions

If we have the following block cipher, $E(k,m)$, which is a permutation, why is $f_2 (x,y)$ not collision resistant? $$f_2(x, y) = E(x, x \oplus y)$$
0
votes
0answers
14 views

Extension of Diffie Hellman for many participants [duplicate]

How to do the Extension of Diffie Hellman Algorithm for Multiple Participants
3
votes
2answers
77 views

Are there any practical methods of steganography?

There isn't a whole lot of information on steganography in the modern age, from what I can tell. A google search for steganography usually brings up a list of very impractical methods (e.g. tattooing ...
15
votes
1answer
1k views

How does a non-prime modulus for Diffie-Hellman allow for a backdoor?

Recently someone found that a Diffie-Hellman modulus used in a unix tool (socat) was not prime. This led some people to shout "backdoor". What I don't understand ...
1
vote
1answer
120 views

ABE Schemes - Access Structures & Performance

I'm reading this article, CP-ABE with constant-size keys for lightweight devices and in the Table 1, are there these access structure: Threshold, Tree, ($n$,$n$)-Threshold, LSSS, AND gates. I have 2 ...
3
votes
2answers
50 views

Determining Involutary Keys in Substitution Ciphers

How would I be able to show that a key $K=(a,b)$ is involutary for an Affine Cipher over the integers modulo n? Similarly, is there a way to generalize the conditions for a key to be involutary for a ...
1
vote
1answer
32 views

Key Exchange MAC encryption order of events? Problem

I want to write the sequence of events of how a MAC encryption works for documentation at work. For this purpose I have a document (given by my boss to me) in German and I am trying to translate it ...
1
vote
0answers
66 views

When we use one time pad TWICE in two different ways

Assumption and Notations: All the values defined over the field $\mathbb{F}_p$, where $p$ is a large prime number. We denote multiplicative inverse of value $v$ by $v^{-1}$. All values are non-zero ...
1
vote
0answers
41 views

Need help with PKCS#12 3 key triple des key expansion

I am trying to decrypt PKCS8-Shrouded Key Bag inside a PKCS#12 pfx file. The oid for the encrypted data is PbeWithSHAAnd3-KeyTripleDES CBC. Iteration count and salt has been provided within the pfx ...
3
votes
1answer
91 views

How does RIPEMD160 pad the message?

For RIPEMD hashing algorithm on hardware I am not exactly getting how padding works So as per my understanding padding will work like explained below: For ripemd 160 message should be multiple of ...
0
votes
1answer
75 views

What is the complexity to break second preimage resistance?

In the context an of hash functions we have three required properties. Preimage resistance Second preimage resistance Collision resistance. The bounds for Pre image collision is $O(2^{n-1})$, the ...
3
votes
2answers
111 views

Classification of a stream cipher

How would one classify a stream cipher that is neither synchronous, nor self synchronizing? I would have thought asynchronous, but from all the sources I can find, asynchronous is synonymous with ...
-4
votes
1answer
37 views

Computing inverses in a binary field

Please suggest how can i solve the below question What is the inverse of {03} in GF (2^8) with the irreducible polynomial x8+x4+x3+x+1?
2
votes
1answer
105 views

Elliptic curve ElGamal with homomorphic mapping

I am interested in ElGamal due to the fact that you can achieve some degree of homomorphic properties. I became interested in applying ElGamal to elliptic curves, and found this other question with an ...
8
votes
2answers
240 views

Would a Rubik's cube be a trapdoor function?

It's easy to scramble a Rubik's cube but it is hard to solve, unless you know the algorithms for solving it. This makes it a trapdoor function, correct?
0
votes
1answer
88 views

SHA1 collisions and the impact for ECDSA signatures

What will it mean for ECDSA using SHA1 when we have practical attacks breaking the collision resistance property of SHA1? [UPDATE] Added a bit more details to be clear. If $(r,s)$ is the ECDSA ...
3
votes
1answer
83 views

Help with AES decryption with AES-NI Instructions

I am in process of implementing a AES 128 encryption in AVX2 assembly (using AES NI), and am having some problems with decryption logic. I have implemented the encryption sequence without any trouble. ...
0
votes
2answers
42 views

Can an AES-256 key be generated for a large number of cribs? [duplicate]

I have a question in regards to Ransomware type viruses. I know that a number of these viruses use the AES-256 algorithm to encrypt user's files using a randomly generated key. I work in IT support ...
0
votes
1answer
91 views

Multiparty encryption and decryption

Is it possible to send a single encrypted data message to multiple users so that the users receiving the message can only decrypt certain parts of the message, depending on their rights. For example, ...
1
vote
1answer
59 views

Difference of full codebook and non full codebook

While reading a paper about Dynamic cube attack, I saw two terms: full-codebook and non-full-codebook attacks. What do they mean? What is the difference? Regards
2
votes
1answer
38 views

Can one passively load-balance HTTPS traffic based on TLS SNI?

Is it theoretically possible to passively snoop into the HTTPS traffic, reliably detect whether or not TLS SNI is attempted to be used by the client, and, if it is, redirect the stream of the ...
0
votes
0answers
21 views

Shamir SS: To associate shares to the public values $x_i$, when the shares are permuted [duplicate]

Suppose we use $(t,n)$ Shamir secret sharing as follows: We share the secret $\beta$ as $S=[s_1,..., s_n]$, where $X=[x_1,...,x_n]$ are the public values. For the sake of simplicity, lets assume ...
1
vote
2answers
97 views

MAC algorithm difficulties

Can anyone explain to me why this is a bad idea? I cannot see anything wrong with it except that key K should be different for MAC and AES. MAC algorithm consists of letting the MAC of message M ...
0
votes
0answers
53 views

total effective key length of the AESX-192

If I have a AESX-192 be a block cipher which is similar to DESX but has the DES being replaced by AES and the AES key size is 192 bits. How should I compute the total effective key length of the ...
0
votes
1answer
35 views

how to define the Truncated Polynomial?

In NTRUEncryption, I seen the trucated polynimials, but I cannot understand the trunacated polynomial calculation. So, could tell me anyone How do we calculate the truncated polynomial?
1
vote
1answer
110 views

Why does image size increase after steganography?

I am working on a steganography technique. Sometimes I need to send my steganographed images online to my friends but in the process the image gets compressed destroying all the data. I found ways to ...
2
votes
1answer
58 views

Proving property of Modified Rabin Signature

I'm trying to prove one of the properties of the “Modified Rabin Signature Scheme”: If $gcd(x, n) = 1$, then $x^{\frac{(p−1)(q−1)}{2}} \equiv 1 \pmod n$ This is what I’ve got so far… Proof Let ...
3
votes
1answer
216 views

Any stream cipher with avalanche effect?

As far as I know, all stream ciphers work by generating a stream of pseudo random bytes, and XOR it with the plain text to get the cipher text. It has the property that one bit change in the cipher ...
1
vote
2answers
68 views

Is there a standard for hashing a list of strings?

I'm working in Python, and my goal is to hash a list of strings with a cryptographic hash function such as sha256. It would need the property that a change in any string, or the order of the strings, ...
0
votes
2answers
148 views

How to determine RSA block size for decryption

A message coded with RSA is broken up into blocks, then padded/transformed prior to encryption via modular exponentiation with the public key. However, the encryption result for each block is not ...
3
votes
2answers
94 views

Long passwords and Bcrypt

I need to store passwords for a web application, and was looking at Bcrypt for a possible solution. After some research, it appears only the first 72 bytes influence the final hash output. While it is ...
0
votes
2answers
98 views

RSA algorithm private key extraction

Decrypting messages can be done by using the following formula: $$M = C^d \mod n$$ Where $M$ is the decrypted message, $C$ is the encrypted message and $d$ is the private key Theoretically ...
4
votes
1answer
98 views

Exactly how bad is using 'mod' to clamp reduce numbers to a given range?

Let's say I'm naive and want to generate a random integer in the range [0, m), so I do the following: ...
0
votes
2answers
63 views

RSA numerical questions

Let $n$ be the modular arithmetic, $p$ and $q$ the two large primes such that $n=p*q$ and $e$ the public exponent. Here they are two "simple" numerical questions: If $p = 13$ and $q = 17$, what is ...
0
votes
3answers
96 views

How to calculate plaintext from modpower cipher

Let $a$ be the plaintext message, $e$ be a small prime exponent (such as 11, 13, 17 etc.), $b$ be cipher text and $n$ be a large modulo (non-prime). Suppose that: $b \equiv a^e \space mod ...
0
votes
0answers
11 views

A standard for multi-key provider encrypted data?

I'm looking for a standard that standardizes data encryption with multiple and diverse key sources to represent a heterogene access structure and culture. The standard must offer the following ...
3
votes
1answer
48 views

What information should I send along with an AES ciphertext and is there any standard to do that?

While using some crypto implementations I got to see that many times a comment is added to the ciphertext. For example: ...

15 30 50 per page