instruction stringlengths 32 27.2k |
|---|
A proposed secret sharing scheme: Suppose that $p:S\times Y\to X$, with $|Y|\geq|S|$ is a cipher where, $y\in Y$ is the key and $x\in X$ the code, $p$ is bijective, namely $(x,y)$ is associated with only one $s$. Hence the decrypted message $s=x\oplus y$ and it is easy to proove it.
$\textbf{Proof:}$ Suppose that we h... |
To use the Laplace mechanism, we have to get the global sensitivity of a query function. What do we do in the case where there is one huge outlier(or multiple outliers) in the dataset such that the global sensitivity gets too large and noise added results in query outputs that do not make sense anymore. In which case c... |
This is from the paper of Yevgeniy Dodis, Shai Halevi, and Tal Rabin
Could anyone provide some help about understanding how the following protocol is executed? The game is played based on the sequel assumptions: ``the players are (1) computationally bounded and (2) can communicate prior to playing the original game, wh... |
Take for example SHA256. Is it possible for the hash of a 64 character hex string S to be S? i.e:
$$H(S)=S$$
|
What's the difference between the definitions of virtual black-box (VBB) obfuscation and indistinguishability obfuscation (iO)? Is there any presentation describing both? Furthermore, why is the notion of iO interesting (and sufficient in practical sense) given that it is a weaker notion than VBB?
|
The problem setting is as follows. Suppose there exists a public input $x$ and the prover evaluates $y \gets VRF_{sk}(x)$, but the prover does not wish to reveal the output $y$. My question is would it be possible to let the prover publishes the commitment of $y$, say $com_y$, then proves that the committed value of $c... |
FIPS 186-4 Digital Signature Standard defers to ANSI X9.62-2005 for the specification of ECDSA, with additional requirements set out in Chapter 6 and Appendix D. However, X9.62-2005 has since been withdrawn and replaced by ANSI X9.142-2020. The FIPS 186-5 draft noted the withdrawal of X9.62-2005 and that X9.142 was und... |
Can one be thought to be a more powerful resource than the other? It seems to me like you could use QSDC to achieve the same thing as QKD (sharing of a secret key) without the use of a classical channel. What exactly is the trade-off between the two?
Finally, are there established bounds on the capacities of various q... |
I read about XEX mode of operation in Wikipedia
My question is:
There are two keys that are XORed against plaintext, if instead of two XORed keys I add 4 or 6, does it increase the security of block cipher mode?
In the case of 4 XOR operations, I mean XOR the first key, XOR the second, encrypt, and XOR the third and fo... |
I stumbled across this question where the questioner asked for specific requirements for the round function $F$ in a Feistel network so that the construction is secure. The answer explained that a pseudorandom function in a four round Feistel cipher is sufficient for it to achieve security.
Is that also necessarily the... |
Let $\text{Adv}^{\text{DLWE}}_{n,m,q,\sigma}$ be the advantage of an attacker to distinguish LWE samples from uniform ones, where $m$ is the number of samples, $q$ the modulus and $\sigma$ the standard deviation of the error distribution.
I can't find an explicit expression for this advantage.
Does reducing $q$ and inc... |
Currently, I have been assigned to attack a reduced version of SHA-1. What are we trying to achieve? How do we attack it?
|
I read about using 64-bit words in PRF functions.
I want to convert the 32-bit ARX cipher Chacha into a 64-bit version, with key/block size of 1024-bits (512*2=1024-bits)
My question is:
Should I add more rounds to achieve similar security?
|
I've came across an example where the e value is three but no matter what tool/script I try, I can't decrypt it. I'm wondering if the ciphertext and n is super super large, is it possible to crack it even if e=3?
|
I'm implementing ECC in my spare time project. I'm referencing RFC-6090 for point arithmetic algorithm over homogeneous coordinates.
In Appendix F subsection 2, there are 5 case labels when determining which formula to use depending on how many if any point-at-infinity exists in operands. For me, implementing these cas... |
I'm referencing RFC-6090 for an attempt at implementing ECC in my spare-time project.
In the RFC, pseudo-code examples are given to illustrate how to handle points-at-infinity in point arithmetic, and this involved several special cases. This is because the point doubling and point add formula in affine and homogeneous... |
I have a device that signs (symmetrically) very short messages, and I would like to sign a long one.
I split it into several short messages, signed each one separately, and now combine all the signatures. Of course, the trivial way is to concatenate them, but is there a way to have the combined signature of the same le... |
According to Representing a function as FHE circuit, the AND gate for FHE encrypted data is just A*B, in the case that the plaintext has only 0 or 1 coefficients.
Remember that on the BFV FHE scheme, it encrypts polynomials, and we can set the maximum value of the coefficients of the polynomial. So, if we set the max v... |
I would like to verify my system by running ECDSA NIST test vectors, but I am not getting expected output. I am able to calculate signature, but it is not right or at least "r" and "s" components contains different values than in nist vectors. What I am doing wrong?
Test vectors: NIST: FIPS 186-4 ECDSA - 186-3ecdsasigg... |
All current best practices about creating and using cryptographic keys I've found, refer to creating an encrypted data out of raw data. However, there is (or at least was a few decades ago) a practice where a key is not used to decrypt or authenticate anything, it is used solely locally as a (very week) proof of owners... |
How can I compare different cipher text? When deciphered, say the same thing. I would like to find out the ciphering method. Any help would be appreciated. Thanks.
The primary code needs to be a 8 characters. The cipher formula then spits out different 20 character Hex codes. Would giving the Hex codes and original cod... |
I will try to define easily the cryptographic system of this paper. The author designs a communication game for $N$ players. The private information of every player is denoted as $t_i\in T_i$ and represents the type of player $i$. The encryption system that the players use to communicate is based in the following repor... |
Consider the LWE problem.
Let $A$ be an $m \times n$ matrix, $x$ is an $n \times 1$ vector, $u$ is a $m \times 1$ vector, and $e$ is sampled from a Gaussian distribution.
We are given either $Ax + e ~~(mod~q)$ or $u ~(mod~q)$ the conjecture being that it is difficult to distinguish between these samples in polynomial t... |
I communicate with another person online,
I know he is a person because sometimes he also writes real messages
but at random timeframes whenever I send him a message he only responds with a dot
maybe the other person is playing a game with me but maybe he leaves his desk and turns on a bot
is there a zero knowledge pro... |
I was looking through the S/MIME Message specification (RFC 8551) to find out what security services it offers. Section 2.4.4 of this document describing AuthEnvelopedData content type (which uses the CMS type of the same name) says:
This content type is used to apply data confidentiality and message integrity to a me... |
Countless examples all over on implementation of AES. None of these actually make sense to someone with zero cryptographic or advanced mathematical experience.
This => too abstract & technical...
This => is very good and a lot closer, however still too technical & abstract...
Etc.
What I want to see is an actual exampl... |
SafeCurves defines criterias for choosing safe curves in elliptic-curve cryptography.
STARK Curve defines a Stark-friendly elliptic curve that can be used with ECDSA.
I was wondering: Is the STARK Curve a SafeCurve?
|
I'm testing my own PRNG generator which should has period $2^{38}$ bytes. So after exactly $2^{38}$ bytes it should start repeat. But PractRand find no anomalies after $2^{39}$ bytes.
Could it be that PractRand wouldn't detect this, or I had miscount something and the generator does not loop after that number of bytes?... |
Recently, I have found research papers about the functional encryptions for inner products and quadratic polynomials.
For inner products, there are a few papers which focus to construct efficient function hiding functional encryption for inner products. However, I could not find any results about the function hiding fu... |
As we all know, secure multi-party computation allows us to run a certain computation/function on private inputs contributed by different parties (that do not necessarily trust each other). The security guarantee of an MPC is that parties learn nothing beyond the computation result.
However, MPC does not deal with the ... |
Could we use permutation polynomials for secret sharing scheme like Shamir's? The say that they induce a bijection over $\mathbb{Z}_p$ what does this mean and how does it helps?
|
I would like to make a parallelism between Shamir's secret sharing scheme and how to define a cryptosystem where the encryption scheme is based on secret sharing. To begin with I do not know if there can be such an analogue.
Suppose that we have a standard cryptosystem. Mathematically, a cryptosystem or encryption sche... |
I would like to make a few questions about Shamir's secret sharing scheme and. To begin with, I am starting with the next theorem that determines the intuition of the whole theorem.
$\textbf{Theorem:}$ Let $p$ be a prime, and let $\{(x_1,y_1), . . . ,(x_{t+1},y_{t+1})\}\subseteq\mathbb{Z}_p$ to be a set of points whose... |
Suppose, If a SHA-2 hash does get broken completely with hardly any power, where would it get reported and is there currently a bounty on it?
|
In a $t+1$ out of $n$ secret sharing scheme where there is a network of $n$ players, in order to reconstruct the secret $t+1<n$ players are needed to share their parts $(x_i,f(x_i))$ so as the polynomial function of degree $t$ can be computed. However, all the $n$ want to have acces to this secret, but at least $t+1$ o... |
I have interest in e-voting and am currently trying to understand El Gamal re-encryption mixnet.
I understand how El Gamal encryption works and how mixnet works but what's not cristal clear for me is how the decryption is done after the re-encryption.
As I understand it, I just need the secret key to decrypt the encryp... |
Each block's contents are hashed into 32 bytes using $\operatorname{SHA-256}$ (call this string $a$). In order for the block to be accepted, there must be a 256bit nonce (call this string $b$) provided such that $\operatorname{SHA-256}(a\mathbin\|b)$ ($a$ concatenated with $b$) has $N$ or more leading zero bits, where... |
I am working with an older piece of software that generates encrypted backups that I'd like to decrypt. I have a plaintext key, a few examples of encrypted data and I'm pretty sure the data is ASCII, but I don't know how they derive the RC4 key from the plaintext key.
How would I go about testing key derivations compre... |
I am trying to solve 3pass Diffihellman problem. However, I could not solve it. Is there any specific rule exist to select a1 and b1 or problem in the calculation. Please help me to solve this problem.
|
Taking into account this paper I will write here a definition that the authors provide.
$\textbf{Definition:}$ (linear secret sharing scheme). A $(t,n)$ secret sharing scheme is a linear secret sharing scheme when the $n$ shares, $v_1,v_2,...,v_n$ can be presented as in Equation $\ref{5}$
$$(v_1,v_2,...,v_n)=(k_1,k_2,.... |
I have three questions regarding Davies-Meyer construction :
What is the name of the underlying block cipher?
How is generated the first input hash value (IV) passed to the block cipher?
What is padded to last original message block?
|
Let be Alice, Bob, and David three people. They all have public-key cryptographic system: private key and public key.
Is there any way, in some known cryptographic system (RSA, Elliptic Curve, etc.), that satisfies the following three conditions:
Alice, Bob, David don't know private keys from anyone
David could see al... |
There is an encryption scheme where the votes are encrypted with ElGamal and the decryption key is the secret that is shared among the authorities. After everybody voted they publish their part of the secret according to the Shamir tresholding scheme and everybody can calculate the tally.
Is it possible that every vote... |
The following extracts were taken from the Zero-Knowledge Proof page on Wikipedia:
In cryptography, a zero-knowledge proof or zero-knowledge protocol is a method by which one party (the prover) can prove to another party (the verifier) that a given statement is true while the prover avoids conveying any additional inf... |
What could $a_0=s$ in Shamir's secret sharing scheme represent?
As we already know in a $k$ out of $n$ secret sharing scheme, a secret is split in $n$ parts however only $k=t$ parts (of a polynomial of degree $t-1$) are needed if we want to compute the secret. Suppose that $f$ is the polynomial function such that
$$f(x... |
First of all, I don't want to reinvent the wheel, just want to build my own car. Non-product environment; only for fun and entertainment.
The goal is to use a single private (and never published) master password to create unique passwords (token) for each website account (twitter.com, reddit.com, etc.)
Is the following... |
I would like to understand the algebra behind GCM's security. Before I ask my questions, let me state my understanding of the math behind GCM. If correct, my questions are at the end; if incorrect, can you please explain my mistake.
For simplicity, assume only one block of ciphertext $c$. We want our tag to have two... |
According to https://eprint.iacr.org/2011/133.pdf and many other papers, there's an isomorphsim between the space of polynomials and its coefficients. So, at least in the BFV scheme, we can do:
$$p(x) = [a_1, a_2, ..., a_3]$$
$$\phi(p(x)) = [\phi(a_1), \phi(a_2), ..., \phi(a_3)]$$
So applying one operation to the polyn... |
I've seen the following (alleged) quotation on this site and other places:-
If you can make random numbers, you can have a private conversation.
-Whitfield Diffie.
Yet we (Google & me) can't find an original source for it. Can anyone point me to the original publication/talk/presentation? Or is it just folklore?
|
I'm using HElib CKKS to do experiments and wondering if it's possible to control the error bound in each basic operation such as multiplication, encoding, and rotation.
I have this question is because I found that it seems the increase of error bound in HElib is faster than the implementation of HEAAN.
Here is the exam... |
Is it possible to tell if a point on an elliptic curve is less than half of the curve's order?
If I have a point $ = [a]$ on a curve with prime order q, is there an efficient way to know that $a < q/2$?
I understand that range proofs would work for this, but is there a quicker way? Specifically, I am working with secp2... |
I'm interested in methods of wrapping an AES DEK (Data Encryption Key) using AES KEK (Key Encryption Key). Is there an advantage to using AES key wrap as defined in RFC 3394 as opposed to simply adding a random nonce to the DEK before encrypting it?
Context: My KEK is based on a TPM 2.0 (Trusted Platform Module), the ... |
Reading the selected answer to Designing a hash function from first principles rather than depending on heuristics is very insightful.
The section on "nonlinearity" suggests that making every equation involved in the hash function into a linear one means the attacker can easily figure out the implementation of the hash... |
From Vitalik Buterin's Blogpost - An approximate introduction to how zk-SNARKs are possible
From the sub-topic "Comparing a polynomial to itself", I understood till here
In other words, any polynomial that equals zero across some set is a
(polynomial) multiple of the simplest (lowest-degree) polynomial that
equals zer... |
In this paper, there is a statement in the abstract:
Our construction uses $3n + 0.002n \log(n)$ logical qubits, $0.3n^3 + 0.0005n ^3\log(n)$ Toffolis, and $500n^2 +n^2 \log(n)$ measurement depth to factor n-bit RSA integers.
The title of the paper states that 20.000.000 qubits are used to crack RSA-2048 where this ... |
According to this there are at least 6 "properties" all cryptographically secure hash functions strive to attain:
Deterministic: the same message always results in the same hash;
Quick: it is quick to compute the hash value for any given message;
One-way function: it is infeasible to generate a message from its hash v... |
In CGPR (link to paper) Section 3.5, it is mentioned that the cost of prover is $O(|C| \log(|C|))$, given the size of the circuit is $|C|$.
It looks to me that the polynomial degree in the resulting QAP should be $O(|C|)$. Wouldn't the prover cost be $O(|C|)$? Am I missing some steps here?
|
When I read about BFV or BGV, they all look similar: they use polynomials from $\mathbb{Z}[X]/X^n+1$ as secret keys/pubic keys, etc.
What is the main difference?
|
How do we measure the security levels of Post Quantum Cryptographic algorithms such as: NTRU Prime, Saber, Kyber,...that are submited to NIST PQC Standardization Process(Competition) in general?
I read the documentation in the NIST submission package of NTRU Prime but understanding the security levels does seem very c... |
Do the key check values of two-key 3DES keys have a uniform distribution? If not I'm curious as to what the distribution is.
I ask because I want to know how safe it is to use a key's KCV as an identifier for that key. If the distribution is uniform, then I believe that I can calculate the chances of a KCV collision vi... |
For elliptic curve cryptography, the procedure to find a base point that generates a subgroup with order $n$ is:
Calculate the order $N$ of the elliptic curve (using Schoof's)
Choose $n$. $n$ must be prime and a divisor of $N$
Compute cofactor $h = \frac{N}{n}$
Choose a random point $P$ on the curve
Compute $G = hP$
I... |
In asymmetric key cryptography, public key is available to everyone. If an attacker encrypts the message sent by another user then the receiver might receive that message. Then how the security is established in this scenario.
|
For example, this:
Are all those numbers like 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8... picked by hand somehow, or are they just selected out of a hat (like you write a script "give me 64 random integers between 0 and 15" and then whatever it outputs you use), or something else? What is the technique for... |
In Chapter 6 of Serious Cryptography, they write about the sponge function:
It XORs the first message block, M1, to H0, a predefined initial value of the internal state (for example, the all-zero string). Message blocks are all the same size and smaller than the internal state.
A permutation, P, transforms the intern... |
So I want to create a zero-knowledge proving system for numbers (think loans and bank accounts, I want to prove my paycheck is more than x dollars per month).
I was thinking about using a zero-knowledge proof for the preimage of a hash. So let's say my employer hashes my paycheck in such a way (e.g. using merkle trees)... |
There are several common principles and ideas in modern cryptography, which are generally accepted and taken into account. An example may be Kerckhoffs's principle:
The system must be practically, if not mathematically, indecipherable;
It should not require secrecy, and it should not be a problem if it falls into enem... |
There has been a question on the BoardGameGeek forums that basically boils down to this:
There is a player character on a regular rectangle map at position (px,py).
There is one "AI" character that moves across this map according to some function or pattern (e.g. one field per turn (t), (ax,ay) = (ax0,ay0) + t * (vx,v... |
On the BFV fully homomorphic scheme, given a polynomial secret key, we can encrypt polynomial plaintexts and generate polynomial ciphertexts.
So, for example, if we have 2 ciphertexts, we can compare them with the less than function, which is 1 if the left polynomial coefficient is less than or equal to the right one, ... |
This is a beginner's question related to general security, but it fits cryptography exchange because it's more specific to the action of cryptographic attacks and how they work.
Assume the following theoretical situation:
I do not know how attacks of all types work programmatically. From the aspect of this question, a... |
I am reading this explanation of zkSnark written by Maksym Petkus - https://arxiv.org/pdf/1906.07221.pdf
Here the Prover knows a polynomial of degree 3, 2 of the solutions of the polynomial are 3 & 4. He has to prove to the verifier he knows such a polynomial without revealing to the verifier the 3rd solution.
This is ... |
From Mihir Bellare's paper
Let $q$ be a prime such that $2q +1$ is also prime, and let $g$ be a generator of the order $q$ subgroup of ${Z^∗}_{2q+1}$. Suppose we are given input $q$, $g$, $g^a$ and want to output a pair $(C, Y)$ such that $Y = C^a$. One way to do this is to pick some $c \in Z_q$, let $C = g^c$, and le... |
I've read that AES CTR is only safe if used properly. Therefore, I want to be sure that I use it properly.
The initial vector (IV) can only be used once, it doesn't have to be random. Is it secure to use a counter for one part of the IV, the other part is just some const text. The counter is transmitted to everyone in... |
Yesterday I made a PR to a python crypto library to support key sizes larger than 16 bytes for Shamir secret sharing scheme.
Currently it supports 16 bytes, as follows:
$$
K = \{ 0, 1 \}^{128}
$$
$$
S_{128}(m, n, K) = s_1, ... , s_n
$$
To not change underlying function, and to support larger keys, I decided to split t... |
There are several ways to decrypt TLS e.g. in an enterprise environment. I did not see using "backdoored" DH parameters being mentioned somewhere though according to my understanding it should work in principle: How does a non-prime modulus for Diffie-Hellman allow for a backdoor?
Would it be possible for a recent desk... |
TLS cipher suites use SHA256 as the hash when using AES_128_GCM and CHACHA20_POLY1305, but SHA384 when using AES_256_GCM.
The TLS Cipher Suite Registry contains no cipher suites that use AES_256_GCM_SHA256 instead of AES_256_GCM_SHA384.
According to RFC 8446, this hash is "to be used with both the key derivation functi... |
Let's suppose I encrypt something with AES-256 in XTS mode two times (there will be 4 four keys, 2 for each encryption operation), wanting to achive 512-bits of security.
Will this scheme be susceptible to Meet-in-the-middle attacks?
I'm asking this because there are more operations on XTS mode than only directly encry... |
My context:
I have a ECHD protocol, my main concern is MITM attack, it doesn't matters if you do HMAC or anything else in future to sign requests if your key exchange is compromised,
Far from https and third party certificate authority, is it possible to protect this channel, taking in account (supposing https is not s... |
In CRYPTO 2021, Liu and Pass published a paper with title "On the Possibility of Basing Cryptography on $\mathbf{EXP} \neq \mathbf{BPP}$.
One of the main results of this work can be interpreted as an indication that the existence of OWFs is equivalent to $\mathbf{EXP} \neq \mathbf{BPP}$.
$\mathbf{EXP} \neq \mathbf{BP... |
We know that for ChaCha20 and XChaCha20, the same key can never be used with the same nonce. But let's say I use a random 256-bit key every time... Then the nonce can be whatever because the key is always different. Let's say I set the nonce to be all zeros. As long as the 256-bit key is random, then this setup should ... |
Fernet is a supposedly idiot-proof, AES-based symmetric encryption scheme that was (again, supposedly) carefully designed to avoid any pitfalls that might compromise security.
I want to use the same key to encrypt multiple files, including modified versions of the same file.
I'm aware that many encryption schemes, espe... |
I refer to questions For a one-time pad, which MAC method is information-theoretically secure?, Seeking clarification of OTP & MAC discussion and this page illustrating various MACi. And the question context is authentication of true one time pads.
The MAC requires one or two secret keys depending on the algorithm. W... |
I'm learning about public key cryptography (asymmetric key cryptography), but from what I've gathered, we basically use public key crypto to just move directly onto private key cryptography (symmetric key cryptography).
Why not just always use asymmetric? (Note: I'm a software developer but not a cryptography expert. I... |
For years, truly random numbers at scale has been elusive. Thus I read this recent research https://www.newscientist.com/article/2303984-overloaded-memory-chips-generate-truly-random-numbers-for-encryption/ and https://cacm.acm.org/news/257835-overloaded-memory-chips-generate-truly-random-numbers-for-encryption with gr... |
I am newbie to cryptography and my college has given me this ECDSA. I know that you have to divide result of: h(m)+r.priv in order to generate signature. But is it possible to generate signature without Nonce or 'K' when I have private key(priv) and a selected r and an hash of message?
|
I know there are some tools to check if a certificate is according to the standards like zlint or if the certificate has been logged. But are there tools that work on the rest of the connection like handshake? Normally it is up to the application or library to check for correct values but consider you have some packet... |
I am compeletely new to cryptography and recently tried to understand it a bit more thoroughly.
My question is:
How does the Generation of keys differ in the case of AES and RSA.
I understood, that the public and private key of RSA can be derive straight-forwardly with some modulo-magic.
What I did understand (at least... |
In my new challenge-project my server once upon a time is broadcasting an "onion" made of three layers encrypted with AES128 (ECB) - 16 bytes long over WiFi.
I am using a WiFi Beacon Frame, to transfer the Onion over the air.
The "Onion" looks more or less like the picture below
Each layer is encrypted with a differen... |
According to https://www.rfc-editor.org/rfc/rfc4880.html#section-13.9
-> OpenPGP only mentioned about CFB mode.
According to https://csrc.nist.gov/CSRC/media/projects/cryptographic-module-validation-program/documents/security-policies/140sp3729.pdf
(section 2.1 and 3.10)
-> AES GCM mode is also approved to use
I am goi... |
For example I have a shadow string
$y$j9T$PaFEMV0mbpeadmHDv0Lp31$G/LliR3MqgdjEBcFC1E.s/3vlRofsZ0Wn5JyZHXAol5
There are 4 parts
id : y (yescrypt)
param : j9T
salt : PaFEMV0mbpeadmHDv0Lp31
hash : G/LliR3MqgdjEBcFC1E.s/3vlRofsZ0Wn5JyZHXAol5
What does j9T in param field mean? Are there other options in this field?
|
Let $R = \mathcal{O}_K$ be the ring of ingtegers of $K$, where $K$ is an algebraic number field, and $q$ a modulus. Let $\chi$ be some error distribution used to sample an element $e$. A primal RLWE sample has the form $(a,a\cdot s+e)\in R_q\times R_q$. The variant which takes $a$ to be invertible has been used (e.g. h... |
For the SHA-3 family of hash functions, the output size $d$ is always chosen as $d=c/2$, i.e. exactly half the capcity. What is the rational for this?
Naively, I think that $d=c$ would make more sense because
The collision resistance seems to be $\min(d/2, c/2)$ and
The pre-image strength seems to be $\min(d, c)$.
So... |
What does the symbol $\perp$ mean? I saw this on a paper where some entity outputs $\perp$.
|
I'm currently trying to crack a ciphertext with three rotating substitution ciphers. I've tried dividing the cipher up into three parts and do text frequency analysis since I know the language but no luck when trying to peace together the parts. It keeps coming back as gibbirish.
Are there any tips or tool that you wou... |
I have system of linear equations $f_1, \ldots, f_m$ over binary variables $x_1,\ldots,x_n$
where $m$ is much larger than $n$. We know if all equations are correct, we can find solution easily using Gaussian elimination. Among those $m$ equations, 90% equations are correct.
For the remaining 10%, constant terms are alt... |
Suppose Alice and Bob choose a number face to face. Let's call it "97"
Alice's original message is "Where did you study?"
Suppose we have an artificial intelligence. Let this artificial intelligence produce 1000 meaningful messages
1. Message: "You were so good at school"
2. Message: "My uncle came to us. I told my unc... |
I want to generate a random number using DRBG with below follow:
Entropy source -> DRBG -> PBKDF
adding PBKDF is redundant ?
|
Recently I'm studying Diffie-Hellman key exchange protocol and I've noticed that the basic Diffie-Hellman can be attacked by Man-In-The-Middle attack. I've also read about the Fixed Diffie-Hellman which uses CA (Certificate Authorities) to prevent MITM attacks.
I'm wondering if there are serious vulnerabilities related... |
This is basically a follow-up question to Hiding/Obscuring position information in a board game which technically answered the question, but raised some well deserved critique.
To quickly summarize the question: Consider a board game with a rectangular 10x10 grid, the player has a position $(p_x p_y)$ and a physical to... |
I wonder if it is possible to break the encryption on a password by such encryption:
Where E is the encryption function that uses a known public key of the server.
|
Problem
Let's say I receive a signature $(r,s)$, the corresponding public key and the message that was signed. I don't have access to the private key. I need to know what the recid (Recovery ID) is that corresponds to the public key. One thing I can do is recover the public key from the signature using a multitude of l... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.