Tag Archives: Crypto

Steganography: from its origins to the present

Steganography: from its origins to the present

The term steganography refers to a technique that aims to hide communication between two interlocutors. The term is composed precisely of the Greek words στεγανός (covered) and γραφία (writing). Unlike encryption, which allows you to encrypt a message so as to make it incomprehensible if you do not have a key to decipher it, steganography aims to keep the very existence of the message away from prying eyes, by hiding it. The origins Traces of steganography already existed in ancient Greece, when Herodotus narrated two examples in his Stories, but the first recorded use of the term was in 1499 by Johannes Trithemius in his Steganographia, a treatise on cryptography […]

War and cryptography: the challenge of quantum communication

War and cryptography: the challenge of quantum communication

Message encryption has always been a very important tool within the military, stretching back to the time of the ancient Greeks to the present day. It is natural for two armies in war to seek information about each other, both to learn about enemy strategies before battle, as well as to discover its movements during it. In order to obtain this information, “cryptoanalysis” was born, that is the study of decrypting encrypted messages without knowing their encryption key. It is easy to assume that if an army, through cryptoanalysis, manages to decipher the enemy’s communications, it can gain a fundamental strategic advantage. To be precise, it must be specified that […]

ON THE CONDITION NUMBER OF THE VANDERMONDE MATRIX OF THE nTH CYCLOTOMIC POLYNOMIAL

ON THE CONDITION NUMBER OF THE VANDERMONDE MATRIX OF THE nTH CYCLOTOMIC POLYNOMIAL

Edoardo Signorini is an undergraduate student who is currently working on various projects in Telsy, while writing his thesis about the “Post Quantum Cryptography”. Furthermore, he also published his work together with two professors of the Polytechnic of Turin, Carlo Sanna and Antonio Jose’ Di Scala, as a part of the amazing job that he is doing within the Company. Following the abstract: Recently, Blanco-Chac´on proved the equivalence between the Ring Learning With Errors and Polynomial Learning With Errors problems for some families of cyclotomic number fields by giving some upper bounds for the condition number Cond(Vn) of the Vandermonde matrix Vn associated to the nth cyclotomic polynomial. We prove […]

Telsy’s Engineer Andrea Molino spoke at the National Cryptography Association

Telsy’s Engineer Andrea Molino spoke at the National Cryptography Association

Telsy is proud to cooperate with the National Cryptography Association. On 14 October 2019, a member of our team, Eng. Andrea Molino, gave a speech at the event ”La De Cifris incontra Torino”, organized by De Componendis Cifris, or National Cryptography Association,and held at Politecnico in Turin. The event focused on successful advancements in cryptography research and applications. The initiative involved several experts from academic institutions and business operating in the cryptography sector. The main goal was fostering cooperation between those who work in the Italian crypto domain. The contribution given by Andrea, finally, dealt with implementation aspects of cryptography. He underlined: “security architecture and schemes cannot ignore hardware systems […]

Seminar – “An introduction to secure multi – party computation”

Seminar – “An introduction to secure multi – party computation”

Telsy seminar of Giuseppe D’Alconzo entitled : ‘’ An introduction to secure multi – party computation’’ The seminar, organized with The Polytechnic University of Turin, will be held on Monday 15 July at 14.30 PM in Polytechnic’s Aula Buzano – Dipartimento di Scienze Matematiche Abstract: Secure Multi Party Computation (MPC) is a branch of cryptography that allows a set of players to evaluate a public function on private inputs, revealing no information about them apart from the computed output. It is an alternative to the strong assumption of the existence of a trusted party. It was born in the 1980s as a theoretical and not so treatable field for its computational […]

Utilizzando il sito, accetti l'utilizzo dei cookie da parte nostra. maggiori informazioni

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.

Close