CyberCampus Aka Le Village d’Asterix

https://www.nolimitsecu.fr/campus-cyber/

EPITA

CAPP GEMINI

THETRIS

YESWEHACK

GATEWATCHER

BNP

CREDIT MUTUEL

HERMES

ARCELOR

Futurs projets locaux :

Attendons cyberCampus II au vert en IDF

-Hauts de France

-Rhône Alpes

-Pays de Loire

-Bretagne (traitement des données sensibles)

Pas galerie marchande mais showroom, boîte à PoCs => je n’y crois pas trop …

https://pastebin.com/0RLZuSa9

Allez hop, soyons fou, j’ai trouvé ce jour un exemplaire de Flottes de Combat 2008. Recherche les années 1918 à 1924 et 1927 … et puis on sera pas mal

Flottes de Combat 2008

[SNAFU] When commenting out the ssl/tls config part in my my.cnf file [client] part I can see « mysql traffic » while logged whith a user that does not require SSL => OK

When activitating ssl/tls part config I can’t see anymore « mysql traffic » when logging in whith a user that does not require SSL/TLS => weird, no ?

image capture wireshark mariaDB

No ! After somme times and a few searches

une pincée de sel ?

Juste besoin de cet execellent passage de Wikipedia (20200401)

RSA (Rivest–Shamir–Adleman) is one of the first public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and distinct from the decryption key which is kept secret (private). In RSA, this asymmetry is based on the practical difficulty of factoring the product of two large prime numbers, the « factoring problem« . The acronym RSA is the initial letters of the surnames of Ron Rivest, Adi Shamir, and Leonard Adleman, who publicly described the algorithm in 1977. Clifford Cocks, an English mathematician working for the British intelligence agency Government Communications Headquarters (GCHQ), had developed an equivalent system in 1973, which was not declassified until 1997.^[1]

A user of RSA creates and then publishes a public key based on two large prime numbers, along with an auxiliary value. The prime numbers must be kept secret. Anyone can use the public key to encrypt a message, but only someone with knowledge of the prime numbers can decode the message.^[2] Breaking RSA encryption is known as the RSA problem. Whether it is as difficult as the factoring problem is an open question. There are no published methods to defeat the system if a large enough key is used.

RSA is a relatively slow algorithm, and because of this, it is less commonly used to directly encrypt user data. More often, RSA passes encrypted shared keys for symmetric key cryptography which in turn can perform bulk encryption-decryption operations at much higher speed.

A few basics about RSA (Rivest – Shamir – Adleman) cryptography encryption and decryption in java. Just for comparison with what we habitually do with openSSL without understanding any command 🙂

Check it online.

Reminder : RSA is an Asymmetric encryption technique that uses two different keys as public and private keys to perform the encryption and decryption. With RSA, you can encrypt sensitive information with a public key and a matching private key is used to decrypt the encrypted message. See details on RSA Cryptosystem on Wikipedia.

Public and private keys generation using KeyPairGenerator and asymmetric encryption and decryption with these keys.

https://github.com/bcgit

https://github.com/anishnath/crypto-tool

https://github.com/jaysridhar/java-stuff

How to Generate RSA Keys in Java

A l’occasion du forum des métier du numérique qui se tiendra à Saint-Malo le samedi 7 mars 2049, j’ai dépoussiéré ce vieil article d’il y a 3 ans : http://www.laurentmarot.fr/wordpress/?p=3737

D’ailleurs, il est grand temps que j’y aille 🙂

Forum IUT Saint Malo 2019