instruction stringlengths 15 30k |
|---|
Is it possible to calculate key(0) and key(1) of ZipCrypto using key(2)? |
> So $R = \mathbb{Z}[x]/(x^n+1)$, where $x^n+1$ is an irreducible polynomial and n is a power of 2. So, this structure would not be a ring anymore, it would be a field. So, why is it called ring and referred it as Ring LWE?
As mentioned in the comments, there are two points to highlight.
1. One doesn't work with ... |
I am curious about the structure of the quotient ring in Ring LWE. So $R=\mathbb Z[x]/(x^n+1)$, where $x^n+1$ is an irreducible polynomial and $n$ is a power of 2. So, this structure would not be a ring anymore, it would be a field. So, why is it called ring and referred it as Ring LWE? |
What is the fastest 128-bit non-cryptographic hash function? |
Is the One-Time-Pad IND-CCA2 Secure? |
Theoretical answer here
- [How to determine the order of an elliptic curve group from its parameters?][1]
- [Schoof's algorithm][2], René Schoof, 1985 with complexity $\mathcal{O}(\log^8 q)$
- [Schoof–Elkies–Atkin algorithm (SEA)][3] with complexity $\mathcal{O}(\log^6 q)$
Practically, one can use [... |
When it comes to applications, such as multiplication or addition, is there any difference between Shamir secret sharing and additive secret sharing? |
Could anybody describe the difference between shamir secret sharing and additive sharing? |
What is the difference between Shamir secret sharing and additive sharing? |
I am having difficulties understanding a sponge construction,as I don't really understand,whether the long internal state of a sponge construction is compressed in the squeeze phase or whether bits are extracted from it,so I like I always do with things I don't understand: I coded a simple prototype.
So is this an ex... |
Is this an example of a sponge construction? |
I am having difficulties understanding a sponge construction, as I don't really understand whether the long internal state of a sponge construction is compressed in the squeeze phase, or whether bits are extracted from it.
So like I always do with things I don't understand: I coded a simple prototype.
So is this ... |
> I don't really understand whether the long internal state of a sponge construction is compressed in the squeeze phase, or whether bits are extracted from it.
In a pure sponge construction of a hash, the later: the output is directly by extracting part of the state (e.g. at start of the block up to capacity) after ... |
> I don't really understand whether the long internal state of a sponge construction is compressed in the squeeze phase, or whether bits are extracted from it.
In a pure sponge construction of a hash, the later: the output is directly by extracting part of the state (e.g. at start of the block up to capacity) after ... |
For an exercise at uni I am tasked with optimizing the execution speed a chaos based image encryption algorithm [1]. While I have taken an introductory class to information security, I never came accross chaos based encryption before and have been unable to find any authoratative resource explaining its significance.
... |
What are advantages of chaos based image encryption methods over simply treating images as opaque bit strings? |
Chaos based encryption is at worst snake oil, at best of dubious use. The answers you linked to go into this in some detail.
Modern encryption algorithms are very high data rate and efficient. These chaos based papers just throw some statistical analysis of the resulting ciphertext at you claiming equidistributed pi... |
Chaos based encryption is at worst snake oil, at best of dubious use. The answers you linked to go into this in some detail.
Modern encryption algorithms are very high data rate and efficient and is secure with highly redundant plaintext. These chaos based papers just throw some statistical analysis of the resulting... |
We have values in the range $[a, b]$, and we apply a differential privacy mechanism to add noise to these values. After obtaining the noisy values, we employ the following truncation function: if a noisy value falls below $a$, it is truncated to $a$, and if the noisy value exceeds $b$, it is truncated to $b$. Does this... |
Chaos based encryption is at worst snake oil, at best of dubious use. The answers you linked to go into this in some detail.
Modern encryption algorithms are very high data rate and efficient and secure with highly redundant plaintext. These chaos based papers just throw some statistical analysis of the resulting ci... |
I read in [this answer here][1] that if the ciphertext is reasonably larger than the key size, Vigenère cipher is easily breakable.
Is there a way to repeat the key if it is reasonably smaller that the ciphertext size and be immune to statistical information leak at the same same?
I have been thinking in XORing a... |
Is there a way to defeat statistical information leak in Vigenère cipher when the ciphertext is reasonably larger than the key size? |
I read in [this answer here][1] that if the ciphertext is reasonably larger than the key size, Vigenère cipher is easily breakable.
Is there a way to repeat the key if it is reasonably smaller that the ciphertext size and be immune to statistical information leak at the same same?
I have been thinking in XORing a... |
We have a set of query answers, i.e., $A = \{A_1, A_2, \dots, A_m\}$ and then we add noise to each of $A_i$ using a mechanism ($M$) providing differential privacy, i.e., $M(A_i) = O_i$. We denote the set of noisy query answers by $O = \{O_1, O_2, \dots, O_m\}$.
I am wondering how to compute the probability that the n... |
> I have been thinking in XORing a keystream of a cryptographically secure hash function in Counter Mode in the plaintext before applying the key, can it defeat statistical information leak?
It depends.
If the keystream is generated using a secret key (making that XOR a secure encryption algorithm), then yes, app... |
> What are advantages of chaos based image encryption methods over simply treating images as opaque bit strings?
The principal advantage of the term "image encryption" is that when it is used with a straight face, **you can immediately discount the author, journal, and publisher as peddlers of bullshit**—lacking in ... |
Chaos-based encryption is **at worst snake oil**, at best of dubious use. The answers you linked to go into this in some detail.
Modern encryption algorithms have a very high data rate and are efficient and secure with highly redundant plaintext. These chaos-based papers just throw some statistical analysis of the r... |
We have a set of query answers, i.e., $A = \{A_1, A_2, \dots, A_m\}$ and then we add noise to each of $A_i$ using a mechanism ($M$) providing differential privacy, i.e., $M(A_i) = O_i$. We denote the set of noisy query answers by $O = \{O_1, O_2, \dots, O_m\}$.
I want to compute the probability that an adversary ca... |
We have a set of query answers, i.e., $A = \{A_1, A_2, \dots, A_m\}$ and then we add noise to each of $A_i$ using a mechanism ($M$) providing differential privacy, i.e., $M(A_i) = O_i$. We denote the set of noisy query answers by $O = \{O_1, O_2, \dots, O_m\}$.
Let's say an adversary is given the sets $A$ and $O$ (... |
We have a set of query answers, i.e., $A = \{A_1, A_2, \dots, A_m\}$ and then we add noise to each of $A_i$ using a mechanism ($M$) providing differential privacy, i.e., $M(A_i) = O_i$. We denote the set of noisy query answers by $O = \{O_1, O_2, \dots, O_m\}$.
Let's say an adversary is given the sets $A$ and $O$ (... |
We have a set of query answers, i.e., $A = \{A_1, A_2, \dots, A_m\}$ and then we add noise to each of $A_i$ using a mechanism ($M$) providing differential privacy, i.e., $M(A_i) = O_i$. We denote the set of noisy query answers by $O = \{O_1, O_2, \dots, O_m\}$.
Let's say an adversary is given the sets $A$ and $O$ (... |
```p256OrdMul``` method in ```crypto/internal/nistec/p256_asm_amd64.s```,
```asm
// func p256OrdMul(res, in1, in2 *p256OrdElement)
TEXT ·p256OrdMul(SB),NOSPLIT,$0
MOVQ res+0(FP), res_ptr
MOVQ in1+8(FP), x_ptr
MOVQ in2+16(FP), y_ptr
// x * y[0]
MOVQ (8*0)(y_ptr), t0
MOVQ (8*0)(x_ptr), AX
MULQ t0
MOV... |
Why doesn’t acc0 need to be cleared in p256OrdMul? |
I'm working on a network where nodes communicate using AES-CCM encryption, within a context of tight bandwidth limitations, making every bit count. The setup uses a nonce that combines a 16-bit node address, a timestamp incremented every 100 seconds (with only the offset transmitted), and a 10-bit counter unique to eac... |
What are the binding properties of post-quantum KEMs? |
Is there an easy to understand and intuitive "one fits all" definition for the concept of diffusion that is applicable to both modern binary cryptosystems as well as classical ciphers?
For a bit of background:
I am currently in the process of writing some teaching materials for high school students (~16 year olds... |
Setting the issue of nuanced time *dependency* \(if a message can be decrypted at time $t$, how will you forbid anyone from using all the information that was available at time $t$ to decrypt it at time $t+1$?\), I'll just mention the idea of a time-*lock*, which keeps the message secret for a certain amount of time.
... |
I'm trying to design an encryption and decryption device that is extremely secure, but simple in design so that it can be understood and audited.
Here is my attempt, do you see any vulnerabilities?
The device consists of a keyboard, 2 LCD character displays, a SD card reader, and 3 arduinos:
[![system diagram]... |
Is this theoretical encryption device secure? |
PFX is commonly used as a synonym of PKCS#12 certificate stores. However, I've never seen an explanation why these stores are called PFX (on Microsoft platforms) in multiple articles, including those of Microsoft. I can think up some names for what is seemingly an acronym, but "protected file X.509" doesn't seem to wor... |
I'm studying Private Information Retrieval for my class. I couldn't find any good resources online apart from various papers written on it. Can somebody recommend a textbook, lecture or any other good resources for Private Information Retrieval? |
I am reading about GKR protocol from Justin Thaler's book - [Proofs, Arguments & Zero Knowledge](https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf)
On Page 59,
> In the first message, $P$ tells $V$ the (claimed) output(s) of the circuit. The protocol then works its way in iterations towards the input ... |
GKR Protocol - is it one Sum-Check per layer or is it one Sum-Check per gate? |
I am reading about GKR protocol from Justin Thaler's book - [Proofs, Arguments & Zero Knowledge](https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf)
On Page 59,
> In the first message, $P$ tells $V$ the (claimed) output(s) of the circuit. The protocol then works its way in iterations towards the input ... |
Does there exist a proof (paper reference welcome) that if a signature scheme is EUF-CMA, and the signatures are always encrypted, then the resulting signature scheme is SUF-CMA?
That is: let SIG be an EUF-CMA signature scheme. Then SIG' is defined as follows:
1. s = SIG(secret key, message)
2. c = ENC(K, s) where E... |
I used an open-source programming language called Lucee / Cfscript that is closely related to Adobe Coldfusion. The default function that developers use to encrypt and decrypt data (usually for passwords or cookie contents etc) is meant to be compatible with a version of Coldfusion that released in 2002. Given that the... |
How to identify if a custom encryption algorithm used in my programming language is secure? |
I used an open-source programming language called Lucee / Cfscript that is closely related to Adobe Coldfusion. The default function that developers use to encrypt and decrypt data (usually for passwords or cookie contents etc) is meant to be compatible with a version of Coldfusion that released in 2002. Given that the... |
How to identify if a legacy encryption algorithm used in my programming language is secure? |
I find that the following image from Wikipedia, though perhaps a bit too technical for your purposes, is still helpful with a little explanation:
[![Sponge function diagram][1]][1]
Essentially, a function $f$ is used repeatedly in two phases, absorbing and squeezing.
In the absorbing phase, small chunks of the... |
No, the algorithm discussed is not secure.
- It is such that only 4 characters of the key are significant. This is apparent in [this loop][1], and verifiable experimentally: encrypting with key "GHIJKLMNOPQR" is undone by decrypting with "????KLMN" or any at-least-8 characters string which 5<sup>th</sup> to 8<sup>th... |
Imagine an __Encryption Algorithm__ which applies a classic __Shift Cipher__ (also called _Caesar_ or _ROT-X_) to a text (with only lowercase `[a-z]` and the space `' '` character), but has one parameter `r` (randomness) to decide if in each round/iteration attempting to encrypt one char `c`, it encrypts the character ... |
Is a Shift Cipher with Random Insertions Unbreakable? |
I am designing a service where each user has both a private 256-bit ID and a public 256-bit ID. These IDs should be derivable from one another, but only within the backend of my service (as to not expose the private IDs to other users). For this purpose, I am considering using AES with a key known only by my service, b... |
Do I need to use unique IVs if I never encrypt the same data twice? |
I am designing a service where each user has both a unique 256-bit private and public ID. These IDs should be derivable from one another, but only within the backend of my service (as to not expose the private IDs to other users). For this purpose, I am considering using AES with a key known only by my service, but thi... |
Do I need to use unique IVs if all encrypted data is unique? |
> Is this necessary for my use case? I've read that this is done so encrypting the same data twice does not result in the same ciphertext, but in my case this is exactly the necessary behavior.
Making sure that encrypting the text twice doesn't result in the same ciphertext is not the only reason for IVs. It is one... |
> Is this necessary for my use case? I've read that this is done so encrypting the same data twice does not result in the same ciphertext, but in my case this is exactly the necessary behavior.
Making sure that encrypting the text twice doesn't result in the same ciphertext is not the only reason for IVs. It is one... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? Specifically, they
> aim to compute the output of a function F for two pairs of inputs,
> a=F(x1, y1) and b=F(x2, y2), where A knows x... |
Is it secure for A to allow B to run a garbled circuit twice with different inputs? |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? Specifically, they
> aim to compute the output of a function F for two pairs of inputs,
> a=F(x1, y1) and b=F(x2, y2), where A knows x... |
Frequency analysis would still apply albeit larger quantities of ciphertext might be required.
If your system is to introduce a random character with probability $p$ and the plaintext frequency of a given letter is $q$, then the ciphertext frequency of its shift will be $(1-p)q+p/26$ and if $q\neq 1/26$ this is stil... |
I'm studying for an exam and came across this question:
> When an electronic signature of a message claimed to be produced by
> Alice is verified we typically verify (at least the first time):
>
> 1. that the public key belongs to Alice by verifying that it has been signed (along with additional information) by ... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? Specifically, they
> aim to compute the output of a function F for two pairs of inputs,
> a=F(x1, y1) and b=F(x2, y2), where A knows x... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? Specifically, they
> aim to compute the output of a function F for two pairs of inputs,
> a=F(x1, y1) and b=F(x2, y2), where A knows x... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? Specifically, they
> aim to compute the output of a function F for two pairs of inputs,
> a=F(x1, y1) and b=F(x2, y2), where A knows x... |
I know Signal uses public/private key E2E encryption to ensure it's impossible for them to read the contents of messages. WhatsApp does too, henceSignal's main attraction is that it additionally claims to avoid collecting metadata pertaining to the messages (unlike WhatsApp). Their server code, last time I checked, i... |
Can we be certain that Signal doesn't log metadata (e.g. message graphs)? |
I know Signal uses public/private key E2E encryption to ensure it's impossible for them to read the contents of messages. WhatsApp does too, hence Signal's main attraction is that it additionally claims to avoid collecting metadata pertaining to the messages (unlike WhatsApp). Their server code, last time I checked, ... |
Hi I have two similar statements which I think are correct:
1) $\beta, s$ are unknown.
Only $g^\beta$ is known to the prover but not any of $g^{\beta s^i}$ for $i \ge 1$.
If the prover is able to find $A$ and $B$ such that $e(A, g^\beta) = e(B, g)$ then the prover knows a field element $a$ such that $A = g^a$
... |
Hi I have two similar statements which I think are correct:
1) $\beta, s$ are unknown.
Only $g^\beta$ is known to the prover but not any of $g^{\beta s^i}$ for $i \ge 1$.
If the prover is able to find group elements $A$ and $B$ such that $e(A, g^\beta) = e(B, g)$ then the prover knows a field element $a$ such tha... |
Hi I have two statements which I think are correct:
1) $\beta, s$ are unknown.
Only $g^\beta$ is known to the prover but not any of $g^{\beta s^i}$ for $i \ge 1$.
If the prover is able to find group elements $A$ and $B$ such that $e(A, g^\beta) = e(B, g)$ then the prover knows a field element $a$ such that $A = g... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs?
I'm still finding garbled circuits hard to grasp so I'm wondering if my understanding is correct that allowing B to run a garbled cir... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? Specifically, they
> aim to compute the output of a function F for two pairs of inputs,
> a=F(x1, y1) and b=F(x2, y2), where A knows x... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? They
> aim to compute the output of a function F for two pairs of inputs,
> A encrypts the circuit and sends the garbled
> circuit to... |
I was reviewing past exam questions and came across this one:
> Is it secure for A (the garbler) to allow B (the evaluator) to
> run a garbled circuit twice with different inputs? They
> aim to compute the output of a function F for two pairs of inputs,
> A encrypts the circuit and sends the garbled
> circuit to... |
> Is there an easy to understand and intuitive "one fits all" definition
> for the concept of diffusion that is applicable to both modern binary
> cryptosystems as well as classical ciphers?
Diffusion in cryptography: An small change in the input, results significant change in the output.
In **modern binary cry... |
I would concur with your interpretation, although the question is a little vague.
When the question says that we trust $Y$ does this mean that we trust $Y$ only to sign messages that are true? Or that it believes to be true to the best of its knowledge?
In either case there is nothing in the statement "$X$'s publ... |
You can use [drand][1], which is backed by companies like [cloudflare][2]. Here is a [demo][3] and [web demo][4]
[1]: https://drand.love/docs/timelock-encryption
[2]: https://drand.love/partner-with-us/
[3]: https://github.com/drand/tlock?tab=readme-ov-file#see-how-it-works
[4]: https://timevault.drand.... |
I am reading about GKR protocol from Justin Thaler's book - [Proofs, Arguments & Zero Knowledge](https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf)
On Page 59,
> In the first message, $P$ tells $V$ the (claimed) output(s) of the circuit. The protocol then works its way in iterations towards the input ... |
I am reading about GKR protocol from Justin Thaler's book - [Proofs, Arguments & Zero Knowledge](https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf)
On Page 59,
> In the first message, $P$ tells $V$ the (claimed) output(s) of the circuit. The protocol then works its way in iterations towards the input ... |
I am reading about GKR protocol from Justin Thaler's book - [Proofs, Arguments & Zero Knowledge](https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.pdf)
On Page 59,
> In the first message, $P$ tells $V$ the (claimed) output(s) of the circuit. The protocol then works its way in iterations towards the input ... |
does anybody have a library of fastest parity finding algorithms in RNS representation ?
I'm super happy I found a fast algorithm, but since it is quite simple, I need to check whether it exists or not.
Thanks |
Given that an algorithmic implementation of a linear feedback shift register based encryption scheme is (much?) more secure against side channel attacks; why are hardware platforms usually used?
I get that speed is a factor in stream/block cipher systems used in communication protocols ie. error correction or encryp... |
Why is firmware implementation not preferred for more lfsr based encryption schemes? |
Why was the simulator/extractor specifically given the power to rewind "time" instead of a different super power?
Was it defined in the first ZKP paper that the simulator and extractor would have this power as a "standard" and then everyone went with it or was there more thought put into it when giving it this supe... |
In Zero Knowledge Proofs (ZKP) why does the simulator and extractor get the power to rewind "time" and not some other superpower? |
Consider a standard supervised machine learning problem on private data. Instead of using DPSGD, suppose that one uses a non-private SGD scheme to produce optimal model parameters $\theta$ (done in the private data enclave, as with DPSGD), and releases publicly $\theta + \eta$, with $\eta \sim$ Laplace$(0, \varepsilon)... |
In order to achieve differentially private machine learning can one simply apply the Laplace mechanism after an SGD scheme? If so does it work well? |
does anybody have a library of fastest parity finding algorithms in RNS representation ?
I'm super happy I found a fast algorithm, but since it is quite simple, I need to check whether it exists or not.
Thanks
Edit: by parity I mean $ x \textrm{ mod } 2 $ where $x$ is the number between 0 and $N=\Pi m_i$ and all... |
There is a lot of confusing information out there regarding the role of digital certificates and the use of Ephimeral Diffie Hellman in how TLS 1.3 operates.
Would it be correct to state that the the digital certificate signed by the CA is only used by the client to verify that it is connected to the correct server ... |
> The asymmetric keys are not used for anything else ?
It is also used to verify that the initial negotiation was not tampered with; for example, a Man-in-the-Middle did not replace the server's DH key shares with his own.
> Once the client establishes the authenticity of the server, then Ephemeral Diffie Hellman... |
i'm new to information theory.
I know the standard perfect secrecy definition:
$$
P(M=m|C=c) = P(M=m) ,
$$
for all $m$ and $c$, respectively the message and the cypher.
Now, i can use the entropic definitions to conclude that if the above equation holds, also the following is true:
$$
H(M|C)=H(M) ,
$$
rig... |
Im reviewing my crypto and I would like to prove the following: RSA experiment where the adversary is given (N, e, y) where N = pq and p, q are two primes. The adversary knows p, q. How can I build an adversary that wins with probability 1?
I know the RSA scheme is built on the idea that it is hard to find 2 large p... |
First time question poster so I hope the below is clear enough :).
**Problem summary**: Can a Holder and Verifier safely use ECDH for a Challenge-Response protocol where:
1. the Holder proves possession and control over a private key $d$ using material that a trusted Issuer signs, and
2. the Verifier learns no ... |
Can DH be used for proof of possession? |
(Also posted to the Mathematics StackExchange)
I have a wireless capture of data and it's 12 bit hash. I am trying to identify the actual function that would have generated the hash data.
I tried all the generic 12 bit CRC polynomials but none of them seem to generate the appropriate output.
Any ideas on how I... |
> The compressed point format includes the least significant bit of
> in the first byte (the first byte is 0x02 or 0x03, depending on that
> bit): this bit is enough to know whether you got or − with the
> square root, ***and adjust in consequence***.
Since I just spent a day figuring what "adjust in consequ... |
(Also posted to the Mathematics StackExchange)
I have a wireless capture of data and it's 12 bit hash. I am trying to identify the actual function that would have generated the hash data.
I tried all the generic 12 bit CRC polynomials but none of them seem to generate the appropriate output.
Any ideas on how I... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.