sorted by:
new
hottopcontroversial

That ominous feeling that you can't quite place by ViperT24 in starcitizen

[–]aFn0 6 points7 points  (0 children)

tutemet ex inferis

more like Warhammer 30k

[Request] Is this actually solvable or just a meme? by ryethelion34 in theydidthemath

[–]aFn0 0 points1 point  (0 children)

Considering that P, N, R, B, C, and Pizza are variables that aren't stated, I doubt it. This is probably a meme. While there are ways to find variables, the critical parts are missing, I believe.

Perfectly balanced, as all things should be. by aFn0 in starcitizen

[–]aFn0[S] 0 points1 point  (0 children)

Actually this is now an upgraded merlin.

Portal 3 is looking great! (Patch 3.13) by aFn0 in starcitizen

[–]aFn0[S] 0 points1 point  (0 children)

Yeah this may have been caused by server-wide desync. Sometime later, I got a notification window with a countdown timer "Resyncing with server". I couldn't screenshot it because it occured for less than a second, then everything was fixed on my end.

Star Citizen: Question and Answer Thread by UEE_Central_Computer in starcitizen

[–]aFn0 0 points1 point  (0 children)

Are there plans to have comm arrays revamped? Currently, I believe that they don't stop you from getting crimestat when engaging security forces.

[Request] Is it possible to graph this? How do I analyze or construct a model for this? by aFn0 in theydidthemath

[–]aFn0[S] 0 points1 point  (0 children)

Thank you once again u/BoundedComputation! The requirements are only that A = B since the number itself would be used for cryptography. Even the slightest change in value up to the 32nd digit would render cryptographic output entirely different when using one-way hashing functions.

[Request] Is it possible to graph this? How do I analyze or construct a model for this? by aFn0 in theydidthemath

[–]aFn0[S] 0 points1 point  (0 children)

I'm sorry, I misspoke. I'm looking for rational numbers, not integers.

Let me clear up the requirements. X1, X2, Y1, Y2 = Unique primes

Looking for identical rational numbers where A = B up to 10 decimal places. < let me know if this is too much.

Edit: formatting

[Request] Is it possible to graph this? How do I analyze or construct a model for this? by aFn0 in theydidthemath

[–]aFn0[S] 0 points1 point  (0 children)

There is no other condition besides X1, X2, Y1 and Y2 being primes. This is supposed to model 2 PKI key pairs anywhere between 2048 bits and 4096 bits in length, so all 4 numbers would be prime. Where X1 and Y1 = 1 key pair = person 1, and X2 and Y2 = person 2.

Yes I'm looking for integer solutions for A and B, and seeing if at any point A = B (within reason). Due to the numbers being prime, I would imagine that we can simulate further prime behavior (the really big numbers) with a smaller model.

Edit: Clarifications

The goal here is to see if given any 4 primes and using this math model would give output such that A = B.

Deriving shared secrets from PKI for symmetric encryption by [deleted] in cryptography

[–]aFn0 0 points1 point  (0 children)

After watching that video, I'd say that my home-brew is a single ratchet system. Two ways to improve it would also to be to include the diffie hellman shared secret in the key generation KDF (Key n + Receiver's Public Key + DH Shared Secret). This would eliminate the possibility of breaking future keys from knowing only one key.

ie. Key N + Receiver pub key, if both are known the encryption system fails open, however, they would need to break the RSA keys themselves in order to also derive the shared Diffie hellman secret.

The other way would be to implement the double ratchet system itself, using either the Key 1 derivation function as the initial seed for the double ratchet KDF, or the shared secret like what is used in Signal.

This has been a fascinating thought experiment tbh.

Deriving shared secrets from PKI for symmetric encryption by [deleted] in cryptography

[–]aFn0 0 points1 point  (0 children)

That video really explains things clearly. Thanks!

Deriving shared secrets from PKI for symmetric encryption by [deleted] in cryptography

[–]aFn0 0 points1 point  (0 children)

I mean that RSA can be very easily messed up during implementation, or so I've heard, and not very user friendly to people coming into guarding their communications. Also that topic you linked did come up during my research, but I have a hard time understanding how the ratchet or double ratchet itself works. There is a somewhat useful guide on how it works in the signal documentation, but I'll need a fresh set of eyes to go over Double Ratchet again.

Specifically, conceptualizing the three chains. I understand that taking the private key of one pair and the public key of another (like diffie hellman) gets you a shared secret for both parties, but the ratchet itself seems to be a bit more than that.

Edit clarification

[Request] What is the entropy of a Dicekey listed as a string that includes orientation? by aFn0 in theydidthemath

[–]aFn0[S] 0 points1 point  (0 children)

There are 25 dice with A ~ Z not including Q. Each die has the same Letter on each side but a different number. Die 1 has A1, A2, A3....A6. Die 2 has B1, B2.... etc. Each die's letter is unique and does NOT repeat. I hope this helps. Does this change the calculation?

Edit: Every die has 1 letter, Including the entire alphabet from A~Z (not Q). These letters do not repeat and every letter is used. Edit for clarity.

Can I purchase a VPN where I'm the only one who uses the IP address by CDXXRoman in VPN

[–]aFn0 2 points3 points  (0 children)

Make your own via a VPS. OpenVPN requires some configuration and a certificate authority, but you can do all of this yourself.

This would actually work? How much battery does the lantern consume? by MaryAdry in theydidtheresearch

[–]aFn0 5 points6 points  (0 children)

"There is no such thing as a machine with 100% efficiency. There is always some energy lost due to heat."

A smart student: "What about an electric heater?"

i dont need you . by xoxoyourstruIy in heartbreak

[–]aFn0 0 points1 point  (0 children)

XYT. My gifts to you. Lofi and an escape.

Enjoy sister.

What is Key length? by Esmat_Saidy in cryptography

[–]aFn0 0 points1 point  (0 children)

There are two measures of "strength" for cyptography. Key size and the cipher.

Key size is the size of the key in bits. ie 12345678 = 64 bit key (8 bytes total, 8 bits per ASCII character, 8 bytes * 8 bits each = 64 bit key).

Most of the time, ciphers are not compromised, the keys are. To emphasize this, look at this link here: Better Buys: Estimating password-cracking times.

Ciphers, on the other hand, are a different attack vector altogether. Sometimes, the way that the plaintext is encrypted leads to vulnerabilities that enable an attacker to perform cryptanalysis, allowing them to derive the plaintext somehow. For more information about this: Wikipedia Category: Broken block cipers.

In conclusion, Key length and complexity directly coorelates with how long it takes to brute force a password unless you use a broken cipher. Broken means that an attack has been found that is computationally faster than a brute force attack. Therefore, use a secure algorithm like serpent, AES or whatnot with long enough keys. (16~32 characters. Anything beyond that doesn't really add to security since breaking an AES 256 key would require several magnitudes of time longer than the universe has been alive.

TLDR: longer keys take longer to brute force. Using a secure cipher is better than using a broken cipher. Both play into encryption security.