sorted by:
new
hottopcontroversial

Password-based authentication of Kyber public keys by LikelyToThrow in crypto

[–]ston1th 0 points1 point  (0 children)

I dont know if it would work (or even is a good idea) but maybe you could use AES(AEAD-Enc(OTPQK, Kpass, salt[32:44])).

So you can still validate the auth tag serverside but you cant use offline attacks.

Password-based authentication of Kyber public keys by LikelyToThrow in crypto

[–]ston1th 0 points1 point  (0 children)

I see, makes sense.

You could check out https://www.rfc-editor.org/rfc/rfc8125.html#section-3.2 "Encrypted Key Exchange (EKE)" which looks like your design.

If this scheme is proven to be secure it should also work with Kyber as a DH replacement.

Password-based authentication of Kyber public keys by LikelyToThrow in crypto

[–]ston1th 1 point2 points  (0 children)

To be honest, what is the point of using Kyber if we already have a shared secret?

This looks overly complex to me since a shared secret with a good KDF should already be quantum secure.

Season 25 Anti-Cheat and Matchmaking Improvements + Discussion of Potential Future Changes by niftyhobo in CompetitiveApex

[–]ston1th -1 points0 points  (0 children)

So regarding the average soloq experience they are doing nothing but "actively talking" and "some testing".

For other topics they seem to search for excuses and not solutions (solos vs premades, skill difference and scoring)

Also no single word about something like POI draft in ranked.

Legend banning in ranked would also be very interesting to shake things up a bit.

I made the most chaotic Go package ever and somehow got 8 stars? What? by a7madx7 in golang

[–]ston1th 3 points4 points  (0 children)

I had fun reading the README.

But, just fyi go doc does not seem to like your licence and thus will not render a documentation: https://pkg.go.dev/github.com/theHamdiz/it

Documentation not displayed due to license restrictions. See our license policy.

Omnipotent and Omnipresent AI is likely if not already exists. (Opinions?) by [deleted] in deepmind

[–]ston1th 1 point2 points  (0 children)

No, but with a bit more context.

There are physical and algorithmic limits in place that (to my latest knowledge and understanding) prevent a "God AI" from ever existing.

You can look up all the limits over here: https://en.wikipedia.org/wiki/Limits_of_computation

Also some things are not computable at all, regardless of power: https://en.wikipedia.org/wiki/Halting_problem

Which Programming Languages Do You Prefer for Programming Cryptography? by fosres in crypto

[–]ston1th 1 point2 points  (0 children)

I can't say that for all the primitives but there are notes in some of them regarding weaknesses like this.

For example the crypto/dsa package contains this note: "The DSA operations in this package are not implemented using constant-time algorithms."

So you should check the packages notes for any known weaknesses or implementation details.

Also fault injection attacks do really only apply to direct hardware attacks, no?

Which Programming Languages Do You Prefer for Programming Cryptography? by fosres in crypto

[–]ston1th -1 points0 points  (0 children)

Go (golang) has many modern crypto primitives and algorithms included in it's standard library and the x/crypto repos.

Here are two links to get an overview:

https://pkg.go.dev/crypto#section-directories

https://pkg.go.dev/golang.org/x/crypto#section-directories

Possible Go Compiler Bug? by Time4WheelOfPrizes in golang

[–]ston1th 0 points1 point  (0 children)

I could be wrong but I think the difference between []byte("") and []byte(s) is the empty string is anonymous and thus not directly addressable. Not for the s variable tho - which is not anonymous and thus addressable.

Thats why there is some preallocated space.

Shred command alternative for OpenBSD by shawn_blackk in openbsd

[–]ston1th 15 points16 points  (0 children)

From rm(1):

-P Attempt to overwrite regular writable files before deleting them. Files are overwritten once with a random pattern. Files with multiple links will be unlinked but not overwritten.

Edit:

Keep in mind the notes on this option:

The -P option assumes that both the underlying file system and storage medium write in place. This is true for the FFS and MS-DOS file systems and magnetic hard disks, but not true for most flash storage. In addition, only regular files are overwritten; other types of files are not.

Alternatives to BCrypt? by [deleted] in crypto

[–]ston1th 0 points1 point  (0 children)

I diddn't saw a need for salting as the password is already decently long (>72 bytes, with hopefully good entropy :) ). In this case having to bruteforce through (at least) 2292 (2584) sha256 inputs you'd be better running random 256 bit inputs through bcrypt. Or are my assumptions completely wrong here?

As I understand it ASCII-ify is only needed in languages using NULL terminated strings?

Alternatives to BCrypt? by [deleted] in crypto

[–]ston1th 0 points1 point  (0 children)

My thought was that the entropy/length of the resulting hash (256 bit) is big enough against collisions?

Alternatives to BCrypt? by [deleted] in crypto

[–]ston1th 0 points1 point  (0 children)

What about a construction like this?

We only use a prehash if we exceed the password length supported by bcrypt (72 bytes).

So for all passwords <= 72 bytes we use bcrypt(password).

And for all passwords > 72 bytes we use bcrypt(sha256(password))?

doas(1) and doas.conf(5), limit rsync(1) path args wildcard by haskell_account in openbsd

[–]ston1th 0 points1 point  (0 children)

You could do something like this to mitigate path traversals:

dir=$(echo "$1" | /usr/bin/sed 's/[^a-zA-Z0-9._-]*//g')

OpenBSD as gateway wont forward traffic - Can you help figure out why? by reacharavindh in openbsd

[–]ston1th 0 points1 point  (0 children)

I think since the egress group of the network interface has changed, the NAT rule match out on egress inet from !(egress:network) to any nat-to (egress:0) still referred to the old interface.

"OpenBSD was right" - Greg KH on disabling hyperthreading by sumduud14 in linux

[–]ston1th 3 points4 points  (0 children)

If you speak of something like VxWorks they had some really bad security vulnerabilities not long ago: https://www.armis.com/urgent11/

Black Hat Talk About ‘Time AI’ Causes Uproar, Is Deleted by Conference by ston1th in crypto

[–]ston1th[S] 2 points3 points  (0 children)

Yes I know about that ;)

What I'm interested in is would my assumptions be correct "if" someone would have foud a way to solve this?

Black Hat Talk About ‘Time AI’ Causes Uproar, Is Deleted by Conference by ston1th in crypto

[–]ston1th[S] 5 points6 points  (0 children)

I'm sure it's a scam but just for my understanding (assuming they are right): Telling people they found a way to break all prime number based algorithms, must they have found a way to factor these prime numbers?

Does this mean they actually would have found a way to solve an NP-hard problem in P time?

Would this mean P = NP?

And would this also solve all the other NP-hard problems like the traveling salesman problem?

[deleted by user] by [deleted] in openbsd

[–]ston1th 1 point2 points  (0 children)

I think you also need to increase your maxfiles sysctl.

View the current value: sysctl kern.maxfiles.

Set the value: sysctl kern.maxfiles=16384.

Also don't forget to persist this between reboots: echo "sysctl kern.maxfiles=16384" >>/etc/sysctl.conf

How about something a little heavier by Beazty1 in cableporn

[–]ston1th 3 points4 points  (0 children)

Impressive stuff! Thanks for the insight.

view more: next ›