instruction stringlengths 32 27.2k |
|---|
I am currently working through the exercises in A Graduate Course in Applied Cryptography by Dan Boneh. I am stuck on exercise 4.16 (page 188 in this PDF)
In the GGM tree construction for constructing a PRF from a PRG, the secret key is used at the root of the tree and the input is used to trace a path through the tree... |
I was looking through https://csrc.nist.gov/projects/post-quantum-cryptography/selected-algorithms-2022
How can one begin to mathematically verify if there are no backdoors to these selected post quantum algorithms?
|
When I searched Google, the top result said
On average, processing for ECC is about four times less CPU-intensive than for RSA.
Yeah, but under what condition? The page says "A 256-bit EC certificate (the minimum length supported) is roughly equivalent to a 3k RSA cert. " Then, does the above 1/4 consumption mean a ... |
Presuming (if we ought to?) that we classify instantiations of algorithms as primitives,
https://cwe.mitre.org/data/definitions/1240.html
Colloquially, one would say that AES (and sometimes AES-256) is the "cryptographic
primitive," because it is the algorithm that realizes the concept of symmetric
encryption (without... |
I am already using the 2 they suggest :
https://github.com/usnistgov/SP800-90B_EntropyAssessment https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90B.pdf
but, here is where I run into issues, I have a a file with 1,000,000 bits, what's the right format for the input? they don't state that, should it be... |
Is it possible to derive private key directly from public key alone using a powerful Quantum computer.
|
I am currently learning about lattice-based cryptography and, reading from A Decade of Lattice Cryptography by Peikert, specifically section 2.3, it emerges that
[...] if the parameter s is greater or equal than the smoothing parameter of a lattice, then the sum of independent discrete gaussians (over that lattice) is ... |
I don’t know how to find.
Like this picture shows.
|
I'm wondering if a binary elliptic curve (such as sect571r1 aka B-571) supports pairs of asymmetric operations (for example, either sign/verify or encrypt/decrypt) on a fixed bit or byte input size in a way that this operation becomes fully bijective on those bytes/bits (where the inverse operation requires the opposit... |
Say that I have a signing/verification key pair $(sk,vk)$ and I generate a signature $\sigma$ over a message $m$. Then, I want to prove to someone else of this fact, which can be done in two different manners:
I directly send $(\sigma,m)$.
I compute a non-interactive zero knowledge argument $\pi$ for the statement: "I... |
Pseudorandom correlation generators (PCG) exist for tensor products, this is described in Figure 1 of [1]. Basically we want party 1 to hold $(x_0, z_0)$ and party 2 to hold $(x_1, z_1)$ such that $x_0 \otimes x_1 = z_0 + z_1$. Let $n = |x_0| = |x_1|$ so the length of $z_0, z_1$ is $n^2$.
My understanding is that PCG s... |
I am trying to understand the AESGcm encryption and decryption and there's one field associated data in Encryption and Decryption methods.
https://learn.microsoft.com/en-us/dotnet/api/system.security.cryptography.aesgcm.decrypt?view=net-7.0#system-security-cryptography-aesgcm-decrypt(system-byte()-system-byte()-system-... |
In Section 2.1 and Section 2.2 of the paper Strongly Unforgeable Signatures Based on Computational Diffie-Hellman" by Dan Boneh et. al.", I noticed the paragraphs quoted as
"We define the advantage of an adversary A in attacking the signature scheme as the probability that A wins the above game, taken over the random b... |
Time locks enables us to encrypt data for a period of time, up to a certain deadline, such that even a computationally powerful adversary is not able to learn any substantial information about the data before the deadline. Time locks received a lot of attention ever since blockchain smart contracts have started using t... |
My background is that of a reasonably experienced programmer who hasn't learnt Comp Science formally. I am now learning Cryptography as a hobby in my spare time & I think I have learnt a reasonable amount of stuff through self-study.
I have learnt Elementary Number, Abstract Algebra & some amount of Algebraic Geometry ... |
I am implementing the Advanced Encryption Standard from scratch, but I came up with a question that I was unable to answer.
Why does no one implement AES with other sizes?
I've searched about that, and some people say it is only because it is not in the standard (which is understandable), but other's says that it was n... |
A question about Schnorr group.
Am I right that this is basically a protection against discrete-log solvers?
So Schnorr signature is better than ElGamal in that sense?
|
I'm writing a higher-order function in Haskell for use in public-key algorithms; it works equally well for RSA or elliptic curves. I'd like to test it for susceptibility to side channel attacks. How should I do this? The software runs on an ordinary Linux or BSD box; I'm not thinking of hardware implementations.
The fu... |
I want to generate a seed using CSPRNG. I then want to shuffle a standard pack of playing cards (52) using said seed, however, I want the shuffle to be accurate enough that it covers all the possible shuffle outcomes which is 52 factorial. I read from a blog post online that I need at least 226 bits of entropy to cover... |
There are 64-bit universal or almost universal hash functions, like CLHASH or VHASH:
https://arxiv.org/pdf/1503.03465.pdf
https://eprint.iacr.org/2007/338.pdf
Can we create secure 256-bit hash function by concatenation of this hash functions (by using different key for every function)? Similarly like authors of ECHO ha... |
We consider a language that is $\{0,1\}^n$. We consider three variables $A$, $B$ and $K$ part of that language. A and K are generated through true random generator.
We consider not two as is traditional but three Turing machines:
-The encrypter. This takes as input a key $K$ and a value $A$. This output $B$ in polynomi... |
while reading Introduction to modern cryptography by Katz and Lindell, I came across these two experiments:
For me, they look like it's the same thing. Can you please explain me the difference? Thanks :)
|
The setup is the following:
Alice has a secret x
Alice can generate proofs P1, P2, P3, ...
Bob (an outsider) should be able to prove that any two proofs come from the same x
without communicating with Alice
Does such a proving protocol exist?
This feels like a problem belonging to the realms of non-interactive zero-k... |
I have a C++ application on Intel x86 using openssl to make a connection to a server. What is the fastest cipher that openssl supports? My implementation is currently using ECDHE-ECDSA-AES128-GCM-SHA256.
I know of the openssl speed command but the supported ciphers don't easily map to the cipher names given to openssl ... |
I looked through NIST's official test vectors (CAVP) for the AES-GCM mode, and noticed that there are some test vectors in there with 8-bit or 1024-bit IVs. But as far as I understand, the GCM guideline specifically insists on using 96-bit IVs.
I took a glance at the SP 800-38D and found no clear guidelines on using th... |
I am learning/exploring the openssl library for encrypting and decrypting data
while encryption goes through fine I see standalone decryption not working as I expected.
The test vector I am using is
# Key 2b7e151628aed2a6abf7158809cf4f3c
# IV 000102030405060708090a0b0c0d0e0f
# Block #1
# Plaintext 6bc1bee22e409f96e93d7... |
We want to perform a known plaintext attack on the enigma M3, the goal is to reach the initial settings of the 3 rotors. I tried to bruteforce those values since I know the plaintext, ciphertext, positions of the rotors and the reflector setting, but I couldn't find the initial position of the 3 rotors.
Is there any me... |
I am trying to understand how the forgery attack works when using the CBC-MAC Algorithm
|
This is about the same random ladder algorithm as my previous question. It computes f(g,n,r)=n*g or g^n (depending on the group notation), where g is a generator of a group. Suppose n=5882353. This can be calculated as
((((((((((1*2*2+1)*2+1)*2*2*2+1)*2+1)*2+1)*2*2*2*2*2*2+1)*2+1)*2+1)*2+1)*2+1)*2*2*2*2+1
(((((((1*3*3+... |
I'm a beginner in the cryptography domain. Can anyone help me understand Additive Secret Sharing and Linear Secret Sharing? Are there any sources or references to understand their difference and how they work?
|
I am trying to understand how XOR operation can lead us to know the plaintext if we can predict the iv using the chosen plaintext attack game.
|
I want to store passwords in a database in a way I can reuse them to authenticate users (symmetrical encryption).
I read some good information here: https://cheatsheetseries.owasp.org/cheatsheets/Cryptographic_Storage_Cheat_Sheet.html#cryptographic-storage-cheat-sheet
After reading, here is what I (think I) need:
Symm... |
As per my understanding AES introduces diffusion in each block it encrypts even with ECB as mode of operation. If that is the case how the patterns are retained in each block?
In this blog https://words.filippo.io/the-ecb-penguin/ penguin outline, eye, body, legs are retained. I expected distorted parts of penguin.
|
Assume we have an $n$-dimensional real-valued function $f$ whose $\ell_1$ sensitivity is equal to $GS(f) = 1$. We can also assume the sensitivity of each dimension is also $\Delta f = 1$.
For pure differential privacy, we have the Laplace Mechanism, whose magnitude is parametrized by the privacy level $\epsilon > 0$ an... |
Something like:
$$ h = Hash(\texttt{"Some String"} \mathbin\| h)$$
|
I've looked at this crypto SE post but it doesn't address the how of my question.
I've been interested in cryptography for some time. I wrote a relatively basic cryptosystem in Python that uses base conversion as one of its layers of security (I don't actually use it for anything, don't worry). I've heard time and tim... |
I’m just seeking a better understanding as to the logic behind design of the A5/1 cipher’s keystream generator. Why are the registers degree chosen in such a fashion (19,22 and 23 bits long respectively)? I have heard because they are co-prime but have little understanding how this may influence the system.
The reason ... |
in learning with error encryption scheme (e.g. in Kyber scheme).
there are two vectors:
$u = r^t A + e_2$ and $v= r^t * pk + e_3 + \lfloor \frac{q}{2}\rceil m$
such that $pk = As +e_1$.
my question is does the encryption still secure if we omit $e_3$ so $v = r^t * pk + \lfloor \frac{q}{2}\rceil m $.
as far as I kn... |
Is there a way to determine the private key (or the phi value) without n factorisation if one knows the ciphertext and the public key and that each letter of the (English) alphabet has been encrypted individually?
|
The Fiat-Shamir transform typically works by substituting (public) coin tosses from the verifier by hashes of the prover's messages until this point, i.e.: $$H(x,\alpha_1) = \beta_1, \\ H(x,\alpha_1, \alpha_2) = \beta_2,\\H(x,\alpha_1, \alpha_2, \alpha_3) = \beta_3,\\\vdots$$ where $x$ is the public input of the protoc... |
4.25) Let F be a strong pseudorandom permutation, and define the following fixed-length encryption scheme: On input a message $m ∈ \{0,1\}^{n/2}$ and key $k ∈ \{0,1\}^n$, algorithm $Enc$ chooses a uniform $r ∈ \{0,1\}^{n/2}$ and computes $c:= F_k(m∥r)$. (See Exercise 3.18.) Prove that this scheme is CCA-secure, but is ... |
In Discovering faster matrix multiplication algorithms with reinforcement learning (Nature, 2022; lightweight intro), the authors used reinforcement learning (an artificial intelligence technique) to devise a new, slightly faster matrix multiplication algorithm.
Could a similar technique work towards a better multiple-... |
Encryption schemes typically are built on the idea that even if a man in the middle attacker knows exactly what kind of encryption you're using, they cannot decrypt your messages without the key.
There are a number of different mechanisms for two users to create or exchange keys without a man in the middle being able t... |
In a Sigma-protocol, the steps are (1) commitment, (2) challenge, and (3) response. In general, the prover has a statement and witness that they can use to compute the commitment step. But in some cases (like Schnorr or equality of two discrete logarithms) the prover doesn't use the statement or witness in the first st... |
Why physical random number source can be weak? I see two kinds of problems:
it is hard to control it and make it resistant to some unwanted bias, but also deliberate attacks,
it has normal distributuon, while we usually want to have uniform distribution (that's why we use randomness extractors or KDFs).
Can anyone el... |
I'm looking at scheme on Wikipedia:
https://en.wikipedia.org/wiki/Merkle–Damgård_construction
And it looks like function f takes two inputs. So do we have to use in this scheme OWF which can take two inputs or maybe we can somehow combine IV with message block, for example by xoring them? Then f can technically take on... |
I wonder if there is a more efficient polynomial multiplication than Karatsuba over the finite field $\operatorname{GF}(2^n)$. Brief research on this topic gave me a few results on fast multiplication on $\operatorname{GF}(2^n)$ using a polynomial over $\operatorname{GF}(2)$, however, it was hard to find a fast 'polyno... |
Assume I create a hash using SHA-256 and then take only the first 160 bits of the hash, as the result. is the result more cryptographically secured than SHA-1? Or are the two algorithms equally secure except for the hash size? (for example in terms of uneven distribution of the hashes and other means that determined th... |
I was asked recently if it is somehow possible to use already existing keypairs stored in HSMs for, e.g. ped-DKG.
Which ultimately led me to the question, which data is actually exchanged between parties when generating a shared key-pair? I was thinking surely there has to be some communication of the parties, e.g. agr... |
When performing homomorphically encrypted computations, when should I use BFV / BGV / CKKS?
It seems BFV / BGV is better suited for integers, and CKKS for floats. It also seems BFV-BGV have some portability. I want to calculate using integers.
How do I understand if I should use BFV or BGV?
I also don't understand why ... |
I recently implemented AES block cipher, encryption side only, to be used in QUIC parsing (QUIC uses GCM mode). There are other modes than GCM that use only encryption: for example CTR, OFB, and CFB.
When implementing the AES cipher encryption side, it occurred to me how everything is done there has to be reversible, s... |
This might be a silly question but I am unable to wrap my mind around it. In Diffie-Hellman can we find $a$ when $A = g^a\bmod p$, given we know $A$, $g$ and $p$?
|
For LWE decryption, Someone told me that If we can bound r⋅e by q/4 then we can retrieve M by checking if this is closer to 0 or q/2
However, how to use tail estimation to derive the relationship between upper limit bound of standard deviation (α) and q/4 ?
Note: There is also upper bound value of sqrt(M) for r, which ... |
In the Blum Blum Shub random number generator, we take two random prime numbers $p$ and $q$ such that both have a remainder of $3$ when divided by $4$. My question is why can't we just take any $2$ random primes? What is significance of having remainder $3$ when divided by $4$ from the perspective of mathematics and se... |
I need a fast linkable ring signatures library, something that is O(log(n)) and n is the ring size.
I read a few papers about these kinds of schemes but I didnt find any implementations of them.
Here are few of the papers I read:
https://reader.elsevier.com/reader/sd/pii/S0304397512009528?token=6FCBA7389B1AF78F2C3B52B7... |
In EdDSA with Ed25519 the algorithm of public key computing is following:
h = hash (privateKey)
h[0] &= 0xF8
h[31] &= 0x7F
h[31] |= 0x40
publicKey = h * B
The questions are
Why is Hashing in Ed25519 key generation needed?
Why are the actions on h bits are needed?
What does the clearing relate to the 31st bit?
|
Can we use a MAC to transform a CPA secure encryption scheme into CCA secure one?
|
The RSA modulus is the product of two $2048$-bit primes.
And the two Public Exponents are both $16$-bit.
I also got the difference between two Private Exponents $\left | d_1-d_2 \right |.$
Is there any way to factorize the Modulus $N$?
|
I have a help recommended high-school project that I'm stuck with. To basically explain the problem: I have an encryption function that is used as the decryption function and I need to reverse it to make an encryption function.
I tried many things but I can't find the proper result. The best I came with was to encrypt ... |
In aggregated BLS Signatures, there's a known attack which allows an adversary to forge a valid signature for a message $m$ knowing only the victims public keys.
Reading about the maths behind it, this justification is done:
After some juggling math around, everything is clear but the middle equality. What allows one ... |
I am not an expert in cryptography and therefore I would like to address this problem to people who have been working on this topic for a long time and thus verify the facts from several sources.
I use Winrar for file encryption because it is most suitable for me, it's fast and I'm already skillful with this program. I... |
In "The Skein Hash Function Family" paper authors wrote:
The MIX/permute structure has been designed to provide full diffusion in 9 rounds for Threefish-256, 10 rounds for Threefish-512, and 11 rounds for Threefish-1024.
How they know it? Is there some rule of designing such structures, which can quarantee some level... |
Let's suppose that we have two parties, $A$ and $B$ that are using a Shamir Secret Sharing scheme with $k=3$. $A$ holds the points $[x_1, f(x_1)]$ and $[x_2, f(x_2)]$ while $B$ holds $[x_3, f(x_3)]$ and $[x_4, f(x_4))]$.
$A$ sends the point $[x_1, f(x_1)]$ to $B$, and $B$ answers with the point $[x_3, f(x_3)]$, so that... |
Background: A cryptocurrency, such as Bitcoin, have a global order of all transactions that is guaranteed to be agreed by all participating nodes. With Bitcoin, this is ensured by making the longest chain win, and that creating a long chain requires performing a lot of computations (so it is not trivial to arbitrarily... |
From RFC 8446 section 4.6.3:
If the request_update field is set to "update_requested", then the
receiver MUST send a KeyUpdate of its own with request_update set to
"update_not_requested" prior to sending its next Application Data
record.
Say I have a client connection that sends things to the server, but ... |
I understand that the end result of a Pedersen Hash (like this one) is a point in an Elliptic Curve.
In the example implementation mentioned above, the input $M$ is split into chunks of 200 bits (the last one possibly being smaller). For each chunk, disconnected/random points in the Elliptic Curve are generated and the... |
I was reading some notes on a naive hash to a group function.
Consider a cryptographic Hash function $$H: \{0,1\}^{*}\to \{0,1\}^{k}$$
Consider a Discrete Log Hard Group $G$ with a generator $g$. We can build a Hash to group function $$HG(a) = g^{H(a)}$$
(We raise $g$ to the numerical representation of the Hash output)... |
I'm having a bit of difficulty understanding how to construct Zero-Knowledge proofs. So given a one-way function $f$ and a secret message $x$ so that $f(x)=y$, $f$ and $y$ being public, how could one construct a simple Zero-Knowledge Proof of Knowledge algorithm proving that one knows $x$?
I think I understand how this... |
Is a random number generated by a CSRNG equivalently secure as the SHA hash of that number? I know that RNGs generate numbers that look random, and aren't necessarily random. For example, in a range of [1, 2^256], number 100 might be picked randomly, but it isn't secure, so it needs to be changed.
However, the SHA256 h... |
I have bumped into this challenge from a well known CTF site. I don't want to make a reference to it because I don't want this to be a hint for anyone. And also to avoid giving out the source code of the challenge I will try to describe the code. The thing is that they provide a small script with a class that implement... |
I have written a mathematical paper in cryptography and I want to publish it but I don't know any professors in the field to collaborate with them. So what should I do and how to get contacts that could help me setting up with this work?
|
I am working out ICAO verification process (biometric IDs), and here is one of their publicly available certificates:
# openssl x509 -in 492F0116.crt -text -noout
Certificate:
Data:
Version: 3 (0x2)
Serial Number: 1227817238 (0x492f0116)
Signature Algorithm: ecdsa-with-SHA256
Issuer: C = GB, O = UKKPA, ... |
I am learning Keccak Hash Algorithm and I am a little bit confused about the Capacity bits parameter. I am trying to understand how we can set the capacity parameters while implementing Keccak in python3.
Example: trying to get a collision in Keccak using Capacity = 0 irrespective of hash size (let's say hash size at ... |
Let's suppose I have a 2MB photo and I want to generate a key from it, and the key should have 2048-bits of size.
A hash function such as SHA3-512 would not deliver a key with with the desired strength.
Is it possible to generate such a key with a hash function having the hash function a maximum digest output/internal ... |
From the literature, STC seems to be the current state-of-the-art for the coding part of steganography. From the description of the method, it appears to me it could be parallelized for GPU. Does developing of STC implementation for GPU even worth it? Are there any existing GPU implementations of STC.
The existing impl... |
I am implementing wet-paper codes (WPC) with randomly generated parity-check matrix $H$, based on this paper. As the wet DCT coefficients, I set DCT coefficients with value 0, or with values 0 and 1 (trying both).
For almost every cover image, the input vector at iteration contains too many wet pixels and the program f... |
I need a chat between two users and I obviously want to make it as secure as possible. I am, by no means, a cryptography expert, so I turn to you guys for some advice.
Because I like the idea of having E2E encryption, I did some reading about the Diffie–Hellman method and the Signal Protocol.
My issue is that this is a... |
I'm new to cryptography and signatures, I've done work that involves a signature model, and now I need to run tests on it.
In this paper [1], a signature model called Linkable Spontaneous Anonymous Group Signature is created.
The algorithm is described in the paper, it is capable of creating signatures for groups of pu... |
How would a proof of inclusion be done here as the number of nodes is odd and some hashes don't have a sibling hash?
Normally you would send the sibling for each level to the client.
Here there are none, is the proof of inclusion not possible here, or do you just send the parent, until you reach a node that has a sibli... |
Apple's Find My technology is described in this Wired article and explains how Apple, or other third parties, are not able to decrypt location data. It mentions how the keys are rotated every hour:
That public key frequently changes, "rotating" periodically to a new
number. Thanks to some mathematical magic, that new ... |
In §2.3.4 of Standards for Efficient Cryptography 1 (SEC 1), the authors define the following step in deserializing elliptic-curve points that were serialized in the format given in §2.3.3 (emphasis added):
2.4.3
If $q = 2^m$ and $x_P\neq 0$, compute the field element $\beta=x_P+a+b x_P^{-2}$ in $\mathbb{F}_{2^m}$, an... |
Is there any use for Fermat's Factorization Method in the world of cryptography? I see that several algorithms are based on it, such as the quadratic sieve and general number field sieve. I understand that Fermat's can be very fast if the factors are close to the square root. Generally RSA moduli have factors that are ... |
So I am a math major who is trying to learn some crypto. However I have some difficulties with some of the probability definitions that are assumed in the cryptography book that I am using at the moment. So here it goes:
Def(perfect security): Let $(E,D)$ be a Shannon cipher defined over $(K,M,C)$ where all these are f... |
I'm very new to cryptography and this may sound so foolish. Often I read quantum computers will brute force keys. Let's assume this is true (does it depend on key length? or on an algorithm? I don't know, let's say they will).
If I have a file encrypted with ChaCha20-Poly1305, or perhaps a LUKS encrypted partition with... |
I've been itching my head over this for a while despite going through the queries related to the topic. Can someone explain me negligible and non-negligible function in a concise way?
As of my naive understanding (correct me if I've the wrong take);
A non-negligible function is one which approaches zero relatively slow... |
I want to estimate when and wether different types of functions provide full or partial diffusion.
I'm trying to understand diffusion of basic operations, like:
addtion,
multiplication,
xoring.
If we change one bit in $a$ how many bits will be changed in average in result $c$ if we do:
$a+b \mod n = c$
If we change o... |
In MITM attacks against the NTRU cryptosystem, we exploit the fact that in the ring of truncated polynomials of degree $n-1$ it holds that $$fg=h\mod q$$ for our secret and public keys $f,h$. The basic idea is splitting $f$ into $f_1,f_2$ such that $f_1+f_2=f$ and therefore considering $$f_1h=g-f_2h. $$This is almost ... |
In the half-gate construction of garbled circuits, is it possible to garble multiple instances of a circuit while re-using certain input labels?
Suppose Alice and Bob would like to compute a function using garbled circuits. Alice will act as the generator and Bob the evaluator.
As usual, Alice generates the input label... |
a zero-knowledge proof is a method by which a prover proves to a verifier that a given statement is true while the prover avoids conveying any additional information apart from the fact that the statement is indeed true
Is there a definition of proof in which the prover conveys no more than X information (where X can b... |
A user of this forum said that the whole entropy of a seed goes to the hashed result if using a counter and also that is suitable for key generation even if the internal state or digest size of the hash function is smaller of that of seed.
Let's suppose I have a seed with an entropy of 512-bits and hash it with a count... |
I have a question in the context of two-party computation and the proof of the security of an MPC. I have looked at some of the beginning parts of this, this chapter 7, and
this But I couldn't achieve my answer.
I want to understand the difference of a malicious adversary with an honest-but-curious one, and to get what... |
I am learning about the concept of two security notions called IND-, which include IND-CPA, IND-CCA1 and IND-CCA2. While I got some grasp understanding about the scenarios between the challenger & attacker for each of these models. I am still not able to comprehend what properties of a security model are required to "u... |
As far as I know Additive Secret Sharing uses a finite field to generate its shares.
The gist of the scheme is that the shares $A_{shares}$ = {$A_1, A_2, ..., A_n$} of a value $A$ on a finite field $N$ can be attained by:
$A\ mod\ N = \sum_{A_i \in A_{shares}} (A_i\ mod\ N)$
If all shares in $A_{shares}$ are positive ... |
It was a challenge from CTF (ended), but I didn't solve it.
p, q = keygen(512)
n = p * q
flag = bytes_to_long(flag)
enc = pow(n + 1, flag, n**3)
So we have module and encrypted flag. We don't know module's factors (p,q). I have tried some ways, search another writeups and read many topics, but I didn't find any inform... |
I know that the Chaotic Logistic map is $x_{n+1}=Rx_n(1−x_n)$. I read some articles about the Chaotic Logistic Map, but some things are not clear. Someone wrote in his article the following: The initial condition $x_0$ for the logistic map is extracted from the string of $256$ bits ($32$ characters) taken in ASCII form... |
In this post the top answer says that for $\mathbb Z_p^*$, $k$, the order of an element $g$, divides p-1. Then it was concluded that this entails we can check if $g$ is a generator by checking if $g^k\bmod p\ne1$, with $k=(p-1)/q$ for $q$ each of the distinct prime factors of $p-1$.
Why does the first claim being true ... |
A user of this forum told about ideal and practical hash functions.
What is the difference between them?
Can someone provide examples of ideal and practical hash functions?
|
I have two servers. A production server with a signed (trusted ca) cert and a test server with a self-signed cert.
How big is the difference between the two handshakes?
Because when benchmarking the two servers the self-signed handles ~90 req/sec where the trusted ca cert ~17 req/sec
The server with the self-signed cer... |
I want to ask 2 questions:
Is GCC's stack canary cryptographically secured?
Does stack canary in general has to be cryptographically secured?
|
According to the following, ecdsa-256 only provides ~128 bit security even for 256 bit private key:
A multi-target attack on 128-bit ECDSA private keys
If the private key has only 128 bit entropy but constant-padded to 256 bit, then the corresponding 256 bit public key is distributed.
Would it provide the same 128 bits... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.