instruction stringlengths 32 27.2k |
|---|
I am using zkSNARK to prove knowledge of preimage for SHA256. However, the library used only supports field operations (such as add and multiply), and it compiles down to arithmetic circuits. Thus, bitwise operations prevalent in SHA256 have to be simulated using field operations. How can they be simulated, say, left s... |
In the zero knowledge definition of the Groth16 scheme (https://eprint.iacr.org/2016/260.pdf) [Section 2.2], why would the simulator be allowed a trap-door in set up? The trap-door information contains the toxic waste that should be destroyed by the set up. In another word, if the simulator (a.k.a modeling a passive at... |
Traditionally, hash functions are single-threaded, and have the 'Init-Update-Final' API style. This is true of MD5, SHA-1/2/3, BLAKE2, to name a few.
However, there have been proposal of parallel hash functions, and tree-hashing. BLAKE3 and KangarooTwelve are among these.
If we continue to use the IUF API, then data-av... |
I am trying to find the flag from an RSA ciphertext, I am able to get the factors from factordb.com but the given e is not coprime with phi(n). One weird thing that I observed is that n and cipher_int has 10264 digits (looks like an integer). I am very new to crypto, Any ideas on how I can solve this?
|
This is a simplified version of a question I made long ago, that never got an accepted answer.
It's given $N$ of $n=2048$ bit, assumed hard to factor, which two prime factors each are $\equiv2\pmod3$, so that the public exponent $e=3$ is usable. It's also given $C\in[0,N)$, known to have been obtained as $C=M^3\bmod N$... |
May someone please explain what the notations in the image means?
In general, for a modulus $q$, what does the $+$ in here $\bmod^+ q$ indicate? What does the $\pm$ in here $\bmod^\pm q$ mean?
|
Let $\mathbb{G}_1$, $\mathbb{G}_2$, $\mathbb{G}_T$ stand for three groups of the same large prime order $r$. I invented a pairing $e\!: \mathbb{G}_1 \times \mathbb{G}_2 \to \mathbb{G}_T$ (with embedding degree $k \in \mathbb{N}$) such that $$
\mathbb{G}_1 \subset J(\mathbb{F}_p), \qquad \mathbb{G}_2 \subset E(\mathbb{F... |
Please see the image below which represents an algebraic definition of the Dolev Yao Closure. From reading around, it appears this is BAN logic and that the lines mean "If you believe the above statement is true, then you must believe the lower statement is also true."
Is this accurate and why do the statements appear ... |
Consider the Schnorr identification protocol. Let $x$ be secret key, $u$ be public key, $r(\xleftarrow{$} \mathbb{Z}_q )$ be a random number with $u_r=g^r$ the commitment that prover uses at first round, and $c(\xleftarrow{$} C)$ be the challenge that verifier challenges to the prover at second round.
At the last roun... |
I'd like to encrypt a file with AES256 and provide my own 32-bytes for the encryption, rather than having GPG derive it from the passphrase.
I could not find such option, but I'm thinking about a possible workaround.
Per this message:
https://lists.gnupg.org/pipermail/gnupg-devel/2018-June/033795.html
The other use of... |
In the BGN-like LWE cryptosystem, section $2.2$, we sample a $m \times m$ trapdoor matrix $T$ that is full rank such that $TA = 0 \pmod q$.
Suppose that $q$ is prime so we are in a finite field: if $T$ is full rank, the nullspace of $T$ is trivial, and $A = 0$?
In particular, $T$ can have rank at most $m-n$?
|
There is a lot of "retail investor" hype implying a zk revolution in the future where we have circuits for common instruction sets and many software backends are zk-proven.
I'm wondering, are there any fundamental results (e.g. impossibility theorems, bounds) like, proving key must be x times the size of the unproven p... |
I'm using OpenSSL 1.0.2 and FOM 2.16 and am trying to figure out a way to draw entropy from Intel (RDRAND/RDSEED) if it's available, and from the Linux OS (/dev/random or /dev/urandom) if it's not. If I build OpenSSL with
--with-rand-seed=rdcpu,os
it tries to get entropy first from the Linux OS. I need it to try RDRA... |
Quoting Ristretto255 for the PHP Community,
Ristretto255 is Ristretto defined over Curve25519, which allows cryptographers to extend the Ed25519 signature scheme to support complex zero-knowledge proof protocols without having to deal with the cofactor.
(The cofactor in Ed25519 is what caused the multi-spend vulnerabi... |
Given n nodes(miners/validators),
Every unspent transaction output is broadcasted to all n nodes.
Each node will select a batch of transactions and add it to their
block. The specific mechanism of how they select transactions will
be dependent on each node’s source code.
A node gets randomly selected to add a block to... |
I have been working on signcryption scheme and its security proof. I want to compute the efficiency in terms of number of scalar multiplication operation, number of exponential operations, and number of bilinear pairing operation. I am comparing it with other schemes as well. I think I am missing out some information r... |
I am making a password manager , I am new to cryptography, so , can someone tell me if this can be a good solution?
1- the user inputs the email/password
2- all the payload gets encrypted with aes@256bit and saved on a public blockchain
It should work right?
and one more thing: as you know storing data on the blockchai... |
I came across an interesting challenge recently. I need to find x such as :
$s=n^x \mod m$
We suppose we have $s, n$ and $m$. The modulus $m$ is prime and $n$ is a primitive root modulo $m$.
The interesting property is that $m$ can be written as $m=a^2+b^2+c^2+d^2$ where $a,b,c,d$ are integers.
Given the decomposition ... |
I have read the Bitcoin paper and there is one statement that I would like to know if it is really proven ir not:
The only way to confirm the absence of a transaction is to be aware of
all transactions
The point is that if this statement is false, maybe there is a mechanism to solve the double-spending problem withou... |
I found an algorithm described in my old math notes that I wanted to dive into further, but the name I noted is apparently completely wrong ("Bolson Adding"), so now I am trying to find the actual name of it.
You have an array of digits 0-9 and add them up in pairs, starting with first+second, then third+fourth, etc., ... |
I'm new to modular arithmetic but it still is something that I think is pure mathematics that I don't get.
I have this problem 3 * d ≡ 1 mod 13. So I need to find the d which is the inverse of 3.
I did find a solution that I understand:
3 * d ≡ 1 mod 13
Which can be written
3^(13-2) % 13 = 9 or pow(3, 13-2, 13) = 9
So... |
This is a rather simple question but I've been unable to find a proper answer for this online.
When defining an asymmetric (public key) algorithm is the one-way trap-door function usage referring to the encryption/decryption function or the key generation process or perhaps both?
I believe that the one-way function is ... |
I have tried to answer this question for quite some time now. But a complete intuitive understanding still eludes me:
suggested a new implementation for AES:
The byte substitution step will be replaced by the function:
$$s(b_0b_1b_2b_3b_4b_5b_6b_7)\,=\,b_7b_0b_1b_2b_3b_4b_5b_6$$
( a cyclic shift of one bit to the right... |
With the appearance of cryptocurrencies several applications of ZK proofs were envisioned. However, to the best of my knowledge, all of these are proofs of knowledge.
My question is: are there any real-world applications (in contrast to applications within cryptography) of ZK proofs without the proof of knowledge prope... |
Based on many suggestions I have seen around, this, that.etc. Best practice says to keep the root CA offline for very understandable reasons.
But how can it be truly offline? Doesn't the root ca have a list of int cas that it trusts. so therefore when a user goes to a website the chain has to be completed. So there is ... |
I’ve read a lot of articles and a lot of questions here to understand how the encryption is done in garbled circuits. As I understand double encryption is to encrypt the gates and the truth table. The thing I wonder is how do we do that double encryption. Which method is used to generate keys?
This is what I’m talking ... |
My question is:
Alice signs messages using RSA with a public key $(e,N)$ and a private key $d$. Alice chooses $d$ in the range $N^{0.25} < d < N^{0.5}$.
What is the time needed for Alice to calculate the signature $S = m^d \bmod N$?
My answer is: Alice chooses $e$ so that $d$ is in the range $N^ {0.25} < d < N^ {0.5}$.... |
Recently I across this cryptographic library for Oblivious Transfers. In the README file I saw many OT flavors that I haven't seen before, more specifically the following :
General OT
Correlated OT
Global correlated OT
Sender random OT
Receiver random OT
Could anyone help me clarify their meaning? Thanks in advance f... |
I’m having difficulty calculating the false positive error probability of matching a prefix of a hash that was truncated to m bits.
Say I have string S1 that produces a SHA256 hash H1. I then save the the first 64 bits of H1, call it prefix P1 to a database.
I have another string S2 that produces a SHA256 hash H2, and ... |
This is not a formal but intuitive concept of one-wayness. The intuition is that if you have a combinatorial object that requires $n$ bits to describe. A one way operation introduces noise in random bit locations such that $\epsilon n$ bits are modified. Then only exponential time algorithm can invert the function. Are... |
I have been reading the book "Serious Cryptography" by Aumasson to begin learning about Cryptography. There was a part where the author suggested how encryption using permutation should have these properties to be secured
It should be a
permutation, which is a rearrangement of the letters A to Z, such that
each lette... |
I want to check if some pubkey belongs to twisted edwards25519 (I guess this is used for ed25519 ?) The problem is that I have in theory some valid pubkeys like:
hash_hex = "3afe3342f7192e52e25ebc07ec77c22a8f2d1ba4ead93be774f5e4db918d82a0"
or
hash_hex = "fd739be0e59c072096693b83f67fb2a7fd4e4b487e040c5b128ff602504e6c72"... |
I am moving from RSA to ECC for my application.
Looking at these posts 1
2
3, they all suggest that Alice generates a temporary (ephemeral) ECC keypair eKP to send a message to Bob.
The sessionkey sK is then generated at Alice' side as (privateKey eKP * publicKeyBob).
The publicKey of eKP is transmitted along with the ... |
I'm currently debating whether to revert to a non-committing AEAD (ChaCha20-Poly1305) instead of a committing AEAD based on Encrypt-then-MAC (XChaCha20-BLAKE2b) for stream encryption. Borg backup made the switch, and non-committing AEADs have several advantages:
Standardised
Generally faster
Less overhead due to short... |
I mean this has certainly been implemented by some scummy PRNG developers, which thought of the economics behind it (especially in the casino and similar businesses). So it might be even legal in some cases, but this not Law StackExchange ;-)
Yes, I am aware that PRNG have a period and hence are practically determinist... |
With public-key cryptography, I know Alice can "seal" a message that only Bob can open. But in that case, Alice knows the message that she is sealing.
What if Alice wants to seal a random number which she doesn't know? Could she seal it such that only Bob can determine it, not Alice?
Here, more specifically, is the kin... |
In the CTR mode, a nonce, a counter value and the key are needed to form the input of the PRF. However, the Deterministic counter mentioned in Dan Boneh's slides (https://crypto.stanford.edu/~dabo/courses/OnlineCrypto/slides/04-using-block-v2-annotated.pdf, pp. 20), does not have the nonce. It only uses the key and the... |
Can Shamir's secret sharing work on any size of key?
|
I have to encrypt data (files) of client on server side and only the client can read theses files (admin can't see name and content of file).
To resolve this, I have the idea to just use something client have and the admin doesn't, his password to generate a cipher key, this idea is simple.
But I have a constraint for ... |
I have just learnt about Diffie-Hellman and AES. However, I cannot seem to understand how they link.
My initial idea was that Diffie-hellman is used to transfer a key for AES decryption. After further research, I understand that AES uses the key that is produced by the Diffie-Hellman.
I don't understand how it uses it ... |
Given that:
$$ SD\bigg( (r, \langle r, s \rangle),(r, b) \bigg) < \mathrm{negl}(n)$$
where $SD$ stands for statistical distance, $r$ is random uniform in $\{0,1\}^n$, $s$ is random uniform in $S \subseteq \{0,1\}^n$ and $b$ is a uniformly distributed bit.
It seems intuitive that, given a collision resistant hash functi... |
General
My goal is to encrypt some strings and store them in a database.
I am using RSA OAEP in Go (Golang):
rsa.EncryptOAEP(sha256.New(), rng, rsaPublickey, plaintext, nil)
rsa.DecryptOAEP(sha256.New(), rng, rsaPrivatekey, ciphertext, nil)
I generated a public/private key pair with 4096 bits.
My understanding of RSA ... |
In cryptography output sequences of stream ciphers are binary valued (or more generally finite field valued). However mathematically sequences over real and complex variables can also be generated by stream ciphers utilising feedback shift registers. We can also convert a binary output sequence $w(k)$ of a stream ciphe... |
Short Version: SHA-256 uses addition alongside a variety of bit-wise operations. What's up with that?
I was reading a description of how SHA-256 worked and it included a description of the various internal operations that take place on the blocks of bits while the algorithm does its work.
Most of them made sense to me ... |
The question is fairly simple and is actually stated in the title although I will elaborate a bit further on it. Also, I'm not really sure if this belongs here or it partly belongs to cstheory.stackexchange.com.
Currently I'm trying to understand ZKP as a class of problems. I have read that IP=PSPACE and that ZKP exist... |
I was curious which of Groth16, Halo2, Bulletproofs, etc have statistical vs computational zero knowledge guarantees. This would inform post-quantum zero knowledge as well, since I imagine that past statistical zero knowledge systems will not be de-anonymized, but past computational zk may. (Note that I am not concerne... |
I want to know if there is a multisignature scheme that allows the merging of two multisignatures for the same data but by two different sets of users, and without knowing the corresponding private keys. The goal is to obtain a single multisig that has the same size than the two multisigs it originates from.
This would... |
I plan to use it locally on mobile devices. These seems to do not offer computational power as good as on a server.
So what could be a secure argon2id parameters that run around 1s since offline apps should also be friendly too?
|
The question is mainly stated in the title, sorry for it being a bit small of a question. I was reading about ZK proofs and I was wondering what do we know about their limits only their properties. Do we have any impossibility theorems or any assumptions that we strongly believe that hold? Thanks in advance for your ti... |
I'm implementing a searchable symmetric encryption scheme, developed by others, for my own personal enrichment. The original research is located at the link: https://eprint.iacr.org/2013/169. I'm using the BigInteger class in Java to perform the group operations. The scheme splits the exponentiation between the cli... |
Please, can any extensively explain the importance of super encryption in relation to attacks experienced by single standard algorithms
|
This question is someway correlated to Breaking RSA with P,Q LSB bits but more specific.
I would like to use LLL to fully reconstruct P,Q given some LSB bits of P and Q in an arbitrary base B.
Let's take RSA 100 and B=12 as example and sagemath as calculator:
# p,q solutions in base 10
# p = 379752279369436739228088727... |
Let $e:G_1\times G_2\to G_t$ be an asymmetric bilinear pairing, $g_1$ be a generator of $G_1$ and $g_2$ be a generator of $G_2$. Can we compute $g_2^t$ from $g_1^t$ when $t$ is unknown?
|
Consider this scenario:
A signs a message to B using A's private key. A then encrypts the signed message with B's public key. A sends both plaintext and encrypted message to B so that B can verify.
B receives the messages from A. B decrypts the signed message using B's private key and verifies that the plaintext mess... |
From what I know SSS creates a polynomial with a0 = secret key and interpolates it on recovery using k coeffs. if a0 is a number, can SSS fully recover keys with 0 bytes in front of them?
Example, If I make shards for 00d3e4bb740636a65d31a8b00793187c will I get d3e4bb740636a65d31a8b00793187c upon reconstruction or 00d3... |
I'm primarily a mathematicians dipping my toes into cryptography, and I have often seen/heard cryptographers use the heuristic that a uniformly random sample $a$ from $(\mathbb{Z} / N \mathbb{Z})^\times$ will be "large", or that $a \approx N$, without referring to a specific result.
I want to make sure I understand the... |
I'm trying to create the digital signature by using these parameters and RSA algorithm:
p = 645353605880701501120167331073
q = 350784310265709643169455170929
e = 19
message = "G’day mate! As we are using a publicly available free WiFi network, our communication may be intercepted by cyber attackers. Therefore, we need... |
I'm aware that the difference between the NaCL sign keys vs the box keys is that the secret key that comes from the NaCL box keypair is the 32 bit secret key + 32 bit public key.
So I decided to use the tweetnacl.js library to create a signing key and use the box functions to encrypt and decrypt data.
I used the nacl.s... |
Do I understand correctly that the textbook Rabin encryption scheme, where there is no random padding (as is also required in RSA for it to be CPA secure), is not CPA secure? (it is deterministic without such padding), or am I missing something?
My confusion arises from the wikipedia article which states that it is CPA... |
I was wondering, if the output of following type of ChaCha + HMAC scheme is indistinguishable from randomness:
from cryptography.hazmat.primitives.ciphers import Cipher, algorithms, modes
from cryptography.hazmat.primitives import hashes, hmac
def chachaHMAC(key, nonce, data): #Do not reuse nonce!!!
#Make differen... |
In three different, highly reputable sources (e.g. "Introduction to Modern Cryptography" by Katz and Lindell, 2007), the definition of CCA attack doesn't allow the adversary to decrypt the challenge, but also doesn't require the adversary to send never-before seen messages.
I'm assuming that this is a mistake, and that... |
safe to say I'm a complete beginner when it comes to cryptography... I believe the example output below is some sort of RSA (or RS256) encrypted string, and was just curious whether it'd be possible to re-create that encryption with any random text I enter based on the information that I have below.
Example output (wha... |
Some of the encrypted messenger apps and password managers use extended version of Bernstein's ciphers and some of them not.
Viber-Salsa20
Wire-ChaCha20
Threema-XSalsa20
Sid-Salsa20
Nordpass-XChaCha20
Keepass-ChaCha20
Why? Does larger nonce make extended version more secure? if it is then why some of them not using ext... |
For DSA, if the same message is signed multiple times on different occasions, the signatures will differ because the random value k is generated for each signature. This is not true of RSA signatures. What is the practical implication of this difference?
|
The compliance department is asking me for recommendations on encrypting data before Saas-solutions. Meaning that the Saas-solution should not be able to see the data when stored and processed.
Reading about Fully Homomorphic Encryption seems like it would solve the issue, but i can't seem to really find out how widesp... |
I am studying the vulnerability of DES algorithm.
Let there be a DES system with 5 keys, 56bits each. Encryption works as follows: (It's in this order on purpose)
$C=DEC_{k1}(ENC_{k2}(ENC_{k3}(DEC_{k4}(DEC_{k5}(M)))))$
With k2=k3 and k4=k5
Where C = Cipher,
M = plain text
DEC = Decryption
ENC = Encryption
-kn = Is the... |
I see many papers that compare the latency of the signature schemes in terms of clock cycles by two-three numbers. I don't know why they write 2-3 numbers instead of one number to represent clock cycle. For example consider the following table from this paper link: https://eprint.iacr.org/2019/122.pdf
|
As title I have a password-like passphrase (8 chars at least) that is then hashed with argon2(with the salt is SHA256 of that passphrase).
Then use it as AES256 key along with a random IV generated by CryptoJS.lib.WordArray.random(256 / 8);
Is it okay?
Or should I use the IV as a key?
|
Let's say I have two binary messages ($m_0$ and $m_1$) of length $n$ which are bitwise complements of each other such that $$m_0 \xleftarrow{r} \{0,1\}^n \text{ and } m_1 = \overline{m_0}$$
If I perform a one-time pad encryption of $m_0$ and $m_1$ with the same key, I would only leak that the messages are bitwise com... |
Lets say I know a secret value x.
The hash of x, y = H(x) is public.
Is there any zk way to prove to a verifier that I know x without revealing x and only revealing y?
|
Mike Hamburg proposed the Ed448-Goldilocks curve and submitted a software implementation for it to the SUPERCOP project.
Below you can see that MH picked a generator (or base point) that has a y-coordinate equal to 19.
Why was this generator chosen?
(I would guess that points with y=0..18 are somehow not suitable and t... |
Can I use Diffie-Hellman over, say, $GF(2^{128}) \bmod$ irreducible poly in $GF(2^{128})$ instead of $GF(p)$?
If not, why?
Or increase it to $GF(2^{2^{\text{whatever}}})$.
|
I came across 2 older answers (2 different but similar questions on the small cofactor attack) which cover this attack.
https://crypto.stackexchange.com/a/12614/3941
Here the attacker replaces the $bG$ Bob sends to Alice with $H$ where $H$ is a point of smaller order.
https://crypto.stackexchange.com/a/26844/3941
H... |
In the dieharder test suite there are things like:-
diehard_3dsphere| 3| 4000| 100|0.56011310| PASSED
and in the NIST IID (brief mode) and randomness test suites there are things like:-
** Passed IID permutation tests
and:-
1 2 1 1 0 2 2 0 0 1 0.739918 10/10 Universal
1 ... |
On KeePass help center it's stated that:
... if the header of the database (first few bytes) is corrupted, you're out of luck, too: the repair functionality won't be able to restore any entries (because the header contains information required to decrypt the database).
I wonder if header corruption (or maybe other ty... |
Let's say that Alice is the administrator of a group. For each message generated by a group member, Alice uses an administrator's private key ($sk$) to sign it, indicating that this message has been checked by her. One day, Bob takes over from Alice. Therefore, Alice sends Bob the $sk$ in a secure channel. But the secu... |
I have a need for the following encryption properties: $f(g(v_\text{plaintext}) = v_\text{ciphertext}$ needs to be decryptable by $f^{-1}(g^{-1}(v_\text{ciphertext}))$ and $f$ and $g$ need to be different.
The idea goes like this.
A user is going to encrypt some plaintext (DB credentials) with a private key they contr... |
As some password manager, such as KeyPassXC allows a user to create a master password using a HMAC response from a YubiKey concatenated with a password entered by user, I was wondering something.
Assuming that:
*The encryption key is created with PBKDF2 HMAC-SHA256 from the YubiKey HMAC result and a user-provided input... |
To valiate integrity
or
To verify if the software is digitally signed
The question seems wrong to me. I do not see any reason to publish(make public) a hash. But it is in the material I am studying.
|
Is it safe to use CTR encryption mode and authenticate it with HMAC(message, key), where key is the cipher encryption key, and the key is unique for each message? Would it be safer if I change the key a little? For example, flip a lower bit. Or I need to have independent secret for HMAC?
|
I think I understand snowball consensus algorithm with exception of 1 think.
Node polls 5-10 random nodes N times and choose color. Is it querying always same list of nodes? Or it is changed after some iteration? Or everytime it queries it chooses a new set of nodes?
|
Is it safe to truncate HMAC? What is the minimum length of a truncated HMAC so that HMAC is still considered to be safe to use? Are there any standards on when it comes to shortening HMAC?
In my case, the hash function is SHA-256. Would the answer also be applicable for any other hash function?
|
I'm reading the Signal specification and they suggest to use EC keys, in particular with X25519 or X448 curves, both for the initial X3DH agreement and the DH ratchet.
I've noticed that languages and libraries seems to have a better support for RSA (for example the two curves recommended by Signal are not available usi... |
We have a smart contract containing encrypted data that should remain encrypted till a specified timeLimit.
Then, the decryption key would be made public, for everyone to read that data.
We want to achieve this in a trustless manner, as anyone with knowledge of this data before the timeLimit can use it to exploit the s... |
Hi I struggling to find the answer of my schhol exam, can anyone help me .
In a Diffie-Hellman key exchange the multiplicative group of integers modulo
p is used with the parameters p = 59, g = 3 mod 59. The public keys A = 28 and
B = 36 are exchanged. One of the private keys is relatively small. Find this key
and comp... |
When implementing and testing my own EdDSA program I found out that the old RFC7748 gives wrong parameters for Ed448/Edwards448.
There is currently a new Draft were this is clarified:
https://datatracker.ietf.org/doc/draft-ietf-lwig-curve-representations/
(page 109)
IMPORTANT NOTE: the supposed base point of Ed448 spe... |
So, I'm taking Cryptography I by Dan Boneh on Coursera and I was reviewing the definition of security for a PRF while solving exercises, and I stumbled upon this question from a homework Dan Boneh gave for a winter class of 2020. Where it's cleared stated that F1 is not a secure PRF, but I can't get my head over it.
I... |
I have a problem where I have to find mod N in a RSA cipher.
I am given the following information:
The public key (e)
Plaintext (M)
Cipher text (C)
How can I reverse the equation C = (M^e) mod N to find N?
|
I have been learning about AES-GCM and AES in general lately and founding:
The key is the secret and both sender and receiver keep it hidden forever.
The IV and auth tag are public and sent along with the ciphertext which means they are public to the world.
So what can these give other people hints or information about... |
Is there any standard solution to the colluding problem in Shamir's secret sharing i.e. How should I prevent my k friends from colluding and recovering my secret?
|
I'm trying to solve a crypto RSA problem from my last exam in a clean way, but I'm stuck in the last step...
First of all, we are using an alphabet with 27 characters (i.e. spanish alphabet: A-Z + Ñ). We will code each char as A=0, B=1, ..., N=13, Ñ=14, O=15, ..., Y=25, Z=26.
We have d=7, n=33, e=3.
As 271 < 33 < 272 w... |
To quote Ilari on the CFRG mailing list:
e.g. the vile mess that is ECDSA with SHA-3
I have some ideas what he might mean but I couldn't find the discussion so what is that mess?
|
This is the attack I am talking about - Why are the lower 3 bits of curve25519/ed25519 secret keys cleared during creation?
An elliptic curve group of order $8p$ where $p$ is a prime.
Let $G$ be the generator of the subgroup of order $p$. For ECDH, Alice sends $aG$ to Bob & Bob sends back $h$ instead of $bG$ where $h$ ... |
Terms:
Client: Browser, mobile app or desktop application written using using JavaScript, HTML, CSS and packaged with Capacitor / Tauri.
Server: NodeJS based API.
Data: Username / password
Vendor: Third party integration
Background:
I am writing an integration with various vendors that requires users to enter their ven... |
I am trying to figure out if there is an authority like FIPS, NIST, NSA, or DOD that has recommendations or standards for implementing AES such as key derivation algorithms and iterations as well as CSPRNG for keys but I can't seem to find anything. Is there any authoritative documentation for "current" AES implementat... |
for example, I have an encryption program like this:
Input: a message, M; my public key Kpub
Step 1: randomly generate a symmetric (e.g., AES) key, K
Step 2: use K to encrypt M
Step 3: use Kpub to encrypt K
Step 4: destroy K
In step 4, how to destroy K? Can we just assign a random value (e.g., 0) to the variable? Is th... |
The Spritz cipher is a "sponge-like" construction that the authors show can be used as a hash, MAC, stream cipher, re-seedable pseudo random number generator, and/or an authenticated cipher.
Apart from some internal control variables, there is an array of size N (call it the state : I set N = 256 for this discussion).
... |
The Spritz stream cipher algorithm has been shown to have a special class of states that can be used to do a full state recovery attack better than brute force.
While the authors of the paper clearly show what states are special, the behaviour of the cipher when in one of these states, and how to exploit them, they do ... |
I'm sorry if I'm going horribly wrong - I am new to this stuff.
My question is：
KDFC1,KDFC2,KDFC3 is defined by myself.
Key1 is come from outside .
Is it possible to use the aes-ecb-256 decryption algorithm to generate an aes key?
If I'm going horribly wrong , Is there any relevant information that can be provided f... |
Before looking at the textbook ZKP for discrete log, I tried to construct one myself. This turned out quite different to the textbook one, and I've been wondering what might be wrong with it? (I was unable to refute any of the ZKP requirements, so I guess I'm missing something).
The original problem:
Given $g,h \in \m... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.