Kaliski, Bart

Bart was born in New York in the 1960s. ^{[ when? ]} . He was the eldest of five children. His parents were teachers: father in business education, mother in science. From the earliest times, education occupied a critical part in his family. While still a boy, Bart helped his father write a doctorate: he calculated the results of a questionnaire for his dissertation. He and his father often visited the university where he taught. Bart spent a lot of time reading books and self-training, he liked to read scientific books and was especially interested in computers. When he was 11, he designed an electrical circuit powered by a 110 volt network and won a school science contest. This circuit was a series of switches connected respectively to a series of electric lamps. He described it as a method of computer communication.

When Bart was a young man, his family lived in Manchester , New Hampshire , and he attended the Manchester Central High School. He was still interested in computers and learned to program on the PDP-11 at school. His math teacher provided him an invaluable service, giving him more knowledge than ordinary school lessons could give. He studied self-taught assembler and did interesting things, such as writing a game of chess on a computer.

Bart was a member of the math club, chess club and bowling club. He mowed lawns in the summer, was fond of the Star Trek , distributed newspapers. His father often took Bart on campaigns in the White Mountains and in the cinema. But almost every second day after school, he preferred to work on his computer programs at school.

Bart spent a lot of time at computers, learning how to program them. This prepared him for study and career. As a teenager, he had a job at a grocery store. He bought a car, but later realized that a lot of the money that he earned went to its maintenance. Therefore, he used it only when he needed to get to work. Then he quit the grocery store and sold the car. This allowed him to devote more time to computers. At first it was difficult, he did not understand them, but he was full of enthusiasm and determination. It was his calling, he wanted to reveal his potential. And his attempts were rewarded.

Uncle Bart graduated from the Massachusetts Institute of Technology (MIT), and Bart was shocked by his uncle's technical knowledge. From a young age, Bart wanted to study at MIT.

He entered MIT and received a basic computer education , and then concentrated on cryptography . His parents paid a lot of attention to Bart's teaching activities. In their opinion, it is necessary to constantly study something for the mind to work and develop. Bart himself has been fond of secret codes ever since he heard about computers. He was also fond of number theory , partly fueled by his uncle's interest in mathematics. This is probably why, after the second year at MIT, Bart decided to develop in the field of cryptography.

In his second year, he read about the discovery of prof. Ron Rivest in RSA cryptography . Bart asked Ron to supervise his undergraduate work, and Rivest agreed.

While in the magistracy, Bart was a member of several public organizations. He was an activist in some religious groups, other interests were related to this. His religious interests at that time intersected strongly with his technical work ^[1] .

Bart later found out about Dennis Bronsted , who worked in cryptography at the National Bureau of Standards . In January 1983, Bart asked him to work a week for free, and Brent gave him such an opportunity. This entailed work in the summer, and then, in the end, the next three diplomas led by Rivest and work in the field of cryptography.

Kaliski defended his undergraduate, graduate and doctoral studies at MIT in computer science, where he focused mainly on cryptography in his research.

Bart began his career at RSA, which was created at MIT in the 1980s, where he was the company's first scientist and helped create RSA Laboratories in 1991, later renamed RSA Security .

In 2006, when EMC Corporation acquired RSA Security, Kaliski became Director of EMC Innovation Network. He coordinated the development of the widely used public key standards. He then led the IEEE P1363 standard development team, covering key points of public key encryption . Bart led the advisory board of the Encyclopedia of Cryptography and Security , as well as the CRYPTO conferences in 1991 and 1997, and the Cryptographic Hardware and Embedded Systems conference in 2002 ( Cryptographic Hardware and Embedded Systems ).

Later, Kaliski was a visiting professor and member of the international advisory board of the School of Software and Microelectronics at the University of Beijing ( English Peking University's School of Software and Microelectronics ). He is also a member of the deliberative board of the RSA Conference and Honorary Trustee of the Massachusetts Technology Leadership Council . He was one of 11 winners of the New England Business and Technology Award in 2003. Kaliski is a member of the IEEE Computer Society .

• 2007 “Integrity check for large files” ^{[2] The} verification considered in this paper is used to verify the integrity of large files, such as archives. It can be used for use with semi-trusted online storage services to ensure that information has not been corrupted or altered.
• 2006 “Mathematics of cryptosystems using the RSA algorithm with a public key” ^[3] In this paper, Bart described the mathematical aspects of the RSA algorithm with a public key.
• 2006 "The state of security of small business in the electronic economy" ^[4]
• 2005 “Verification for two-server authentication” ^[5] Since many servers store the password in the clear, when attacking them, a lot of information will be lost. For this, 2 or more servers are used, on which parts of the password are stored. This work focuses on a secure authentication protocol using 2 or more servers.
• 2003 “A new method of two-server authentication with a short key” ^[6] This paper presents a new method for storing and protecting short keys. This method does not require any cryptographic calculations from clients and can be implemented very quickly.
• 2002 “On the security of RSA encoding in a TLS connection” ^[7] In this work, shown at the CRYPTO '02 conference, his team, drawing on the previously shown, examined vulnerabilities in RSA encoding in a TLS connection. They considered an alternative pseudo-random function. The result was extended to a wide class of designs: the so-called. mechanisms for encapsulating labeled keys.
• 2002 “On hash firewalls in signature schemes” ^{[8] The} security of such firewalls depends on the assurance of the verifier that the same hash function was applied during signing. Some schemes involve adding unique identifiers for each hash function and increasing security. However, as Kaliski shows in this paper, there are “weak” hash functions that may be the target of hacking algorithms. In this work, Bart describes not only an attack on “weak” hash functions, but also demonstrates a new attack, the purpose of which may even be “strong” hash functions.
• 2001 An unknown key-share attack on the MQV key agreement protocol.
• 2000 Server-assisted generation of a strong secret from a password.
• 1999 Efficient finite field basis conversion involving dual bases.
• 1999. Emerging standards for public-key cryptography. Lectures on Data Security: Modern Cryptology in Theory and Practice.
• 1998 Storage-efficient finite field basis conversion.
• 1988 Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools. Ph.D. Thesis, MIT / LCS / TR-411, MIT.