There have been multiple accounts created with the sole purpose of posting advertisement posts or replies containing unsolicited advertising.

Accounts which solely post advertisements, or persistently post them may be terminated.

lemmy.world

slazer2au , to linuxmemes in -----BEGIN PRIVATE KEY-----

I wonder if you string together enough words can it be a valid key?

cm0002 ,

I would hope so, sentences and words are some of the most secure passwords/phrases you can use

https://lemmy.world/pictrs/image/71426e32-a0e3-450a-9e84-be198e2b3144.png

bjorney , (edited )

Words are the least secure way to generate a password of a given length because you are limiting your character set to 26, and character N gives you information about the character at position N+1

The most secure way to generate a password is to uniformly pick bytes from the entire character set using a suitable form of entropy

Edit: for the dozens of people still feeling the need to reply to me: RSA keys are fixed length, and you don’t need to memorize them. Using a dictionary of words to create your own RSA key is intentionally kneecapping the security of the key.

laurelraven ,

That’s only really true if you’re going to be storing the password in a secure vault after randomly generating it; otherwise, it’s terrible because 1) nobody will be able to remember it so they’ll be writing it down, and 2) it’ll be such a pain to type that people will find ways to circumvent it at every possible turn

Pass phrases, even when taken with the idea that it’s a limited character set that follows a semi predictable flow, if you look at it in terms of the number of words possible it actually is decently secure, especially if the words used are random and not meaningful to the user. Even limiting yourself to the 1000 most common words in the English language and using 4 words, that’s one trillion possible combinations without even accounting for modifying capitalisation, adding a symbol or three, including a short number at the end…

And even with that base set, even if a computer could theoretically try all trillion possibilities quickly, it’ll make a ton of noise, get throttled, and likely lock the account out long before it has a chance to try even the tiniest fraction of them

Your way is theoretically more secure, but practically only works for machines or with secure password storage. If it’s something a human needs to remember and type themselves, phrases of random words is much more viable and much more likely to be used in a secure fashion.

bjorney ,

We are talking about RSA though, so there is a fixed character length and it isn’t meant to be remembered because your private key is stored on disk.

Yes the word method is better than a random character password when length is unbounded, but creating secure and memorable passwords is a bit of an oxymoron in today’s date and age - if you are relying on remembering your passwords that likely means you are reusing at least some of them, which is arguably one of the worst things you can do.

user224 ,
@user224@lemmy.sdf.org avatar

You didn’t have to call me out like that.

laurelraven ,

Okay, that’s fair… Not sure how I missed that context but that’s totally on me

Fetus ,

Most of my passwords are based around strings of characters that are comfortable to type, then committing them to muscle memory. There’s a few downsides to this:

  • If I need to log in to something on mobile and don’t have a proper keyboard with me, it’s tough to remember which symbols I’ve used
  • I share some of my logins with friends and family for certain things, if they call and need to re-enter a password, it’s usually impossible to recite it to them over the phone (most of my shared logins have reverted back to proper words and numbers to make it easier for the others)
  • If I lose an arm, I’ll probably have to reset all of my passwords.

But yeah, words alone provide plenty of possibilities. There’s a reason cryptocurrency wallets use them for seed phrases.

ClamDrinker ,

And even with that base set, even if a computer could theoretically try all trillion possibilities quickly, it’ll make a ton of noise, get throttled, and likely lock the account out long before it has a chance to try even the tiniest fraction of them

One small correction - this just isn’t how the vast majority of password cracking happens. You’ll most likely get throttled before you try 5 password and banned before you get to try 50. And it’s extremely traceable what you’re trying to do. Most cracking happens after a data breach, where the cracker has unrestricted local access to (hopefully) encrypted and salted password hashes.

People just often re-use their password or even forget to change it after a breach. That’s where these leaked passwords get their value if you can decrypt them. So really, this is a non-factor. But the rest stands.

laurelraven ,

That’s fair

It’s still a rather large pool to crack through even without adding more than the 1000 most common words, extra digits, minimal character substitution, capitalization tweaks, etc

possiblylinux127 ,

That’s why you need lots of words. (6) If you combine that with a large word list it gets very secure.

JackbyDev ,

Good luck remembering random bytes. That infographic is about memorable passwords.

bjorney ,

You memorize your RSA keys?

sus ,

you memorize the password required to decrypt whatever container your RSA key is in. Hopefully.

bjorney ,

Sure but we aren’t talking about that

sus ,

I think this specific chain of replies is talking about that actually… though it is a pretty big tangent from the original post

bjorney ,

“can you string words to form a valid RSA key”

“Yes this is the most secure way to do it”

“No, it’s not when there is a fixed byte length”

-> where we are now

sus ,

the direct chain I can see is

“can you string words to form a valid RSA key”

“I would hope so, [xkcd about password strength]”

“words are the least secure way to generate random bytes”

“Good luck remembering random bytes. That infographic is about memorable passwords.”

“You memorize your RSA keys?”

so between comments 2 and 3 and 4 I’d say it soundly went past the handcrafted RSA key stuff.

Jtotheb ,

Sounds like a good point, but claiming that “Words are the least secure way to generate a password 84 characters long” would be pointless.

sus ,

and some people will try to just hold a key down until it reaches the length limit… which is an even worse way to generate a password of that length

prole , (edited )

Edit: Oops forgot what the topic was.

bjorney ,
  1. we are talking about RSA keys - you don’t memorize your RSA keys
  2. if you rely on memorizing all your passwords, I assume that means you have ample password reuse, which is a million times worse than using a different less-secure password on every site
prole ,

Derp. Forgot where I was.

I find passphrases easy to remember and I have several. I appreciate the concern, but I understand basic password safety.

shrugs ,

so you are saying 44 bits of entropy is not enough. the whole point of the comic is, that 4 words out of a list of 2000 is more secure then some shorter password with leetcode and a number and punctuation at the end. which feels rather intuitive given that 4 words are way easier to remember

bjorney ,

No im saying if your password size is limited to a fixed number of characters, as is the case with RSA keys, words are substantially less secure

intensely_human ,

Not if you’re considering security gained versus difficulty of remembering.

bjorney ,

You don’t memorize RSA keys

raspberriesareyummy ,

you are at the same time right, but … wooosh.

intensely_human ,

character N gives you information about the character at position N+1

There is no point in a password cracking attempt during which the attacker knows the character at N but not the character at N+1

bjorney ,

If you know the key is composed of English language words you can skip strings of letters like “ZRZP” and “TQK” and focus on sequences that actually occur in a dictionary

Fillicia ,

The part where this falls flat is that using dictionary words is one of the first step in finding unsecured password. Starting with a character by character brute force might land you on a secure password eventually, but going by dictionary and common string is sure to land you on an unsecured password fast.

possiblylinux127 ,

That’d why words are from the eff long word list and there are 6 words

SatyrSack ,

Even if an attacker knew that your password was exactly four words from a specific list of only 2048 common words, that password would still be more secure than something like Tr0ub4dor&3

www.explainxkcd.com/…/936:_Password_Strength

Fillicia ,

If the attacker search for your password specifically then xkcd themself posted the reason why it wouldn’t really matter

www.explainxkcd.com/wiki/index.php/538:_Security

If you’re doing blind attemps on a large set of users you’ll aim for the least secured password first, dictionary words and known strings.

14th_cylon ,

No, it would not. 2048 to the power of 4 is significantly less than 60 to the power of 11.

[www.wolframalpha.com/input?i2d=true&i=Power2048%…

Zangoose ,

That’s true but in practice it wouldn’t take 60^11 tries to break the password. Troubador is not a random string and all of the substitutions are common ( o -> 0, a ->4, etc. ). You could crack this password a lot easier with a basic dictionary + substitution brute force method.

I’m saying this because I had an assignment that showed this in an college cybersecurity class. Part of our lesson on password strength was doing a brute force attack on passwords like the one in the top of the xkcd meme to prove they aren’t secure. Any modern laptop with an i5 or higher can probably brute force this password using something like hashcat if you left it on overnight.

Granted, I probably wouldn’t use the xkcd one either. I’d either want another word or two or maybe a number/symbol in between each word with alternating caps or something like that. Either way it wouldn’t be much harder to remember.

14th_cylon ,

Troubador is not a random string

except it is not troubador. it is troubador, ampersand, digit.

if you know there are exactly two additional characters and you know they are at the end of the string, the first number is really slightly bigger (like 11 times)

once the random appendix is 3 characters or more, the second number wins

[www.wolframalpha.com/input?i2d=true&i=DividePowe…

and moral of the story is: don’t use xkcd comic, however funny it is, as your guidance to computer security. yes, the comic suggestions are better than having the password on a post-it on your monitor, but this is 21st century ffs, use password wallet.

sus , (edited )

if you know there are exactly two additional characters

this is pretty much irrelevant, as the amount of passwords with n+1 random characters is going to be exponentially higher than ones with n random characters. Any decent password cracker is going to try the 30x smaller set before doing the bigger set

and you know they are at the end of the string

that knowledge is worth like 2 bits at most, unless the characters are in the middle of a word which is probably even harder to remember

if you know there are exactly two additional characters and you know they are at the end of the string, the first number is really slightly bigger (like 11 times)

even if you assume the random characters are chosen from a large set, say 256 characters, you’d still get the 4-word one as over 50 times more. Far more likely is that it’s a regular human following one of those “you must have x numbers and y special characters” rules which would reduce it to something like 1234567890!?<^>@$%&±() which is going to be less than 30 characters

and even if they end up roughly equal in quessing difficulty, it is still far easier to remember the 4 random words

ClamDrinker , (edited )

While this comic is good for people that do the former or have very short passwords, it often misleads from the fact that humans simply shouldn’t try to remember more than one really good password (for a password manager) and apply proper supplementary techniques like 2FA. One fully random password of enough length will do better than both of these, and it’s not even close. It will take like a week or so of typing it to properly memorize it, but once you do, everything beyond that will all be fully random too, and will be remembered by the password manager.

cheeso ,

then someone uses a dictionary attack and your password gets cracked within minutes

sus , (edited )

this assumes a dictionary is used. Otherwise the entropy would be 117 bits or more. The only problem is some people may fail to use actually uniformly random words drawn from a large enough set of words (okay, and you should also use a password manager for the most part)

shrugs ,

see, you didn’t get the whole comic. 4 words out of a dicitionary with 2000 words has more combinations then a single uncommon non gibberish baseword with numeral and puction at the end. as long as the attacker knows your method.

a dicitonary attack will not lower the entropy of 44 bits, thats what the comic is trying to say

dohpaz42 ,
@dohpaz42@lemmy.world avatar
hendrik ,

It's assymetric crypto. You'd need to find a matching public key. Or it's just some useless characters. I suppose that's impossible, or what we call that... Like take a few billion years to compute. But I'm not an expert on RSA.

slazer2au ,

Public keys are derived from the private key. The asymmetric part is for communication not generation. Afaik

hendrik , (edited )

I'm pretty sure the cryptographic parameters to generate a public key are included in the private key file. So while you can generate the other file from that file, it's not only the private part in it but also some extra information and you can't really change the characters in the private key part. Also not an expert here. I'm fairly certain that it can't happen the other way round, or you could impersonate someone and do all kinds of MITM attacks... In this case I've tried it this way, changed characters and openssh-keygen complains and can't generate anything anymore.

kamenlady ,
@kamenlady@lemmy.world avatar

The surprised man in the middle

possiblylinux127 ,

Reddit did it in reverse for Tor

ShortFuse , (edited )

Yeah, except for the first few bytes. PKCS8 has some initial header information, but most of it is the OCTET_STRING of the private key itself.

The PEM (human “readable”) version is Base64, so you can craft up a string and make that your key. DER is that converted to binary again:


<span style="font-style:italic;color:#969896;">/**
</span><span style="font-style:italic;color:#969896;"> * @see https://datatracker.ietf.org/doc/html/rfc5208#section-5
</span><span style="font-style:italic;color:#969896;"> * @see https://datatracker.ietf.org/doc/html/rfc2313#section-11
</span><span style="font-style:italic;color:#969896;"> * Unwraps PKCS8 Container for internal key (RSA or EC)
</span><span style="font-style:italic;color:#969896;"> * @param {string|Uint8Array} pkcs8
</span><span style="font-style:italic;color:#969896;"> * @param {string} [checkOID]
</span><span style="font-style:italic;color:#969896;"> * @return {Uint8Array} DER
</span><span style="font-style:italic;color:#969896;"> */
</span><span style="font-weight:bold;color:#a71d5d;">export </span><span style="color:#323232;">function privateKeyFromPrivateKeyInformation(pkcs8, checkOID) {
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">const </span><span style="color:#323232;">der </span><span style="font-weight:bold;color:#a71d5d;">= </span><span style="color:#323232;">derFromPrivateKeyInformation(pkcs8);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">const </span><span style="color:#323232;">[
</span><span style="color:#323232;">    [privateKeyInfoType, [
</span><span style="color:#323232;">      [versionType, version],
</span><span style="color:#323232;">      algorithmIdentifierTuple,
</span><span style="color:#323232;">      privateKeyTuple,
</span><span style="color:#323232;">    ]],
</span><span style="color:#323232;">  ] </span><span style="font-weight:bold;color:#a71d5d;">= </span><span style="color:#323232;">decodeDER(der);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(privateKeyInfoType </span><span style="font-weight:bold;color:#a71d5d;">!== </span><span style="color:#183691;">'SEQUENCE'</span><span style="color:#323232;">) </span><span style="font-weight:bold;color:#a71d5d;">throw new </span><span style="color:#0086b3;">Error</span><span style="color:#323232;">(</span><span style="color:#183691;">'Invalid PKCS8'</span><span style="color:#323232;">);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(versionType </span><span style="font-weight:bold;color:#a71d5d;">!== </span><span style="color:#183691;">'INTEGER'</span><span style="color:#323232;">) </span><span style="font-weight:bold;color:#a71d5d;">throw new </span><span style="color:#0086b3;">Error</span><span style="color:#323232;">(</span><span style="color:#183691;">'Invalid PKCS8'</span><span style="color:#323232;">);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(version </span><span style="font-weight:bold;color:#a71d5d;">!== </span><span style="color:#0086b3;">0</span><span style="color:#323232;">) </span><span style="font-weight:bold;color:#a71d5d;">throw new </span><span style="color:#0086b3;">Error</span><span style="color:#323232;">(</span><span style="color:#183691;">'Unsupported PKCS8 Version'</span><span style="color:#323232;">);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">const </span><span style="color:#323232;">[algorithmIdentifierType, algorithmIdentifierValues] </span><span style="font-weight:bold;color:#a71d5d;">= </span><span style="color:#323232;">algorithmIdentifierTuple;
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(algorithmIdentifierType </span><span style="font-weight:bold;color:#a71d5d;">!== </span><span style="color:#183691;">'SEQUENCE'</span><span style="color:#323232;">) </span><span style="font-weight:bold;color:#a71d5d;">throw new </span><span style="color:#0086b3;">Error</span><span style="color:#323232;">(</span><span style="color:#183691;">'Invalid PKCS8'</span><span style="color:#323232;">);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">const </span><span style="color:#323232;">[privateKeyType, privateKey] </span><span style="font-weight:bold;color:#a71d5d;">= </span><span style="color:#323232;">privateKeyTuple;
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(privateKeyType </span><span style="font-weight:bold;color:#a71d5d;">!== </span><span style="color:#183691;">'OCTET_STRING'</span><span style="color:#323232;">) </span><span style="font-weight:bold;color:#a71d5d;">throw new </span><span style="color:#0086b3;">Error</span><span style="color:#323232;">(</span><span style="color:#183691;">'Invalid PKCS8'</span><span style="color:#323232;">);
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(checkOID) {
</span><span style="color:#323232;">    </span><span style="font-weight:bold;color:#a71d5d;">for </span><span style="color:#323232;">(</span><span style="font-weight:bold;color:#a71d5d;">const </span><span style="color:#323232;">[type, value] </span><span style="font-weight:bold;color:#a71d5d;">of </span><span style="color:#323232;">algorithmIdentifierValues) {
</span><span style="color:#323232;">      </span><span style="font-weight:bold;color:#a71d5d;">if </span><span style="color:#323232;">(type </span><span style="font-weight:bold;color:#a71d5d;">=== </span><span style="color:#183691;">'OBJECT_IDENTIFIER' </span><span style="font-weight:bold;color:#a71d5d;">&& </span><span style="color:#323232;">value </span><span style="font-weight:bold;color:#a71d5d;">=== </span><span style="color:#323232;">checkOID) {
</span><span style="color:#323232;">        </span><span style="font-weight:bold;color:#a71d5d;">return </span><span style="color:#323232;">privateKey;
</span><span style="color:#323232;">      }
</span><span style="color:#323232;">    }
</span><span style="color:#323232;">    </span><span style="font-weight:bold;color:#a71d5d;">return </span><span style="color:#0086b3;">null</span><span style="color:#323232;">; </span><span style="font-style:italic;color:#969896;">// Not an error, just doesn't match
</span><span style="color:#323232;">  }
</span><span style="color:#323232;">
</span><span style="color:#323232;">  </span><span style="font-weight:bold;color:#a71d5d;">return </span><span style="color:#323232;">privateKey;
</span><span style="color:#323232;">}
</span>

I wrote a “plain English” library in Javascript to demystify all the magic of Let’s Encrypt, ACME, and all those certificates. (Also to spin up my own certs in NodeJS/Chrome).

github.com/…/privateKeyInformation.js#L40

Edit: To be specific, PKCS8 is usually a PKCS1 (RSA) key with some wrapping to identify it (the OID). The integers (BigInts) you pick for RSA would have to line up in some way, but I would think it’s doable. At worst there is maybe a character or two of garbage at the breakpoints for the RSA integers. And if you account for which ones are absent in the public key, then anybody reading it could get a kick out of reading your public certificate.

MehBlah ,

It the length not the content for the most part. Some keys have syntax such as leading or trailing characters.

Towerofpain11 , to lemmyshitpost in Most important map

In Australia I’m pretty sure it’s “Streets”.

Kusimulkku ,

Streets Ahead

abbadon420 ,

Stop trying to coin that phrase, Pierce

profoundninja ,

Coined and minted.

SeattleRain , to greentext in Anon notices

Dogs need more maintenance and care. Men are just naturally more caring.

Shou ,

Dogs tolerate a lot. Cats set clear boundries. Men just naturally don’t care about other people’s boundries. /s

gnutard ,

WE’RE ALL GOOD PEOPLE

SeattleRain , to greentext in Anon notices

Families and children prefer dogs.

SonicBlue03 , to lemmyshitpost in Most important map

Wall’s Ice Cream. Good Humor in the US.

lars ,

Thank you. And wow.

Etterra ,

I can’t remember ever having Good Humor (branded) that didn’t come off of an ice cream truck back when I was a kid.

harrys_balzac , to science_memes in The stages of understanding evolution

The creationists who are antivaxxers, anti-abortion, pushing Christianity to be the official religion in government, want Bible studies as part of school curriculum, brlieve the Earth is 6000 years old, climate change deniers?

Those creationists?

yesman OP ,

Yea, all that stuff seems pretty trivial compared to the damage of eugenics, forced sterilizations, and genocide. Ya know, Social Darwinism?

Kraiden ,

And you think think Christo-fascists aren't into all that because...

cygnus , to linuxmemes in -----BEGIN PRIVATE KEY-----
@cygnus@lemmy.ca avatar

Replying to a 10-year-old tweet is a power move in itself.

Aggravationstation , to lemmyshitpost in Most important map

Very interesting. Does anyone know if it’s a case of them buying out local brands in a country, trying to make their brand sound like a local one or a mix of the two?

AllNewTypeFace ,
@AllNewTypeFace@leminal.space avatar

IIRC, they bought out local companies, and gradually replaced their branding with the corporate standard.

Bezier ,
@Bezier@suppo.fi avatar

Not sure about the others, but Ingman used to be a local brand.

ChilledPeppers ,

From what ive heard, their original name was bought when they moved to their second country so they just use whatever name, altho I have no source for that

Hegar , to lemmyshitpost in Most important map
@Hegar@fedia.io avatar

In NNY it's called momcorp.

flicker ,

On the Moon, we have Momazon.

Toes , to lemmyshitpost in shræmp

This is a Gura approved message.

OhFudgeBars , to pics in American toad

such froge

much hopping

wow

shield_gengar , to insanepeoplefacebook in Jimmy Corsetti shows his wisdom once again.
@shield_gengar@sh.itjust.works avatar

Should I know who this is?

FlyingSquid OP ,
@FlyingSquid@lemmy.world avatar

No. A crazy man who says a lot of crazy things and gets on shows like Rogan’s.

shield_gengar ,
@shield_gengar@sh.itjust.works avatar

Sounds good ty. Honestly, curating your online experience reduces anxiety, by a lot.

norimee , to cat in He demands the munch

Oh my god! Didn’t you see him starving!?!

recursive_recursion ,
@recursive_recursion@programming.dev avatar
credo , to science_memes in The stages of understanding evolution

But why not put the labels at the bottom of the chart?

Tlaloc_Temporal ,

Big letters are more likely to catch your eye and be read easily, while all letters are more likely to be garbled by image compression. It’s well adapted behavior.

Lizardking27 , to greentext in Anon notices

What’s going on here is OP is making a lot of baseless generalizations.

  • All
  • Subscribed
  • Moderated
  • Favorites
  • random
  • lifeLocal
  • goranko
  • All magazines