instruction stringlengths 32 27.2k |
|---|
I would like to get a feeling on how the noise develops in different FHE schemes. So I ran some experiments using HElib for both BGV and CKKS. I wanted to look at the noise of a fresh public key and a fresh secret key ciphertext in both schemes. Curiously, in both schemes the noise I obtained was the same for public ke... |
I need to test my server with curl 8.2.1 utility.
My server works only with TLS1.3 and cipher 0x1302 - TLS_AES_256_GCM_SHA384.
When I run curl it proposes many TLS ciphersuites that are not supported by my server (and TLS1.3) - for example (suites list of TLS-handshaking): 0xC028, 0xC027, 0xC014, 0xC013, etc.
I run cu... |
The most known example cipher reaching perfect secrecy is One-time Pad, which employs modulus addition for encryption and decryption.
Is there any other well-known cipher no less practical than OTP that reachs perfect secrecy?
Note: Practical application is necessary. For extempore constructions, See answers here
What... |
I have a function that generates a random 16 character length (upper + lower case letters plus numbers) seed password:
const crypto = require('crypto');
function generateRandomString() {
const charset = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
const length = 16;
const randomBytes = cryp... |
1. G known - how to decrypt
Referring to this question: Basic attacks on McEliece; finding S and P (nobody answered)
Take a McEliece cryptosystem with public generator matrix $G′=SGP$ where $G$ is a generator matrix of a secret code with known fast decoding (not necessarily a Goppa code over $\mathbb F_2$), $S$ is rand... |
I'm writing a simple small IP hash table on an FPGA for an ARP cache. On the FPGA I need to ensure I can very efficiently calculate the hash due the critical path of the circuit.
I have a 32-bit input that I need to reduce to between 2- and 12-bit hash (Compile time configurable). I'm leaning on simply Xoring the bits ... |
So I developed this algorithm as RNG, although it looks random to me, I wanted to know the opinion of more experienced persons in the topic.
from time import time_ns
from math import sqrt
class Random:
incr = 0
seed = 0
defloat = lambda x: x*(10^(len(str(x))-(str(x).find(".")+1)))
def __init__(self,seed... |
If $g(x)$ if length preserving one way function, is there a scenario where $h(x) := g(x)_{1\ldots |x|−1}$ . I.e., $h$ returns all bits that g returns, except for the last bit., is not a one way function.
I think it has to be one way because the probability of inverse just doubles at most. If the probability of inverse... |
I am working on improving my grasp on applied cryptography. Following question is just for learning/understanding purposes..
Lets say I want to generate a 16 byte key that I want to use for some symmetric encryption (leaving aside the specific algorithm, IV etc.) which of the following two is better and for what reason... |
First of all a couple of things:
I am aware that cascade encryption tries to solve a problem that isn't present often. Attacks are more likely to be mounted against implementation details instead of creating a pure cryptoanalytic break on modern crypto.
I am also aware that cascade encryption has at least the security ... |
This paper suggests the following approach to oblivious transfer (OT), using asymmetric encryption:
Receiver generates keypair $(pk_b, sk)$, selects random $t$, and set $pk_{1 - b} = pk_b \oplus \mathsf{H}(t)$;
Receiver gives sender $pk_0, t$, and sender challenges receiver to confirm it knows how to decrypt one of $p... |
I don't understand whether they are different or not. Would you mind explaining them all?
MK-AC, MK-SMI, MK-SMC
MDK Encryption Key, MDK MAC, MDK AC
IMK-AC, IMK-SMI, IMK-SMC
For example, in the generation of ICC Master Key(=Unique Derived Key), EMV Book 2 on page 129, Option A uses IMK while in Eftlab to generate the ... |
Is there a better way than brute forcing (choose $k=\mathrm{rank}(A)$ first columns - test the determinant, if determinant = 0 choose new column set - there are $\binom nk$ many possibilities which is inefficient if the full rank sub matrices are rare!)
|
In the normal McEliece proposal, the public key
G' = SGP is used, with S beeing non-singular, G Generator Matrix and P permutation Matrix
In the White Paper on McEliece with Binary Goppa Codes by Michiel Marcus and the lecture of Tanja Lange it says that you do not need P because you can just permute the support L and ... |
I am quite new to knapsack cryptosystems (specifically the merkle-hellman cryptosystem) and don't quite understand what exactly is the density $d(a) = \frac{n}{\log_2max_i a_i}$ defined here among other things. The denominator of the formula of $d(a)$ is the largest element of the weights (i.e. the public key)? What ex... |
slope (s) = 75359724952757581356787150982223137069297282952438962440225639443485944634025
Qx = 112711660439710606056748659173929673102114977341539408544630613555209775888121
Qy = 25583027980570883691656905877401976406448868254816295069919888960541586679410
Derived x and y-coordinate from performing point doubling usin... |
Ok, let me preface this by clarifying that I am not a cryptographer by trade, but I've been using cryptographic suites in the context of signing w3c Verifiable Credentials, and I am not sure if this is the right place to ask this question.
In the European framework, eIDAS requires Qualified eSeals for legal entities.
W... |
I'm building an app that will primarily be iOS or Android based. My plan is for every user to have their own key pair. The public key will be stored on the server along with a 128 bit UUID which is used to identify each user. The private key will obviously stay on the device.
When a message is sent to other people the ... |
I'm writing a tool for manually collecting entropy from sources like coins and dice, and I'm wondering how to best deal with the case where the desired number of bits of entropy is not representable with a whole number of inputs. For example, when collecting 256 bits of entropy with a D6; log6(2^256) = 99.034318652.
Th... |
Suppose a prover computes a non-interactive proof which is composed of $k$ parallel repetitions of a sigma protocol with binary challenges (and knowledge error $\frac{1}{2}$), composed in parallel and transformed into a non-interactive proof by Fiat-Shamir.
The verifier samples a random subset of $m$-out-of-$k$ of the ... |
I am trying to understand theory behind noise budget operation implemented in seal
Let the ciphertext be defined as
$$
c0=A \in Rq \\c1= As+v+delta*m \in Rq
$$
They first calculate noise polynomial
$$
c1-c0s = delta*m + v \pmod Q
$$
After that they perform multiply by plaintext mod t
$$
(Q*m + t v )= tv\pmo... |
PORS (PRNG to ORS) is a secure variant of the HORS few-time signature scheme. In PORS, instead of using a hash function, it uses a message (and salt) as a seed of PRNG and query it until obtains k distinct indices.
As stated in 6.2 Security of PORS
How does a non-adaptive adversary performing a brute-force attack again... |
I'm trying to understand benefits of using Twisted Edwards curve over regular Edwards curve. I'm aware of some properties of Twisted Edwards curve that regular Edwards curve missing like isomorphism and fact that every twisted Edwards curve is birationally equivalent to an elliptic curve in Montgomery form. But I can't... |
I want to know the state of the art result for proving knowledge of graph isomorphism. As described here, the classical Goldreich-Micali-Wigderson (GMW) protocol is a $\Sigma$-protocol with soundness error $\frac{1}{2}$, so it requires repetition. They then showed a $5$-round protocol for GI, essentially forcing the ve... |
I see in many discussion on differential cryptanalysis of SBOX (and others boolean functions, see SIMON-like round functions, SPECK-like round function) the idea of reasoning in terms of weights associated with differentials. Weight is defined as minus the logarithm of the probability of a transition. Some seem to impl... |
A (interactive) proof system for a language $\mathcal{L}$ is defined by two algorithms $\mathcal{P}$, a prover, and $\mathcal{V}$, an efficient verifier, with the following requirements:
Completeness: For $x\in \mathcal{L}$, $\Pr[\mathcal{V}(x, \mathcal{P(x)}) = 1] \geq c$, for some fix constant $c \in (0,1]$.
Soundn... |
How many distinct sequences can a $128$-bit Fibonacci LFSR (considering $4$ taps set for the maximum period) generate? Will all $2^{128} - 1$ distinct seeds produce distinct sequences?
Also, let's say I discard the first $128$ bits and only consider the bits that occur after the MSB of the seed has come out of the outp... |
Can the KangarooTwelve Keccak-p[1600,12] be used to create a CSPRNG in which there is random access to an element (or a small group of outputs) of the generated list (instead of sequential generation)?
Perhaps the k-th group of L outputs can be generated as:
K12(inputMessage=seed || k, customizationString="",outputByt... |
We want to implement an encryption / decryption module that we want to provide to different internal components of our system (internal library for internal components).
The component will provide (authenticated) Encryption & Decryption based on state-of-the art algorithms (AES-GCM-256).
Furthermore we have a Password ... |
I try to understand the POODLE attack. I read that the attacker try to change one byte of the last block of the ciphertext. Becasue the last block is only have padding and the last byte is the padding length the attacker need that only the last byte remain the same. I understand how the attacker know if it stay the sam... |
Why is the Initial Permutation Step necessary in DES? How does it strengthen the cipher since we are reversing the permutation in the output?
|
I am trying to implement a TRNG on Windows and among other entropy sources, I want to extract raw bytes from various kinds of CPU and process info.
As per my knowledge, BCryptGenRandom is a CRNG in the Windows API that uses this kind of noise to generate entropy. Do files like /dev/random exist on Windows and if so how... |
May I ask that in section 2.7 challenge space in the paper Lattice-Based Zero-Knowledge Proofs and Applications:
Shorter, Simpler, and More General
What is rot(c), why does rot(c) $\in Z^{d*d}$, and why |rot(u)|2 <= |u|2 ?
And may I also ask that what is $S_{k}^{\delta}$
Also, I am new to lattice crypto, I would trul... |
I'm currently studying the possibility of a novel ransomware technique, where an adversary instead of forcing the victim to pay a ransom, forces them to brute force a key of given length and thus spend a lot of computational power.
However before beginning the victim would need some assurance that recovery is actually ... |
According to my understanding a public key is made up of x and y coordinate and a compress public key is made up of the y-coordinate since it's possible to directly calculate the uncompress public key using the compress public key.
Using the below secp256k1 elliptic curve coordinate what formula can I use to derive the... |
I'm trying to figure out why Mersenne Twister use exactly Mersenne prime numbers but not regular primes. What makes Mersenne prime numbers more appropriate for this role than regular primes?
|
Background information:
I need to encrypt 168bit messages, the ciphertext should, preferably, match the plaintext size. Message Authentication and Integrity is not a must, but a really important should. My first idea was using AES-GCM-SIV, but performance is a thing. the software will run on a mini PC (Older RaspberryP... |
I'm researching cryptographic libraries for a project I'm working on, and I'm particularly interested in the BearSSL Library due to its lightweight nature. But I'm not sure if it supports ECC (Elliptic Curve Cryptography) encryption/decryption functionality.
Can someone provide information on whether the BearSSL Librar... |
Sorry, this is sort of a beginner question.
But providing that it is possible to find the same options, can I verify a message with Openssl if it was sign with .Net System.Security.Cryptography ?
Let's say I need to do this for sha1, are the underlying algorithms similar enough to be able to verify the signature of ano... |
Suppose we have two sets of ElGamal cipher texts encrypted with the same public key $y$ in a prime order group:
$C_i = (g^{r_i}, a_i y^{r_i}) $ for $ i \in \{1 ... n\}$
and
$D_j = (g^{s_j}, b_j y^{s_i}) $ for $ j \in \{1 ... m\}$
Bob own the private key $x$ to $y$ such that $g^x = y$
Alice wants to know if there is any... |
Here is a CTF chanllege about RSA(The competition has ended for serval hours),and here is the critical encryption code:
.........
def encrypt(msg):
p, q, r, t = getPrime(256), getPrime(256), getPrime(256), getPrime(256)
n = p ** 2 * q * r * t
phi = (p - 1) * (q - 1) * (r - 1) * (t - 1)
privkey = inverse... |
Various papers in the literature (such as https://eprint.iacr.org/2022/322.pdf, https://eprint.iacr.org/2013/850.pdf) use the sign, exponent, and significand values to additively secret share the original floating point secrets and later perform arithmetic operations on the shares of sign, exponent, and significand val... |
Quote from https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Operation
A basic principle behind RSA is the observation that it is practical
to find three very large positive integers $e$, $d$, and $n$, such
that with modular exponentiation for all integers $m$ (with $0 ≤ m < n$)
$$ (m^e)^d \equiv m \pmod{n} $$
and that... |
$\left(\epsilon,\delta,\gamma\right)$-Random Differential Privacy as defined in rubenstein17:
$$\begin{align*}Pr\left[\forall S \subset \mathbb{R}, Pr\left(A(D) \in S\right) \leq e^{\epsilon} \cdot Pr\left(A(D') \in S\right) + \delta\right] &\geq Pr\left[|f(D) - f(D')| \leq \Delta\right] \\ &\geq 1 - \gamma\end{align*}... |
Setting all 48 ChaCha state bytes (key, nonce, initial counter) from one result of strong hash function like sha3-384 or blake2b - correct usage? or bad practice?
PS: using original chacha20 (8bytes nonce/8bytes counter) for encrypting one long file or one-way tcp stream, not multiple small files/messages.
|
I am currently working on a cryptography challenge. The program uses AES-GCM to encrypt and decrypt strings.
Let's say I have the following:
IV which is reused
only 1 cipher text
authentication tag
AAD data
Is it possible to uncover the plaintext even if I don't have the key? I've read somewhere that IV reuse is bad ... |
Suppose I have the following secret, calculated by concatenating and hashing the results of two random strings:
secret = H( H( random_string1 ) || H( random_string2 ) )
Let's assume that the adversary knows one of these strings but not the other. In this case, can the adversary recover the secret in a practical manner?... |
Assuming there is a web service that returns the following to an unauthenticated user:
SHA-1(known_prefix + user_input + backend_secret)
where + is string concatenation, known_prefix is known to the attacker, user_input can be specified almost arbitrarily (maybe only printable ascii characters, but arbitrary length), ... |
A Boolean cardinality constraint
$$\sum_{j=0}^{n-1}x_j=k,$$
where $x_j$’s are Boolean
variables, and $k$ is a non-negative integer.
How to express the Boolean cardinality constraint to CNF formulas?
|
Suppose I encrypt a file, of, say, 10 MB, with a secure, suitable passphrase, and the command:
gpg --symmetric my_file.txt
What level of expertise and hardware would be required, in broad terms, to break the encryption?
|
I'm diving into SHAKE256's XOF (Extendable Output Function), and I've got a bit of a head-scratcher.
I'm wondering if there's any difference between incrementally absorbing bytes and absorbing everything in one go when it comes to generating the digest. I've scoured the web but couldn't find an answer.
Scenario 1 Incre... |
In this question on sha1(known_prefix + user_input + backend_secret), an answer states that is realistically possible to find the first few bytes of backend_secret quicker than brute force.
Changing only user_input, how can I find some information about the constant value of backend_secret?
I give the known prefix of ... |
This assumption appeared in the 2000 'timed commitment' to justify privacy in the scheme. But it is not known what the relevant symbols mean in this hypothesis.
|
I have $C_1 \oplus C_2$ where $C_1$ = $AES128_k(P_1)$ and $C_2$ = $AES128_k(P_2)$.
I know the k, it is 0 (i.e. 16 bytes of zeros).
I know the piece of $P_1$ (7 bytes).
How to restore the plaintexts ($P_1$, $P_2$), knowing all this?
|
Hi im doing a problem from the Chapter Lightweight Introduction to Lattices in "Learning and Experiencing Cryptography with CrypTool and SageMath"
I'm curious if my implementation is wrong since I'm trying to measure a solution as a whole number as opposed to fraction. I've tried searching for common leetspeak words li... |
I have trouble finding information on the security strength of HMAC-SHA256 against key recovery attacks with respect to the key size.
To fit a certain application I must use a 128-bits key with a HMAC-SHA256 function. All the documentation I read about HMAC-SHA256 advise or impose a 256-bits key, but the reason given f... |
Use a block cipher in CBC mode with a public or all-0 key. Twice.
Wrapping the last block into (xor) the first on the second round.
Every block will depend on all previous and all successive blocks. Any corruption in any block will corrupt all the rest.
Will this result in an All-Or-Nothing Transform (AONT)?
|
I've been sometimes getting this error while interacting with zksync "invalid value.blockHash" and have been unable to find information about it elsewhere. What's curious to me is that it only happens sometimes, not all the time and it also happens with different smart contracts interactin in zksync that belong to diff... |
In TLS 1.3, and since the server signs the entire handshake messages including the server hello message, in this case, is the SNI extension of the client hello message, is it included in the content for which the signature is generated. I know that the cipher suites exchanged are signed, but not sure about the SNI.
|
In PHOTON-Beetle Authenticated Encryption algorithm, the state consists of 64 4-bit
elements, which is represented as a (8 × 8) matrix. The Initial Value which consists of Key and Nonce from the specification is $IV \gets N||K$. Can anyone guide me how this 256-bit $IV$ sits on the state matrix?
For example Key is $0x0... |
I implemented AES128-CBC algorithm and what I need is to be able to compare encrypted text without decrypting. Is the only way to use static or no iv to achieve this? . Any ideas?
Use in code -Something like :
select x from ins left join Users ui on ui.UserIDNumber=id
or Select * from users where userIdNumber = @userI... |
Short version:
Given a hash of a plaintext, a public key, and a ciphertext (but not knowing the original plaintext), is there any way to verify that the ciphertext is the plaintext after being encrypted with the public key?
Long version:
I'd like to develop a broker that can pass to a recipient a message of which it kn... |
Can we use array as the input of a transition/function? Just like:\
transition testarr(arr: [u32; 3]) {
}
I saw some tutorials that have examples of this but now the Aleo seems not to support this grammar.
|
Suppose I have a masked AES encryption $AES(\oplus_i K_i, \oplus_i P_i)=\oplus_i C_i$, i.e. the key, plaintext, and resulting ciphertext are tuples $K_i$, $P_i$, and $C_i$ that sum to $K$, $P$, and $C$ respectively, and the encryption acts independently on the randomized input shares to the extent possible to produce t... |
I'm new to cryptography, and I'm working on exercises that involve "breaking" PRF schemes which involves writing a poly-time program that distinguishes between two particular programs, the ideal random world and the fake random world. Basically, I need to write a poly-time program that "wins" a distinguishing game by d... |
Background: there is a theory going around that claims that P256 was backdoored by the NSA. The theory goes is that the NSA found a weakness that applies to a nontrivial fraction of elliptic curves (perhaps one in a thousand, perhaps one in a trillion). So, what the NSA supposedly did is use a published procedure to ... |
I've been thinking about ways to improve the security of my data stored and backed up using the "3-2-1" method.
Moreover by using several layers of encryption to encrypt and decrypt a filesystem structure steps by steps.
Consider the following :
/root
|____folder1
|____folder2
|____subfolder1
|____subfolder2
... |
Gaussian distribution on lattices generally seems esoteric (at least for me, for now). My question is:
Does Gaussian distribution on a lattice mean to add a Gaussian noise on a single point of a lattice (or its span) or adding Gaussian noise on all points of a lattice?
When we are reading a paper,
in some part of the ... |
Bob has constructed a non-linear function $f: \mathbb{R}^n\rightarrow \mathbb{R}^m$ of moderate complexity (i.e., evaluation takes on the order of seconds on a modern computer). Is it possible to share a function $g: \mathbb{R}^n\rightarrow \mathbb{R}^m$ of the same asymptotic complexity with Alice, such that:
(1) $g$ ... |
I want to sign and transmit a short message, which contains a few simple hashes. My objective is not to prevent an attacker from inserting a fake message, but to ensure that the attacker cannot define or craft the specific contents of such a fake message.
The conventional method involves creating a signature by first h... |
I'm implementing encryption in my browser extension that will allow users to encrypt their data and then share them with others. And since shared links can be leaked, I want to protect the data as much as possible against brute force attacks.
I'm using PBKDF2 to derive 256 bits:
self.crypto.subtle.deriveBits({name, sal... |
In TLS 1.2, when client authentication is carried out, digital signatures are utilized. However, at what point is the specific signature algorithm communicated to the server? It seems to me that the server cannot perform verification without receiving a unique algorithm from the client.
From what I understand, what is ... |
In the Wikipedia page on differential privacy, the section on $\varepsilon$-differential privacy for the Laplace mechanism says that the Laplace mechanism is specified for some output as $\mathcal{T}_{\mathcal{A}}(x)=f(x)+ Y$, where $Y = (Y_1, \ldots, Y_n)$ and the $Y_i \sim \mathrm{Lap}(\lambda)$. Here's my question: ... |
I've implemented a CTR_DRBG random number generator according to NIST SP 800-90A Rev. 1 and I am now testing it with test vectors provided in NIST CAVS 14.3 (drbgvectors_no_reseed\CTR_DRBG.txt).
Starting from the very first example of [AES-128 no df]:
[AES-128 no df]
[PredictionResistance = False]
[EntropyInputLen = 25... |
I want to implement authentication for an API and thought about using Shamir Secret Sharing to do so.
My plan is to generate 1 Master Key which is stored in the Database, we then generate about 1000 Subkeys or more with the key threshold of 2.
1 of the subkeys is then also stored in the DB and will be used as the Appli... |
Assume we have the situation that Alice is receiving somewhere in the magnitude of 1_000_000 encrypted messages, whereby a small number (n<100 for 99% of cases) of these messages are meant for her. An outside observer should not be able to tell which of these messages are meant for Alice, so we can't just send the ciph... |
I am trying to implement an encryption function that uses the AES T-Tables implementation.
I am quite sure that my roundKeys are correct.
I also know that the initial round key addition in the following code is correct.
So there must be an error in the main rounds, but i am not sure what went wrong. I have narrowed it ... |
Can we have an asymmetric key in AES? Clarification about PBKDF2 and AES-GCM in WebCrypto
According to wikipedia AES page, AES is a symmetric-key algorithm.
The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data.
While PBKDF2, always acco... |
I was reading this post and the accepted answer wrote about a way to “prove that some list of points $[A,B,C,...]$ when multiplied by $x$ produces $[A′,B′,C′,...]$”. However, in their explanation their definition of $e$ seems to be self-referential. If you understand what they were getting at in that post, I'd apprecia... |
At page 336 in "Handbook of Applied Cryptography - Menezes", I see the sentence
For $n$-bit MAC with $t$-bit key space this requires $2^t$ MAC operations, after which one expects $1+2^{(t-n)}$ candidate keys remain".
I do not understand why is $1+2^{(t-n)}$. According to me, it must be $2^{(t-n)}-1$.
For example, in ... |
Are there any encryption protocols or services that are time based. I.e I can encrypt something now and it can only be decrypted on or after 01/01/2100. Like a digital time capsule.
The only way I can think that this could be implemented is by a third party that publishes a list public keys - one for each future day an... |
The following context is based on elliptic curves in short-weierstrass form y^2 = x^3 + b.
I know that elements of a non-prime order cyclic group G can be moved to its subgroup H by a process called "cofactor clearing". You just have to simply multiply a cofactor by an element of main group that ends up giving an eleme... |
Given two lattices $L_1$ and $L_2$ represented by bases $B_1$ and $B_2$, is there an efficient algorithm to compute $L_1\cap L_2$?
I can show, I think, that if $\gcd(\det(B_1),\det(B_2))=1$, then $B_1adj(B_1)B_2$ generates $L_1\cap L_2$, but I'm interested in lattices whose volumes have greater GCDs.
A follow-up questi... |
I need to design some protocol where actors will leverage Zero Knowledge Proofs (ZKP) to prove that they know the pre-image of some specific SHA256 hash without revealing the pre-image itself.
Ideally, they should also be able to batch proofs of multiple hashes into a single ZKP.
SHA-256 hashing is not a ZK friendly op... |
What are the theoretical usage limits of Kyber and Dilithium? Are there any sources to back this up? Maximum number of encryptions/signatures allowed per key, etc.?
|
Suppose we have $GF(2^{128})=F_2[x]/(x^{128}+x^7+x^2+x+1)$ and $a,b,c \in GF(2^{128})$ with $a*b=c$, where * is multiplication in $GF(2^{128})$. Could we convert them to $a',b',c'$ of length 128 bit vectors, such that $a'\&b'=c'$, where & is bitwise AND?
I think FFT might work, but I am confused how to do a FFT on a le... |
I have a question in regards to a task I've been given at uni. I need to encode the string 'Cyber' 2 characters at a time with RSA with padding being space.
What do the chunks look like than need to be encrypted? Should I just concatenate the ascii codes 'Cy',then 'be',then 'r ' , ex 'Cy'=67121, or should I separate th... |
I recently started reading about Yao's Millionaires' problem. If the Yao's Millionaires' problem is capable of finding if one party has less money / more or equal money than the other party, then is it possible for one party to find the exact amount of money that the other party have?
I specifically read the articles p... |
I am looking for a safe and easy way for my inheritors to get a password after my death. That can be the password of a digital vault, a password manager, or anything else.
I could write the password in a testament but since a leak is still possible, I do not want this to be in clear. I was thinking to encrypt the pass... |
The following context is based on elliptic curves in short-weierstrass form y^2 = x^3 + b.
pls read carefully-
I am looking for a function/formula/algorithm that can be applied on any curve, say for e.g. y^2 = x^3 + 2 with prime = 1097, largest subgroup order(J) = 1098 and subgroups = 1098, 549, 122, 183, 366, 61 and s... |
As a preamble,I acknowledge that it is fundamentally impossible to authenticate
that a networked client is who they claim to be. The question is, given that
it's impossible, what should I do anyway?
Suppose I have a http server and only want to provide services to browser X rather
than all the other brands of browser... |
I'm working on finding an attack on textbook RSA using non-prime, low public exponents $e_1,e_2$ for each encryption.
Given $$c_1 = m^{e_1}\space mod \space n \\ c_2 = m^{e_2} \space mod \space n$$
I found there's the Common Modulus Attack which works when $gcd(e_1,e_2)=1$.
But is there a different way to solve the pro... |
In my idea, $n$ clients will have the connection to a server, and clients will not be able to connect with other clients. Are there any previous design has been published to let $n$ clients agree on a same shared secret, while the server does not know what the secret is?
|
Assume I am using the SIMD encryption of homomorphic encryption. Performing plaintext-ciphertext multiplication between two vectors $\mathbf{a}$ and $\mathbf{x}$ means
$Dec(\mathbf{a} \times Enc(\mathbf{x})) = \mathbf{a} \times \mathbf{x}$, where $\times$ means point-wise (or say element-wise) multiplication. I am won... |
The situation:
I have a group with 20 members, each member broadcasting 1 message per second. Communicating one on one is possible, but 1 message per member per second is the absolute limit and every member needs every message.
The only means of communication for this group allows me to send 258 bits per message. The m... |
I need to store a public key in a variable of maximum 32 bytes.
I recover the compressed key and remove its prefix, but then I have to do the opposite: I have to rebuild the compressed address from it without the prefix.
I know that the prefix depends on the last two characters of the uncompressed key.
Prefix = 0x03 if... |
I used to think that adding random padding to an rsa plaintext was to prevent attack when you can ask/have access to different ciphered output, and decipher it without access to the private key (under certain conditions).
I've came across a signature verification scheme that seems to use random padding (at start and en... |
I'm studying a case where when i sign a same message with the same private key and a different nonce, i sometimes get signatures (r,s) where r values share some similarities (same numbers at the same indexes).
import ecdsa
import random
import sys
import math
from Crypto.Util.number import bytes_to_long
from ecdsa.numb... |
I have seen that Filecoin performed a public set-up ceremony for their zkSNARK system. Because Filecoin uses the Groth16 prover (which has a circuit-specific set-up), the output of this ceremony was public parameters that anyone can use to prove statements involving one of six Filecoin-defined circuits.
It would be nic... |
I just tried to implement ISAAC from scratch, using the Jean-Philippe Aumasson paper from 2007 as a reference.
This paper gives a definition of the original ISAAC algorithm as well as the improved ISAAC+ algorithm.
JPA states in this paper that there are several flaws in ISAAC, and that ISAAC+ would fix those.
However,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.