Content generator : Photos : automatically rename + Retrive same freepik

Hello, Sven,

Is it possible to automatically rename the title of the photos by the inserted keywords or by a relation with the article?

Is it possible for you to select photos related to our recovery theme / article ?

Example for me, marketing
Is it possible to retrieve photos by keywords on Freepik (by indicating his account identifiers) because this site is free or almost free or other photo sites but good photos ?
thank you for a great software

RC-Code if I have a generator matrix for a specific code how do I get the distance to the dual code?

$ \mathcal{R} \mathcal{S}_{6, 3}$ and $ a_{i} \in \mathbb{F}_{11}$

G=\begin{pmatrix}1&1&1 &1&1&1\ 0&1&2 &3&4&5\ 0&1^2&2^2 &3^2&4^2&5^2 \end{pmatrix}

G=\begin{pmatrix} 1&1&1 &1&1&1\0&1&2 &3&4&5\ 0&1&4 &9&5&3 \end{pmatrix}

I now have to determine the distance to the dual code.

Any clue how to accomplish this?

Thanks for any help.

Creating a top-hat distributed random number generator

enter image description here

I have this Fortran code which generates a flat distribution as it produces a single random number centered on 0. The function GRNDM (Geant 4 random number generator) produces equally distributed random numbers between the values of 0 and 1. RDUMMY is the name of the vector filled with the random number and the argument “1” states the length of the vector: i.e. GRNDM here will produce a single random number between 0 and 1. The second line then produces random numbers in the interval [μ−σ2,μ+σ2].

I was wondering if there was a way of changing it to produce random numbers with a top hat distribution?

Why high and lower bit of generator must be 1?

Here is an excerpt from Andrew S. Tanenbaum, Computer Networks, 5th edition, Chapter 3 (The data link layer), Page 213:

enter image description here

[Both the high and low order bit of the generator must be 1.]

My question is how do you determine high order bit? And why high order bit and lower order bit, both must be one? From my understanding, it is used to detect burst error but is my understanding true?

how to send prime and generator of diffie hell-men to client over network node js?

I am using crypto module of node js for exchanging key using diffie-hellman algorithm.

server.js

const crypto = require("crypto");  const alice = crypto.createDiffieHellman(512);  const aliceKey = alice.generateKeys(); 

client.js

const bob = crypto.createDiffieHellman(alice.getPrime(), alice.getGenerator());  const bobKey = bob.generateKeys();  const aliceSecret = alice.computeSecret(bobKey);  const bobSecret = bob.computeSecret(aliceKey); 

The above example is taken from node.js documentation as shown the client uses servers prime number for generating the prime number.

my question is how should I securely send the prime number and the other parameter to client over internet? are there any other alternatives?

and another question is that I am generating keys using generate keys function but I have already generated private-key.pem and public-cert.pem file. can I use those if yes then how?, if no then what is difference between those keys?

Is it better for me to bang on the keyboard for 12 characters or use my password manager’s generator?

I use a password manager with a long rememberable master password for logging into all of my online accounts. When signing up for new accounts my password manager prompts me to generate a strong password which it then autofills. This auto generated password is a twelve character long alphanumeric string. Is there higher risk in me attempting to generate a random password by randomly pressing twelve characters on on the keyboard vs a potential flaw in the generator that would allow password discovery with some other available information (password creation time, password length, creation method)?

I know in the ideal case the password generator is far superior to my attempt to be random on the keyboard, but is my hand dropping on the keyboard so much worse that the risk of my password manager’s generator being flawed is the better of the two options? I know this might be an opinionated question so any facts, studies, or personal knowledge on this topic would be highly appreciated. I did attempt to Google this question and my searches along the lines of “password generator vs random typing” yielded no good results.

PS: Where as I don’t use them it might be cool if answers also addressed random typing vs going to Google, searching “password generator”, clicking one of the top results, and then using a web based random password generator.

How likely is for a pseudorandom number generator to generate a long sequence of similar numbers?

How likely is for a pseudorandom number generator to generate a long sequence of similar numbers? “Similar numbers” could be same numbers, or numbers from a given range.

For example, if we consider PRNG algorithm being a simple counter counting from 0 tom MAX, the distribution is uniform and there’s a guarantee of not repeating numbers in a sequence. So, not repeating numbers does not break uniformness. But probably it breaks randomness, does it? To what extent? If so, does it mean, that the better the algorithm, the less guarantee we have to not generate similar numbers in sequence?

I’m particularly interested in the answers regarding Mersenne Twister as a most popular PRNG in programming languages implementations. It’d also be great to know how things are in operating systems’ crypto-secure PRNGs – Yarrow (macOS), Fortuna (FreeBSD) or ChaCha20 (Linux).