instruction stringlengths 32 27.2k |
|---|
I asked an AI the following question:
Can you provide me with random numbers of 30 digits in length?
And then the AI has generated these numbers for me.
563958422461839604397274590248
743298571529845197630149526734
962345019834590239458293827563
841259630492576302945836184025
129458392650293745092837563945
9384750298... |
I have a theoretical question about the probability of collisions of hashes versus random numbers. I'm not interested in the exact probabilities. The exact hash function is not relevant (we can assume it is perfectly uniform, cryptographically strong, etc.). The implementation of the random number generator is also not... |
(Sorry for a newbie question)
In ECC the intent is to create a group of a prime order (or prime multiplied by a relatively small cofactor).
I know there's an algorithm for ECC to count the number of elements. My question is: how is it known that the group order is indeed prime? AFAIK there're no known deterministic alg... |
The use case here is to deterministically generate a multi-use wallet from a single 12-word BIP39 mnemonic. Currently a standard process for deriving secp256k1 keypairs is implemented, e.g., using a derivation path like m/44'/60'/0'/0/x for an arbitrary x (0, 1...) to derive keypairs, which include a 32 byte/256 bit p... |
I am learning about Elliptic curve scalar multiplications and I am on NAF, and I am trying to figure out the concept.
What I understand is if I have K=27 with using NAF the binary looks like this 100-10-1 then the scalar multiplication process like this: 2(2(2(2(2P))-P))-P which is 5DBL and 2ADD.
My questions is if wan... |
Should you hash the salt on its own ? Is that possible?
for example being password with salt appended at the end hash(pass || salt) and hash(salt) in a password file?
|
I have a pytorch model that generates bond trade pairs that have a high probability of reverting to the mean in a 30 day time period.
I want to sell the signals, but I do not want them to be redistributed. Is there a way to encrypt my data signals, if I put them on a marketplace like Amazon Data Exchange or Snowflake?
|
This is the problem
Let $\mathcal{L}$ be a lattice and $v_1,v_2,\ldots,v_n\notin\mathcal{L}$. Given the values $a_1,\ldots,a_n$ such that
$$a_1=\lfloor v_1\rceil+v_2+\ldots+v_n$$
$$a_2=v_1+\lfloor v_2\rceil+\ldots+v_n$$
$$\vdots$$
$$a_n=v_1+v_2+\ldots+\lfloor v_n\rceil$$
where $\lfloor\cdot\rceil$ means projection to $... |
I'm trying to understand the exploitability of the padding oracle attack, which enables someone to decrypt and encrypt the contents without knowing the encryption key.
Can encrypted data with the first block, be decrypted by the app that relies on a static IV without knowing the IV?
I want to understand the padding o... |
The implementation of Shamir secret sharing in this code, only generates the original image if the shares are provided in consecutive order (ex: [2,3,4]) and won't work in any other share order (ex: [2,4,6] or [4,1,3]). However, Shamir secret reconstruction does not require the shares to be in any order, then why does ... |
I want to wrap a private key out of a HSM, using an external EC key pair (master key) and then verify that I can recover it.
The wrapping occurs as follows:
Generate a secret AES key in the HSM, using the public part of the EC master key, the private part of the internal key pair and the derivation mechanism CKM_ECDH1... |
In the paper Efficient and Secure Pairing-Free Certificateless Aggregate Signature Scheme for Healthcare Wireless Medical Sensor Networks, on the signature generation part (Page 5), there is an equation $Y_{2i} = [(y_2x_i + h_{2i}d_i)modq]P_{Pub} = (u_i, v_i)$.
How is a group element assigned to two integers? $u_i$ is... |
I need to sign a URL to make sure the URL cannot be tampered or forged.
The client has limited capabilities and I cannot use a key which is more than 50 characters long.
Generally I use RSA to generate the signature, with keys of the proper size.
So I am not sure what technique to use to keep the signature safe enough.... |
In PKCS#11 documentation § 2.1.23 is described how to wrap and unwrap a target asymmetric key of any length and type using an RSA key, called CKM_RSA_AES_KEY_WRAP. This mechanism could be easily implemented by hand in case it is not available in HSM.
The counterpart exists for EC, CKM_EC_AES_KEY_WRAP can wrap and unwra... |
I need a way to encode a set of information in a way that the result would be as short as possible with a requirement of it being usable as part of URL string.
I don't really care that much about security, the encryption is applied mostly for the plain text to not be visible right away. At the same time, just encoding ... |
I received two distinct outcomes from a single input using SHA3-256 and KECCAK-256:
input --> sha3-256 --> output1
input --> keccak-256 --> output2
I want to find input2, which will give me output1 after Keccak-256 hash :
input2 --> keccak-256 -> output1
Is it somewhat possible? I read somewhere that SHA3-256 and ... |
I find it hard to fully grasp the whole Pinocchio protocol
.
I understand that the $\alpha$ s are for restricting the prover to compute only the corresponding set-up values.
But it's not clear for me to pick up $\gamma$ for the consistent(same) witness check.
From what I can tell, this protocol cleverly embedded differ... |
I have found myself in a position where I need to encrypt multiple objects (vCards) with AES Counter mode or Galois/Counter Mode using the same key. Now here is the problem the structure of the vCard always starts with predefined values i.e. here is an example from wikipedia
BEGIN:VCARD
VERSION:4.0
FN:Simon Perreau... |
This is Dan Boneh's video on PLONK - https://www.youtube.com/watch?v=vxyoPM2m7Yg
I went through the video multiple times & also tried to go through the original PLONK paper - https://eprint.iacr.org/2019/953.pdf
Boneh's explanation of PLONK involves the steps
1) Boneh consider's the trace of the equation as the inputs ... |
Is there a lossless compression algorithm that has hashing-like properties where there are multiple solutions to it?
As in for example, when a 1000-bit data-sequence is compressed into a 500-bit data sequence, there are multiple possible 500-bit data sequences that can be generated as outputs. Each of these 500-bit dat... |
Backgroud: I am reading the paper "Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures". (here is the link). And I got stuck in understanding the computation of moment.
Question statement: In section 4.3 of the paper, It defined: For any $V=[\mathbf{v}_1,\cdots,\mathbf{v}_n] \in GL_n(\mathbb{R})$ and an... |
We are planning to organize a workshop with the participation of academicians, engineers and graduate students working in the field of cryptology. On the first day, we are planning a fun competition for the participants as an ice-breaking event. Our goal is to organize a quiz on fun, little-known facts about cryptology... |
This may be a stupid question but I've been stuck on parsing these definitions for a while.
I am reading the paper "On Ideal Lattices and Learning with Errors Over Rings" by Lyubashevsky, Peikert, and Regev. I am trying to understand the error distributions they are proposing. In section 3, they define a set $\mathbb T... |
Finding a cryptography library to implement various application features is not difficult nowadays, thanks to options like NaCl, Google Tink, PyCA, and OpenSSL.
However, I've been struggling to find a library that supports group signatures, which is causing confusion. Would anyone be able to provide an explanation or r... |
I am trying to understand STARK with not much math. I understand SNARK like this:
Computation → Arithmetic Circuit → R1CS → QAP → zk-SNARK
From the helpful article: https://z.cash/technology/zksnarks/
We have a computation with many steps that can prove something. We take that and create an arithmetic circuit (in simpl... |
Suppose we have a standard $\Sigma$-protocol for proving the knowledge of a witness $x$ for the statement $y$. It has an honest-verifier ZK and special soundness. Now we do an unusual modification to get an interactive $\Sigma'$-protocol in ROM:
The prover $\mathcal{P}$ compute $a$ exactly like in $\Sigma$-protocol an... |
I am trying NIST SP 800-22 to test the randomness of 128 bit output in AES, but i always get igamc: UNDERFLOW or Segmentation fault (core dumped) error.
My data file has 128 bit output format, for example as follows:
0110110001000101111101110101001101100000010111100111110001001011101111100101001110110100000011101101110... |
I'm a dev new to security and cryptography.
I'm writing a password manager and Time-based OTP combo in dart/flutter to use in multiple devices and platform for fun and use it personally for real. I have done some reading over google, stackoverflow.com and crypto.stackexchange.com, came up with following skeleton, and h... |
I would like to investigate if it is possible to introduce Differential Privacy (DP) to a model via both adding Laplacian noise to the training data and then training with DP-SGD updates. Is it a valid way to introduce DP ?
In other words, if we separately applied Laplacian noise to the data the system would be assigne... |
According to FIPS 186-4 § D.1.1.5 Choice of Base Points I should be able to create ECDSA signatures with custom base points on P-256 (secp256r1).
Does standard PKCS#11 support this feature?
This is how far I got building example code, based on org.xipki:ipkcs11wrapper:1.0.4 and SoftHSM 2.6.1:
import org.xipki.pkcs11.wr... |
Consider a system where DES is used to encrypt HTTP GET requests. The first three bytes correspond to the character sequence "GET". How many encrypted messages is it necessary to intercept to be sure to guess the key used to encryption ?
|
I'm using the Rivest Shamir Wagner Time Lock Puzzle setup in an application, leveraging Pietrzak's algorithm for generating the proof.
My question has to do with selecting a proper starting point. In this paper the authors talk about verifying that the starting point is a modular square root. They discuss the choic... |
Is it theoretically possible to use homomorphic encryption to run an encrypted algorithm over encrypted data?
If this is not possible, is it at least possible to run an encrypted algorithm over plain data (beyond a plain algorithm over encrypted data)?
Ideally, can you cite papers where I can read about it?
|
Does the order of Lagrange interpolation have any role in reconstructing the secret key in Shamir's secret share?
|
Is it possible to find a secure curve which's base field is the scalar field of secp256k1?
In general, can you find a secure curve defined over the scalar field of any secure curve? (For example, a secure curve defined over the scalar field of ed25519?)
Edit: Using the same parameters as secp256k1 (in short Weierstrass... |
The OpenSSL 3.0 rand function's DRBG uses the getrandom() system call to get 48 bytes of secure entropy from the kernel. It also uses other information like the system uptime, available RAM, and other factors public in user space. So if the getrandom() function is compromised by an adversary using a rootkit, how would ... |
In my application I have an SQLite database that stores labels for images, like this:
IMAGE ID
LABEL
1
foo
1
bar
2
bar
3
foo
The LABEL column is indexed as it is important that I can efficiently find all images with a certain label.
At rest I would like to encrypt those labels so that no one can learn... |
Consider a Tor hidden service. I want to retrieve the main page of such website in such a way that I can later prove to a skeptical third party that the website with this certificate (identified by the public key in the address) provided me with this exact HTML page.
Is this possible assuming the website does not insta... |
I want to use a data structure like merkle tree in a hypothetical blockchain that, if needed, can fast check whether a wallet/account has received directly or indirectly from a specific list of wallets/accounts in the past. And in an ideal case, how much of the current balance of this wallet has been received from the ... |
Specifically if we know the $r$ takes values from the set $\{0,1\}$and $c=g^r*h^m$ does the hiding property still hold? I think I already managed to prove that the binding property holds due to the difficulty of the Dlog problem and my intuition says that the hiding property is compromised. But I can't seem to figure o... |
I am reading this explanation of zkSnark written by Maksym Petkus - https://arxiv.org/pdf/1906.07221.pdf
In page 24, the zk-SNARK of polynomial is explained. In setup phase, the proving and verification keys are created by a trusted setup. I understood how proof is created using the proving key.
However, if we see the ... |
Where can I find a clear algorithm diagram of SPECK algorithm? I want to follow steps to write ARM assembly code.
|
I recently read the article on the threshold signature scheme “Fast Multiparty Threshold ECDSA with Fast Trustless Setup” and I have a question.
In the key generation section, each player $P_i$ selects $u_i$ and then performs a $(t, n)$ Feldman-VSS of the $u_i$ value. In this case, other participants can make use of La... |
I'm having problem proving the following, I intuitively think this is correct but can't formally prove why.
given a PRF $F_k(x)$
proove that the following is also a PRF
$$
F'_k(x) = \begin{cases}
F_k(x)&\text{if }k\neq0\\
\\\text{const(some const value)}&\text{if }k=0
\end{cases}
$$
I found my mistake, I did not use... |
Suppose we sign and verify messages with a DSA scheme. Before signing the first
message the necessary parameters $(p,q,h,g,x,y)$ are initialized, including the nonce $k$ as an integer between $(1,q-1)$.
For each message, this value is increased by a fixed amount $b$. Therefore it grows linearly .
How can I prove that t... |
I have a request in which I get a series of data in clear (nothing encrypted) and a MAC / authentication tag.
The question is whether the MAC should be validated first or if the fields are filled in or are numerical (or similar validations). I have always considered that the MAC must be validated first, however, I can... |
On an exam I recently took, one of the questions was:
Consider the following signature scheme. The public key is $(p,g,g^x)$, where $p$ is a large prime number. $g$ is a generator of $\mathbb Z^*_p$, and $x$ is a random number in $\mathbb Z_{p-1}$. The secret key is $x$. The scheme also uses a public hash $H(M)$ that ... |
I recently took an exam where one of the questions was roughly the following:
You need a specific way for sender S to send a large file M to a receiver R with their secret-public key pair, without interaction. You cannot use interactive key exchange protocols. The receiver’s public key is assumed to be authentic. The ... |
I'm currently working on a distributed consensus-based system. I currently give the system a private key through a threshold encryption model, and I want to be able to take some data encrypted with the network's public key and re-encrypt it with an arbitrary public key without any member of the network knowing what the... |
Hello I am trying to understand why the Sidelnikov-Shestakov attack doesn't work for McEliece cryptosystem based on Goppa codes whereas it works when based of GRS codes.
I understood how the attack works but I don't see why it fails with Goppa codes since they are quite similar than GRS codes.
On the 2007 paper https:/... |
Normally I use Argon2 to generate an encryption key, and then use AES to encrypt data with that key.
Can I just set the hash size to be equal to the data size, set the associated data to a random value, and then just use Xor on the Argon2 output to encrypt/decrypt the data instead? Or are there some cryptographic prope... |
I am simply wondering what the bit-length in the algorithm variant in the table below refers to? For the hash functions I assume that this refers to the ouput length in bits. For instance for SHA3-256 this means the hash will be of 256 bits in length. Is this correct?
But, then, what does the 256 mean for the XOF SHAKE... |
I have built a small password manager desktop app using python. This app falls under the master-password model.The app connects to two databases stored locally. The first database stores the users username for my app and the hashed (sha256+salt) master password it also stores an email for password recovery puprpose. Th... |
Use Case:
Web application accessed in browser. Registered users can store personal notes in the application, these notes are stored in a SQL database on a online server. The user can store unencrypted notes and encrypted notes. For unencrypted notes the process is trivial, just store the notes in the database. For encr... |
I was wondering whether quantum-computers really break Schnorr's signature scheme. Schor's algorithm works via the quantum Fourier transform, which reveals the cycle time and thus phi. However, with a multiplicative group mod $q$, a prime, everyone knows the cycle time, but that isn't the problem (unlike RSA). The prob... |
I store the ciphertext and the nonce in a SQL database.
If I decrypt the ciphertext change it and encrypt it again I generate a new nonce, so that I do not encrypt two different plaintexts with the same nonce. After encrypting the updated plaintext I store the ciphertext and the new nonce back to the database.
My quest... |
It is a bit stupid question, but I am so confused. Please examine my explanation. What is the space that exponents the generator $g$ of a cyclic group $G$ of prime order $p$?
I think it is $\mathbb{Z}_p$ since $|G|=p$, so that $G=\{g^0, g^1, \ldots, g^{p-1}\}$. Thus the space that the exponents live is $\mathbb{Z}_p$, ... |
From the PLONK paper.
On pages 19 & 20, the paper describes the prescribed permutation check in PLONK.
In the last step of the proof, these are the checks
a) $L_1(a)(Z(a) - 1) = 0$
b) $Z(a)f'(a) = g'(a)Z(a \cdot g)$
In (a), I think checking $Z(a) - 1 = 0$ & doing the (b) check as written is enough. What purpose does m... |
Do you know a blockchain that does not use at all cryptographic primitives standardized by USA or other countries? It is strange to me that the security of many cryptocurrencies is based on ciphers, hash functions, elliptic curves, etc. from American standards.
It is normal when a cryptographic product contains standar... |
The CEO of the organization XYZ decides to hold a vote to decide whether employees should be allowed to work from home (WFH) either one, two or three days a week.
All 4 employees of XYZ (excluding the CEO), need to vote either “WFH one”, “WFH two” or “WFH three”. To ensure privacy, the CEO asks employees to send their ... |
Given some group in which both discrete logarithms and the computational Diffie-Hellman problem are hard. Furthermore, two random, unrelated group generators $G_1, G_2$, and a third generator defined by $H = G_1 + G_2$. Can you compute $xG_1$ if you know only $G_1$, $G_2$, and $xH$?
My guess: I would assume it's hard, ... |
How do we know that hash functions cannot be reversed? An example is often given of two primes and their product, but any composite number that is the product of two primes has, by definition, exactly 2 natural factors. In the case of hash functions, things are different.
Have there been attempts to reverse hash functi... |
I am constructing a two-party OR gate and trying to do this with oblivious transfer. Yet I am very new to oblivious transfer, wishing to know whether the following construction makes sense.
Goal: Alice inputs a random bit $a$, Bob inputs a random bit $b$, and Bob outputs the logical OR bit $a\oplus b$.
Construction via... |
Suppose that Peggy(prover) and Victor(verifier) are running some zero knowledge proof protocol that does not rely on hidden verifier secrets. The verifier generates randomly chosen challenge values only. Such protocols can be Fiat-Shamir transformed into NI(non-interactive)ZKPs.
There is significant work on NIZKPs. Usi... |
Here is a CTF crypto challenge likes(its write up is public on https://ctftime.org/writeup/15438):
$$N = p*q\\
c1 = (2*p + 3*q)^{e_{1}} mod N\\
c2 = (5*p + 7*q)^{e_{2}} mod N$$
After i transform these:
$$(c^{e_2}_1)\equiv (2p)^{e_1e_2}+(3q)^{e_1e_2}\pmod{N}\\
(c^{e_1}_2)\equiv (5p)^{e_1e_2}+(7q)^{e_1e_2}\pmod{N}$$
Afte... |
When attacking RSA with Square&Multiply, one can figure out the secret key by looking at the exponentiation algorithm itself. To prevent this in software, we could use dummy multiplications after each square.
Yet, there are attacks like correlation power analysis on AES, which is vulnerable to it by definition. How can... |
I have some questions about the setting of the one-way authenticated key exchange of Kyber.AKE as defined in section 5 of the paper.
How does $P_2$ authenticate itself to $P_1$? It is not obvious to me in the paper how it is ensured that $P_1$ really communicates with $P_2$. So how does $P_1$ know that it can actually... |
Could anyone explain me the difference between "key_share" extension and "server_key_exchange" message in TLS (1.3) ?
If I understood right, these "packets" of data are used to send a key material to generate premaster keys. But what's the difference ?
In which case a server must use one or another
|
From the PLONK paper.
On pages 19 & 20, the paper describes the prescribed permutation check in PLONK.
------------------------------------------------------------------------------------------------
My question is about the Step 3 in the protocol which I have marked in red
I am interpreting $1 \le j < i$ as $j =1$ to... |
When I want to encrypt a 16 byte long message with AES-128-CBC using int TLS 1.2 do I need to add a 16 byte block of padding or can I just encrypt the message without padding ?
|
For example is it harder to break one 256 bit encryption than two 255 bit encryption for RSA and AES?
For example, I understand that 256 bit RSA can be cracked in one minute according to this article [1] So would two independent 255 bit RSA message take thirty seconds each, and four 254 bit messages take 15 seconds eac... |
When using AES-256 (cipher mode CBC and padding mode PKCS7) in combination with HMAC-SHA for authenticated encryption (assuming alternatives like TLS and AES-GCM cannot be used),
should we use SHA-256 or SHA-512?
This answer seems to indicate SHA512.
Is this interpretation correct?
I've seen an implementation using SH... |
I need to implement a Merkle tree using a 128 bit hash function. In general, any hash function that guarantees pre-image, second pre-image and collission resistance should be fine to implement a Markle tree. Is it correct? Probably, it is not even necessary to have pre-image resistance as long as the other two properti... |
Alice has master EC key pair: $a$ - private key, $A$ - corresponding public key
Bob generates 2 random integers $r_1$ and $r_2$ and wants Alice to derive 2 new key pairs:
$a_1$ = $a$ + $r_1$ and $a_2$ = $a$ + $r_2$ and corresponding public keys $A_1$ and $A_2$
Questions:
Is it possible for Alice to prove that she deri... |
Summary: The operation of the Enigma Bombe is well documented. I manage to use it and a candidate checking machine to recover the plugboard pairs and the ring setting for the fast rotor. I struggle to recover ring settings for the slow and the middle rotors.
Question: Where can I find out more technical details on the ... |
I am working on a chat feature to use both post quantum cryptography along with RSA, and want to confirm my thoughts.
As these algorithms haven't been fully battle tested, I have decided to use a combination of both PQE and usual public, secret key cryptography
I decided upon the best algorithms to use for security.
S... |
I'd like for two machines on a network to be able to prove to each other that they both have knowledge of a pre-shared secret, without revealing the secret to each other. Let's assume that all traffic over the connection between the parties, A and B, is encrypted.
Here are the steps I'm currently imagining:
1. A->B: no... |
I have been researching the best encryption to use in a .NET application for managing a sensitive database field (column). This encryption is on top of e.g. AWS at-rest encryption applied to the whole of the database and is aimed at frustrating use of the sensitive data by anyone other than the application (which knows... |
I'm drafing an RFC for a low computation crypto algorithm, intended for low power bluetooth communication. Likely without a connection using advertisements only.
It's going to include raw C code examples so it should be quite portable.
Is there a good site to post my RFC to, where it will be more visible than say, my d... |
assuming that I have an RSA key of length 4k bit which I'm interested to wrap using AES-GCM, and I have a (limited) AES-GCM cipher which can only encrypt limited input in size (say 256-bit/512-bit input) per invocation.
Is there a way/conditions to fulfill when splitting this 4k bit key into smaller keys to fit my (lim... |
Disclaimer: I first posted this question on security.stackexchange some minutes ago but deleted it, this is probably a better place for it.
My goal is to use JWE with hybrid encryption (ECDH+AES) for exchanging sensitive data with another party. However, the example code I can find for various Java libraries doesn't ma... |
When we take the coin flip in Blum's algorithm in "Coin flipping by telephone a protocol for solving impossible problems", where Alice and Bob both want ownership over the same car, then one party (the adversary / Alice) can abort the protocol. Provided there does exist a powerful third party (e.g. the law), the protoc... |
The PLONK paper uses the term preprocessed polynomial a lot of times.
For e.g. page 14
The protocol definition includes a set of preprocessed polynomials $g1, . . . , g_l \in F<d[X]$
Page 20
Preprocessed polynomials: The polynomial $S_{ID} \in F<n[X]$ defined by $S_{ID}(\mathbf g^i) = i$ for each $i \in [n]$ and... |
I'm trying to understand some cryptographic properties of the s-box so I can have my own code. Example of balanced properties I read in this document that they say
A boolean function S : $ GF(2^n) $ $ \to $ $ GF(2) $ is called balanced if the output
set contains equal number of ones and zeros in the corresponding tru... |
I am working with lossy ID-schemes and their security in the QROM. Following the article of Kiltz et al. , I am at a loss of the number 8 appearing in most reductions throughout the article. I know it comes from the Generic Search Problem for Bounded Probabilites, however how?
The Lemma from the article as wee as the g... |
I am working on MPCs (multi party computation) in crypto, and now I am developing a implementation of GG 18.
In sign phase, algorithm needs MtA (Multiplicative to Additive) and uses a Paillier key pair for this.
Paillier uses modulus $N$ ($N=p_1 * p_2$†, prime numbers drawn at key generation). But we need to consider t... |
From this blog post: https://medium.com/@VitalikButerin/exploring-elliptic-curve-pairings-c73c1864e627
if P = G * p, Q = G * q and R = G * r, you can check whether or not p * q = r, having just P, Q and R as inputs.
How?
It's easy to see p * Q = q * P = R. But I don't see the leap to proving p * q = r.
|
In a previous question, I asked how to implement arbitrary s-box in side-channel-free fashion. The code I posted in the question loops over all 256 values of a byte to avoid timing channel, and I want to change it to loop over the values of a word.
Before getting carried away and lost, I'm considering lazy-initializing... |
Passkeys have this complicated QR code + Bluetooth dance to enroll a new device which seems like it ought to be securely creating a key on the device in a TPM.
However the messaging around "sync" seems to suggest that while that is happening, the device key is only used to encrypt a software key which is encrypted and ... |
I am working on manual decryption of application data in TLS 1.3 by going through example in RFC8448. I successfully derived and expanded key and IV, but the IV in examples is only 12 bytes long instead of 16, which is required for AES-128-GCM.
|
I am new at cryptography and start to learn some terms. I just saw an question in the book and didn't got a clue about this question. Could someone can explain me the answer of this question? Because all of the questions seems to be fine for me.
Assuming the block length is 8 bytes (L = 8) Which of the following is/are... |
I have stuck in two problems when understanding the noise management of BFV scheme, and I don't have any idea about the two problem, help me please.
Problem 1:
In the Lemma 3 , the paper demonstrates that the norm of the noise after multiplying two ciphertexts $ct_0$ and $ct_1$ is $\left \|v_{mul}\right\|$=$E\cdot\del... |
From the PLONK paper.
Page 29, Round 3
The paper doesn't explain the need or the use of the quotient challenge $\alpha$.
I understand why each of the polynomials is multiplied by $\frac {1}{Z_H}$ but don't understand why the second is also multiplied by $\alpha$ & the last by $\alpha^2$ - what purpose does the quotien... |
While exploring secp256k1, I came across what seems like the official definition at https://www.secg.org/, specifically in https://www.secg.org/sec2-v2.pdf. In terms of authorship, the document only contains references to the Standards for Efficient Cryptography group and Certicom (acquired by Blackberry). However, man... |
In this image, It describes the basic idea of an iterative hash function. I am confused as to why the i value is set to be m+t+1 as default. Specifically, where does the 1 come from as m+t is just the arbitrary output size + t the message chunk size but the 1 im confused about
|
I try to understand a oracle Padding Oracle Attack example. I try to solve this question but I didn't figure out the answer.
A 7-byte message is padded per PKCS#5 and encrypted using the CBC mode of operation. The resulting ciphertext is
0x07 06 05 04 03 02 01 01, 0x08 09 0A 0B 0C 0D 0E 0F
Assume an Attacker modified t... |
What is meant by "supported groups" in the section 4.2.7. "Supported Groups" of RFC 8446:
/* Finite Field Groups (DHE) */
ffdhe2048(0x0100), ffdhe3072(0x0101), etc:
Is the digits - 2048, 3072 (and groups) etc - are simply numbers of bits of the parameter p (module) in DF algorythm or something else ?
|
Section 2 of RFC 8446 says about the phase "Key Exchange": … Everything after this phase is encrypted.
The "Certificate" message is sent after "Key exchange" as the scheme in that section shows. So it seems to be encrypted.
I am confused that I haven't found a mention of certificate encrypting in the "Certificate" sec... |
The sequence number should be a 64 bit number in every TLS record, but the record header layer is only 5 bytes long and I am looking at a Wireshark pcap, where the TLS record only includes the header and encrypted application data. There is no sequence number.
|
I'm developing a custom Authentication Socialite ADFS Provider using OpenID Connect: Authentication Flow.
Since I have a TLS connection between the client App and the Authentication server that issues the token, what is the point of verifying the access token signature?
From my perspective, the connection is already au... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.