instruction stringlengths 32 27.2k |
|---|
Assuming a random number generation process outputs lots of numbers between 0-9. First I gathered up a bunch of the numbers, converted them to binary and created a bitmap.
Not so random as you can see! That must be why you shouldn't just use raw integers as random numbers in a computer program. Look what happens when... |
Alice has two secret numbers, a and b. She publishes c1=E(a), c2=E(b) and c3=E(a+b). Is there an encryption system E such that anyone would be able to prove that the c3 as published by Alice is actually E(a+b)?
EDIT: Modified the question to use "anyone" instead of "Bob".
Note that this is different from homomorphic en... |
If I've got an LFSR, let's say a 16-bit Fibonacci LFSR as shown in the corresponding wikipedia article, which generates maximum length sequences, could I use it to create word sequences instead of bit sequences?
Staying with the wiki example, let's say I got a 16-bit LFSR with the following primitive polynomial: $x^{16... |
I'm currently examining the NaCl library written by Daniel J. Bernstein and I noticed that the library hard codes the sigma:
static const unsigned char sigma[16] = "expand 32-byte k";
In all the salsa stream implementations:
crypto_stream_xsalsa20
crypto_stream_salsa20
crypto_stream_salsa2012
crypto_stream_salsa208
a... |
Why did the MARS cipher receive such a high number of negative votes in the AES competition? As I understand only MARS and Serpent implement measures to counter future cryptoanalytic attacks, so it would seem that it is one of the most secure ciphers in the competition. Am I missing something?
|
What block cipher is used for CBC-MAC? DES, AES, 3DES? Or it doesn't matter?
|
Is there any technique so that if I encrypt data, the ciphertext would be genuine and if someone else tries to encrypt the same data the ciphertext could be determined as fake or just invalid?
I want to create a network in which the user has to register to get a ciphertext (like a token) and only after getting a genuin... |
I am working on a project where I am benchmarking the 5 AES finalists (Rijndael, Twofish, Serpent, MARS and RC6) on CUDA Hardware.
My problem is that I am no experienced CUDA programmer. My approach is to find open source projects that implement these algorithms in CUDA and modify them to match my needs.
It was obvious... |
I thought the current state of the art for fully homomorphic encryption was Brakerski, Gentry and Vaikuntanathan's scheme (BGV) based on standard/ring LWE employing modulus switching for noise management.
I recently came across a paper by Zvika Brakerski on a "scale invariant" FHE scheme, based on gapSVP, that does no... |
Preamble:
There is currently a zoo of various logics for evaluating (proving) security in cryptographic protocols. The idea is that, by expressing these protocols using some logic, you can create a formula describing some property (such as shared secrecy, message authentication, and perfect forward secrecy).
Example (S... |
I'm conducting an experiment dealing with differences in padding across different aes operations for my Intro to Crypto class, and the question says OpenSSL uses PKCS5 padding, and that I need to prove this. All we've been taught up to this point was how to encrypt something by doing this:
openssl enc -aes-128-cbc -e -... |
So for a Diffie-Hellman problem, I am given the prime $p$ for the Diffie-Hellman exchange.
I am also given $g$, secret number for machine as $A$, secret number for station as $B$, a Diffie-Hellman shielded Login Name $V$, and Diffie-Hellman shielded password $W$.
For this problem, I am given three users and see which o... |
Given that RSA key generation works by computing:
n = pq
φ = (p-1)(q-1)
d = (1/e) mod φ
If I was an attacker who wanted to brute force d, could I brute force d given just the public key, the plaintext message, and the generally known facts of RSA such as
φ is always less than n = pq
n is known by the attacker by th... |
I'm looking to implement Lamport signatures as a little fun project, and I need a fast one way function that maps $\{0,1\}^{256} \rightarrow \{0,1\}^{256}$.
I was wondering whether I could safely use the ChaCha core for that, by setting the input as the key, the nonce and counter to 0 and truncating the output to 256 b... |
I'm aware of two methods to attack RSA:
Brute force factoring, where no plain text is available
Brute force (1/e) mod φ where the plain text is available as described here
Question
Given an optimized solution either in a generic CPU, or custom ASIC, what operation is more likely to take longer, and/or consume more ... |
“Brainwallet” is a program that takes a passphrase (hopefully a good one) and deterministically creates a Bitcoin wallet. This wallet can be used for transactions, then deleted from the computer. To get access to the wallet again, you only need the passphrase to re-create it.
Does something similar exist for GPG? If ye... |
The definition of $e$ can be seen here. I want to know the accurate comparison of efficiency between $e(\cdot,\cdot)$ and $g^a \pmod{p}$. If computing $e(P,Q)$ is less efficient than computing $g^a \pmod{p}$, should we prefer $g^a \pmod{p}$ to $e(P,Q)$ when designing protocols?
Also, what is the reason for defining th... |
Are there open source implementations of SSE and OPE?
Can anyone please point to sample codes, if available.
EDIT
If cryptDB is not an option, what other options are available?
(Indeed, these schemes are weak — which is why cryptDB proposes onion layers for encryption.)
|
Assumptions:
Alice and Bob use (cryptographically secure, hardware-rng generated) 4096 bit keys.
Each message is encrypted using a new key; meaning: once a key is used, it's destroyed.
Alice and Bob only need to encrypt/decrypt messages up to a length of 256 bytes.
To keep it simple, key-exchange is not part of the pi... |
One-Time Padding is (theoretically) perfect encryption algorithm. Let's assume that these problems are solved:
Fast generation of independent and identically distributed random variables
Perfect key distribution system
Key only used once.
Key destroyed after use, without side channels that would allow any non-trusted ... |
So, I have a file that is XY Exabytes big. I create a SHA-512 hash from it.
Are there any theoretical chances that I can retrieve the original data just from the sha512 hash?
Also, are there any better hashes then sha512?
|
I am trying to prove that:
"If the gap Diffie-Hellman problem is easy, then the Cha-Cheon signature scheme will be broken."
Can you help me to prove it? Is there any proof to the relation between the gap Diffie-Hellman problem and the the Cha-Cheon signature scheme?
My related question: Can you help me design a simple... |
I am attempting to encrypty/decrypt a long message in RSA using javascript (with crypto-js and jsbn libraries).
I posted this on stackoverflow too but I figured someone here on crypto might be able to help as well.
so far, to encrypt/decrypt short messages I have the following code:
function encrypt(signedCert, msg) { ... |
From what I read in Wikipedia's article "Elliptic Curve DSA ~ Security", the "deterministic" generation of $k$ can help prevent certain type of attacks (such as the one happened to Sony).
However, wouldn't the deterministic property be predictable as compared with "probabilistic encryption"? To me, it seems like RSA d... |
How would one go about designing something like Google Drive/Dropbox providing the following features:
files are encrypted and decrypted on the client
files can be synced between devices
the service provider shouldn't be store private keys/passwords on servers
if the user can have only one password to remember that'd ... |
I was studying Crypto, and this question came up. Using a PRG like the multiplicative congruence generator:
$b_{i+1} = a \cdot b_i \mod m$
How do I prove that the output of this PRG, or any PRG's whatsoever is easily distinguished from a random sequence of numbers?
|
One of our users seems to have been hit by CryptoLocker. As a result, he has a hard drive full of encrypted files. The ransom-ware claims to have used public key encryption on the files.
If we know exact contents of some of the files prior to them being encrypted, would it be feasible to use those files to discover th... |
Suppose you have 2 drives you want to encrypt using different encryption algorithms, as an example: AES256 and Twofish.
I am aware that using the same password for both could potentially weaken either one or both because it would build a relationship.
But AFAIK it's only true if both passwords are hashed into the same ... |
I have placed a bet that I can create a public key such that my adversary will not be able to crack (decrypt) it for at least one week. For my primes $p$ and $q$, I chose very large numbers that are $101$ digits long, each. I also tried to make them to be as distinct as possible.
Now what I am wondering is whether to ... |
I've recently been reading an article about "using cryptography to store credentials", and I would love it someone explained this in more detail…
Up until Android 4.1, Android used a SecureRandom provider, that, given the same seed, after using setSeed(seed), it would generate the exact same stream of bytes. Because of... |
I'd like to create a database of questions and answers so that an attacker with access to the database can't obtain either the questions or the answers.
If H0 and H1 are secure hashes, looking up the answer to a question might proceed as follows:
lookup(H0(question)) -> value
H1(question) XOR value -> answer
Can this ... |
I have recently begun studying crypto. If it's one thing I have learned it's that we should not implement our own crypto. Therefore we should look to using existing software and libraries.
When I go to implement something that needs data security, there are many options -- openssl, mcrypt, truecrypt, crypt, pycrypto,... |
I'm trying to understand if the feature "Hierarchical Deterministic Wallets" in Bitcoin allows for complete privacy of all derived keys, and if any of those keys can be associated with each other after they are generated.
Knowing the answer to this will greatly impact the scenarios these keys are usable in.
|
I'm curious what would happen in the following scenario:
Suppose an attacker gets a hold of a cipher-text of sufficiently large length. And suppose he has the means to verify a successful decryption.
But the attacker has no clue what cipher is used and assumes it's unbreakable with anything but brute-force whatever it ... |
Given $R$, a prime $p$ and two bases $g_1$ and $g_2$, is it possible to decide if $R = g_1^r$ mod $p$ or $R = g_2^r$ mod $p$ without knowing $r$?
|
From What is the difference between PKCS#5 padding and PKCS#7 padding, I understand that PKCS#5 is defined for 8 byte block sizes. Does this rule it out as a padding option for AES since AES has a 16byte block size. I have seen some conflicting usages and would like to get a definitive answer
|
Plenty of ciphers come out of the USA from government research or selection competitions. AES and DES are examples.
Are there any public ciphers produced by other states, China or Iran for example? Do you really think they trust AES?
EDIT: List of ciphers from different nations:
USA: Skipjack
Japan: Camellia
Russia: G... |
In the abstract of "Cryptography with Tamperable and Leaky Memory", at the end of the 3rd paragraph, the authors say:
In both schemes we rely on the linear assumption over bilinear groups.
What is the linear assumption ? How do you break this linear assumption ?
I would appreciate if somebody could give me concrete... |
I've searched Google and the GnuPG documentation and I haven't been able to find an answer. Some pointers in the right direction would be greatly appreciated.
|
I would like to ask what happens if we build an RSA system with modulus a product of more than 2 primes, for example let $n=p_{1}p_{2}...p_{L}$. I know only the classical RSA system with $n=pq$ with $p$ and $q$ large prime numbers.
I guess the modulus $n=p_{1}p_{2}...p_{L}$ will be not a good idea, because one can use... |
I'm trying to read a public key into Bouncy Castle (secp256k1) and need to choose from the following objects
FpPoint;
FpCurve;
or
F2mPoint;
F2mCurve;
or
ECPoint;
ECCurve;
Although it would be helpful if someone simply told me which object to use, what would be more u... |
Salesforce recently announced they are moving away from HMAC SHA256 to RSA SHA256.
Why did they make that move? Any technical factors?
Is HMAC really easy to break?
PS: I am not a security expert.
|
Consider a secure modern block cipher like AES/Serpent/Twofish.
I hear everyone say that the complexity is $2^{128}$ for a 128 block cipher. But isn't the weak link the actual hashed and salted password? Any brute force should be targeted at it?
By my rough calculations $2^{128}$ = $84^{20}$, so any proper password com... |
Are there any known timing attacks (both practical and theoretical) on any implementations of the following?
ECDSA (I'm aware of this one - are there any applicable to prime fields?),
ECDHE (again, over a prime field),
AES,
SHA2
|
I recently had a discussion with a friend of mine about cryptography. As we are both no experts, I thought that I could better resolve are dispute here.
My friend said that when he used public key cryptography in the past, he used to keep his public key private too. Only giving it out to people that really needed it (... |
It seems the only specified CTR mode ciphers in TLS are all GCM based.
GCM ciphers run AES-CTR and do authenticated encryption with a MAC based on Galois-field arithmetic ("GHASH") - and the latter seems to be difficult to get right in software (side-channel attacks, constant time) or require CPU hardware support (e.g.... |
Using
openssl s_client -host myserver.net -port 443
I can see the cipher negotiated is indeed using ECDHE for session key exchange:
SSL handshake has read 5894 bytes and written 447 bytes
---
New, TLSv1/SSLv3, Cipher is ECDHE-RSA-AES256-GCM-SHA384
Server public key is 2048 bit
Secure Renegotiation IS supported
Compres... |
Given that a TLS client and server have already agreed upon ECDHE for session key establishment, how does the selection of the actual elliptic curve ("domain parameters") being used for deriving the DH keys work?
Is the curve somehow negotiated and if so how does that work (in the context of TLS)?
|
I've had lots of practice adding points for my crypto class. However I've run into a situation where I need to subtract two points for decryption:
Pm + kPb - nb(kG) = Pm
Where Pm is the plaintext, Pb is participant b's public key, nb is participant b's private key, G is a base point in the elliptic group Ep(a,b), and ... |
Let $G:\{0,1\}^{*} \mapsto \{0,1\}^{*}$ be a secure PRG. Prove or disprove that the following construction also yields a secure PRG.
$$G'(k) = G(k||0),$$
where $||$ denotes the concatenation of two strings.
I understand that proving/disproving such constructions usually involves a proof by reduction or a counterexample... |
I'm reading the SSL specs here.
The interesting thing seems to be that RC4 is not re-keyed with a new IV for each message. The stream cipher state is simply carried over to the next record. Why is this secure? Shouldn't messages be encrypted with different IVs? Honestly, this is one part I don't fully understand about ... |
Are there any examples of attacks on hash functions which:
break collision resistance and second preimage resistant, or
break collision resistance and preimage resistant?
I have looked at Rogaway's paper1, but it seems complicated, hence was wondering if a succinct example exists.
1) Cryptographic Hash-Function Basic... |
I'm currently studying secret key cryptography, and I've come across the terms "long-term key" and "session key".
What's the difference between these two kinds of keys?
|
I'm reading the SSL specs, and it seems that the initial handshake has no authenticity protection at all. What is to prevent, say, an attacker from overwriting the "available ciphers" list with one that is full of broken, or even null, ciphers? Is there some sort of defense for this, or is this fundamentally unsolvable... |
A theoretical question about the Vigenère cipher:
Without any knowledge about the key (not even it's length) can we tell how much known or chosen plaintext is needed for the adversary to completely recover the key?
What about if we know the key length? (I assume that we'll need plaintext with the same length of the ke... |
The way Applied cryptography 2ED explains the puzzle is as follows (I paraphrase it):
Bob generates 2^20 messages of the form x,y where x is a puzzle number and y is the secret key. Both x and y are different for each of the one million message. Encrypt each message using symmetric cipher with a different 20-bit key. ... |
I am working on Bent functions that are of interest in cryptography. I developed an algorithm that construct such functions. However, I need some tools to calculate boolean expression from the truth table. Is there such a application or applet available? (Actually I am interested in expressions without any NOTs).
|
I am interested in what conditions are necessary and sufficient to define a cryptographically secure pseudo-random number generator (CSPRNG).
Wikipedia lists two defining characteristics:
It satisfies the next-bit test.
It withstands 'state compromise extensions' - part of all of the state being compromised does not a... |
When you are using a named curve like P-256 in openSSL, is there any standard key size for ECDH private key keys?
If you look at the ec_key.c file in the openSSL source this is what you see:
BN_rand_range(priv_key, order)
Here a cryptographically strong random number is generated which is smaller than the order.
|
There is already a question asking "Why initialize SHA1 with specific buffer?" and my question follows on from this:
Why are the initial states of hash functions often non-zero?
For most, I have been able to find a clear explanation of where the initial values come from, and they are frequently nothing-up-my-sleeve va... |
Assume that we have a probability distribution $P(X,Y)$ for the joint probability of random variables $X$ and $Y$. Let $P(Y, Z)$ be analogous distribution for $Z$ and $Y$. Based on these we can define a joint probability distribution of $P(X,Y,Z)$.
Let, $P'(X,Y)$ and $P'(Y,Z)$ be analogously probability distributions w... |
I'm trying to create a remote controller compatible with HiSec algorithm. It's so old that “National Semiconductor” (now “Texas Instruments”) discontinued NM95HS01/02 and docs are unavailable.
Does anyone have the documentation that describe the algorithm code block if the HiSeC™ –High Security Rolling Code Generator? ... |
I've read some papers about linear cryptanalysis. But since I am going to give a lecture about it I am looking for an example of breaking a system using this attack. Is there such an example available?
|
In the paper Pairings for Cryptographers we read about what the authors call a type 2 pairing in which we have a "pairing friendly curve $E$ over $\mathbb{F}_q$ with embedding degree $k>1$ and define $G_1$ to be the subgroup of $E(\mathbb{F}_q)$ of order $l$". We also define $G_2=\langle Q\rangle$ where $Q\in E(\mathbb... |
Is it advisable to use AES CTR mode with the counter initialized to 0? How good is it in security terms?
|
My problem is to outsource an array of data and ask the prover to sort the data.
I am wonder if there is any working system out there that support interactive proof for the above computation? Or if none, any particular protocol that may be efficient enough and implementable for the problem of verifiable sorting?
|
I was wondering how we can get a secret sharing of $a+b$ from the sharing of secrets $a$ and $b$ themselves by using an XOR secret sharing scheme, where $a_1,...,a_n$ and $b_1,...,b_n$ are the shares for $a$ and $b$ respectively. Can anyone give me any suggestion?
|
In this paper the last sentence of the first paragraph in the abstract states:
We assume a (necessary) “leak-free” preprocessing stage.
But then later on in section 1.4 they say
Another interesting open question is to construct a leakage- resilient
MPC protocol without assuming any leak-free stages,
Why do they ... |
I am working on Intel AES-NI library and since the AES function is coded using low-level assembly instructions. I could not see how the IV or initial counter increases in CTR mode. In general, how does the IV or initial counter increase by itself for each 128-bit block (let's say we use AES_CTR_128)? Does it increase b... |
In this paper, the authors construct an encryption scheme that is supposed to be resilient to tampering and leaking (as opposed to just leaking).
Specifically this scheme:
If you look at the update procedure they simply multiply the current secret key $g^s$ and multiply it by $g^{Bu}$
If you tamper with this updated... |
Are there any differences in operation between existing Diffie-Hellman specifications, especially those within the RSA PKCS#3, ANSI X9.42 and RFC 2631 standards?
|
Recently, I found a function that is performed on a sequence to return another sequence. All known algorithms for finding the input, given the output are of exponential complexity. I want to propose this function for encryption in a public key cryptosystem. What steps I am supposed to take? Actually I am a beginner in ... |
Meet in the middle on 2DES uses $2^{56}$ memory.
Given the fact that the attacker has only $2^{45}$ memory.
How can the attacker adjust the attack so even with this memory limit, it will still be more efficient than looking after all the existing keys?
I guess you can separate this to a few lookups - a few tables - eac... |
I have been playing with base 26 LFSRs (i.e. using the alphabet) and noticed that the XOR operation for base 26 is just the tabula recta and so can be done very quickly. This made me wonder whether a base 26 LFSR (combined with a technique such as self shrinking) could be used as a PRNG that could be performed by hand ... |
Consider 4 people, $A$,$B$,$C$,$D$, & a secret $s\in\{0,1\}^k$. Construct a scheme
which enables the following subsets of people to retrieve the secret $\{A,B\}$, $\{A,C\}$, $\{B,C,D\}$.
I know that we can use Shamir's secret sharing scheme to do so, and A should be allocated more shares than the others. But how do we ... |
In the comments of this question, Ricky Demer proposes a function $HMAX$ to combine two $HMAC$s based on different hash functions:
$HMAX_{H0,H1}(⟨k_0,k_1⟩,m) = HMAC_{H0}(k_0,m) \oplus HMAC_{H1}(k_1,m)$
The OP also talked about hash function combiners in general and preserving collision-resistance of the underlying hash... |
How are IVs used in association with RSA Encryption?
Can someone explain why we use them in this RSA context?
|
I've discovered that a client has SEED enabled in their SSL ciphers, and would like to know a bit more about it from a security perspective. The Wikipedia article doesn't mention any flaws, yet I've found two papers that demonstrate attacks - a differential fault analysis, which is fast but has infeasible requirements,... |
I know how to calculate the entropy of a key that relates to its selection process. For example if the key space is $1000$, entropy of a randomly chosen key is $1000$. Suppose now you have two keys $X$ and $Y$. The finale key $Z$ is a concatenation of $X$ and $Y$. There are two ways to combine. One is to use XOR and ot... |
If I have the unencrypted text and the encrypted text, can I calculate the key? It seems logical based on my limited knowledge of encryption that I should be able to... but it also seems like too obvious of a vulnerability for it to be possible.
Could someone explain how encryption schemes prevent against this type of... |
I understand how to compute HMAC-SHA1, HMAC-SHA2 etcetera.
Please explain why/how is the resulting HMAC value is used in conjunction with AES for encryption/decryption and signing/verifying.
In particular:
How does HMAC interact with AES for key sizes (AES-128, AES-196 and AES-256)?
Is the calculated MAC encrypted usi... |
My bank's website uses HTTPS with the cipher suite ssl_rsa_with_rc4_128_md5.
What are the known weaknesses of this suite? Do they have a practical impact for banking-related communications?
|
Cryptographic hash functions normally take as input a bitstring.
I am looking for a hash function that takes as input a finite multiset of values. In other words, given $S \subset \{0,1\}^*$, I want to compute $H(S)$, a hash of $S$. Also, I would like this function to be chosen so that given the hashes $H(S),H(T)$ of... |
In Elgamal, the generator $g$ is always quadratic non-residue modulo $p$, where $p$ is a safe prime and the inverse of $g$ can also be generator?
Can I prove it? I can't come up with it at all.
|
I know the definitions of both but can't specifically tell how they are different and if one is better than the other.
Please help.
|
I'll probably get shot for asking this, but I've got some kids (aged 8-10) in my neighbourhood that I've been showing/teaching the simple pen-and-paper Caesar cipher and they're successfully playing with it for more than a week now.
Silly me thought it would be great to now show them the concept of message authenticati... |
For a start, I've got a question regarding public key encryption.
I know public key encryption overcomes the key distribution issue with the symmetric encryption and that in the case of communication between 2 parties, there is a total of 4 keys: each party has a public and a private key.
But here's what's been confusi... |
I need to prove that the following encryption scheme is a perfect cipher:
Let $p$ be a prime. The secret key is a pair $(a,b)$ sampled uniformly at random from $\mathbb{Z}_p^* \times \mathbb{Z}_p$. An encryption of a message $M \in \mathbb{Z}_p$ is defined as:
$E_{a,b}(M) = aM + b \mod p$
The problem is that I don't un... |
I'm having hard time with the implementation of the S-Boxes by Osvik found in this paper: Speeding up Serpent. At the end of the paper, all the s-boxes are given and then, I just implement them. Here's my implementation of $S_0$ as an example :
UInt32Vector Serpent::S0(const UInt32Vector &Y)
{
UInt32Vector X = Y;
... |
In the FFX spec, there is a note about using CBC-MAC as the round function.
Security notes. The round function F is constructed in such a way that the set of inputs on
which the CBC-MAC is invoked is prefix-free. (A set of strings is prefix-free if for any distinct x, y
in the set, x is not a prefix of y.) The CBC... |
What is best to use (for message integrity) between…
AES(Data) + HMAC(Data)
AES(Data + HMAC(Data))
AES(Data + Hash(Data))
…and why?
|
I'm writing some software that requires the use of a CSPRNG with javascript for use in the browser and I'm wondering what libraries are available. Crypto-js doesn't seem to have a CSPRNG I can directly call (unless I missed it?). I've looked through the Stanford crypto js library, but I'm uncertain how much analysis th... |
It seems to me an exhaustive search would simply try to use all the possible bit combinations of a key, while factorization is some mathematical formula for determining the key? When discussing the NSA's cryptography "breakthroughs" some articles discuss factorization as the contributing factor. However, others go furt... |
Does evaluating the products of shares $a_jb_j$ give a secret sharing of $ab$?
I think it's a no, but I am not sure on how to prove it.
|
In an Ars Technica article about Adobe's use of 3DES in ECB mode, there's a paragraph
The passwords, according to password expert Steve "Sc00bz" Thomas, are encrypted in a mode known as ECB. That was a poor choice on
the part of Adobe engineers, because ECB often leaks information about the passwords, such as t... |
I am currently working on a secure messaging website and I had been using RSA 2048 for encryption, decryption and signing of messages but I found it to be EXTREMELY LAGGY so i've moved to 1024.
I did a timing test and these are my results (this was a test of generating a private key from the same string in cryptico.js)... |
In the recent Adobe passwords leak, presumably encrypted in 3DES ECB, second half of all 8-character passwords is identical: ioxG6CatHBw==
Source: http://pastebin.com/iDTFARwq (guesses based on obvious password hints)
L8qbAD3jl3jioxG6CatHBw== password
BB4e6X+b2xLioxG6CatHBw== adobe123
j9p+HwtWWT/ioxG6CatHBw== 12345678
... |
I am trying to factor few integers that are each between 115 and 135 digits long. I was wondering if anyone knew of any efficient methods or any programs that I could use to find the two primes $p$ and $q$ for $n=pq$.
I was thinking of using quadratic sieve but I don't know if there is any other way. Plus I don't know ... |
Edits: added then removed additional cases that on reflection seem like a bad idea. In fact, this whole line of thought seems like a complicated way to get a bigger nonce, which might be better accomplished with something like XSalsa20 which was designed for that. I will accept the "just use the right tool" answer, b... |
I've been reading up a bit on deterministic password generators. All the ones I can find basically do something like this:
Pick a master username and a master passphrase. The username could be your email, or a PIN, or something else. The master passphrase can be subject to stringent requirements to ensure sufficient e... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.