1
vote
0answers
48 views

Does using a verifiable secret sharing scheme ensure robustness of a protocol if it is secure under the semi-honest adversarial model

Consider a protocol $\pi$ which uses a linear secret sharing scheme like that of Shamir secret sharing. Further assume that the protocol $\pi$ has been proven to be secure (correctness and privacy) ...
1
vote
0answers
24 views

Some confusions about Repeated Doubling Algorithm?

The following repeated point doubling algorithm is taken from the book Guide to Elliptic Curve Cryptography by D. Hankerson, A. Menezes, and S. Vanstone on page#93. Clearly, this algorithm is ...
1
vote
0answers
55 views

Calculating the discrete logarithm

I'm given a prime number $p = 1217$ I'm also given the following equations: $$ 40 \equiv \log2 \pmod{64} \\ 63 \equiv \log3 \pmod{64} \\ 13 \equiv \log5 \pmod{64} \\ 13 \equiv \log2 \pmod{19} \\ 10 ...
1
vote
0answers
41 views

Why is Siphash-128 considered “experimental”?

Why is Siphash-128 still considered "experimental"? What does this mean?
1
vote
0answers
20 views

How do I prove the tracing part in a ring signature model?

I have a question about the article “efficient and multi-level privacy-preserving communication protocol for VANET” by H. Xiong et al. I need the ID of malicious vehicle, but I could not prove how I ...
1
vote
0answers
47 views

Given a public-key encryption and signature scheme, define a new primitive

I'm new to cryptography and am currently working on the following question: Say you are given a public-key encryption scheme $\Pi_e=(\mathcal{K}_e,\mathcal{E},\mathcal{D})$ and a signature scheme ...
1
vote
0answers
46 views

Format Preserving Encryption FF1 Samples

NIST published methods for Format-Preserving Encryption and there is a link in the document giving examples for FF1 methods. I am confused by the value of R given in the examples. $R$ is the output ...
1
vote
0answers
16 views

Sigma protocol: witness hiding

I am working on an assignment and I am stuck with the last part of proving witness hiding for the protocol. I have previously proved it is witness indistinguishable, and it has q (primer number ...
1
vote
0answers
29 views

Generating cryptographic-quality 1/f noise

Can anyone suggest how I'd generate cryptographic quality 1/f noise: aka 'pink noise', where the PSD follows 1/f. I'd be happy to derive the pink noise from white noise (e.g. /dev/urandom), but I ...
1
vote
0answers
20 views

Should we use exponent 3 in RSA-OAEP?

As I understand it the proof that RSA-OAEP is secure in the random oracle model is much tighter for exponent 3. Does that mean that exponent 3 should be chosen?
1
vote
0answers
13 views

Why does HS1-SIV allow forgeries when the SIV collides, even when the PMN does not collide?

The HS1-SIV authors claim that forgeries are possible if an SIV collision occurs. However, I do not understand how this is possible unless the PMN collides too. Otherwise, the collision will be in ...
1
vote
0answers
31 views

Is parallel, vectorized NORX nearly as fast as hardware-accelerated AES-GCM?

As I understand it, NORX gets 3.5 CPB in an unoptimized implementation. But NORX can be parallelized. With 4-way SIMD, I would expect about 7/8 CPB performance. This is nearly as good as AES-GCM in ...
1
vote
0answers
34 views

How to encrypt an image with logistic chaotic map?

I need to encrypt color images, using logistic chaotic map. Could you please recommend an algorithm for this? All the articles that I've found on the Internet are completely unclear.
1
vote
0answers
19 views

AES - Size of T-Boxes and obtaining T-Box values

In article "A high performance ST-Box based unified AES encryption/decryption architecture on FPGA" (http://www.sciencedirect.com/science/article/pii/S0141933115001945) two 32Kb dual-port BRAMs are ...
1
vote
0answers
38 views

Can error correcting codes be used to guess this plaintext?

I pick a finite set of messages, perhaps the set of integers $M = \lbrace n \in \mathbf{Z} \, : \, 0 \leq n\lt10 \rbrace$, which you are then allowed to encode in any way you want (some form of error ...
1
vote
0answers
36 views

How to provide mathematical proof of the security of a stream cipher against known attacks?

Suppose a person has invented a stream cipher and he/she wants to get it published. I have a few questions: In addition to providing detailed description of the algorithm, how would he/she give ...
1
vote
0answers
48 views

Why need mapping to slots to embed bytes in AES-homomorphic encryption?

The encoding of each AES bytes $𝛼_𝑖$ is using CRT(Chinese remainder theorem). It means that there is an aggregate plaintext $H$ such that: $H \mod F_0 =𝛼_0(MappingData[0])$ $H \mod F_1 ...
1
vote
0answers
51 views

How to invert a linear hash function?

My friend is trying to convince me that his linear hash function (with a few bit operations) is secure. Is there a way to disprove this? (Or prove this, but I've read from multiple sources that this ...
1
vote
0answers
15 views

Finding missing probabilities for formal proofs

In formal proofs, you often need to use probabilities to show that the Advantage of an algorithm is negligible. In proofs by contradiction, these probabilities are often tied to probabilities of ...
1
vote
0answers
37 views

Parallel hashing function that always gives the same hash despite a variable number of cpus

The title pretty much sums it up :) I'm looking for a hashing algorithm that does not need to be cryptographically secure beyond reducing the number of accidental collisions. There is no need to ...
1
vote
0answers
28 views

TLS padding format

My question is about how the padding is formated in TLS1.0, 1.1, 1.2, 1.3 I came across the PKCS7 format for the padding: ...
1
vote
0answers
45 views

How to deal with collisions in Bitcoin addresses?

When creating a Bitcoin account, you need to issue a couple of private/public ECDSA-keys. Then, you derive your account address by taking a 160-bit hash (through sha-256 and ripemd) of the public key ...
1
vote
0answers
33 views

Simple application of verifiable random function?

I have been reading a little bit about verifiable random functions (e.g.). In the literature, these are described as "pseudo-random functions that provide a non-interactively verifiable proof for the ...
1
vote
0answers
19 views

Which protocols / file formats use CBC with a random IV and without a MAC?

Disclaimer: I am a noob so this may well be a stupid question or one that's been asked before. I didn't see it come up after searching, though, so I'm going to assume it hasn't been asked here. The ...
1
vote
0answers
50 views

Encryption & decryption of integers using modular multiplicative inverse and extended euclidean algorithm

I'm looking for a neat algorithm, which is capable of encrypting an integer to another integer and decrypting it again AND is secure. When I was in university, my professor showed me an awesome way ...
1
vote
0answers
31 views

Security of a lightweight heartbeat protocol

I am implementing a heartbeat protocol so that a server can send notifications to clients. The notifications are not occurring so often, so I don't want to keep an open TCP+TLS session for each ...
1
vote
0answers
66 views

Differential bound of the S-Box in GOST R34.11-2012

In Russian GOST R34.11-2012 LPS-transformation is used. LPS gets all of its non-linearity from the 8-bit S-box S, which apparently has been designed to offer resistance against classical methods of ...
1
vote
0answers
13 views

IX509Extension XCN encoding?

I understand from reading MSDN that the X509 v3 extensions must be handcrafted. This involves the CRL, AIA, name and policy constraints, policy mapping, private key usage period, and subject ...
1
vote
0answers
68 views

How to calculate min entropy of the output of PRNG?

As min entropy of a random variable provides the maximum probability of getting the desired realization of the random variable, which is the most conservative way of measuring the uncertainty of ...
1
vote
0answers
36 views

Rijndael variant using AES for key schedule?

The weakest part of Rijndael is considered to be the key schedule (I believe that this is true for all variants, including ones not standardized as AES). One solution to this problem is to use ...
1
vote
0answers
15 views

For the LTV-FHE scheme, after how many additions should modulus switching be used?

From the LTV-FHE paper I find out that after every multiplication there must be a modulus switch to mitigate the noise in the resulting ciphertext, besides relinearization. But, assuming the ...
1
vote
0answers
22 views

Can we use the sponge construct to efficiently authenticate any cipher?

The sponge construct facilitates authenticated encryption independently of the function used to mix its state. Could we use any strong cipher (i.e. AES-256) as the mixing function in a sponge to ...
1
vote
0answers
69 views

Confidentiality then Integrity with different keys

Can anyone describe how we can do what is said in the below sentence which is in Mark Stamp crypto slides (PPTX) on slide number 101 : Can do a little better - about 1.5 “encryptions” The whole ...
1
vote
0answers
35 views

Is it safe to use a key as message in keyed hashing (HMAC)?

Scenario: User gives password. A "password key" is derived from the password (e.g. by PBKDF2). A random salt is applied. The password key is hashed with a HMAC algorithm (e.g. HMAC-SHA256), with ...
1
vote
0answers
47 views

Why is the compression function in Miyaguchi-Preneel scheme secure?

I was reading about the Miyaguchi-Preneel scheme and had difficulty in understanding why the compression function, $h(H,m)=E(H, H \oplus M) \oplus M \oplus H$ can be called secure. The only resource I ...
1
vote
0answers
31 views

Reykeyed AES in CTR mode as a stream cipher

Suppose one uses AES in CTR mode to generate a keystream, but every $l$ bytes the $n$ bits that would follow are used as a new AES key. Assuming that AES is a secure PRP: Is this a secure stream ...
1
vote
0answers
61 views

Is $E_{k}(x) = F_{k}(x) \oplus F_{k}( \bar x)$ PRF?

$E_{k}(x) = F_{k}(x) \oplus F_{k}( \bar x)$ and F is PRF which maps $\left \{0,1 \right \}^n \times \left \{0,1 \right \}^n $ to $\left \{0,1 \right \}^n$. Let two messages $m_{0} = 0^l $ and $m_{1} ...
1
vote
0answers
28 views

Does extra encryption improve the security of CBC and CTR?

I am learning about cryptography and during my research and reading I had a question. When looking at information leakage and CBC mode, I asked if there is a way to improve this with by using the ...
1
vote
0answers
36 views

Is XSalsa20-Poly1305-SIV a reasonable choice for nonce-misuse-resistant authenticated encryption?

Consider XSalsa20-Poly1305-SIV. This is obtained by: computing a MAC $t_{secret}$ of the plaintext from the key and nonce, as in ChaCha20-Poly1305 except that the plaintext, not the ciphertext, is ...
1
vote
0answers
121 views

Fiat Shamir with S^3

I'm trying to do Fiat Shamir but with $I = S^3 \pmod n$ where $S$ is the secret key. How will I prove that I know the cube root? I tried doing the old formula but with instead with $(RS)^3 = x*I \pmod ...
1
vote
0answers
41 views

Effect of the birthday bound on AES-GCM

What is the effect of the birthday bound on the security of AES-GCM, when a very large number of messages are encrypted? I am looking for attacks that are useful in obtaining information about the ...
1
vote
0answers
40 views

Is this a better GCM?

Using the keystream from the block cipher for both parts of the GMAC key (initialization and encrypting the auth tag) seems to produce a better mode of operation than GCM, as successful forgeries and ...
1
vote
0answers
33 views

Can a secure MAC break if the adversary is given oracle access to Verify?

In the Mac-forge experiment, the adversary is given access to a tag-generation oracle, which generates a tag for each message given by the adversary. The adversary's task is to generate a valid tag on ...
1
vote
0answers
40 views

Can an attacker recover the key if a Poly1305 collision is known?

Suppose that messages $m_1$ and $m_2 \neq m_1$, both known to the attacker, are both MAC'd through Poly1305 with the same key. By chance, these two messages hash to the same value. The attacker ...
1
vote
0answers
35 views

Weighted secret sharing scheme?

Is there a secret sharing scheme where secrets can be weighted, and that you need a total weight of $1$ to unlock the secret? I know that you could, of course, just figure out every subset that has ...
1
vote
0answers
43 views

Caculated time One Point Multiplication with double and method

I am using double and add method for point multiplication in affine coordinates. How we compute 1PM in double and method? Di Wang said one point multiplication consists of repeated addition and ...
1
vote
0answers
18 views

Attribute based access control and role based, online bookstore example

I am asked to answer a question that says: One online book-store wants to grand access to clients regarding their subscription. There are 3 types of subscriptions A , B and C. Customers get access ...
1
vote
0answers
88 views

Breaking Vigenere via Kasiski/Babbage method? (non-programmatic)

I'm really hoping someone can explain to me what is going on in the second major component of this form of analysis. If you wish, for convenience, here's a page that already has some ciphered text ...
1
vote
0answers
29 views

Faster discrete Gaussian sampling

Our goal is find a faster discrete Gaussian sampling to solve $"SVP"$ problem in lattice: A lattice is discrete subgroup of $R^n$ such that define as below: let $\{b_1,\cdots ,b_n\}$ be a basis in ...

15 30 50 per page