instruction stringlengths 32 27.2k |
|---|
Suppose someone has figured out how to factor integers in polynomial time, thus breaking the RSA system. Also suppose this person does not want to reveal the secret of how to factor integers in polynomial time, only to prove he or she has broken it (or at least give evidence that he has broken it). One way to do this w... |
The linear regression is simply $y=Wx+b$, where the server holds $W$ and $b$ and the client holds $x$. The private linear regression means the client sends encrypted $x$ to the server, and receives encrytped $y$. Then the client can decrypt $y$ for result. I have read some papers about privacy-preserving linear (logist... |
Community,
I'm new into lattice based cryptography, and I'm interested about the security of cryptography schemata like Kyber and why the focus of solving this problem lead into solving approx. SVP.
If you're looking into breaking Cryptography schemas like Kyber you find statements like:
“The best known attacks against... |
The overview of Blake3 states that Blake3 is internally a Merkle tree. Diving a bit deeper into the paper one finds out that Blake3 splits its input in chunks of 1 KiB (1024 B), organizing chunks in a binary tree whose root is used as the Blake3 hash of the input. This makes it fast to compute the Blake3 hash of large ... |
With TLS 1.3 supporting only secure, forward-secret cipher suites, are there any significant technological improvements that could still be made to the protocol?
|
I have two keypairs on the curve curve25519
k1 --> (a, aG)
k2 --> (b, bG)
I can compute and verify that a(bG) = b(aG).
Lets say k = a (bG), I'm computing scalar inverse of a which is pow(a, -1) and computing pow(a, -1) a (bG) and expecting that it will be equal to (bG) but i see its not equal to bG.
From a(bG) by only... |
The NIST Computer Security Resource Center called for nominations for a process to standardise lightweight symmetric primitives in August 2018.
In the update talk in the 2019 Lightweight Cryptography Workshop, it was hoped that winners would be announced in 2021.
At the 2020 workshop, it was hoped that finalists would ... |
Let $G:\{0, 1\}^n \to \{0, 1\}^m$ be a PRG. We define another PRG $G_0 : \{0, 1\}^n \to \{0, 1\}^m$ as follows: $G_0(s) = G(s) \oplus (0^{m−n}\mathbin\|s)$. Can there exists a secure PRG $G$ for which $G_0$ is insecure?
The question asks me to prove that such a PRG exists. But I am not sure how. Primarily I was think... |
Suppose we have two ciphertexts c1 and c2.
c1 is generated based on the param whose slots are 1024.
c2 is generated based on the param whose slots are 512.
Then is multiplication available between c1 and c2?
If not, can we shrink c1 to have 512 slots? If we can shrink, how to shrink? Any ideas, steps or references? The... |
For clarification, the protocol works as follows: $P$ wants to convince $V$ that he knows $x$ such that $g^x=y$, where $g,y\in\mathbb{G}$ of order $p$; they perform the following steps:
$P$ samples $k\stackrel{R}\leftarrow\mathbb{Z}/p\mathbb{Z}$ uniformly at random, computes commitment $r\leftarrow g^k$, and sends $r$... |
I have an encryption scheme set up with a client and server that utilizes AES 256. What I am curious about is whether or not all information sent from the server to the client can be verified as legitimate using just a single digital signature (ECDSA, secp256k1 specifically) on the key that is sent to the client.
Given... |
Given a Schnorr Public Key (32 bytes) x, I'd like to generate a compressed ECDSA Public Key (33 bytes) and thus be able to generate the bitcoin address that the private key holder can generate with their private key.
A Schnorr Public Key is x (BIP340, https://bips.xyz/340 - more detail about the Schnorr signature.)
A... |
This is an existing website with approx. 100K accounts, and passwords are hashed using bcrypt with a high number of rounds.
The current design that I'm questioning is that we're sending the username and password to the server, and doing the bcrypt on the server, instead of sending a SHA generated in the browser and bcr... |
Let we have 2 generator $G$ and $H$ in any elliptic curve.
A prover creates a ciphertext with Homomorphic ElGamal, $(r_1G,\;mG + r_1P)$ such that $r_1$ is random and $P$ is public key of the prover.
Then the prover creates a Pedersen commitment $(mG + r_2H)$ or $(mH + r_2G)$ if it makes the proof easier.
The prover wan... |
I am implementing TLS (or something like it perhaps) because the browser doesn't seem to provide a direct client-script interface to TLS. The browser provides a SubtleCrypto.encrypt() function that claims to do AES-GCM. However, the documentation for this function does not mention an input for RFC 5246/5116 AEAD Associ... |
This question pertains to identity-based key encapsulation mechanisms (IB-KEMs). To recap the functionality:
$\mathsf{KeyGen}(1^\lambda) \to (\mathsf{msk}, \mathsf{mpk})$ Generates the master keypair
$\mathsf{Extract}(\mathsf{mpk}, \mathsf{msk}, \mathsf{id}) \to \mathsf{usk}$ Constructs an identity-bound private key $... |
In the concept of Automatic Test Pattern Generation (ATPG), two events are required to perform in sequence: Fault Activation and Fault Propagation.
In the case of a linear 2-input XOR gate, without loss of generality, we consider a stuck-at-0 fault at the input register a, while the input register b may take values in... |
Situation
I need to generate unique 16-digit decimal values in NodeJS API or C++ Addon.
It's used internally in my organization (gift card id). And performance doesn't matter as it's generated non-realtime.
I've searched for some options, but unsure about their safety. If there's better way to do it, please let me know... |
My studying material states that although symmetric ciphers can be either block or stream ciphers, it also states that asymmetric can only be block ciphers without further clarification.
|
Let's say we have an IND-CPA secure public key encryption scheme $\Pi = (\text{Gen}, \text{Enc}, \text{Dec})$. Construct a new PKE $\Pi' = (\text{Gen}', \text{Enc}', \text{Dec}')$ that behaves exactly as $\Pi$ except it additionally leaks the hash of the private key. For example, $\text{Gen}' = (sk, pk \vert \vert H(sk... |
I'm reading Boneh and Shoup's book "A Graduate Course in Applied Cryptography." Im doing one of the questions at the end of the stream ciphers chapter. I'm not sure how to do this problem:
Let $\mathcal{E} = (E,D)$ be a cipher defined over $\mathcal{K}, \mathcal{M}, \mathcal{C}$. Assume that one can efficiently generat... |
I'm aware that GnuPG encrypts for multiple recipients, but is there any way to build a multisig, say, 2 of 5 signatures with GPG?
So having a file encrypted for the following recipients needs at least two of the five to decrypt it:
gpg --encrypt \
--recipient alice@example.com \
--recipient bob@example.com \
--re... |
I want to encrypt data on client side with Openssl AES 128 GCM and decrypt those data on server side inside Intel SGX using rijndael 128 GCM. I can see inside sgx_aes_gcm.cpp that it uses the same functions from Openssl.
I can imagine that the tag generated by EVP_CIPHER_CTX_ctrl(pState, EVP_CTRL_GCM_GET_TAG, 16, tag) ... |
https://en.wikipedia.org/wiki/Disk_encryption_theory
Why do we use XTS over CTR for disk encryption?
If we used ChaCha20 (without authentication) by simply encrypting each disk sector with the same random key and with the block number as the nonce (no additional data), how would this break the properties of the securit... |
We have a block cipher $E:\{0,1\}^{128}\times\{0,1\}^{128}\rightarrow\{0,1\}^{128}$.
We know that the PRP advantage of E is Adv$_E^{PRP}=t/2^{128}$ where $t$ is the time needed by the algorithm to get the maximum advantage.
From $E$ we define $E'$ such that $E':\{0,1\}^{128}\times\{0,1\}^{128}\rightarrow\{0,1\}^{128}$ ... |
In light of the LastPass hack their use of PBKDF2 had me wondering a few things.
If PBKDF2 with a salt and the Master password is used to generate a vault password every time you type in your master password to access the vault wouldn't that salt need to always be the same?
If so then where is that salt stored and wo... |
I did some experimenting with web subtle crypto.
I derived a key using PBKDF2 with SHA-512 and 100 000 iterations and timed it.
Doing same with 200 000 rounds doubled the time as expected.
Then I did PBKDF2 twice in parallel, both with same password, same iteration count (100k) but different salts. This took about same... |
I'm currently trying to write the blake3 algorithm in JS using the official whitepaper or what it's called.
If I understand correctly then... after the 7 round keyed permutation (at the end of the compression function) the first half of the output values is then xor'ed with the latter half to get the NEW first half. An... |
Is there a well know (cryptographically secure) algorithm to shuffle a vector of values, deterministically, without using any randomness, such that it is hard (or as hard as possible) to guess its initial configuration?
The goal is to achieve an effect similar to what a hash function achieves, but instead of producing ... |
Let A(x) and B(x) be two secret polynomials. Suppose a user publishes commitments $C_A$ and $C_B$ to these polynomials (such that the lengths of $C_A$ and $C_B$ are sublinear in the degree of $A(x)$ and $B(x)$). I would like to prove that the GCD of these two polynomials, (given the commitments) is 1. Is there a speci... |
I'm considering a case when after hybrid encryption (AES Key encrypted via RSA) RSA key will be "splited" like in OTP.
On the end one side gets encrypted AES key and "half" key RSA, and second side gets another "half" RSA and encrypted data what force to combine both sides to decrypt data.
But...
What in case when same... |
I was reading the FORS and DFORS Few-Time-Signature scheme. I understood the security of HORS Few time signature equals to $ (rk/t)^k $, but I could not understand the security of FORS is $ (r/t)^k $ as discussed in the following paper page no 5. [Hash based signatures Revisited]: https://eprint.iacr.org/2020/564.pdf
I... |
Using the notation from the Wikipedia article: https://en.wikipedia.org/wiki/Schnorr_signature, the Schnorr signature mixes the random value $k$ and the hash $e$ like this:
$$s = k - xe$$
(Where $x$ is the private key scalar)
My question is: What would be the problem with reversing the two scalars like this:
$$s = e -... |
I need to know if there is a security proof for ECDSA in the Random Oracle model?
|
I'm a newbie, currently interested in data security & integrity.
I'm quite new to blockchain and distributed system theories, and suffering from some unclear doubts/questions on the fault-tolerant consensus.
May I ask for your kind advice on my dull thoughts regarding on the blockchain's true objective?
It would be a g... |
Hey I got a pointer a while ago to hidden order groups and I found papers like https://eprint.iacr.org/2006/178.pdf dating way back using this, but I couldn't find any elementary read on what can and can't I do with hidden order groups.
Does anyone have a small pointer for me on where to pick up reading?
|
I am self studying "A Graduate Course in Applied Cryptography" by Boneh-Shoup. I am not sure if my proof for the following problem in the book is correct. The problem asks to prove that if a stream cipher is semantically secure, then the underlying PRG is secure. Please let me know if my attempt works. If my solution i... |
I am looking at the paper on Kate Polynomial Commitments.
The paper refers to Appendix A & Appendix B but it's not available with the document. Does anyone know where I find the full paper with the Appendices?
|
So I needed symmetric encryption for my program. I landed on AES 192 bits in the CTR mode, because of some Computerphile videos on YouTube.
After using it with the Node.js "crypto" lib implementation, I noticed that some of the outputs are very similar. The output is created from a UTF-8 SQL syntax string input and dig... |
I have access to an HSM that can sign messages but doesn't have a way to expose the private key. The signatures are deterministic (RFC 6979). Another application only works with ed25519 signatures which isn't supported by the HSM.
Is it safe to have the HSM sign a message and use the signature as a secret to determinis... |
This is a follow-up of my previous two questions (1 and 2), might be relevant to check them out first for a full context. I am trying to re-create results from this paper. The basic algorithm is described here.
I am trying to implement NTRUEncrypt system but working on a Quaternion algebra. I think the code is correct ... |
Does encrypting plaintext multiple times with the same stream cipher but independent keys increase security? If each key is n-bits, and the cascade uses m-streams, could this be considered mn-bit encryption? If so, when?
Versions of this question are already addressed in the following posts, but they seem to mostly dis... |
I understand that from security perspective the sign-then-encrypt approach is the best.
I tried to implement it in Python with the cryptography package and I got this error: ValueError: Encryption/decryption failed.
This is not surprising. The maximum I can encrypt with RSA and OAEP padding is 190 bytes, but the signat... |
I'm working on some RSA code that uses Toms Fast Math (TFM for short), and I'm trying to understand why the functions fp_exptmod (for modular exponentiation operations) and fp_invmod (for modular inverse operations) both require an odd modulus and the former also requires an odd exponent. I've written code to allow th... |
I'm working on the blinding portion of some RSA code. Some implementations I've looked at don't verify that the random number used for blinding is relative prime to N as described on the Wikipedia page for blinding:
RSA blinding involves computing the blinding operation E(x) = (xr)e
mod N, where r is a random integer... |
I'm trying to implement ECDSA for learning purposes and have generated public and private keys, which seem to be correct as I have compared them with those generated by an online tool called noble. However, my signing or verification algorithm (or both) is not working correctly and I am having difficulty debugging the ... |
Are there any known weaknesses in Barreto-Naehrig Curves (e.g. BN P256) ?
|
Cryptographic sponge functions are a hot topic right now with LWC and all.
They solve the symmetric crypto problem with simplicity and efficiency. However,
none of them seem to achieve 256-bit security without relying on a gigantic state
(such as Keyak).
For example, why isn't Gimli (as per the NIST LWC paper), which h... |
NIST P-521 has the longest key size for standardised ECC, which has 521 bits instead of 512. If a quantum computer is available, how many qubits can break P-521?
|
You can get access to this document via institutional login at https://www.researchgate.net/publication/220556089_Security_and_composition_of_cryptographic_protocols_A_tutorial
So in Ran Canettis Tutorial on Composable Security I came across some definitions of how protocols can be composed:
Earlier, it explains an e... |
Is it possible to efficiently solve the discrete log problem for $r$:
$$
g^r\equiv v\pmod N
$$
When the following constants are know:
$$
N,\ g,\ v,\ \phi=(p-1)(q-1)\text{ s.t. }N=p\,q
$$
|
As shown in this paper the IND-CPA of NTRU is based on both the decision key cracking problem and the decision ciphertext cracking problem. However, I often see claims (such as in this paper) that the OW-CPA of NTRU only relies on decision key cracking problem. I don't see a way to prove this.
Suppose that in the OW-CP... |
What if we consider an MPC protocol in which all parties are dishonest? Is it unattainable (even with allowing abort) or is it just meaningless to think about?
|
This question is a direct follow-up (hopefully - the last) of my previous one; please see it for full information. I would like to further generalise NTRU cryptosystem on higher-order algebras. Following these two papers: resource1 and resource2 I am trying to implement the method for sedonions over polynomial quotient... |
I am searching for the exact definition of High density SIS and Low density SIS, but there is something unclear about it.
SIS problem is to find $x\in \mathbb{Z}^m$ such that for random $A\in\mathbb{Z}_q^{n\times m}$, $Ax=0$ and $\lVert x\rVert < \beta$.
As far as I know, high density SIS is when $n\log q < m$, so that... |
One method to create a secure MPC protocol against malicious adversaries is to create a secure protocol against semi-honest adversaries and then add some zero-knowledge proofs to ensure that the latter protocol runs honestly.
What if we create an honest programming language in which every line of code can be proven to ... |
I'm watching "SSL, TLS, HTTPS Explained" by ByteByteGo on YouTube and at the end, starting around 5:15, there are two points that are interesting:
in TLS 1.3 RSA is no longer supported as the a method for key exchange Diffie-Hellman is a more common way nowadays for exchanging session keys Diffie-Hellman is complicate... |
How to apply local differential privacy to specific categorical values in order to perform some analysis? Does there exist a tool?
For example, I have the following dataset.
email address
0 exampleemail1 exampleadress1
1 exampleemail2 exampleadress2
From this dataset, I take as output ... |
I'm somewhat confused about how the definition of a proof of knowledge relates to the Theorem 19.1 in Boneh-Shoup (http://toc.cryptobook.us/book.pdf), particularly in relation to Schnorr's protocol for proof of knowledge of a discrete logarithm.
As far as I'm aware, the standard definition of a "proof of knowledge" is ... |
I am a beginner in cryptography.
I wonder is it possible to create by Zero Knowledge Proof, to prove Two cipherTexts that are encrypted by same Public Key with Paillier Encryption have the same value inside but without decrypting the texts. I have access to the Public Key at the moment.
I have an array which is like [1... |
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 ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.