What is the name of this Ravenloft adventure?

When I started playing Dungeons & Dragons, it was in second edition, Ravenloft Campaign.

I remember playing an adventure where it was a small village in the snow, where a werewolf was killing villagers, and the innkeeper was a vampire. I really can’t remember the name of the adventure or the module, but it was an official Ravenloft module, can someone help me? I wanted to try to buy that module in second hand, I remember it has several adventures.

What is the name of this Ravenloft adventure?

In DnD, does the idea of a check with multiple DCs make sense or have a name?

For example, say a character is placed in a supernaturally hot environment, requiring a constitution save with the following result table:

16+: no effect 10-15: 1d6 fire damage ...9: 1d6 fire + 1 exhaustion point 

This would have 2 DCs- 10 and 16. Is there a name or precedent for something like this? Or just “multiple DCs”?

The Certificate’s CN name does not match the passed value

Each time I teach a network course and we attempt to create and use self signed certificates with the Windows 10 SSTP client we encounter the dreaded “The Certificate’s CN name does not match the passed value” error message

The ca and server certificates are created, signed and trusted We then select the server certificate in the SSTP server settings and export the ca certificate for the Windows PC: https://gyazo.com/10e785b7c51a17572bf40ee85ff744e1

Initially we would specify the sstp (server) router’s IP address as the server CN, and set “ca” as the ca’s CN but recently I have noticed that Windows only accepts the ca if its CN also corresponds to this same IP

We import the certificate on the Windows PC: https://prnt.sc/r7bkhe

Configure the Windows SSTP client : https://gyazo.com/72a61e75c37ed38fdc633b5914729865

And then connect : https://gyazo.com/b034fa2de61f0c33cc665549521d6f52

I assume that the problem lies with Windows but I can’t seem to find where the issue is

Any suggestions ? regards yann

Name of binary encoding scheme for integer numbers

I once found on Wikipedia a nice technique for encoding $ k \in (2^{n-1}, 2^n)$ uniformly distributed integer numbers with less then $ \log_2n$ average bits/symbol, thanks to a simple to compute variable length code. Basically it used $ \log_2n$ for some symbols and $ \log_2n – 1$ for some others.

Unfortunately all my Googling has failed me. I recall something similar to “variable length binary”, but I keep ending on VLQ which are a different beast. Since I know your memory better than mine, can you help me?

Name of ‘smart brute force’ attack against sequential cipher lock [duplicate]

I remember learning about an attack against sequential cipher locks – ones that don’t have a ‘reset’ or ‘enter’, you just enter digits and as soon as the last n consecutive entries match, the lock opens. So, if the code is ‘1234’, the sequence ‘32431234’ will work just fine.

The attack depends on a specific sequence that appends such digits that the resulting ‘tail’ of the string is as new as possible.

Let’s take for example a 3-digit binary lock. The possible codes are 000, 001, 010, 011, 100, 101, 110, 111. To try all 8 codes in standard brute force attack, you’d enter 24 digits total.

But instead, entering sequence 0001110100, 10 digits total, you cover all combinations and unlock the lock – generating sequences: 000, 001, 011, 111, 110, 101, 010, 100, each new digit past first 2 generating a new code.

For the good of me, I can’t recall the name of the sequence used for this sort of attack.

Name for a Ceasar Cipher that uses random offsets?

In a traditional Ceasar Cipher you pick a specific offset such as “plus three” so that to encrypt each character of a message you count three letters up from the input and to decrypt you count three letters down from the input. For example, “APPLE” would become “DSSOH” where D is A+3, S is P+3, and so on.

I saw a variant of this where the key is used as the seed of a random number generator instead of a constant offset, and those random offsets are then used to encode the message. This has the advantage that the same input characters are not mapped to the same output characters. For example my RNG might generate a sequence of 3 7 5 0 2, so then “APPLE” would become “DWULG” where D is A+3, W is P+7, U is P+5, etc.

Since the random number generator is deterministic, you can re-seed the RNG with the original key and generate the same random sequence to decode.

Is there a specific name for this type of cipher?

MySQL 5.7 – Calling procedure with dynamic name

I’m trying to write a MySQL (5.7) procedure that dynamically calls another procedure based on the one of its inputs.

The code I came up with so far is this (procedure_exists works for checking whether or not the function is available):

CREATE PROCEDURE process_event (IN event_type VARCHAR(32), IN aggregate_id CHAR(36), IN payload JSON) BEGIN     DECLARE handler_name VARCHAR(38) DEFAULT CONCAT('handle', event_type);      IF procedure_exists(handler_name) THEN         SET @handler_sql = CONCAT('CALL ', handler_name, '(?,?)');          PREPARE prepared_statement FROM @handler_sql;          SET @aggregate_id = aggregate_id;         SET @payload = payload;          EXECUTE prepared_statement USING @aggregate_id, @payload;     END IF; END; 

This doesn’t work however, because I keep getting

[0A000][1336] Dynamic SQL is not allowed in stored function or trigger

From what I understand, disallowing that by default makes perfect sense, but from what I’ve gathered there seems to be no way of opting in to theoretically less secure behavior, by allowing certain types of statements or disabling the check altogether.

Do you have any suggestions for getting this to work?

In short the question boils down to this:

Can I somehow have a procedure to which I pass event_type (VARCHAR(32)), aggregate_id (CHAR(36)) and payload (JSON) which will then automatically call handle{event_type}(aggregate_id, payload) if it exists?

Finding out if the name is encrypted and finding the encryption algorithm

I’m new to security field. I have a website. Whenever I upload a photo to the website that, for example, its name is 123 with the format of .jpg, its name seems to turn to string like this f408KFcUb+k=. The address for reaching this image will be something like this:

https://example.com?imgID=f408KFcUb%2bk%3d

If I upload the same photo again, its name will turn to another string on the website.

It seems that the name is being encrypted or encoded, Am I right? If so, is there any way to find out what encryption algorithm is being used for encrypting the names of the files?

What is the name of the data structure that is a tree on the backend but has a list like API?

I’m looking for the name of a data structure. It is organized like a balanced tree. The elements need not be comparable. Instead of asking if the tree contains a thing (like you would with a collection of comparables), you can query for any k’th element in logarithmic time. You can insert before or after any k’th element. So the API is a bit like a list, except all operations are logarithmic.

I think “rope” might be similar but those seem to be restricted to strings only. It could be thought of as a segment tree, where every leaf has a weight of 1, but instead of storing the weights in the leaves the entry itself is stored.