instruction stringlengths 32 27.2k |
|---|
In small subgroup confinement attack we are taking k (the power which Eve will use to be)
k = (p-1)/w
where p-1 is the order of the group on which Alice and Bob is working on (Legit Users) and w is the order of the subgroup.
Is it necessary that w has to be of prime order ?
One of the examples I saw
P = 29
W was taken ... |
Triple DES (using an existing cipher 'DES' of key length 56bits) provides security of 112bits (although it requires key material of 168bits).
Does there exist a mechanism to increase block length of an existing cipher? like creating double AES with block length of 256bits?
|
Recently, I am very interested in the hash function attack paper, so I am reading it closely.
I found out that there are Free-start and Semi-free-start settings among the attacks on the hash function.
The example below introduces these two definitions.
(The definition is similar to other papers, so I brought it here.)
... |
What I've read:
https://crypto.stackexchange.com/a/12256
https://crypto.stackexchange.com/a/20328
Seems in practice, will first choose an e, then choose the 2 big primes p1 and p2.
What I've learned so far:
e is usually between (2^16, 2^32), e.g 2^16 + 1 = 65537. // TODO .. not sure
e should not be too large, otherw... |
There is a claim by Chinese researchers making the rounds (Schneier's blog here) that RSA can be broken by Quantum Computers. The paper is on arXiv.
Wading through the discussion in Schneier's blog, and distinguishing between noisy qubits and physical cubits, the claim does not seem as catastrophic but also not as outl... |
I'm attempting to generate a private/public key pair in a few different standards and formats for testing an encryption library I'm working on (i.e. keys with the same "guts", but different formats and standards). Specifically I want a keys generated by OpenSSL in the DER and PEM formats, using the PKCS#1, PKCS#8, and... |
$$f_0 = A$$
$$f_{n+1}=AES(f_n,k_n)$$
$$f_i = B$$
For given 128-bit values $A, B$ we want to find a chain of suitable 128-bit keys $k_1$ to $k_i$.
The total length $i$ is undetermined. Every valid key chain size gets accepted.
How long will it take?
If we limit $i=1$ it would be equal to the normal use case.
$$B = AES(... |
I am implementing Bulletproofs over Ristretto255. (I am using libsodium, so can't switch to another Elliptic Curve implementation.)
I need to implement zero knowledge verification of elliptic curve operations, with the ultimate intention of using these to implement with these more advanced operations like EdDSA and (Pe... |
Consider the following case, given x(private key) and y(public key), how to determine whether this key pair is generated by a pre-defined Safe Prime Group(Say FFDHE, RFC 7919)?
In context of SP800 56Ar3 Section 5.6.1.1.4, my understanding is we need to check 2 conditions,
i. y = g^x mod p
ii. 1 < x < min(2^N, q-1)
whe... |
Based on the Schnorr signature below: What is the suitable size of lamda to generate a secure key?
|
What PKCS standard is the public key in the image below? It seems to me that it is PKCS#8, but what I've read makes me think that PKCS#8 only applies to private keys.
Here is the corresponding private key which is PKCS#8. Note they look identical except the private key only contains modulus and exponent info.
|
I've read through, and roughly understand, Maksym Petkus' zk-SNARK paper (http://www.petkus.info/papers/WhyAndHowZkSnarkWorks.pdf). I'm re-reading it, and trying to code up the examples as I go along to gain a better understanding. I'm making (hopefully a simple) mistake, but I'm not sure where.
In 3.3.4 Encrypted Poly... |
Let $\mathbb{G}$ be a cyclic group of prime order q and generated by g. Let $D$ be the uniform distribution over $\mathbb{G}^3$. Let $D_{dh}$ be the uniform distribution over the set of all DH-triples $(g^{\alpha}, g^{\beta}, g^{\alpha\beta})$. Let $D_{ndh}$ be the uniform distribution over the set of all non-DH-triple... |
Step 2 of the PKCS #1 v1.5 signature verification operation as described in RFC 8017 section 8.2.2 reads:
2. RSA verification:
a. Convert the signature S to an integer signature
representative s (see Section 4.2):
s = OS2IP (S).
b. Apply the RSAVP1 verification p... |
Suppose we have a function that returns a chipertext of a known plaintext that has been encrypted twice with AES-ECB with two unknown keys, is it possible to get both keys ?
|
I'm trying to solve the following but I don't understand some of the steps and how to proceed. I found similar questions on the internet saying the order is 6 but I want to understand why.
Given an elliptic curve E/Q (Q are the rationals) E/Q = y^2 = x^3 + 1
determine the subgroup generated by point <2,3> and its si... |
In the definition of a pseudorandom function, we consider two distributions $D_0$ and $D_1$ over functions, where $D_0$ is the distribution of a random function and $D_1$ is the distribution of a pseudorandom function (defined as the distribution of $F_k$ under uniform $k$ for some public function $F$). The function $F... |
Consider the fields highlighted in red in the following keys.
Will the "version" fields (i.e. INTEGER 0) always be zero for the specified structure?
Will the NULL fields fields always be NULL for the specified structure?
If "No", what would cause the values to change?
PKCS#1 Private Key:
PKCS#8 Private Key:
X.509/S... |
I have been trying to follow this paper for zk-SNARKs to create Zero Knowledge Proofs (ZKPs) for verifying computations. Specifically, given a public program $F$, a public input $x$, I would like to create a proof $\pi$ which "proves" that there exists some private input $w$ such that,
$$F(x,w)=z,$$
without revealing w... |
I'm wondering whether is of any use to add salt when computing a signature of a piece of data.
I looked around but didn't find an answer to this, although there's a very similar question: Why hash or salt when signing?
My use case is the following:
I have a small JSON-like document that I want to encode & sign on the ... |
Seems there are 2 ways:
d = (ϕ(n)*k + 1) / e
In this case, need to choose a proper integer k.
Question 1: How to choose k, just try positive integers start from 1, until found one?
Use The Extended Euclidean algorithm, make d * e - k * ϕ(n) == 1, where k can be adjusted as need.
Seems need to add LCM(e, ϕ(n)) to d * e... |
I am reading a pdf on pseudorandom function I found here https://www.cs.utexas.edu/~dwu4/courses/sp21/static/reductions.pdf
My problem/struggle is with the computation of the distinguisher's $B$ advantage.
According to the notes $b=0$ means that $B$ receives a sample from the function of interest, let's call it $F$, w... |
If I do a simple encrypt and decrypt test like so:
echo 'Hello World' | \
openssl enc -aes-128-cbc -pass pass:SeCrEt | \
openssl enc -d -aes-128-cbc -pass pass:SeCrEt
It works fine, it correctly outputs 'Hello World'.
However when I change the blockmode to gcm and keep everything else the same:
echo 'Hello World' | \
... |
For verifying transactions, normally nodes do proof of work and agree with the majority of workers, but why can't they just do the computation themselves and agree with any other node that has the same result? That way even if an attacker has 99% of the work/stake/etc, the other 1% (aka all the actual users) can ignore... |
So I found some test vectors for my SSE implementation of AES256-GCM and unfortunately it seems that after the last step of AAD it goes wrong. My guess is that this is because the AAD is actually misaligned; it's 8-byte instead of 16. I read this into a 128-bit vector and read the byte array into it as a byte array and... |
Suppose m is a positive integer converted from the plain text in bytes.
And there are two positive integers a, b which satisfies $a^2=1+4919b^2$ in the encryption process. (a and b are both unknown)
The cipher text is x which satisfies $x = (am+b) mod p$ where p is known and is a large prime number.
For some reasons, ... |
I'm trying to create a script that will take a snapshot of the contents of a directory. For each file, all possible metadata will be recorded and written to the database. The point is that with some transfer of this directory, you can take a new snapshot and compare it with the original one taken in the "safe zone" to ... |
I am trying to figure out how to use a custom password with a JWK that uses the password for key wrapping. The JWA spec contains for example "PBES2-HS512+A256KW", which does "PBES2 with HMAC SHA-512 and 'A256KW' wrapping". So, if I understand correctly, PBES2 involves using a KDF, so can I just use a password and a key... |
For given 128-bit numbers $S$ and $E$ we want to find a series of keys $k_i$ with
$$ E = BC(BC(BC(.....BC(S, k_1),k_2) ..k_n)$$
We can either use a 128-Bit blocksize block cipher similar to AES (ECB mode) with
$$BC(m_i,k_i) \equiv AES(m_i,k_i)$$
Or a 256-Bit blocksize block cipher similar to AES (like Rijndael, not AE... |
I am working on a system involving multiple parties performing homomorphic cryptographic operations using Microsoft SEAL (BFV). Because of the nature of the system, it would be preferable for the parties to share zero-knowledge proofs of correctness for the operations performed.
I am specifically interested in a non-in... |
What are the best known cryptanalytic attacks against AES-128 with 9 rounds?
I found many such attacks on AES-192 and AES-256 with 9 rounds, but not for AES-128 with 9 rounds.
Are there any cryptanalytic attacks that show that such a version of AES-128 would be weaker than the 10 rounds one?
|
I am looking for some practical examples on how to use SMCQL on some typical SQL queries. The paper seems to be oriented more towards theory. Can somebody point me to some examples to understand it better? Thanks.
|
Two parties share a password. They need to now exchange some data. Is there a way where one party generates a public/private key pair from the data and password and shares just the public key with the other party. The other party should retrieve the data using the shared password and just the public key. Is this possib... |
I'm currently working with BLS Signature Schemes in the field of publicly verifiable Compact Proofs of Retrievability by Shacham and Waters.
So for creating the Sigmas the following function is defined:
$$
\sigma_i \leftarrow\left(H(\text { name } \| i) \cdot u^{m_{i}}\right)^\alpha .
$$
$\left\{m_{i}\right\}_{\substac... |
I'm looking at document of SEAL and openFHE, and they both use $\mathrm{NTT}^{\mathrm{CT}, \psi_{rev}}[\text{no to bo}]$ and $\mathrm{INTT}^{\mathrm{GS}, \psi_{rev}}[\text{bo to no}]$, 2 kinds of butterflies. $[\text{no to bo}]$ means natural order to bit-reversal order, similar to the other one.
I'm quite confused bec... |
Please explain what goes wrong if we always set the IV to 0 in randomized CBC, and use the system to encrypt two different messages m0 /= m1 with the same key k.
I tried to find answer and read CBC mode IV .
I can't understand what goes wrong if we always set IV = 0
|
The purpose is for a server to ensure the content of the flash memory of a slave IoT contains a good known firmware.
The server does not have a copy of the IoT firmware code - but only a hash or equivalent.
The server transmits a nonce/seed random key to the IoT to perform the hash computation.
The IoT computes a new ... |
I was very surprised when I said that hashing the same data twice was "double pass" and a comment came in that this wasn't the case if the hashing could be performed in parallel. This would mean that calling CCM/EAX a "two pass" system or GCM a 1.5 pass system would be wrong.
I've always understood that if data is "pas... |
could anyone help me understand how is ECDSA broken using Shor's Algorithm? All the papers I find are too complex to understand, and even though I feel I understand some concepts, some others are a bit more of a mess.
|
In RSA, one of the math background is:
m ^ φ(n) % n == 1, where m is the message to be sent, n = p * q.
The equation is from λ(n) (Carmichael function), which requires m and n are co-primes.
And, since n = p * q, thus φ(n) = λ(n), I guess. Question 1: is this correct?
Question 2: If m equals p or q, then m and n are ... |
I am trying to show that UF-naCMA doesn't imply UF-CMA. UF-naCMA is actually defined as UF-CMA but the adversary should send $q \in poly$ messages $m_i$ chosen non-adaptively (i.e. all at the same time) before obtaining the public key. Then, as in UF-CMA in order to win he has to forge a valid $(m^*,\sigma^*)$ with $m^... |
As we know, the IV and the output of SHA-256 are identical in size. Suppose the input value to the SHA-256 is completely transparent. Is there any correlation between IV value and output? Is it possible to limit the output space?
I would appreciate it if you can introduce any source - article or manuscript in this spec... |
According to the Curve25519 website:
Computing secret keys. Inside your program, to generate a 32-byte Curve25519 secret key, start by generating 32 secret random bytes from a cryptographically safe source: mysecret[0], mysecret[1], ..., mysecret[31]. Then do
mysecret[0] &= 248;
mysecret[31] &= 127;
mysecret[31] |= 64... |
On my old laptop, ChaCha20 is quite a bit faster than AES as there is no hardware acceleration for AES. But for disk encryption AES based schemes seem to be the only option, as a stream cipher like ChaCha20 cannot directly be used for disk encryption. Is it possible to use ChaCha20 in some other way/mode to make it sui... |
Is there any way in which classical computers oculd end up breaking ECDLP. I read that GNFS could through prime factorization, but I am not sure if I understood this properly.
|
I am presented with the following problem:
Given a set of matrices $M = \{A^i_{m,n} : 0 < i < 101 \}$ design a procedure to compose all of them into one encrypted matrix $E_{m,n}$ and later decompose (decrypt) it into the initial set. The procedure should be as difficult to break as possible (quantum-resistant preferab... |
This may be a very basic question.
I know that symmetric key algorithms use the same key to encrypt and decrypt plaintext and ciphertext.
However, it seems that hash functions are often classified as symmetric key cryptography.
Even though the key is not used in the hash function, from what point of view can it be clas... |
I'm studying the post-quantum cryptography (PQC).
While studying hash-based pqc, I read a thesis about Winternitz one-time signature scheme (W-OTS). What is the exact definition of "One-time Signature (OTS)"?
There is lots of papers and posts quote the word "OTS", but anybody didn't write the definition of OTS.
|
What issues do yall see with the following in terms of key recovery and related key attacks:
RC4 used to "sign" a nonce:
3 byte nonce concatenated with 16 byte long term key > RC4 Keystream Generator > 259 bytes keystream output
Discard first 256 bytes of keystream leaving only last 3 bytes "Signature"
3 byte Nonce / 3... |
I'm working on a friendly tower finite field implementation for educational purposes. The library should allow easy building of tower fields from smaller ones - a user may define $\mathbb F_q$ and then build a tower field such as $\mathbb F_q \rightarrow \mathbb F_{q^k} \rightarrow \mathbb F_{(q^k)^m}$ and add/multiply... |
My understanding is that iOS FaceID/Fingerprint for example use an underlying mathematical representation of the biometric features.
Is it possible to generate a key pair from this representation and re-generate the same key pair from the same input but on a different device for example?
I only found this old thread fr... |
The protocol would look like this:
User creates account and provides username, static public key
User logs in by sending username
Server responds by sending an ephemeral public key
For the duration of the user's session, all requests must be accompanied by the ECDH shared secret between user-static and server-ephemera... |
In university, I'm currently learning how to use Scyther to model security protocols. Currently I am trying to understand what is happening in an example protocol given to me which is:
# Key Establishment Protocol
#
usertype SessionKey;
protocol ke11(I,R,S)
{
role I
{
var Kir: SessionKey;
sen... |
I was trying to come up with simple padding functions for the RSA, then trying to break them just to have a better understanding of why we need all the pieces used in the RSA OAEP... So, I am considering the following.
Let $N = p\cdot q$, $pk = e$ and $sk = d$ be the RSA parameters and keys, as usual.
Now, let $n = \lc... |
I rent a room in a building. There are also 9 others who rent other rooms in this building. Just like everyone else who rents a room I only have one key of this building.
With my key I can open the front door of the building. Just like everyone else who rents a room can with their key. However, only I can open the door... |
Suppose that Alice has an X25519 key pair $\{S_A,P_A\}$ (secret and public key, respectively). Using randomly selected X25519 public keys $\{P_*\}$ (such that $P_A\notin \{P_*\}$), Alice calculates several values $X_* = \operatorname{X25519}(S_*,P_*)$.
She then repeatedly flips a (fair) coin. Each time, if the result i... |
From here - Batch Opening of KZG PCS
One can prove multiple evaluations $(\phi(e_i) = y_i)_{i\in I}$,for arbitrary points $e_i$ using a constant-sized KZG batch proof, $\pi_I = g^{q_I(\tau)}$, where
\begin{align}
\label{eq:batch-proof-rel}
q_I(X) &=\frac{\phi(X)-R_I(X)}{A_I(X)}\\
A_I(X) &=\prod_{i\in I} (X - e_i)\\
... |
In this question, we restrict to RSA public keys $(n,e)$ such that
$n$ and $e$ are odd, $3\le e<e_\max$, $e<n$
Note: For some old Windows API, $e_\max=2^{32}$. In FIPS 186-4, $e_\max=2^{256}$. Other requirements are from PKCS#1.
For all $m\in[0,n)$, it holds $m^e\bmod n=m$. That is, textbook RSA encryption is the ide... |
How should I generate the remaining keys when performing subkey generation in AES encryption? I generated keys 0 and 1 first, but the other keys I generated later were wrongly generated, so what steps should I do to generate the rest?
I know the steps of shifting rows and mixing columns but I don't know what to use whe... |
Let $G:\{0,1\}^n \leftarrow \{0,1\}^{2n}$ be a PRG. Establish whether the following PRG candidates $$G^{'},G^{''}:\{0,1\}^n \leftarrow \{0,1\}^{3n}$$ are secure or not:
$G^{'}(s)=(x⊕y,u,v)$ where $(x,y)=G(s)$ and $(u,v)=G(y)$;
$G^{''}(s)=(x,y ⊕ u,v)$ where $(x,y)=G(s)$ and $(u,v)=G(y)$;
This was in my exam today and ... |
The iOS version of Signal application (not the protocol) includes a form of key wrap that I've never seen elsewhere: SHA256-HMAC-SIV.
It's used to encrypt your master key with your pwHash(PIN) before sending it to signal.org's Key Backup Service.
So far as I can tell, it does the following:
SHA256-HMAC-SIV(kek, raw)
ke... |
I wonder if it's possible to do public key authentication (preferably not vulnerable to replay attacks) before modern computers became a thing (e.g. in a medieval setting).
Specifically:
Authentication can be done in a reasonable time by hand.
Brute force by hand requires unreasonable time. (But it may be possible wit... |
I have a question regarding the paper:
Andreeva, E. et al, Securely Release Unverified Plaintext in Authenticated Encryption , 2014
(DOI: 10.1007/978-3-662-45611-8_6)
AE schemes such as GCM [28] and CCM [40] reduce to CTR mode in the RUP setting. This is because the adversary does not need to forge a ciphertext in ord... |
In a WPA2 (802.1X) scenario, there are 3 entities -> Supplicant (client), Authenticator (router) and Authentication server (Radius server). Radius server performs the authentication process and, as far as I understand, in the authentication process, the router works only as a proxy.
If an attacker is able to sniff the ... |
Does there exist a lattice in $\mathbb{R}^n$, with an independent generative family $(b_1, \dots, b_{n+1})$ of $(n+1)$ vectors (without any loss of generality I suppose $(b_1, \dots, b_{n})$ is a $\mathbb{R}$-basis), for no generative family of size $n$.
I know:
If these vectors are in $\mathbb{Q}^n$, then the answer... |
It's well known that two parties, Alice and Bob, can flip a fair coin using commitments.
Alice picks a random number $a \in \mathbb{Z}_q$ and computes $c_a = Com(a, r_a)$ where $r_a \xleftarrow{R} \mathbb{Z}_q$. She then sends to Bob $c_a$.
Bob does the same, pick a number $b \in \mathbb{Z}_q$, and compute $c_b$ and s... |
What goes wrong if we use the same key k in deterministic counter mode to encrypt two different plaintext messages m0 /= m1.
It is not true that c0 = c1, because we XOR output of m0 with input of m1 in counter mode. As a result, c0 cannot equal c1, and c1 cannot be said to be the same as c0.
Could this be true?
Attack... |
I'm not fully sure what the most accurate terms would be to describe what I'm looking for, but here's the gist:
Let $u_1, \cdots, u_n$ be the users from a set of users $U$. Users may or may not submit some data $d_{u_1}, \cdots, d_{u_n}$ into my database, which I'll model as a set of data $D$. I want to be able to det... |
The Inhomogeneous Short Integer Solution (ISIS) problem is as follows: given an integer $q$, a matrix $A\in \mathbb{Z}^{n\times m}_q$, a vector $b\in \mathbb{Z}^{n}_q$, and a real $\beta$, find an integer vector $e\in\mathbb{Z}^m$ such that $Ae=b\mod q$ and $0<\Vert e\Vert_2\leq\beta$.
if we assume that $n=m$ is this a... |
Does this research also work for breaking bitcoin ECDSA? If so, how many qubit will be needed for 256-bit elliptic curve key?
|
In one proof I show that, given a cyclic group $Z_{p}^{*}$ where $p$ is prime, and a set of information $X$ computing $y\in Z_{p}^{*}$ is as difficult as solving Computational Diffie Hellman (CDH) problem.
In another proof can I make the argument that as transformation $X \rightarrow y$ is proven to be CDH, given $X$, ... |
Since AES needs IV to be random (unless fed by a unit test), I was wondering how to properly handle it.
I know that Intel/AMD now supports the rdrand64 function but I don't fully want to rely on that.
Can I safely combine multiple sources of randomness and SHA256 them to produce a random 256-bit number?
My sources of r... |
I'm working on a problem where I need to track some state that's 64-bit integers. It turns out this state can tracked by simply accumulating a sum of differences, which in my case turns out to naturally sum to zero:
$$s = \sum_k (b_k-a_k)$$
This is a "closure" relationship that relies on all the values being transitiv... |
The task is something like this. Alice must send Bob the money, but so that the amount remains hidden.
How can this be done if only "hiding" balances are stored in the blockchain? How can I prove to someone that my balance is positive after the transfer?
In other words, how can I prove to someone that the number x >0, ... |
Kyber and Dilithium are post-quantum cryptographic designs, but the resources are hard to understand. Is it possible to explain those ciphers to children?
|
I'm currently taking a computer security module in University and as part of a problem have been asked:
My thought for the question is that no it does not provide 64 bits of security strength. This is as (IV,C) is transmitted over the network meaning that if the signal were intercepted by an adversary IV can easily be... |
I am doing a RSA cryptography task where I need to decrypt a ciphertext but I am only given the ciphertext ,c, a public exponent, e, and a RSA modulus, n, which has two prime factors p and q such that |p − q| < 10000.
I am unsure of how to do this but I am given the hint of using a low exponent attack (although the exp... |
In some RSA libraries I've encountered, the P bit count is left shifted by some amount and Q bit count right shifted by the same amount. For example, if generating a 2048 bit key, the P bit count would be 1088 and the Q bit count would be 960, so the N bit count would still be the requested 2048, assuming appropriate ... |
Consider the following construction of a SKE scheme $\Pi^*=(Enc^*,Dec^*)$ based on a PRF family $F=\{F_k:\{0,1\}^n\rightarrow \{0,1\}^n\}_{k\in\{0,1\}^\lambda}$ and on a MAC
$ Tag:\{0,1\}^\lambda \times \{0,1\}^n \rightarrow \{0,1\}^\lambda$ with UF-CMA security.
Key Generation: The key generation algorithm returns a r... |
Is hashing a pseudo-random generated string of letters upper/lower + numbers 256 characters long with SHA256 insecure, in the sense that in any reasonable amount of time you can go from hash to original string?
Would using a more conventionally strong password hashing algorithm be necessary to still answer no to the ab... |
I am looking at this in the context of password hashing in PostgreSQL, specifically, the crypt function of the pgcrypto extension.
The PostgreSQL documentation refers to the Unix man page of the crypt function. The man page (man 3 crypt) of the crypt function states that it performs Trapdoor encryption. Now a trapdoor ... |
I am working on my master thesis which has as a main subject the CKKS algorithm. I am following the paper https://eprint.iacr.org/2016/421.pdf in which on page 8 it is mentioned that the encoding/decoding in the CKKS are isometric ring isomorphisms between $(S, \|\cdot \|_{\infty}^{can})$ and $(\mathbb{C}^{N/2}, \|\cdo... |
What is the significance of theoretical weaknesses?
Any real life incident where a theoretical weakness was ignored and later it compromised the system? Whats the dividing line between theoretical and practical weakness? Are there any other categories? How quantifies a practical weakness as what seems impossible for on... |
Consider a Schnorr group with order a prime $q$ sized for security against current computers (like $q$ of 256 bit); modulus a prime $p=q\,r+1$ large enough (e.g. 3072 to 32768-bit) that the algorithms of choice for solving the DLP in the group are Pollard's rho or Pollard's kangaroo, rather than Index calculus, Functio... |
An encryption scheme should be injective in the sense that each ciphertext should only be associated with at most one message, in order that decryption is unambiguous. An efficient signature verification scheme should be surjective in the sense that each message (equivalently message hash) has an associated signature, ... |
NIST's main recommendation for encryption/decryption mechanism is CRYSTALS-KYBER. Whereas, the BSI (German equivalent) chooses FrodoKEM.
As far as my knowledge goes both these mechanisms use LWE lattice problem for their cryptographic security.
Then what makes the two mechanisms different?
Is it just the parameterizat... |
All,
Recently, I came across a question on privacy for big data and AI.
IMO, big data privacy focuses on "anonymization" aspect where sensitive informatino such as Personal Identitfiable Information should be protected, while AI privacy focuses on "raw data stealth" where raw data should not be inferred or derived from... |
I am looking at the paper on Kate Polynomial Commitments.
On Page 7, VerifyEval, the verifier checks the following to verify commitment.
$e(\mathcal C, g) \stackrel {?}{=} e(w_i, \frac {g(\alpha)}{g(i)})e(g, g)^{\phi(i)}$
In the next line, the paper explains why this equality will be true if the commitment is in fact h... |
Is there any algorithm that I can check if point(G^9857) is more near to point(G^54) rather than point(G^448)?
|
I am new in Elliptic curve and I got a lot of knowledge through reading :) but I reached to NAF method as a scalar multiplication method, but don't understand how in this example get it:
Let k = 1234567 and its binary representation contains 21- bits:
100101101011010000111. In this
11 1′s and 10 0′s can be found resul... |
I’m sorry if this is already answered, however, regarding symmetric key components to create a symmetric key using xor
(So eg comp1 xor comp2 xor comp3 = key)
If in the case of an AES KEY, which goes through an expansion routine(?) If someone gets one of the values (who shouldn’t), what is the actual risk? It gives not... |
I have a simple question but I can't seem to find the answer of.
I know that
A 128-bit hash contains 32 characters since each represents a hexadecimal.
Similarly, a 64-bit hash would contain 16 characters.
However, if I had a 64-bit and 128-bit string consisting of letters (both uppercase and lowercase) and numbers ... |
In Wesolowski's VDF (verifiable delay function) a prover produces a pair $(x, y)$ and needs to argue to the verifier that the pair satisfies $y = x^e \pmod N$ for some $e$ computable to both. The verifier is compute limited and $e$ is really large, so cannot compute $x^e\pmod N$ herself. The prover needs to convince th... |
Given a list of base entities (B) with each of them having a universally unique identifier (UUID) of 128 bits.
I want to attach to them a list of ≤ 7 related entities (TE, UE, ..., ZE) with each of them having their own UUID. One requirement is that I should be able to get the UUID of the main entity from the related e... |
If I test the Pseudo Random Number Generator(PRNG) and it satisfies the serial test, it is not sure that the resulting distribution is uniform. Is my observation correct? If it is correct, what test should I do to be sure?
|
Suppose we define privacy as a game where a machine $M$ has a coin $b$, and on input $M_0, M_1$ always replies with encrypted $M_0$ if $b=0$ and encrypted $M_1$ if $b=1$. The adversary can send as many pairs $M_0, M_1$ as he wants. The goal is to guess $b$. If he cannot do better than guessing at random (i.e., with pro... |
CKKS is a levelled scheme, because the rescale $\lfloor\frac{x}{\Delta}\rceil$ operation requires truncating a modulus to be efficiently evaluated, and rescale is (usually) needed after every multiplication to control noise growth.
But I don't understand why rescale have to decrease ciphertext modulus. In residue numbe... |
I would like to implement a hash function $H1 \colon \{0,1\}^* \to \mathbb{Z}_p^*$ such that $p$ is a prime number and second fonction $H2 \colon \mathbb{Z}_p^* \to \{0,1\}^k$ where $k$ is a security parameter
what is the best way to implement them with SHA 256 or another hash function?
|
When researching about PQ KEM's I have come across two different definitions of indistinguishability under (adaptive) chosen ciphertext attack. IND-CCA (https://eprint.iacr.org/2017/604.pdf page 10, Kyber - https://eprint.iacr.org/2017/634.pdf page 3) and IND-CCA2 (https://eprint.iacr.org/2002/174.pdf page 4), the sec... |
I'm reading our school's notes for cryptography, and it does a good job explaining CBC and DES in detail, but it fails to provide good information on how they are related.
From what I've researched so far, it appears that CBC is essentially a series of block ciphers, and DES can be used for the block cipher encryption ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.