instruction stringlengths 32 27.2k |
|---|
While setting up PGP for the first time, I am presented with various encryption standards I can use being:
RSA (2048, 3072, 4096 bits) with an option for + RSA (2048, 3072, 4096 bits)
DSA (2048 bits) with an option for + Elgamal (2048, 3072, 4096 bits)
ECDSA/EdDSA (ed25519, brainpoolP256r1, brainpoolP384r1, brainpoolP... |
From the PLONK paper.
On Page 31, Point 6
Compute the Lagrange Polynomial Evaluation $L_1(\zeta) = \frac{\omega(\zeta^n - 1)} {n(\zeta- \omega)}$
I don't think this formula is correct.
We have $n$ gates from $H=\lbrace 1, \omega, \omega^2, \omega^3, ..., \omega^{n-1}\rbrace$.
So the formula for computing $L_1(X)$ shoul... |
I was working on implementing shamir secret sharing in GF(2^256), According to my knowledge multiplication in a finite field is defined as mul(a,b) = (a*b)%mod, where mod is the irreducible polynomial.
But when I saw the implementation here, It uses bitmasking to multiply and when I compare my multiplication results wi... |
I have a quick question. How would you decrypt an encryption scheme, involving both Hill and Vernam Cipher. The order of encryption is Hill Cipher then Vernam Cipher. Problem is that only final cipher text and the original plain text is intercepted. Without the cipher text derived from the Hill Cipher, I can't think of... |
$H_k$ is a cryptographic hash function that's keyed using a section of key material $k$ (for whatever definition of "keyed" that's appropriate for the given hash function $H$).
Are the following two methods roughly equivalent ways of authenticating that the section of key material $k$ is associated with the section of... |
I have temporal data from experiment and by setting a threshold, I convert them to zeros and ones. I saved these binary bits to txt file (normal txt file from MATLAB) with each line has 32 bits (total number of bits is a little over 20 million).
When running the NIST test suite, I use ./assess 500000 with 40 bit stream... |
I am using the NIST test suite to test random binary numbers. when I tried it for data.pi, the generated report has some items that can not be interpreted.
for example, the coeffecients named C0~C10. I am using 20 bit streams. My question is how do these coefficients relate to the 20 streams? and what do they represent... |
I am using DES encryption when writing a file in an embedded device. When I decrypt the file. I get a partially corrupted file. Kind of randomly some 8-byte blocks are corrupted. Some are not. When I regenerate the file, It shows the same corruption. But If I reset the device, the file is okay.
My DES encryption functi... |
Common PIR schemes only protect the client's privacy, not the server's, while Symmetric PIR(SPIR) can do both.
In many papers, it is mentioned that we can use the Naor and Pinkas method (https://dl.acm.org/doi/pdf/10.1145/301250.301312) to turn a PIR scheme into SPIR one, however when implementing this, I found this me... |
While working with AES 256 in CBC mode, I learned that it requires Key Expansion - forward (for encryption) and reverse (for decryption).
Does AES CTR mode also requires such a step ? Or can the 256 bit key be used as is ?
|
I have a challenge in which I need to decrypt 32(?) bytes of plaintext, which by encryption resulted in 48 (this for sure) bytes of data.
It's a black box challenge, but managed to figure out the above and below.
According to this https://security.stackexchange.com/questions/207633/decrypting-aes-128-cbc-leads-to-first... |
n, e and modulus of RSA are given and n is very large. p and q are primes generated by pow(7, random_seed, modulus), and the seed that p and q used is very close. How can I get p and q, or is there any other way to decrypt this RSA?
|
If we have a Diffie-Hellman oracle then given $g^x$ and $g^y$ we can construct $g^{xy}$.
Can we construct $g^{x^{-1}}$ given $g^x$?
|
I ame reading the paper "Secret-Sharing schemes: A survey" by Amos Beimel. Here there are two definitions of secret sharing.
The first one states:\
A distribution scheme $\langle \Pi,\mu \rangle$ with domain of secrets $S$ is a secret-sharing scheme realizing an access structure $\mathscr{A}$ if the following holds:
C... |
I use an offline password manager, I want to use a future proof very strong master password and I'm going to choose one of these options from the EFF's large wordlist, a randomly chosen 8 word passphrase (104 bits), or a 10 word (128 bits) or I can even use a 12 word generated passphrase... Which one should I choose?
F... |
Is RFC 6979 guaranteed to prevent the reuse of nonces for different signed hashes?
|
It's that time of the year - I'm trying to learn how AES-128-CBC encryption works. My key is (since it's AES-128) is 16 bytes, my IV is 16 bytes as well. My implementation of key wrapping does apparently does not help me much to comprehend the concepts behind and neither does reading the RFC. Hence I turn for answers t... |
This is about the KZG Polynomial Commitment Scheme
In Section 2, it's written
We use the notation $e : \mathbb G \times \mathbb G \mapsto \mathbb G_T$ to denote a symmetric (type 1) bilinear pairing.The choice of type 1 pairings was made to simplify presentation, however, our constructions can easily be modified to wo... |
Imagine a channel where the initial secret for deriving of the actual key is established with ECDH.
First, that shared secret is used to derive a temporary key with some default parameters (salt, iterations) embedded into the software.
Then this channel is used to exchange random parameters specific to each direction (... |
I'm working on a challenge like this:
def weird_func(FLAG)
enc_flag = [(a + b*i) % n for i in FLAG]
return bytes(enc_flag).hex()
Although I know the FLAG prefix which is flag{, without knowing a,b and n, I find it hard to calculate the whole FLAG. Only enc_flag is given in hex. I tried to brute-force but it se... |
Monoalphabhatic Random Subsitution Cipher is pretty hard to crack compared to Ceasar Cipher especially through brute force but using frequency analysis, provided enough cipher text is easy.
But what if key for the subsitution changes lets say every 16 characters. Then there wouldn't be enough cipher text for frequency... |
I am working on TLS 1.2 Cipher TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, After send the application data server throws an error message Encryption alert (21).
I have mentioned the parameter shard by the server given below.
Decryption key: ab98fbfabe869b008697b9f62b8f59ee7a3165db6a0fdc37e2bac41d73995889
nonce: f53672195e4412... |
We know that we can factor integer $n = pq$ when we know that $p\oplus q$, where $\oplus$ means xor. If we know $\lfloor \sqrt{p} \rfloor \oplus \lfloor \sqrt{q}\rfloor$, can we factor $n$?
|
I'm making a cloud-based service. So, basically, my users will be able to upload files (any type of files) and they will be uploaded to a server. I am aware that I have two options:
Upload the files first and let the back-end handle the encryption
Encrypt the files first and upload then to the back-end
I want to use ... |
If order of the cyclic group on which discrete logarithm is done is $2q$ where $q$ is a prime such that $2q+1$ is a prime, then using square root identification we can get the lsb.
How about if the order is $2^rq$ where $r\in\mathbb Z_{\geq1}$, can we extract the least significant $r$ bits in polynomial time? If so, th... |
I have given three points $ P $, $ Q $, $ R $ on Twisted Edwards Curve over prime finite field $ \mathbb{Z}_p $.
$$ ax^2 + by^2 = dx^2y^2 + 1 $$
I know about given points that point $ Q $ is doubling of point $ P $ and $ R $ is doubling of $ Q $. But I don't know the coefficient of curve's formula $ a $, $ b $, $ d $ a... |
The CLWE problem (and related) talks about the hardness of finding the secret key $\vec{s}$, given polynomially many samples $(\vec{a},t)$, where $\vec{a}$ is sampled from the normal distribution, and $t=\gamma \vec{a}\cdot\vec{s}+e \pmod{1}$, where $e$ is also sampled from the normal distribution.
Is the distribution ... |
As far as I understand, compressed public keys of secp256k1 can represent points either above or below the X axis, depending on whether they begin 0x02 or 0x03.
Am I correct in thinking that if you know a secret key for a public key beginning 0x02 you can trivially find the secret key for the identical public key, but ... |
I am interested in the practicality of using generic SNARK techniques to prove the following relation.
Let E and E' be two ElGamal ciphertexts. They have the form
E = (E1, E2) = (g^r, M*PK^r) and E' = (E1', E2') = (g^r', M'*PK^r').
There is also a hash function H.
All of these are public: E, E', PK, H.
I want to prove ... |
Why can't we use any random elliptic curve? What are the properties that need to be satisfied?
|
Shamir's Secret Sharing GPL implementation called ssss got removed from Tails OS years back.
Is Shamir's secret sharing still secure nowadays? Why was it removed from Tails OS?
Is it true that the technical limit is a maximum of 128 characters?
|
The diffusion model, which is used by products like Midjourney and Dall-E, trains AI systems to de-noise (remove added randomness) from data to infer what the original de-noised data is. That would seem to have direct applications to cryptanalysis. As such, I wonder what views security folks have on the following:
Is ... |
in the following pdf, several attacks on double key length triple des are deemed feasible at 2 to the power of 88/89 des calculations.
if we take the record of cracking des at 2 to the power of 56 calculations in 23 or so hours as the example, according to my estimate, this should take hundreds of years and definitly i... |
Could anyone please help me explain this?
I am reading the article about TFHE (Guide to Fully Homomorphic Encryption over the [Discretized] Torus).
On page 31:
I don't understand why we need to scale to module 2N. What is the meaning of "multiplicative element of Zn[X]" and why is X of order 2N?
|
Are cofactor $4$ and $8$ ECC schemes widely used in practical deployments such as those in cryptocurrencies?
Can you name some practical settings where there curves are used and cryptocurrencies where these are used (I checked bitcoin and it uses cofactor $1$ ECC and so I was not sure if other cryptocurrencies also use... |
I read somewhere that TRNGs are better than cryptographic algorithms that generate pseudo-random numbers (PRNGs) because these algorithms are more energy intensive than TRNGs.
By low power devices, I mean things with limited computational capacity or limited power. Like a small IOT device.
Would there be any benefit to... |
When I came to the topic of Ansible (Vault), when deploying secrets in Ansible and other passwords up to 128 characters Shamir's Secret Sharing would be an ideal solution I think:
The secret is never in one spot
The secret can be encrypted "on top"
You can place the parts of the secrets on multiple servers with good r... |
According to Wikipedia, tropical cryptographic protocols are built upon tropical algebras, i.e., a semiring $(\mathbb{R} \cup \{\infty\}, \oplus, \otimes)$ where $x \oplus y = \min \{x,y\}$ and $x \otimes y = x+y$. Recently, several tropical algebra-based cryptographic protocols have been proposed, and they rely on som... |
As I was reading on some encryption schemes the other day, I stumbled upon the Blum–Goldwasser cryptosystem and read that it is vulnerable to adaptive chosen ciphertext attack.
I searched for some actual example but could not find any, so I thought asking here for anyone willing to provide a simple proof of concept cho... |
I'm decently new to cryptography and am trying to wrap my head around zero-knowledge proofs and applications. One use case that I am trying to figure out a strategy for is the following:
I have some plaintext that I'm going to encrypt and give to someone. They can't decrypt the ciphertext but want to verify the hash of... |
Let's imagine two entities: Bob and Alice. Bob's public key is $B = bG$. Alice's public key is $A = aG$.
Alice encrypts her number $n$ with Bob's public key so Bob could decrypt it ($n$ is small enough to be brute-forced):
$$E = nG + r_0B$$ $$R = r_0G$$ where $r_0$ is a random nonce. Alice sends $(E, R)$ to Bob.
Bob de... |
I am trying to understand the design rationale of in place NTT in Dilithium. I know that how the splitting of polynomials is done but I cant seem to map this approach to the precomputed table of zetas that is present in the authors code. I have attached the array of values as well. Specifically speaking, is there a way... |
We can prove the security of a cryptographic scheme in standard model and non-standard model.
Standard models like using some computational assumptions, on the other hand, non-standard models like random oracle, generic group model. Right?
I've seen in a paper [CGKV18 ,page 10] the term $\color{blue}{static}$ computati... |
The MACsec standard (IEEE 802.1AE-2018) states "The number of SCIs (and hence the number of SSCIs) is ultimately limited by the maximum number of current members in a group CA that MKA can support (less than 100) but is likely to be further limited by the port-based network control application (see Clause 7 of IEEE Std... |
I am not sure whether "linear decomposition" is appropriate to summary my question: We know that the traditional symmetric encryption/decryption algorithm (like AES, TDES) can be written as:
C = FUN_enc(key, P) P = FUN_dec(key, C)
Where FUN_enc is the encryption function/algorithm, FUN_dec is the decryption function, C... |
I am trying to fully separate RSA key pairs by breaking down $(N,e)$ for public part and $(N,d)$ for private part. From my understanding of RSA signature process, the message to be signed is digested at first (using e.g., SHA256) and the digest is then encrypted using private key. The receiver of the message then calcu... |
I am trying to solve a challenge regarding a RSA oracle which allows me to encrypt/decrypt any plaintext/ciphertext I want, but there are a few checks that I have to bypass, and my goal is to decrypt the given flag. The strategy I am using is basically trying to get the N by making the oracle encrypt some small numbers... |
I have implemented a ring signature in a Python program, To keep it simple, I have Alice and Bob. Based on this ring equation:
$$ v = E_k(y_s⊕E_k(y_i⊕v))$$
I will get:
$$ y_s = E_k^{-1}(v)⊕E_k(y_i⊕v) \pmod{n_s}$$ where $y_i$ is the private key of the ring signer
However, after calculating, I did not get a value that e... |
There are attacks that can extract some information from lookup table access that depends on a secret value, e.g. if we access a[0] or a[255] depending on some property of the secret, and a[255] causes a cache miss. But what if only the order of access changes depending on the secret value? E.g. we could have the a[0],... |
For the NTT I know the following preconditions, which must be fulfilled for the primitive $N$-th root of unity:
$$ \omega^N \equiv 1 $$
$$ \sum_{i=0}^{N-1} \omega^{ik} \equiv 0 \quad k=1,\ldots,N-1 $$
These are derived from the DFT and adapted to the modular arithmetic of the NNT. So far clear.
But what about this cond... |
The JSON Web Encryption RFC 7516 says:
Encrypt the CEK with the recipient's public key using the
RSAES-PKCS1-v1_5 [or RSAES-OAEP] algorithm to produce the JWE
Encrypted Key.
Assuming a client/server architecture here where the server generates JWE tokens, does this mean that the client must initiate the JWA creation ... |
My question is very basic one. Suppose there are two independent boolean variable $X_1$ and $X_2$. It is given that $X_1$ is biased towards $0$ and $X_2$ is biased towards $1$ with same amount of bias. Now will their XOR variable be biased or unbiased ?
My try:
Since their bias is same, probability that $X_1$ takes $0$... |
While working with serial division/remainder method of finding factors, I have found that using knowns such as the known factors of a comparative number, or the difference between a number to be factored and its comparison number, then dividing into each number with the knowns and summing the remainders, the two origin... |
Given a password as a seed for a Psuedo Random number generator and Fisher Yates Algorithm to shuffle bytes of a string to random places like Hello World to ldWoeHor ll, is it practically and/or theoretically impossible to break such cipher if plaintext contains enough words like >100?
Like for example, a string is shu... |
I need to enable hybernation to the LUKS-encrypted drive. My /boot partition is unencrypted hence it stores all kernel images as well as kernel parameters in unencrypted form. For hybernation to work I should specify where the swap file starts off on my drive where the system can write hybernated data to. For this Linu... |
In the proof that RSA successfully decrypts the message $x$, we show that $x^{e^{d}}\equiv x \pmod N$. However, I am wondering whether it is a problem that we don't recover $x$ exactly, but merely a number congruent to it in mod $N$. Does this cause problems as far as decrypting the message successfully?
Also, the tex... |
In an application, a curve25519 private key is the only stable identifier for an individual. I don't have readily have access to the corresponding public key.
Would it be safe to generate a public identifier by hashing this private key? E.g.
ID = argon2id(K_curve25519_private)
|
What's the exact meaning of 'Argon2 uses BLAKE2b'? Does it based on BLAKE2b? like chacha20 based on salsa20 kind of meaning or does Argon2 use the BLAKE2b with 12 rounds hash function at the end to generate a hash value? thank you.
|
In the paper: "Universal One-Way Hash Functions and their Cryptographic
Applications". The following is proven: "If 1-1 one-way functions exist, then the one-way based signature scheme described above is secure." For a signature scheme defined in the paper, where by secure they mean "existentially unforgeable under an ... |
I want to construct a non-interactive ZK proof that in a set of pairs of group (where the DDH-assumption holds true) elements:
$(g_1, Y_1), (g_2, Y_2), ..., (g_n, Y_n)$
, the prover knows at least one private key $x_i$ such that $g_i^{x_i} = Y_i$. The proof should also not reveal $i$.
The protocol would be based on $\S... |
I have a vector of $n$ elements where each entry is a non-negative integer. Neighboring vectors differ in one element where the absolute value difference between the elements that differ is $1$. I want to release the entire vector differentially privately. We can do this easily using the Laplace mechanism with sensitiv... |
I have a question on how to interpret test results of NIST test suite.
First, when the asterisk mark appear on the report, what does it mean? I thought it means the random sequence fails the test. However, some p-values are more than 0.01 and it appears
second, some tests have p-value lower than 0.01. However, the ast... |
I'm making a peer-to-peer game client using an already existing protocol where messages are broadcasted to all people on the network, and messages are already proven to be from a given user. One of the games I want to add is UNO, and I found this paper from the same authors of RSA that describes an algorithm that perfe... |
I am currently reading "A Decade of Lattice Cryptography"
At page 30, section 4.3.2, it descrip left multiplication by any fixed ring element a
It mention something about curcilant matrix whose first column is the coefficient vector a. I am confused why multiply a circulant matrix will yield a SIS instance? Can someo... |
If I have three integers $x,y,z\in \mathbb{F}_{2^n}$,
How do I convert the modulo addition operation into conjunctive normal form (CNF)?
$$
(x+y)\pmod{2^n-1}=z
$$
|
I read that to mitigrate BEAST attack openSSL tried to inject empty TLS record before each real TLS record. and by doing that there is no opportunity to execute an attack but i dont understand way?
what the diffrence between normal TLS? the attacker can still xor the block he want to guess with the last block to disabl... |
I'm writing a paper for uni about password security, specifically about cracking passwords in the context of a password manager. I've coded a password encryption scheme which uses PBKDF2(SHA512) to hash a master password into a key that AES256 uses to encrypt a password database or vault.
I'm trying to estimate the tim... |
Setting: Shamir secret-sharing over the field $GF(p)$, $p$ a prime.
For $a\in GF(p)$, I would like a protocol that takes a sharing $[a]$ as input, and outputs: $[a^{-1}]$ if $a\neq 0$, and $[0]$ if $a=0$.
I cannot think of an easy way to modify the well-known protocol that computes $a^{-1}$ using a multiplicative mask,... |
I am currently trying to understand and implement the design of post quantum algorithm signature algorithm Dilithium. I have read the document several times and they have just used uniform random sampling for s1 and s2 and they have not provided any algorithm regarding its calculation. Viewing the reference code, doesn... |
Let's say I have the following equation to be arithmetised in PLONK
$x^3 + x + 5 = 35$ and the witness is $x = 3$
$3 * 3 = 9$
$9 * 3 = 27$
$27 + 3 = 30$
$30 + 5 = 35$
Now the 4th gate can be expressed as
$Q_l\cdot 30 + Q_r\cdot 5 + Q_m(30\cdot 5) + Q_c + Q_o\cdot(35)$
with $Q_l = 1, Q_r = 1, Q_m = 0, Q_c = 0, Q_o = -... |
There is a JSON array like this:
[
{
"date": "28.08.23 10:52",
"type": "text",
"data": "card number including expiration date and CVC"
},
{
"date": "29.08.23 10:52",
"type": "text",
"data": "bank password in the form admin:password"
},
{
"date": "30.08.23 10:52",
"type": "text"... |
I am inquiring about the feasibility of calculating the point difference between two distinct secp256k1 elliptic curve points. Given the nature of secp256k1, which is widely used in cryptographic applications such as blockchain technology, I am interested in understanding the process and potential challenges involved i... |
What would be an easy way to use the hexadecimal output of a hash function (like md5) to generate n unique numbers from, say 0 to 15. Of course I could generate n numbers by using each digit of the digest, but I need those numbers to be unique.
|
Consider a BLS signature verification using BLS12-381 where signatures are in $G_1$ and public keys are in $G_2$. Verification is performed by checking that
$e(sig, G2) = e(H(m), pk)$
or equivalently (by taking advantage of the bilinearity property to avoid one of the final exponentiations) that
$e(sig, -G2) * e(H(m), ... |
Hello I am new to lattice cryptography
I am reading the paper More Efficient Commitments from
Structured Lattice Assumptions
They define bound B in page 3
Then In figure 1 in page 9
Can someone kindly explain why the bound increase/decrease will change the LWE/SIS from computation hard to statistical hard? (It ... |
In TLS 1.2 and TLS 1.3, does the EC curve used to generate the ephemeral keys at the client side, does it need to be the same as that on the and server sides?
For example can I use secp521r1 at the client side and secp256r1 at the server side, and visa-versa?
I am asking this question, since in TLS 1.2 you can use fini... |
In yet another twist that is the terminology around key establishment I found out that ECIES is often denoted as key encapsulation followed by data encapsulation. I'm wondering how the term "key encapsulation" can be applied to ECIES.
ECIES consists of the following:
key agreement using ECDH, giving the master secret;... |
I just wanted to know for sure that TLS 1.3 does not support DHE_EXPORT cipher suits.
|
I have a question regarding the operations performed on an elliptic curve, specifically related to point doubling and point addition. I am trying to understand whether it is possible to determine the order in which these calculations were performed in order to obtain the x and y values of a public key.
To provide some ... |
I had an idea for safely transmitting sensitive data online, and I wanted an expert opinion.
Would it be safe to encrypt data (for simplicity at this point just use plain text) with a ruleset (an array with specific instructions on how each letter should be encrypted by any means).
Of course, you can guess the ruleset.... |
I have many questions about the details of using zk-SNARK technology in zk-rollup：
How can the validity of signatures in layer-2 transactions be proven in zk-rollup?
In zk-rollup, is a single large zero-knowledge proof circuit used to prove the validity of signatures for a batch of transactions, or is it separately pr... |
I'm trying to implement X25519 for a little game I'm working on. I knew nothing about this stuff a week ago so it's been a bit of a learning curve (that was really funny).
Most of the resources I found online were easy to follow, so I have a seemingly working implementation. While looking around I saw that apparently y... |
Obsidian.md claims
End-to-end encryption means that the data is encrypted from the moment it leaves your device, and can only be decrypted using your encryption key once it's back on one of your devices.
We can't read your data. Neither can any potential eavesdroppers, such as your internet service provider.
In the ra... |
I've been thinking about creating strong and unique passwords for my online accounts, but I also want them to be memorable. I've come across the idea of using a memorable passphrase as the basis for a complex password generation. Specifically, I'm considering hashing the passphrase to generate the complex password, suc... |
I am stuck here and can't map the coding part to the algorithm.
$$\underline{\text{Power2Round}_q(r, d)}\\
r := r \bmod^+ q\\
r_0 := r mod^\pm 2^d\\
\textbf{return}\big((r-r_0) / 2^d, r_0\big)
$$
What I tried:
int32_t power2round (int32_t *a0, int32_t a) {
int32_t al;
a1 = (a + (1 << (D-1)) - 1) >> D;
*a0 =... |
When one is computing $E(x) \equiv x^e \pmod N$ (where $N = pq$) in RSA, what is the precedent for which number in the residue class of $x^e$ to have as the result of this computation? Does this mean that we compute $x^e$ and then apply the mod function %$N$ to this, such that $E(x)$ is always in $\{0,1,. . .,N-1\}$? O... |
The GOC (Générateur d'Octets Chiffrants, Ciphering Byte Generator) is a PseudoRandom Generator that was used during the late 20th century for content encryption in pre-internet Videotex terminals, mostly in France. One application was encrypting sensitive data (e.g. banking details) while in transit to a Minitel.
The G... |
As indicated in an earlier Q / A, KEM's do not necessarily directly encrypt a pre-generated random value. However, it is clear that some KEM's do actually do this, with RSA-KEM being an obvious example.
Is there a name for the property of a KEM that it relies on both the public key value as well as a generated random v... |
Have any good 8-bit S-boxes made using ARX principles been found yet? I found Alzette, but it's a huge S-box at 64 bits.
I know that with a combination of addition, rotation, and XOR that any S-box permutation can be achieved, but working backwards would be way too hard for the effort.
|
In constructing a SHVZK simulator for a sigma protocol I am working on I have encountered some fairly basic questions, but ones which are not often discussed in textbooks and papers - consider the two following probability distributions:
$X_n$ - The uniform distribution on $\{1, \dots n\}=[n]$
$Y_n$ - The uniform dist... |
I am trying to implement Pei10 and BB13, but I am confused about what concrete parameters to use.
In Pei10, Algorithm 1 takes a rounding parameter $r = \omega(\sqrt{\log n})$ as parameter, but it does not specify how to choose it concretely. As in, would $r = \sqrt{\log n}$ or $r = 2\sqrt{\log n}$ work, as long as they... |
Is there any formula for deriving the $y$-coordinate using the $x$-coordinate and the slope in the secp256k1 elliptic curve?
For example:
Calculate the slope:
slope = 75359724952757581356787150982223137069297282952438962440225639443485944634025
Calculate the new $x$-coordinates:
x = 11271166043971060605674865917392967... |
Trying to understand the LPN encryption in this paper: https://eprint.iacr.org/2021/120.pdf. From Definitions 4 and 5, ciphertext is $c=C\cdot s\oplus e\oplus G\cdot m$ and the paper says the LPN encryption scheme is both message homomorphic and key homomorphic, where $s$ is the secret key, $C$ and $G$ are two matrices... |
We are doing symmetric Needham-Schroeder protocol in university. We were provided a modified protocol and needed to answer the following questions.
Original protocol:
Modified protocol:
Task
a) An attacker is an active MitM and knows an old key $k_{cs_{old}}$ and all transmitted messages from the past. Can the attack... |
PKCS#12 contains 2 integrity protection modes: password-based and public-key based. The way this is done in the standard is that data layout wise it appears to be fine to skip integrity protection because the macData field (used for the password-based integrity mode) in the outer structure is OPTIONAL to make way for t... |
I am new to cryptography and do not have sufficient background knowledge, and I am sorry for any possible vagueness in my question.
I am reading a paper (https://eprint.iacr.org/2019/129.pdf) about homomorphic secret-sharing and is confused by the key generation protocol mentioned (HSS.Gen) in the paper.
The key genera... |
Let's say we have a point $nP = (x,y)$ on a curve $E$ over a prime $p$. The corresponding Edwards curve coordinates are $(u,v)$. I want to construct the point corresponding to $(u,-v)$ on the Edwards curve.
I can construct $(-u,-v)$ easily, that just amounts to $-nP$, flipping the $y$ coordinate.
But I don't know about... |
How Ciphers, specifically, Substitution Ciphers and Transposition Ciphers manipulate the Entropy of Plaintext w/wo the aid of Entropy Source?
Reversely, how Decryption manipulates the entropy of Ciphertext?
Link: From Entropy's perspective how a Message was affected by Entropy, specifically, One-time Pad Ciphers and Bl... |
The definition of Benaloh encryption scheme can be found here.
Does exist an elliptic analogue of this scheme?
I want to use this scheme but the length of the key is very big(like $2048$). If you can do something similar for elliptic curves it would be great.
|
I'm currently taking a course in which we choose a stats-heavy paper and analyse it, summarising our work in the form of a written report and presentation. I have tried to find such a paper in crypto, even asking a professor who works in Information Security, but no success yet.
If possible, I'd like to be provided a l... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.