instruction stringlengths 32 27.2k |
|---|
In this picture we have a use of a hash function for message authentication.
M is plaintext message. H is hash function. E is encryption block with K symmetric key. || is concatenation of plaintext M with the output of E.
Is it true that this is vulnerable to bit flipping attack? I'm not sure how though.
This is what ... |
My goal is to enhance by bringing some changes to these techniques and schemes so that any improvements can be brought to them. So I tried to find some of the tools and came up with these:
Secret Sharing Protocol:
Cryptool: Cryptool is an open-source software suite that includes various cryptographic tools and modules.... |
I'm trying to understand how its represented a ciphertext of CKKS in memory, or the data structure.
Here is what I understand, correct me if I'm wrong. I also add some questions.
To start with, given a polynomial degree N and and a coefficient modulus, say {60, 40, 40, 60}. This means that the encoding in the CRT repr... |
I'm doing vulnerability research and looking at a device that is using some u-boot RSA encryption that they've modified. I've extracted the 4096-bit public key from the flash, it has an exponent of 65537. They simplified the padding to use a hardcoded 480-byte array that's labeled as "PKCS 1.5 paddings as described in ... |
In this question we are dealing with "$q$-ary" lattices. I will give the definition available to me and I'm interested in proving the lemma. As a reference see the PDF on page 2 from Peikert's lectures.
Definition. Let $\mathbb{Z}_q := \{ 0, 1, \dots, q-1\}$. We define $ \Lambda^{\perp}(\mathbf{A}) := \left\{ \mathbf{z... |
I am reviewing the ZKP course, represented by the university of Berkley (https://zk-learning.org/). In pages 41 and 42 of lecture 6 that is attached below (https://zk-learning.org/assets/lecture6.pdf), the instructor explains the Poly-commitment based on Bulletproofs scheme. He uses an example for a polynomial with deg... |
In this paper,
they shortly introduced how to uniformly sample points from the n-sphere.
The points of n-sphere consist with normal variables.
My question is ..
If I samlpe coefficients of ring using normal distribution,
what is differences between sphere sample and normal sample of ring?
How normal variables make un... |
Normally, when computing an EC threshold DKG, I have all parties reveal a commitment to the public key, and only reveal their own public key after verifying the commitments. Otherwise it's trivial to produce a public key that gives one member control. In a 2 party, for example, one can just wait for the other's publ... |
I've used OpenSSL to generate an RSA-PSS keypair.
-----BEGIN PRIVATE KEY-----
MIIBUgIBADALBgkqhkiG9w0BAQoEggE+MIIBOgIBAAJBAKjJmhflBebbRJt0JNWe
elk9w32jGxvZrvxO7kdpvNFWCgXIXSU0zC26R2Rca1w81sY4MpKfKl0baIK06Dbp
F6cCAwEAAQJANfamrocJeQKXj7/1WtrdMRT/IHb6XtAdEwvFQM28kYyUU4QuIxGO
cJ90rX99FdhOouUtbeYVXfnR7+I4NL6C+QIhAN6GukudUZq... |
An Elgamal-like bit commitment scheme:
Let $\langle g \rangle$ be a group of order $n$, where $n$ is a large prime.
Let $h\in_{R}\langle g \rangle\setminus\{1\}$ denotes a random group element such that $\log_{g} h$ is not know to any party, neither the sender nor the receiver.
$commit(u,x):=(g^{u},h^{u+x})$, where $u\... |
I have a compressed WIF private key starting with K but when ever i try to import it gives a different address. What could the issue be. The address generated is correct for the private key as i do have the screenshot as well when it was generated back in 2018 using a well known python script. Everytime i try to conver... |
I have a large file (> 200 Gb), that I encrypted a while ago with AES-256-CBC. The file itself is a tar which I ran through openssl. I've forgotten the exact password, but have a general idea of what it is.
Brute force is the easiest way to crack this from what I've seen (given the circumstances that I have a general t... |
This might be a stupid question, so bear with me. I was wondering if LLM embeddings can be used to anonymize input text. I couldn't find any information online that says that embeddings can be 1:1 decoded back to the original text.
An example:
A user wants to check some metadata about a query with an external API, but ... |
Pretty new to ECC Pairings. I am trying to understand KZG Commitments from multiple sources. I found this blog beginner friendly and easier to understand. However, I'm stuck at ECC Pairings and having difficulty in order to completely understand it.
The blog mentioned:
Input: 2 points ($P$ and $Q$) on 2 subgroups of ... |
In the preliminaries section of a paper$^\color{magenta}{\star}$ on lattice-based cryptography, the matrix norm $\| \cdot \|_{2}$ is used. Why do we define such norm? What's the purpose of defining such a norm? Is it common in matrix mathematics?
$\color{magenta}{\star}$ Dan Boneh, Craig Gentry, Sergey Gorbunov, Sha... |
Consider a system in which DES is used to encrypt messages in which the first three plaintext Bytes are known by the attacker. How many encrypted messages is it necessary to intercept in order to be reasonably sure of identifying the key used for encryption?
I thought about this, but I am not sure:
The probability that... |
TL;DR: Why is there a static-static diffie hellman in the Noise_IK handshake?
Hi,
I am currently trying to understand the WireGuard VPN protocol.
As you may know, it uses the Noise_IK handshake from the Noise Protocol Framework.
This handshake uses two ephemeral-static diffie hellman operations (es and se) to authenti... |
I know that in order to find the linear complexity of the two sequence beginnings
$$(1,-1,0,-1,0,0,0,0,1,0,\dots)\in\mathbb{Z}_3^\mathbb{N}\\
(2,0,-1,-2,0,0,-2,2,-1,-2,\dots)\in\mathbb{Z}_5^\mathbb{N},$$ I have to find LFSRs that generate these sequences. Do these have to be found by trial and error or is there a bette... |
In a previous question, we explored various security definitions of encryption schemes, such as IND-CPA, IND-CCA{1,2,3,etc.}
These indistinguishability games can roughly translate to blockciphers, as both data encryption and block encryption involve keys - a hidden parameter unknown to the adversary.
What I'm curious a... |
I am trying to create linear approximation table of AES SBox to better understand linear cryptanalysis, I have followed the formula in this paper (page 7 of pdf file) to be able to generate the linear approximation table of AES S-Box, specifically that is
$$\frac{\#\{x\in R|x \cdot t_x=B(x)\cdot t_y\}}{2^8} -\frac{1}{2... |
Does Apple secure enclave support rfc6979 with P256 curve? This RFC defines a deterministic ecdsa with a deterministic k value.
THATS LINK OF THE RFC https://www.rfc-editor.org/rfc/rfc6979
I looked everywhere in their documentation but couldn't find a mention of such usage
|
Is it possible to check if a PGP signed message has been modified when the public key of the signer is not available?
Like, is there a message digest (hash) that can be checked without knowing the public key of the signer?
Note that I am aware that, even if the message digest is okay, it is not possible to prove authen... |
Recently, I have noticed that openssl always gives numbers which have '1' in upper two bits. It always begins with 0xC or higher values (0xD, 0xE, 0xF). It doesn't give primes that starting with 0xB, 0xC, 0xA, 0x9 or 0x8. Common thing among those values is that their bit before msb is '0'.
I have an assumption about th... |
Assume that we have n people each owning a secret number. Now we want to collaboratively compute the addition of all these numbers without anyone revealing their numbers. Then the result will be made public to all. Wonder what algorithm shall I use?
(I have looked into multi-party computation, specifically secret shari... |
I have private data and I want to encrypt it to share it with some users who should be able to decrypt it. Therefore, I need multiple keys to decrypt it. But, I also want to be able to revoke a key to prevent someone from decrypting it, is there an algorithm that allows key revocation without encrypting the data again?... |
Suppose we have multiple parties ${P_i}$ each holding a secret share $(y_i,k_i)$ of the secret $(y,k)$. How can we calculate the inverse value $(y+k)^{-1}$ using multiparty computation such that these secret shares are never revealed?
|
Clarification on the use of Key block Version ID
For the first time since we migrated to the Key Block we are exchanging keys with third parties,
The keys were all generated by choosing Key Scheme "S".
During export as Key Scheme of ZMK we selected "R".
One of the counterparts is experiencing problems and they believe ... |
In general or in specific examples, how is the group used in an instance of the hidden subgroup problem embedded into a complex Hilbert space in order to apply the quantum fourier transform needed to solve the problem efficiently?
In quantum computing we imagine qubits as unit vectors in a complex Hilbert space $\mathb... |
I need a digital signature scheme with the following characteristics, but I don't know what it's called, so I'm having trouble searching for publications about it. It seems likely that something like it already exists. Could you please help me identify what it's called?
The scheme I need consists of four algorithms:
$... |
By using additive sharing of the private key over the integers, one can obtain a simple threshold RSA signature scheme.
It provides security against a passive adversary.
The dealer chooses random $d_{i}$ from $\mathbb{Z}$ such that the RSA private key $d=\sum_{i=1}^{n} d_{i}\mod \phi(n)$.
In order not to reveal informa... |
Given n voters and p candidates, how can we design a trustless voting algorithm that satisfies the following properties. Each voter can only vote for exactly one candidate.
The algorithm needs to:
Keep all voters' vote private, i.e. only known to the voter itself
Keep the number of votes each candidate receive private... |
In mental poker, we can use ZK-shuffle to deal cards to the players such that the cards are kept private to each player (https://hackmd.io/@nmohnblatt/SJKJfVqzq). Suppose we deal exactly one card to each player, I wonder if there is any way for the players who got the cards with the same number to know this fact withou... |
Say $B$ is a server and $A$ is a client who wants to login to the server, by proving herself to $B$. In challenge-response authentication protocols, $B$ sends challenge to $A$ and $A$ replies with response.
Here, I think all kinds of challenge-response authentication protocols are vulnerable to Man-in-the-Middle attack... |
The spec ( https://github.com/ulid/spec which is not a real standard ) explains that there are 80 random bits in an ULID. UUIDv4 is better from a security aspect, as it has 122 bits for randomness. But UUIDv4 has no monotonic sort order, and that would be very benefical in my actual application.
So how bad would it be ... |
bscrypt is a cache-hard password hashing algorithm/KDF from Steve Thomas (aka Sc00bz/TobTu), who was on the Password Hashing Competition (PHC) panel. He argues it is better than the alternative algorithms on his minimum password hashing parameters page. There are two talks for further information, but it's not thorough... |
we have a concern about a key export.
We completed the migration to Key Block LMK in our environment (with HSM Thales 10K).
Now, we have to exchange keys with third-parties that still use Keys in variant form.
We generated the keys and formed the ZMK using the Key Block standard. To resolve the issue we have to export ... |
According to section 4.2 of Pedersen's verifiable secret sharing, given a secret share $(s_i, t_i)$, it is possible to verify that the secret share is valid by using the commitments $E_j$, for $j=0,\ldots,k-1$, by using the formula
$E(s_i, t_i) = E_0 \cdot E_1^{x_i} \cdots E_{k-1}^{x_i^{k-1}}$, i.e. $g^{s_i}h^{t_i}=g^{... |
I want to test my server application (TLS 1.3) using s_client program from the openssl library and I need to get from the s_client a keyshare in the 1st ClientHello for secp256r1 (it proposes x25519 now). Could you tell me, which command line options in s_client should I use ?
|
Hi I want to implement pedersen commitment ontop of lib sodium
Below is what I am trying to do:
comm1: m1G+r1H
comm2: m2G+r2H
comm3: (m1+m2)G+(r1+r2)H
comm4: comm1+comm2
and comm3 should equals comm4
And here is my code:
unsigned char x[crypto_core_ristretto255_HASHBYTES];
randombytes_buf(x, sizeof x);
unsigned ... |
Hi I am new to lib sodium, may I ask that is it possible to get scalar of ristretto255 from integer/bytes or NTL:zz?
Some thing as follows:
crypto_core_ristretto255_from_bytes(px, x);
crypto_core_ristretto255_from_int(px, x);
crypto_core_ristretto255_from_ntl(px, x);
TIA
|
Given integers $s_1, \dots , s_n$ and target integer $t$, I'm trying to find small integer coefficients $x_1, \dots , x_n$ such that:
$$
t \approx x_1 s_1 + \dots +x_ns_n
$$
Taking inspiration from the Knapsack problem, I was trying to use LLL on the matrix :
$$
B =
\begin{pmatrix}
1 & & & & \\
& 1 & & & \\
& & \ddots... |
LWE schemes are currently being deployed. LWE has no quantum polynomial time algorithms as far as we know.
Despite this what is the consequence if LWE can be broken on a classical computer? Do we have any other alternatives?
|
AFAIK, SuperSingular curves appear to be broken by MOV:
A. J. Menezes, T. Okamoto and S. A. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field," in IEEE Transactions on Information Theory, vol. 39, no. 5, pp. 1639-1646, Sept. 1993, doi: 10.1109/18.259647.
I recall that with a big order chos... |
Given $e(a,b)$ as known, can I get the value of $a$ or $b$?
|
Let $N=pq$ be an RSA modulus, that is, $p$ and $q$ are large, distinct primes.
Let $J_{N}=\{y\in\mathbb{Z}^{*}_{N}:(\frac{y}{N})_{J}=1\}$ denote the set of all integers in $\mathbb{Z}^{*}_{N}$ with Jacobi symbol $1$.
The Quadratic Residuosity (QR) problem is to decide whether a given $y\in J_{N}$ is a quadratic residue... |
In asymmetric key encryption, we have 2 functions, encrypt(m,k) and decrypt(m,k), and 2 keys, public_key and private_key.
And it must hold true that decrypt(encrypt(msg, public_key), private_key)) = msg.
Question 1: Are the encrypt(m,k) and decrypt(m,k) functions different, or are they the same function?
Question 2: Mu... |
Homomorphic properties turn out to be very useful, e.g., for achieving secure multiparty
computation.
As a concrete example, homomorphic commitments can be used as a building block for secure election schemes: very roughly, during the voting stage, voters put their votes into homomorphic commitments, and during the ta... |
First of all, I know that I should not be using RSA in 2023, and that I'm better off with Elligator2 + ECIES for a variety of reasons.
However, I am thinking about whether RSA-KEM can be used for PURB-like constructions with long lived public keys. For it to be viable, the RSA ciphertexts should not be distinguishable ... |
I'm trying to understand the security of the Montgomery ladder algorithm in the context of timing side-channel attacks. I'm looking at the algorithm from wikipedia
While I know that the algorithm ensures a constant number of operations in each branch of the if statement, I'm unsure about its overall safety. The Montgom... |
I am looking for guidance on implementing a protocol where a BLS private key is split into 2 out of 3 shares using Shamir's Secret Sharing, and signatures must be obtained without revealing the original message to the other parties.
Here's my current approach:
Alice has a BLS private key. She splits this private key in... |
I hope this question is not too speculative.
Applebaum, Nir and Pinkas have a new paper which has an $n-$party secret sharing scheme with:
reconstruction complexity of $O(n)$ additions
constant share size
sharing complexity of $O(n)$ additions
is a blackbox secret sharing scheme
The shamir scheme has complexity $n \l... |
The ME-600 key generator was developed in the early 1990s for generating truly random one time key streams. That's not exactly World War 1 or 2. I don't know how long it was used, or whether it still is.
Now with quantum computing on the horizon, people are looking at post-quantum cryptography. We also don't yet know... |
I have been given a DES encryption assignment. I was given the Cipher text, the Plain text and the "passphrase". The passphrase consist of a 4 byte hex string. I have studied several different tutorials on you-tube about the workings of DES but I still can't seem to be able to figure out the key. I have tried to ad... |
In short, my question is:
What exactly do people mean when they say that "The more you apply the Rabin-Miller test to a number, the more certain you can be that the number you're testing is prime."?
To clarify what I'm asking, let's look at an example I was working through:
Testing if N = 78007 is prime or not (spoiler... |
I am researching the Xorshift128 PRNG. I am particularly interested in recovering the state given a set of outputs that have the remainder taken with different values.
A common way to take a unsigned 32-bit output from Xorshift128 and produce a value that ranges from 0<=n<50 is to take the remainder of the output and 5... |
In 186-2rsatestvectors.zip/SigVerRSA.rsp
n = bb5784794f27bfab90a19bcc20bb10ac3d1d432d90651dace6235e34560abd733a0c3b693ea3802707c0e22e81603a6e2b82812a0027ece2d974a5a5190df89d636f7ab200849065fe412fe85e41aceb0d68b10cdd07e42ea16184c974f58c10c560aa444f64b41e932ab25355648b510b1feedca780cfb68f11ac9fc98ab15b
p = bda227ead8dc1... |
Looking at https://github.com/tbuktu/libntru/blob/master/src/ntru.h, there are some functions that deal with having multiple public keys with the same private key. I don't believe I need such functionality but it makes me suspect that it might be required. Basically, I want to know if it is OK to reuse the same keypair... |
I don't really know what should be the correct title for this and the community can correct it after reading.
I was the author of PKDSA (Searchable on github).
I have the idea to do it because I feel like shifting from a password based scheme to challenge and respond with digital signature as much as possible might be ... |
I'm still kinda new to Galois theory so I apologize if this question is very obvious to some people.
Basically I'm reading this paper by the NTRU Prime team and in section 2.5 it's explaining how cyclotomic fields should be replaced with prime degree fields with "big Galois group", namely because how structures within ... |
RSA factoring challenge is a famous one and is still not completely solved.
Are there similar challenges for
Discrete log over $\mathbb Z_p^*$?
Discrete log over Elliptic curves?
LWE?
LPN?
|
I designed my TRNG with FPGA. My TRNG has a good entropy performance with a value of 0.99x over several test times. But for the NIST800-22, during several run times, sometimes my sequence passes all the tests, and sometimes it fails one or two tests. (my sequence length is 100.000.000 with the number of run-time for ea... |
First layer of each AES round is the Byte Substitution layer. It is the only nonlinear element of AES. What would happen if this layer was not in the path? And the lack of it would create a problem in the design goals?
|
Can the error in LWE or ringLWE schemes be from $\{0,1\}$? If not why and what is the best attack in this case?
|
I haven't found much info on the internet about the weakness of modes to chosen plaintext attacks, but from what I understand of them, there seem to be some trivial attacks, so I'm a bit confused.
For example, let's encrypt 2 blocks of plaintext with value 0 with CBC:
C0=Ek(P0+IV)=Ek(IV)
C1=Ek(P1+C0)=Ek(Ek(IV))
But the... |
I'm testing my server application (TLS 1.3) using s_client program from the openssl library and I need to force the s_client generating my "random" values in it's ClientHello.
Could you tell me, how can I do it using command line options - where I should point my random sequence to be generated ?
|
Consider a ZKP anonymous credential scheme where each tuple of (x, identity_secret, merkle_root) corresponds to a unique nullifier computed as Hash(x|identity_secret). The prover can use this tuple repeatedly along with proving other statements.
x is designated on a per-session/app basis. And for a specific triple, a u... |
I am reading Section 4.1 (An offline algorithm: SmallDB) of The Algorithmic Foundations of Differential Privacy by Dwork and Roth. I am stuck at the proof of Proposition 4.4, which is about the utility guarantee of the small database mechanism (Algorithm 4 in page 70).
Proposition 4.4. Let $\mathcal{Q}$ be any class o... |
I am reviewing the ZKP course, represented by the university of Berkley (https://zk-learning.org/). In pages 44 of lecture 6 that is attached below (https://zk-learning.org/assets/lecture6.pdf), the instructor explains the Poly-commitment based on Bulletproofs scheme.
I am a little confused that why the verifier comput... |
My question is essentially the same as this one.
The random oracle is a black box that does two things.
Maintain a lookup table for any query that has already been asked.
For all new queries, toss a bunch of coins to obtain a sufficiently long uniformly random bitstring.
As far as I can tell, 1. sounds straightforwar... |
Assume integer factoring, discrete log are classical safe and LWE, McEliece etc are quantum safe. This question is only about SHA and hash families in general on why we need them if we have pkc primitives.
What role does SHA256 or other hash families play? Why are they needed when we have LWE, McEliece etc?
What happ... |
A Diffie Hellman style approach is proposed in https://mathoverflow.net/questions/408757/diffie-hellman-cryptography-based-on-graph-isomorphism but is broken easily.
Two graphs are isomorphic iff there adjacency matrices can be permuted to each other. GI has only quasipolynomial algorithms.
I wonder if there is a toy s... |
I am new to RLWE, would like to ask whether what I am thinking make sense
Suppose I have a message e.g.: x=5
And I have a lattice based encryption scheme, e.g.: BGV
could I encrypt x with BGV by treating x as a polynomial ring with constant coefficient=5, and other coefficient =0?
Thanks
|
Can any encryption scheme that is CCA (Chosen Ciphertext Attack) secure be considered to achieve perfect secrecy?
|
I think it should have APIs for polynomials, FFT and bilinear mapping if KZG commitment scheme is used.
|
Alice wants to send Bob a message. Both have well known public/private EC keys (PA, b, PB, b). Both have well known public keys tied to an identity.
Alice computes a shared secret with Bob (PBa), and uses the x coordinate to tweak her private key, creating a new public/private keypair (PAx, ax).
Alice computes a shar... |
A couple years ago, I devised some primitives for block ciphers and block cipher modes of operation; I was partly inspired by CAESAR. What these designs all had in common is that the encryption/decryption process would produce a bit string $T_i$ for each block and all of these bit strings would be combined together to ... |
I've this requirement to 'derive' a session key from an AES key that is stored inside a HSM. I don't want to mention which HSM since what I intended to do is to make the system HSM neutral.
The initial idea is to use any existing KDF algorithms but since the AES key is in hardware, the KDF is only possible if the HSM s... |
I was wondering if changing modes or primitives could affect security. For example, let's say you have encrypted data with AES-128 with CBC mode and you want to change it to AES-128 GCM, or to ASCON. What I mean by that is that you decrypt the messages then encrypt them again with the new scheme. Does that affect secur... |
In ECDSA, if Alice wants to send a message to Bob, she computes $s=k^{-1}(z+rd_A)$.
I was thinking that the formula could simply be $s=k^{-1}zrd_A$ and the algorithm would work just as well, and the verification would be simpler, because the recipient would just have to calculate $X=s^{-1}zrQ_A$ instead of a sum $X=s^{... |
Update:
In Lipton and Regan's blog, Scott Aaranson and Craig Gidney have commented that the results are not unexpected and also not a deal-breaker in that dealing with this type of noise is already part of the way QC is implemented, including the use of physical measures as well as error correction for making quantum c... |
The NIST Kyber KEM spec. defines an encryption scheme, KYBER.CPAPKE, that's a variant of the so called Lyubashevsky, Peikert, Regev ("LPR") encryption scheme [1]. While LPR encryption is typically defined over subrings of cyclotomic number fields, KYBER.CPAPKE is instantiated over an $R_q$-Module where the base commuta... |
In the paper Dual system encryption: realizing fully secure IBE and HIBE under simple assumption (free PDF), the authors said "there is an apparent paradox in this strategy since it seems that the reduction algorithm could simply answer the challenge ciphertext". In the paper An efficient IBE scheme with tight security... |
Does anyone know what are the family relationships in the paper "How to Explain Zero-Knowledge Protocols to Your Children"
The authors are: Jean-Jacques Quisquater, Myriam Quisquater, Muriel Quisquater, Michaël Quisquater, Louis C. Guillou, Marie Annick Guillou, Gaïd Guillou, Anna Guillou, Gwenolé Guillou, Soazig Guill... |
In Kyber the following estimation is given for a quantum adversary:
Theorem 4. For any quantum adversary $A$ that makes at most $q_{RO}$ many queries to quantum random oracles $H$ and $G$, and at
most $q_D$ many (classical) queries to the decryption oracle, there
exists a quantum adversary $B$ such that
$$\text{Adv}_{... |
Anyone can explaine to me how does the round key in aes256 work please, why is the round key 32 digit while 1 block only have 16 digit? how can 32 digit key XOR 16 digit block? Is it like two digit of round key XOR 1 digit in block?
|
Can anyone explaine how to find the every 15 round key by the 64 hex digit master key of AES 256 please. I will be really greatfull
|
So the problem I'm exploring is basically how to run a paper exam (such as the SAT) in such a way that participants can be sure that their exams were graded fairly, meaning the exam hosts can't change the answers or questions of the exam after the exam is conducted without the examinees finding out.
So we have a test w... |
All the knowledge I have learned about encryption algorithms tells me that the AES encryption algorithm uses three key bit lengths of 128, 192, and 256 to encrypt data, and these three key bit lengths correspond to 10, 12, and 14 rounds of encryption, respectively.
But the question is, why?
Why not 11, 13, 15? Why not ... |
I've generated a key using an HSM Thales PayShield and i have share it with a counterpart. I followed these steps:
i generated key usign KG console command
i use FK to form ZMK from clear components (received by the
counterpart)
i exported key key under ZMK (KE command)
Now, in this particular case the counterpart... |
I have a group of subscribers who are subscribed to a message broker in an IoT setting, let's say to the topic 'sensor/temperature'. Now, I want to create a public/private key pair in such a way that only the subscribers are capable of generating the pair, while the broker remains unaware of it. The publisher will encr... |
The integer factorization decision problem (does integer N have a prime factor = k?) is known to be an NP problem. Analogous to this, can we say that the decision problem for finding the private key of an Elliptic curve (Is r the number of times base point was added to come up with target point) is also in NP, but not ... |
If we use the following notation:
$$C = E(P, K_e)$$
$$P = D(C, K_d)$$
Where:
$$E(), D(), C, P, K_e, K_d$$ are the encryption algorithm, decryption algorithm, ciphertext, plaintext, encryption key and decryption key respectively
The only difference between symmetric and asymmetric encryption is:
$K_e = K_d$ for symmetri... |
I am studying openssl 3.0 (Windows, C++) in order to encrypt data using RSA. More specifically, I need to sign a CertificateVerify server message in TLS 1.3. The questions are:1) how can I define padding mode (PSS) for RSA encryption for this aim ?2) Should I to create EVP_PKEY_CTX* ctx or I need EVP_MD_CTX* mdctx only... |
From the PLONK paper.
Page 23, 6 Constraint System
The constraint system $C = (V, Q)$ is defined as follows.
$V$ is of the form $V = (a, b, c)$, where $a$, $b$, $c \in [m]^n$. We think of $a$, $b$, $c$ as the left, right and output sequence of $C$ respectively.
$Q = (q_L, q_R, q_O, q_M, q_C) \in (\mathbb F^n)^5$
whe... |
In SEAL library, I want to multiply a BFV ciphertext ct with an integer inverse. Here are what I do:
Compute the integer inverse as follows:
uint64_t inverse = invert_mod(pow(2, log_total_item),enc_params_.plain_modulus());
Encode inverse to BFV plaintext using the following code:
Plaintext inverse_pt(to_string... |
My train of thought went, OTP is very secure if key is unknown because I am guessing the original message. AES on the other hand tells me I gave it the wrong key, and if I did I can just switch using another key without having to worry about if the decrypted message using a key that's not the original key was the origi... |
I know it's possible with ECDSA. How bout RSA?
|
I would like to let the receiver has the ability to check the sender's authenticity when he gets the message.
Also, I want to protect the message's confidentiality and integrity.
Should I use aes gcm + hmamc or just aes gcm?
I heard aes gcm provides messages authentication suing Ghash. But ghash is not a mac, so I am c... |
The Pinocchio paper contains a description of the GGPR protocol (Protocol 1), and states that verification requires "8 pairings for the $\alpha$ terms, and 3 for the $\beta$ term". However I can't figure out how to verify the $\beta$ term with 3 pairings, it seems to require 4.
For context, the proof is given as:
$$
( ... |
For security against Chosen Plaintext Attack (CPA), we need randomized algorithms for encryption. But in some schemes (maybe almost all of them) take decryption algorithm deterministic. This procedure occurs in functional encryption, that its security definitions are more complicated than ordinary public encryption, to... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.