instruction stringlengths 32 27.2k |
|---|
If I have the password and hash will I be able to find out the Hashing algorithm and salt used. What tools can I can use? Will hashcat work?
|
I am working on a project that uses PAKE (SRP) for authentication. When we send the M1 to the server we are encrypting the payload using AES-GCM. I mention SRP only to set the context:
A message is being sent to the server with content we want to protect
The client and server have a unique (one-time) symmetric key sha... |
In the paper GM18, they say that the sampling algorithm, SampleG, is shown in Figure 2. It takes as input a modulus $q$, an integer variance $s$, a coset $u$ of $\Lambda^{\perp}(g^T )$, and outputs a sample statistically close to $D_{\Lambda^{\perp}_u(g^T),s}$. SampleG relies on subroutines Perturb and SampleD where Pe... |
So I get how it works for inputs shorter than $512$, but as for larger inputs "In the case where the remaining input data is exactly $448$ bits long, an entire extra block would need to be added for the padding." what do they mean by the 'remaining' input data is exactly $448$ bits long? if input was like, lets say $50... |
I'm reading the fourth edition of "Cryptography: Theory and Practice" by D.R. Stinson and M.B. Paterson.
In the book, they have mentioned the concept of "collision-resistant hash" and I've stumbled upon the following question from another source:
Is there a collision resistant hash function $h(x)=h_1(x)\oplus h_2(x)$ ... |
so i have function to decrypt aes ctr. but when i tried to decrypt, the result i got from plaintext is type bytes. i want to get the result of plaintext using decode, because when i encrypt it, i was encode it first.
here's my encrypt func:
def encrypt(key, pt):
plaintext = read_file(pt)
if isinstance(plaintext... |
In mpz_nextprime(), after some sieving with small primes, an MR test function is called, with the number of trials set to 25 (https://github.com/alisw/GMP/blob/master/mpz/nextprime.c#L118):
if (mpz_millerrabin (p, 25))
goto done;
But then in mpz_millerrabin(), for large enough candidates (candidates bigg... |
For my own project and the fun of it I have created an algorithm that turns plain text into cipher by interacting between entered text and a given password. My question is, in this instance, does the password count as what is known as a key, or is a key something entirely different?
|
A user of this forum answered in one of my questions and said that if the IV is kept secret in multiple encryption with CTR mode, the cost of breaking the scheme is $${2^{2 l_{key}}} 2 \cdot {2^{l_{iv}}}$$
Can the encryption operation in multiple-encryption with CTR mode be replaced by a non-cryptographic operation ass... |
I have a question about Cryptocurrency wallets like Metamask (soft) or Ledger (hard).
How is a 12 or 24 word seed phrase enough to show the same crypto addresses in any crypto wallet that supports the same standard (ie. BIP-39). Can someone unravel this for me / us?
Would it be this:
seed phrase with its 2048^(12 or ... |
AES-256 in XTS mode has 32x16 (512) bytes of blocksize but there are some other wide-block modes of operation such as WCFB which accepts any block size.
My question is:
What is the maximum acceptable block size for disk encryption? "Acceptable" is ways of not having too much cons.
|
I have some questions about the Kyber paper, especially about Theorem 2 on page 6, which I would like to ask here. First of all I quote the following theorem from the paper and ask my questions afterwards.
Theorem 2. For any adversary A, there exists an adversary B such that $Adv_{Kyber.CPA'}^{cpa}(A) \leq 2 \cdot Adv... |
I have this couple of deterministic functions $G_1$ and $G_2$. Suppose at least I of them is a PRG. Take $G^*=G_1(x)$ xor $G_2(x)$ with the same $x$. I have to show whether this is still a PRG. I thought about this counterexample: if $G_1=G_2$ then $G^*$ cannot be a PRG but my teacher said then $G^*$ isn't interesting.... |
I've been reading this set of notes on some topics in MPC and am having difficulty understanding the transformation the authors make in order to reduce the round complexity of the GMW protocol through applying garbled circuits. In particular, the goal is to make the round complexity of GMW independent of the depth of ... |
I am wondering how to use and expand keys during the Decryption.
Let’s say we have an initial key (128bits): 61 62 63 64 65 66 67 68 69 6A 6B 6C 6D 6E 6F 70
So we get: w[0] = (61 62 63 64), w[1]=( 65 66 67 68),w[2]=( 69 6A 6B 6C),w[3]( 6D 6E 6F 70)
Then with the g () function, we get:
Circular byte left shift of w[3... |
LFSR-12 with poly $x^7+x^2+1$ and LFSR-19 with poly $x^{11}+x^5+1$ are used to produce
8 bit of output each, output is then added together modulo FF
(LFSR-12+LFSR19)mod FF
I know first 8 bytes (-> 8 cycles of registers) of this sum. I am pretty sure there is better solution than just brute force - which is currently ... |
OK, so I know that this is somewhat really basic in "post-quantum discourse", but unfortunately I did not find any textbooks/entry level papers specific to the topic of reductions in the quantum setting.
It seems that there are two main caveats regarding quantum adversaries:
The possibility to ask a "superposition que... |
Given two functions f,g we have to construct h; such that h is one way function. Either f or g is a one way function. We don't know which one is a one way function. Both f and g are defined over X-> Y
|
I'm having a problem in a RSA challenge. I already had p, and q is calculated based on p.
(100000000**(p-1) -1)%p
q is the nearest prime to this number.
I knew that my comp will take a huge time too compute this (Don't know what time it would take). So can you guys suggest some ways to deal with this large number. Man... |
I wasn't sure if this question is more suited for SE.Math or not; please tell me if I should move it.
For its mpz_nextprime() function (find the next pseudoprime following the given number) GMP uses an interesting variation of the Sieve. In order to weed out multiples of small primes before applying slower tests (Mille... |
Suppose I want to take advantage of hardware accelerated symmetric encryption like AES and use it to compute a “hash”. How collision resistant would it be if I’d take the IV + last N blocks of an AES CBC transformation and use it as my hash. What would be good
Values for N?
In my hypothetical use case I am not immediat... |
In trying to implement mental poker, can all players agree on a standard set of 52 points on the curve corresponding to each card, and then to "encrypt" a card you just multiply it by a scalar which is your encryption key? (and to decrypt, multiply by the scalar's inverse modulo the group size)
|
I am currently trying to reverse engineer a piece of software that uses a seemingly-custom encryption algorithm.
After disassembling the decryption part of the code, I've come up with the following code that decrypts the data file just as well as the original software:
void decrypt_one_run(uint8_t* four_bytes_to_decryp... |
About Rabin Signature link
According to this paper, the person who wants to sign a message M first appends a random byte string U.
=> M_new = MU
Then uses a compression function to get c = Compression_function(MU)
Then solves the equation for x, x(x+b) mod n = c mod n.
Then the signature is (U,x) pair.
My question i... |
I had an idea to make XEX mode parallelizable at CPU level.
Let's suppose I take an IV, XOR with random data, encrypt, XOR again with another data, and XOR on the plaintext
Would this encipherment scheme be valid? Would it be secure?
|
I've found this question from 2014 on Key Whitening: How exactly does key whitening manage to increase security? where is said that AES applies key whitening internally by adding a sub-key prior to the first round and after the last round.
Isn't key whitening applied to each round in AES?
|
can someone explain to me why django saves the hash in the database asargon2$argon2id$v=19$m=102400,t=2,p=8$... and not $argon2id$v=19$m=102400,t=2,p=8$...?
|
The definition of Bilinear pairing is shown here
Could you given an simple numerical example of Bilinear pairing? It would be very helpful for me to understand
|
I want to encode my plaintexts as points on some given elliptic curve $E$ defined over a finite field $F_q$. Suppose I want to use Koblitz's method. Does the size of the message I want to encode matter? Can I encode the message in the size I want? What should I do with very long messages?
|
I am planning to encrypt multiple values using a 16 byte IV that I'm generating from the below scheme. My seed is a 32 byte value generated from hashing a password and salt is an 8 byte counter (i.e. salt is easy to predict for an outside observer).
iv = sha256(seed, salt)[0:16]
Intuitively this should be equivalent to... |
Does it work if we try to construct a device (e.g., for counting purpose in several remote branches of a company) using a self-containing digital signature key enclosed in a tamper-proof hardware to make sure that the operations transcript of that function could be verified? (the transmitted report/transcript of the co... |
The proof of Lemma A.1 of the paper "FHE over the Integers" (Page 21-22) states that the absolute value of the rightmost term of
$c=p\cdot (kq_0+\sum_{i\in S}{q_i})+(m+2r+k\cdot2r_0+\sum_{i\in S}{r_i})$
is at most $(4\tau +3)2^{\rho}<\tau 2^{\rho+3}$.
We have $|k|\leq\tau$ and $|r_i|\leq 2^{\rho}$.
In addition, it is m... |
Sorry if this is a duplicate but, to be honest, I don't even know how to search for an answer to it.
I'm working in an environment in which I cannot use streams to encrypt data (React Native using the react-native-aes-crypto module).
Unlike Java where I can use something like cipher.update(buffer) (where cipher is an j... |
I'm trying to practice and to understand possible scenarios and the basics of symmetric encryption schemes. For the scenarios I listed below, I am not 100% sure of scenarios 1 and 3.
A symmetric encryption algorithm using non-random/predictable IV that is CPA secure.
I do not think this scheme is possible. For examp... |
Let F be a pseudorandom function. Check if if $F_1(k,x) = F(k,x) \oplus x$ is pseudorandom( $\oplus$ is bitwise XOR).
I found this question in a book. I am not sure how to proceed :
$F_1(k,x) = F(k,x) \oplus x \implies F(k,x) \oplus F_1(k, x) = x$
Now do we assume that we know $F(k,x), F_1(k,x)$ ? Because if we do I fo... |
I want update in place for sorted element list and proof for accumulator encoding of only element updated. I try to find technique similar to this, but only GCTI pop up and similar methods.
It must get elements in order of sorted list, replace ith element ($e^i$) with update list element ($e'^i$) to make new accumulati... |
I have been studying C/C++ and I read that if one wants unpredictable random data in a program, it is needed that a random generation function be supplied with truly and unpredictable random data (as of /dev/hwrng).
But this confused me because for cryptographic things a normal and non-cryptographic PRNG should be avoi... |
I'm currently trying to implement compact proofs of retrievability that are publicly verifiable by RSA as described in this paper Compact Proofs of Retrievability in GO. I'm currently struggling on page 26 with the following equation:
$$
σ_i \leftarrow \left(H(\text{name}\mathbin\|i) \cdot \Pi_{j=1}^s u_j^{m_{ij}}\righ... |
How do you calculate the digraphic and trigraphic IOCs and the same expected IOCs? I'm aware of the formula for calculating the single letter IOC which is given at this formula but I can't find the formula for the higher orders.
Is it simply the sum of frequencies ( $F_i(F_i − 1)$ or $F_i \times F_i$ where $F_i$ is eac... |
Brzusk et al. introduced the state-separation proof technique to tame complexity in game-based security proofs. The framework allows for modular, easy to understand, and reusable proofs. It has been applied to real-world protocols, like in this paper on the security of the TLS 1.3 key schedule. Additionally, this forma... |
I only use one gpg key, which I use with pass, which currently holds a ton of password stuff. I also use that key to sign my github commits and a ton of other stuff. I leaked my key by posting my private key, thinking it was my public key on my github profile (it's been up for a couple of days now, and I just realized ... |
MPC protocols have a harder time handling division (truncation) than multiplication. The case I am considering is when the divisor is a public value. Dividing it may lead to a wrong result due to wrapping around the ring, or we need to pay more cost to get a faithful result. But if the divisor is public, parties can co... |
Traditionally, I think that implementing the CRS (common reference string) model in the real world is usually through a trusted third party or running a distributed protocol. Are there specific papers on this that I can refer to? Thanks a lot!
|
A pseudorandom correlation generator for bilinear correlation (namely, $x_0 \otimes x_1 = z_0 + z_1$, where party $\sigma$ gets $x_\sigma, z_\sigma$) over some field $F$ works roughly as follows (based on Figure 14 of https://eprint.iacr.org/2022/1035):
Gen:
Pick two random sparse vectors of weight $t$ $e_0, e_1 \gets... |
new member here.
I am taking a course in computer security, and we just got introduced in Cryptography and especially in RSA Algorithm. Although i got the 'basic idea' behind the RSA algorithm and the prime numbers needed for the keys, we have an assignment. Roughly the content of the exercise, is this : Suppose an RSA... |
The question is what is an appropriate public/private key length in order to encrypt a 256-bit or 512-bit AES key without wasting bytes, and whether long public/private keys provide meaningful increase in security simply from being longer.
I'm encrypting a 256-bit AES key using a public key from a 2048-bit private key.... |
I've been recently thinking about building a c++ poker game that would let players to play over sockets in a peer to peer network. However I do not know how security would be ensured. I was thinking that whenever a particular player has a turn, they alter the game state and then they broadcast this game state to the ne... |
If you were designing:
An open source client that offered E2E encryption for e.g. folder sharing between users
Each user had public keys for signing (and separate public keys for encryption of symmetric keys etc, but this is not what the question is about).
The service is extra cautious by default (wanting to be extra... |
As I know a very common hash code has 256 bits.
From a message, it outputs a hash code that's 256 bits. That hash code should be unique to that message. That message can be something like email.
But a message can be very long, far longer than 256 bits.
Theoretically there can be 2^256 different hash codes, and that's i... |
I am trying to understand the implication of the Borel-Cantelli Lemma to the random oracle model.
I think understanding a special case, say, a random oracle is one-way with probability 1, would be helpful. The statement (see, e.g., page 19 of Arkady Yerukhimovich's thesis) as far as I understand in words goes like "if ... |
I'm creating an application where I'm going to use Argon2, I'm going to have a password, and I'm going to use as salt: email+name+date of birth, you must think that my salt is silly because name and date of birth can change, which would change the result, well this is not the case with my application, I should and will... |
Following ciphersuites found to be weak in Qualys(https://www.ssllabs.com/ssltest/analyze.html) tool:
TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 (0xc027) ECDH x25519 (eq. 3072
bits RSA) TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 (0xc028) ECDH
x25519 (eq. 3072 bits RSA) TLS_DHE_RSA_WITH_AES_128_CBC_SHA256
(0x67) DH 4... |
I know that both algorithms are similar to the Diffie-Hellman key exchange and are used for exchanging secret keys in a group but I still cannot figure out the key differences between both algorithms.
Is the difference only in the number of rounds that are required to exchange the keys?
I would appreciate an in-depth e... |
As Bleichenbacher states, a wrong implementation of the parsing function of the padding could lead to a signature forgery attack when using a low exponent.
In the provided example he assumes the attacker has the freedom to put chosen bytes in the "garbage" section at the end of the message, in order to create a perfect... |
I will be using a tRNG to generate EC keypairs on a Secure Integrated Controller.
I need to demonstrate I, the issuer, can not know the private key without colluding with the user to obtain it, even if the tRNG is weak. I also don't want to reveal the private key to the user, only the public key.
I'm thinking a scheme ... |
I don't understand why I need a salt for Argon2 if Argon2 is only needed as a KDF for a password which is then called AES. At the end neither the password nor a password hash is stored. Only the data which was encrypted with the KDF key.
It is logical that when storing passwords in databases a salt is needed to prevent... |
I am trying to implement an electronic voting scheme which uses the exponential version of elgamal cryptosystem, voters encrypt their votes for each candidate and send them all to the ballot box. Now each ballot contains the encryption of either 0 or 1 for each candidate in a determined order, vote's validity gets chec... |
[Moderator note: this question now lives there]
So, I'm preparing a talk about the well known fact that humans are bad at the task of generating uniformly random sequences of numbers when asked to do so, which is a huge flaw for simple cryptographic systems.
I would like to spice the talk a bit by present some real cas... |
Xorshift family pseudo-random number generators have a variety of different internal state sizes.
Let's take one of this family called xorshift1024*.
My question is:
Having xorshift1024* a internal state of 1024-bits, can I generate a block shorter than 1024-bits without having to compute the entire 1024-bits output be... |
Want to get 32 bits from 0x8000 address as 8 bytes (perm box)
MEM_EXT:00008000 db 54h
MEM_EXT:00008001 db 53h, 57h, 20h
MEM_EXT:00008004 dd 322E3256h, 31332030h, 30303330h, 31313320h, 43432036h
MEM_EXT:00008004 dd 2F363535h, 20425345h, 865808FAh, 865808FAh... |
Is there a known example of a deterministic algorithm that given an n-bit input returns 2n-bit output, and where a random output can't be efficiently distinguished from a random 2n bit string?
|
I know that there are papers for both theoretic and practical zk snark computation. And most of them could support general computations. i.e: support multiplication and addition
But what I am curious about is that are there papers/constructions that optimize the exponentiation computation, not just having a^n compute... |
I am looking to get P-box and S-box from firmware
Decided to search the firmware for
Pbox - 8 nibbles from 0-7
i.e
pbox = [2, 0, 6, 5, 7, 4, 3, 1]
Found it :)
And for S-Box
16 bytes from 0-15 (based on my research on S-box)
i.e
sbox = [5, 11, 7, 12, 4, 8, 0, 3, 13, 9, 6, 1, 2, 14, 10, 15]
However cannot find it in fi... |
Background
Bob's goal: Receive data E = E(D) (encryption of D) from Alice that he knows for sure is encrypted and that he can't possibly decrypt (without brute force). This gives his data backup company peace of mind - no need to worry about what sorts of data he stores (copyright issues, etc.). When Bob sends E back t... |
I hope this question is not too basic. I'm currently trying to implement compact proofs of retrievability that are publicly verifiable by BLS scheme as described in this paper Compact Proofs of Retrievability in GO. I already implemented it with RSA and now I want to do the same with the BLS Scheme as described in sect... |
I am currently writing a seminar paper on Kyber and other lattice-based methods. I was so excited about the lattice-based methods that I also currently searched quantum algorithms to solve the methods.
In the process, I came across this paper: https://www.mdpi.com/1099-4300/24/10/1428/pdf, called "Using Variational Qua... |
What is the best progress (i.e. most bits) in crafting messages with a chosen hash image for modern hash functions?
Blockchain networks with proof of work are basically brute force machines for pre-image attack on keccak with a target image of 0x000.000.
So I was looking for some idea of what the "best hash" ever found... |
I asked OpenSSL to generate a dummy Ed25519 private key for me and got this output:
https://lapo.it/asn1js/#MC4CAQAwBQYDK2VwBCIEIJCO9eKZEUOmL9CGfecuKqvYU_hLTAFXwl0Ipd8xNXbP
It decodes to the following:
SEQUENCE (3 elem)
INTEGER 0
SEQUENCE (1 elem)
OBJECT IDENTIFIER 1.3.101.112 curveEd25519 (EdDSA 25519 signatur... |
When the last n bytes of the plaintext are themselves suitably random, but predictably repeat m times in the same message - how bad is that? I'm convinced it is detrimental, but I am uncertain how detrimental exactly.
Edit: assume a Padding Oracle to be available.
NB: I'm not asking about the same overall plaintext sen... |
When i list down the curves using openssl ecpram -list_curves where in which I didn't see any curve named FRP256v1.
Does openssl actually supports FRP256v1? If so can you please let me know the version in which the support for this curve exists?
The openssl version where in which I checked this is OpenSSL 1.1.1 11 Sep... |
I am currently developing the back end of a website for one my projects and needed to store passwords. I knew that I needed to store passwords with salt, and my initial approach was to just generate the salt and append it to the password. However, to check that I wasn't being stupid I looked it up and saw a multitude ... |
What is the best known attack on the stream cipher Trivium?
And is there is any good reason to not use it?
By googling the good key words, I've found this paper, but I'm not enough expert to judge the relevancy of this paper.
|
I've seen (on Wikipedia) in the more recent version of TLS, the Counter-mode was not used. But the Galois-Counter-mode was used?
What is the advantage to use the GCM instead of using the Counter-mode?
|
This is with reference to Eddie Woo's video on RSA. He uses the prime numbers '2' and '7' to make the product, n=14. He chooses the public key to be '5', the only possibility. However, many numbers meet the criteria to be the private key, where (5 * private key mod 14) = 1. To name a few, the numbers include 5,11,17. E... |
I wish to encrypt an image using Logistic map. A Logistic map can be specified with the Equation:
$$x_{n+1} = r\,x_n (1-x_n).$$
Now, according to the Kerckhoff principle, the entire system's security is dependent on the key. Perfect chaos can be achieved with a fixed control parameter ($r$) and initial condition ($x_0$... |
I wondered whether my understanding of entropy is correct, that a 256-bit counter that starts at 0 and counts to 2^256 - 1 by a +1 increment has a 256-bit entropy.
I am asking this because I felt it awkward that for RNGs, developers often only specify an entropy.
So is it correct that a non-repeating 256-bit counter ha... |
I want to accredit members so they can pseudonymously give feedback while still being provably part of a group, without a way to give extra accreditations.
Suppose a group of 100 members (I decide and make public who these members are) want to bit by bit create 100 accounts such that nobody knows which member created w... |
Several years ago, there was an unenforced constraint on verification in the cirmcomlib library : a tool for building projects using ZsNarks. The error allowed to forge cryptographic nullifiers/proofs without having a prior commitment.
Tornado Cash, using Groth16 was the most well‑known affected case : the protocol had... |
I have been asked to make a HMAC-SHA256 password digest from:
a password
some salt, and
an 80-bit secret key.
I've been advised that I should be using a key of 256 bits or more for HMAC-256.
The key I have is only 80 bits.
Is there any value in using sha256(key80bit) as the key for HMAC-SHA256, as it will not increas... |
I'm implementing impossible differential cryptanalysis on 3.5 round IDEA using the methods in "Miss in the middle attack on IDEA and Khufu" paper.
In the first step, I need to provide $2^{32}$ pairs that are identical in $X_2$ and $X_4$ and have all the possibilities in $X_1$ and $X_3$ to start the cryptanalysis.
So I'... |
Why are credit cards using 3DES instead of AES? As far I understood, even DES3 is less secure than AES. Why it is still used?
I searched already in the internet and forum to check out if it is meanwhile AES (and the information from my lecture may be just old) but I didn't find any clue for that.
|
When we consider a group generation algorithm $\mathcal{G}$ (taken from Katz and Lindell's Introduction to Modern Cryptography), that takes as input a security parameter $1^n$ and outputs $(\mathbb{Z}_n, n, g)$, where $\mathbb{Z}_n$ is an additive group, can we say that the DDH, CDH, and discrete logarithm assumptions ... |
The original description of the MD5 algorithm initializes the values of A, B, C, and D to the following:
word A: 01 23 45 67
word B: 89 ab cd ef
word C: fe dc ba 98
word D: 76 54 32 10
How were the values determined and does it matter how they were chosen?
|
I'm trying to formalize the following protocol in $\mathsf{ProVerif}$, where $m$, $p$ are messages, $j$, $k$, $h$ are private keys, and $\{m\}_k$ is the ciphertext obtained by encrypting $m$ with $k$. Furthermore, $f$ and $g$ are functions whose result does not reveal any information about any of the two arguments.
I a... |
I am curious what is an attack that the RSA Key Exchange algorithm is vulnerable to that Diffie Hellman Key Exchange is not vulnerable to? I know Diffie Hellman is prone to Man in the Middle attacks but when performing key exchange with RSA, is it also susceptible to some attacks that Diffie Hellman is not to?
|
I'm writing a school paper about Blowfish encryption, and couldn't seem to find out if the size of the subkey array for Blowfish changes based on the length of the key. I would assume that it doesn't effect the size of the subkey array but I'm relatively new to Blowfish encryption.
|
I've got a scheme where I XOR a secret key value with a public (but random) value, XOR together all the bits of the result, and publish that bit (0 or 1), which is the parity of the result of the XOR. My goal is for this published bit to be hard to predict, for a given public value, before it is published.
I'm certain ... |
I was reading the Wikipedia page for scrypt because I wanted to learn more about it and I came across their pseudocode for the algorithm. What confused me was the following line:
I don't understand why having (what I assume to be) an output length of 32 bytes would make it in any way associated with SHA-256. Yes, they... |
Can we devise an attack on AES or DES (ECB mode) if we know just the distribution for the plaintext? For example, it is a English plain text -- we know what that would look like and the relative frequencies of letters, bigrams, and trigrams?
Has anyone come across such type of attacks, it is a advanced version of known... |
The Wikipedia page for BLS digital signature describes a scheme with only two groups, $G$ and $G_T$, and a bilinear pairing $e: G \times G \rightarrow G_T$. To the best of my understanding, in such a scheme both public keys and signatures would belong to the same group $G$, signature verification being performed by com... |
TL;DR: My simple ChaCha-based sponge PRNG is getting "unusual" evaluation from PractRand test battery pretty reliably, sometimes even within the first GB; I'm trying understand why.
I was in need of a fast, non-cryptographic PRNG, preferably one without a bloated state, or one that would use a portion of its internal s... |
Are there any automated security protocol verification tools that model algebraic operations; specifically addition.
I am familiar with AVISPA and Verifpal, and they are both great and user-friendly tools, but they do not support addition operation.
Please help
|
Here is the fixed script
# Generator point coordinates
x=55066263022277343669578718895168534326250603453777594175500187360389116729240
y=32670510020758816978083085130507043184471273380659243275938904335757337482424
# Order
n=115792089237316195423570985008687907853269984665640564039457584007908834671663
# from the curve... |
IBM (now HCL) Domino has since way back a complete procedure to issue X509 client certificate as a login option to a webserver.
Back in 2010-ish it worked fine in both Firefox and Internet Explorer.
The handling has 4 steps
Acceptance of Root certificate, CA (usually self-signed from Domino)
Request client certificate... |
I know about the existential forgery attack on RSA where a forgery is possible given two valid message and signature pairs but I am wondering how can a forgery be done on RSA with just the knowledge of the public key (e and n) without the knowledge of another message/signature pair given that the signatures are not pad... |
I'm working on a project with two computation "phases". In the first phase, I would like to homomorphically compute operations on my ciphertexts with a plaintext modulus of 2. But for my second phase, I would like to use a different plaintext modulus say 12799.
Without decrypting and reencrypting my results between pha... |
I have been puzzled by the following for a long time. In the (very well know in the field) paper:
Improved Non-Interactive Zero Knowledge with Applications
to Post-Quantum Signatures
, the authors introduce the so-called cut and choose technique to produce zk proofs. In particular, they show how to prove that $y=f(x)$ ... |
Are their any attacks on AES (any mode) in which before the attack is mounted, the adversary is aware that the input distribution is non-uniform?
Most of the work assume that the plaintext is uniformly distributed.
This is with reference to the following paper-
https://eprint.iacr.org/2019/491.pdf
|
The problem I have is next:
There's the centralized DataBase app which has its own private key and sends its public key to its customers.
Each customer has its own private key and should be able to use the combination of his own key and DB app's public key to encrypt its own data.
The encrypted data will be visible/av... |
I have noticed that points on a NIST curve (secp256, secp384, etc.) or some other elliptic curves used in cryptography, when represented as 04 | x coordinate | y coordinate in hexadecimal, the coordinates appear to have a fixed length. Is this something that is proved somewhere ? As far as the math goes, I do not see a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.