Transcript<\/strong><\/p>\nKristin Lauter: As mathematicians, our approach is to think hard about the problems we\u2019re trying to solve and figure out the best algorithms that we know for solving them. So, if I wasn\u2019t before, then I firmly became, an algorithmic number theorist when I came into cryptography.<\/p>\n
(Music plays)<\/strong><\/p>\nHost: You\u2019re listening to the Microsoft Research Podcast, a show that brings you closer to the cutting edge of technology research and the scientists behind it. I\u2019m your host, Gretchen Huizinga.<\/strong><\/p>\nFrom ancient hieroglyphics to secret decoder rings, to World War II enigma code-makers and code-breakers, cryptography has always held a particular fascination for us. But few of us have the skills \u2013 or can actually do the math \u2013 to unlock the mysteries of encrypted data. Fortunately, Dr. Kristin Lauter, distinguished mathematician, founder of the Women in Numbers Network, and Principal Researcher and Researcher Manager for the Cryptography Group at Microsoft Research, can. And she\u2019s using her powers for good, not for evil.<\/strong><\/p>\nToday, Dr. Lauter tells us why she feels lucky to do math for a living, explains the singular beauty of elliptic curves, and the singular difficulty of supersingular isogeny graphs, talks about how homomorphic encryption \u2013 part of the field of Private AI \u2013 allows us to operate on, while still protecting, our most sensitive data, and shares her dream of one day seeing a Grace Hopper-like conference to celebrate women in mathematics. That and much more on this episode of the Microsoft Research Podcast.<\/strong><\/p>\n(Music plays)<\/strong><\/p>\nHost: Kristin Lauter, welcome to the podcast today. It\u2019s great to have you with us.<\/strong><\/p>\nKristin Lauter: Thank you so much. Nice to be here.<\/p>\n
Host: So, you\u2019re a Principal Researcher and the Research Manager for the Cryptography Group at Microsoft Research, where you apply number theory and algebraic geometry to cryptography.<\/strong><\/p>\nKristin Lauter: That\u2019s right. Well, I\u2019m one of the lucky ones to have such a great job to be able to spend my life researching the things that I love. So, I was very lucky to find the opportunity to come to my Microsoft and apply the mathematics that I had learned in graduate school and worked on as an assistant professor at the University of Michigan to work in the exciting area of cryptography.<\/p>\n
Host: So, tell us a little bit more about the general field of cryptography. We\u2019ve got mostly high-tech listeners who are probably familiar a bit. But I think there\u2019s room for a little bit of an overview of the field. What is cryptography about, and why is it important?<\/strong><\/p>\nKristin Lauter: So, cryptography is essential in today\u2019s economy for securing our e-commerce and our cloud, and all of our online presence and interactions. So, the tools that cryptography provides are for encryption, which provides confidentiality for data while it\u2019s being stored or transmitted. But also, authentication so that you know when you\u2019re interacting with a party online that they\u2019re actually the party that they say that they are, so you\u2019re actually buying something from the vendor that you think you\u2019re buying from rather than from somebody else. So there\u2019s a whole infrastructure around cryptography that we use in industry and government that\u2019s very important for securing our interactions.<\/p>\n
Host: So, it\u2019s all about being able to share information and not have somebody that shouldn\u2019t have that information get it.<\/strong><\/p>\nKristin Lauter: That\u2019s right. So public key cryptography is the science of interacting publicly and ending up with something that\u2019s secret. So, the exciting thing for me is, is that number theory is basically the foundation for public key cryptography. So, the way public key cryptography works is that there\u2019s hard number theory problems that are used as the basis of security for these public key interactions. So that includes key exchange, encryption, digital signatures.<\/p>\n
Host: So, let\u2019s talk about your specific work right now. And you\u2019re known for several things in the field. And one of them is elliptic curve cryptography. So, what is it, why is it important, and how has it impacted the field?<\/strong><\/p>\nKristin Lauter: Well, I was very excited when I came to Microsoft to work on elliptic curve cryptography. It had been proposed around 1985, but it was not yet being used, widespread, in the industry in 1999 when I came to Microsoft. And I worked for my first about 5 years here on kind of evangelizing the technology and working with another researching in my team, Peter Montgomery, to develop our elliptic curve cryptography code and to optimize things and to make it work for different platforms. And that was a very exciting entr\u00e9e for me into the industry, because I got to learn, through interacting with product groups, what was really needed and how things work, and I got to work on real-world problems that had a very real mathematical bent. So, I got to go to the office of top executives and have them freak out when they found out they were having a meeting on elliptic curve cryptography. And I got to, you know, file patents where I was explaining elliptic curve technology to lawyers, who were listening intently and trying to understand. So, it was really fun.<\/p>\n
Host: Can you take a minute to explain it to our audience?<\/strong><\/p>\nKristin Lauter: Sure. So elliptic curves are a very beautiful object which have been studied in mathematics for more than 100 years. They\u2019re actually a curve, so they have a geometric aspect to them. They have a shape in some sense. But they also have a group structure, an algebraic structure, that allows you to take two points on the curve and add them together. And it\u2019s this group structure that you need, and use, in cryptography to create these public key crypto systems.<\/p>\n
Host: Now I understand it just slightly better than I did before. One of the other things you\u2019re known for is your work in supersingular isogeny graphs. Tell us the story about how you came to introduce it as a hard problem in cryptography.<\/strong><\/p>\nKristin Lauter: Well, that was a really lucky and great coincidence. With some collaborators, a post-doc and a visiting researcher that were here at Microsoft Research with me, we were working on even a more complicated object, a higher-dimensional version of supersingular isogeny graphs. And this was in 2005 when there was a lot of hype around the NIST hash function competition. So MD5 had been broken, and it was clear that there was going to be a new hash function selected. And so, there were a lot of ideas kind of swirling in the air. And we were working on these objects and realized, \u201cWow! Walking around on supersingular isogeny graphs could potentially be a really hard problem.\u201d And just because it was new, and that\u2019s what we do, we\u2019re mathematicians, we think about cryptographic problems and how hard they are, proposing new ones, attacking current ones, improving algorithms, we thought, \u201cOh, well, since we can\u2019t figure out any way to break it, why don\u2019t we propose this as a hard problem?\u201d And we proposed a hash function to go along with it and presented it at the NIST hash function competition. So, it was really fun to find out, just a few years ago, that interest in this proposal has resurfaced because of the current post-quantum cryptography competition, where we need all kinds of new ideas from mathematics to create new crypto systems for which we don\u2019t currently know polynomial-time quantum algorithms. And since this was a new system that we had proposed, and no one has come up with polynomial-time quantum algorithms yet, it\u2019s under serious consideration for standardization as a post-quantum technology.<\/p>\n
(Music plays)<\/strong><\/p>\nHost: So, let\u2019s talk a little bit about what I think is, like, the most interesting thing in your career right now, and that\u2019s homomorphic encryption. It\u2019s a pretty big deal for a lot of reasons. Tell us what it is, what\u2019s different about it, and why it\u2019s important in an AI world?<\/strong><\/p>\nKristin Lauter: So, homomorphic encryption allows to compute on encrypted data, so this is a very important breakthrough. Standardized crypto, today, that\u2019s in widespread use, such as block ciphers, like AES, or other types of ciphers like stream ciphers\u2026 If you take two encrypted texts and, kind of, try to operate on them, add them together or do something with them, you\u2019ll get just gibberish. So homomorphic encryption preserves the mathematical structure underlying the cipher texts. And that allows us to actually operate on them. As mathematicians, we can think of cipher texts as just being these mathematical objects, and we can do operations that correspond to circuits, which is how computers, you know, compute on information. And we can make it so that you can do things like machine-learning algorithms, doing predictions and training models, and doing all kinds of exciting things to allow what we call Private AI.<\/p>\n
Host: Unpack that a bit more. Private AI is an interesting term, and I think it\u2019s super important in an AI world and the largeness of what we\u2019re doing with machine learning. How does that Private AI come into play?<\/strong><\/p>\nKristin Lauter: Well, the AI world that we\u2019re living in, we\u2019re collecting more and more data, and we\u2019re improving our ability and our algorithms for processing that data. But as we do that, we\u2019re putting our privacy at risk in the sense that there could be very sensitive data being collected. For example, our health information, genomic information, financial information. Private AI is a set of tools which can be used to handle data in a private way, and yet still provide AI services on top of it.<\/p>\n
Host: So, you\u2019re able to compute and operate on encrypted data?<\/strong><\/p>\nKristin Lauter: That\u2019s exactly right. So, for example, for the first time, we can collect encrypted information from a customer, and they may want to learn from that data in some way, get some business intelligence or get some prediction. And what we can do with homomorphic encryption is we can handle those computations in encrypted form. So, the client or the customer can encrypt their data and keep their key and never share their key with us, but share the encrypted data with us and ask for some prediction. And then we can give them this prediction by operating on their encrypted data, and what we\u2019re doing is we\u2019re giving them an encrypted prediction. So, we don\u2019t learn their data or their prediction. And then we return it to them, and they can use their key to decrypt it. So, the information is never decrypted while we have access to it.<\/p>\n
Host: That just seems wild to me, even trying to wrap my brain around how that can happen. I\u2019m impressed by you people. That\u2019s incredible.<\/strong><\/p>\nKristin Lauter: Well, that\u2019s the reaction that we get from a lot of customers and potential partners that we talk to, that its somehow a magic box. But from a mathematical perspective, it\u2019s very natural. What you\u2019ve done is, you\u2019ve put the information into a structured, mathematical form, and then you\u2019re operating on it. And as long as you do it in a way that preserves that structure of that data to begin with, as you operate on it, you continue to preserve that structure, and it\u2019s just mathematics. And that\u2019s the beauty of mathematics.<\/p>\n
Host: It is. It\u2019s a beautiful thing. Let\u2019s drill in on a couple of homomorphic stories, as you called them the other day. Um\u2026 These must be the kinds of stories mathematicians tell their kids at bedtime. You framed one of the stories about healthcare and genomic privacy, and you called it one of the most motivating things in your whole career. So, tell us about that.<\/strong><\/p>\nKristin Lauter: Well, another lucky coincidence in my career was that, as we started to make homomorphic encryption more practical, there was a genomics researcher here at Microsoft Research, David Heckerman, that said, \u201cHey, I bet you can do genomic predictions using your technology.\u201d And so we worked together with him and his group to show doing live genomic predictions using homomorphic encryption. And based on that, I started getting invited to a whole series of meetings that I would never have gone to otherwise, biological data science at Cold Spring Harbor, for example, where I met the iDASH organizers who are funded by NIH to run the secure genome analysis contest. So, I got involved in a whole community of people in bioinformatics and biostatistics that are interested in protecting genomic data for patients for the future. And this is something that I found just really inspiring, to be working on something such as health and genomic privacy, which I feel is so important for society, and for which we have mathematical tools that can be helpful.<\/p>\n
Host: Right. So, tell me the story about iDASH, and how that all played out with this homomorphic encryption.<\/strong><\/p>\nKristin Lauter: So, when I first met the iDASH organizers, it was at the Cold Spring Harbor meeting. And I was doing a tutorial on homomorphic encryption and talking about some of the sample tasks we\u2019d been able to show were possible with our practical homomorphic encryption techniques. And those included edit distance and chi-squared statistics. And so, when they ran their secure genome analysis contest the first year, they picked those as some of the tasks. And we actually won the edit distance track of that competition. And I used to joke that it was really funny, because we had an unfair advantage since they picked a task we had already been working on. But we developed a really great relationship with the iDASH organizers and the rest of the community. It\u2019s an international community of teams from industry and academia who work to solve these challenges each year and them come together in a workshop to share each others\u2019 solutions. And the powerful thing about this model for advancing the state of the art is that, okay, we call it a competition, but that\u2019s a little bit beside the point. The point is really to work collaboratively on these challenges in a fixed time frame, and to produce results which can provide benchmarks that show how possible certain tasks are with homomorphic encryption today.<\/p>\n
Host: I love that. In fact, my brain is just going 1,000 directions right now. Everything you say gives me another question in my mind. How else is this playing out, the homomorphic encryption? Does it have other applications that you think would be interesting research threads for people?<\/strong><\/p>\nKristin Lauter: Absolutely. So, I like to say, when I talk about genomic privacy, that it\u2019s an area where we absolutely need that interdisciplinary work to make progress. So, we\u2019re working together, mathematicians, computer scientists, working with machine-learning researchers, biostatisticians, even medical practitioners and engineers, and policymakers to bring this all together to provide solutions. So that\u2019s a very exciting area to be working in now.<\/p>\n
(Music plays)<\/strong><\/p>\nHost: So, you said in a talk several years ago, \u201cMy vision of the future,\u201d \u2013 I\u2019m quoting you \u2013 \u201cMy vision of the future is that all data would be stored in the cloud in encrypted form.\u201d And then you kind of laughed and admitted that there were some problems with cryptographic cloud storage. So where are we now? Fast forward several years. Do you remember saying that?<\/strong><\/p>\nKristin Lauter: Yes, and I\u2019m still working towards that vision, and<\/strong> I still believe in it. So, I believe that \u2013 well, first of all, we already know, today, that encryption is a very important technology for protecting people\u2019s data. And we like to say that you can protect data in transit, at rest, and while you\u2019re trying to compute on it. And the standardized cryptography that we use today can help you protect the data while it\u2019s being stored. And what homomorphic encryption can do, is to help you protect it in encrypted form, but still retain the utility of the data and be able to compute on it. So, I\u2019m still working toward that vision. I believe in it. I believe we\u2019re going to get there.<\/p>\nHost: What are your biggest challenges to getting there?<\/strong><\/p>\nKristin Lauter: Well, homomorphic encryption is a relatively new technology in the sense that it\u2019s only 10 years old. So that might sound like it\u2019s in the stone age when we think of how fast technology evolves these days. But typically, for public key crypto systems over the last 40, 50 years, there have been roughly at least a 10-year time lag before crypto technologies get adopted. And that\u2019s because the community needs to have time to think about how hard these problems are, and to set the security levels appropriately, and to standardize the technologies. So, we\u2019re just getting to that point now where, kind of, almost 10 years after the first solutions were introduced, we\u2019ve put together a broad coalition of researchers in industry, government and academia, to come together to try to standardize this technology. And we\u2019re having our second workshop in March at MIT, where we\u2019re going to try to get broad approval for our standard document, which recommends security parameters. So that\u2019s the first challenge, is getting everyone to agree on what is the strength of these systems, kind of, essentially, how hard are these mathematical problems underneath, and then we plan to continue to build on that with this community, to get agreement on a common set of APIs, for example, for how we can deploy this technology in the industry and have systems be interoperable, and to work on a rich set of applications with the applications community.<\/p>\n
Host: That\u2019s really important, getting the standards in place and then moving forward as a group rather than just a bunch of individual agents that…<\/strong><\/p>\nKristin Lauter: That\u2019s right. And it also helps to build the public trust in the technology.<\/p>\n
Host: Yeah, and that brings up a question in my mind. With the exponential growth of technological devices and abilities, do new things sort of show up on your doorstep in the encryption world, and you say, \u201cOh, got to think of that.\u201d I mean, how much does the onward push of technology impact what you\u2019re trying work on in terms of standardizing and getting a lid on it?<\/strong><\/p>\nKristin Lauter: So, there\u2019s always kind of new events that come in that can be disruptive. But as mathematicians, our approach is to think hard about the problems we\u2019re trying to solve and figure out the best algorithms that we know for solving them. So, if I wasn\u2019t before, then I firmly became, an algorithmic number theorist when I came into cryptography. And what we do is we try to estimate the running time for the algorithms that will break the crypto systems we\u2019re proposing. And then we see, for example, how these algorithms evolve over time, how much we can improve them in different ways, and we estimate the running times for the future security of these systems. And so even though there can be disruptive events that come in, when we have a community of mathematicians working on these problems over time, we think we understand relatively well what their security will be in the future at least, say 10, 15 years into the future.<\/p>\n
Host: Right, beyond that, who knows? So, you\u2019re a mathematician first, and you\u2019ve got an amazing CV and are truly an inspiration. In fact, I\u2019ve actually been told you have fans, like people find out you\u2019re going to be someplace, and they say, I\u2019m going to that. So, talk about how you caught the math bug and how it\u2019s affected your own life.<\/strong><\/p>\nKristin Lauter: Well, I loved math from a very early age. So, I used to do math problems in the car with my dad when I was young, so story problems. And I just loved it. And I guess it was always very clear to me that that was something that was fun and that I was apparently good at. So, I was allowed to work ahead in school on my own, and I just kind of zoomed through the curriculum and I graduated from high school when I was 15, and I went to the University of Chicago. So, I was very lucky to get into their undergraduate program and then to be encouraged to go to graduate school there. So, as a career, I have found that it has much more importance and applications than what people realize. The mathematical community is \u2013 people sometimes don\u2019t realize that their kids can go into math and have a fabulous career in industry and in all kinds of areas. And so I try to spread that message as well.<\/p>\n
Host: And I imagine that there\u2019s a lot of new applications, career-wise, for mathematics now even than there were 10 years ago, given what\u2019s going on in the high-tech world.<\/strong><\/p>\nKristin Lauter: Yeah, so there\u2019s a lot of areas where, kind of, math is underappreciated, because it\u2019s not called by that name. For example, machine learning. Machine learning is the foundation of AI. Machine learning is just mathematics. But it\u2019s mostly computer scientists that are doing it these days. And so, I\u2019m in an interesting position, being a mathematician working in the computer science research lab, because I have access to great researchers on both sides, and it\u2019s really fun to see. But it can sometimes be frustrating to see the lack of communication or crossover between the fields.<\/p>\n
Host: Yeah. In fact, even as I think about it, I\u2019m not sure how big the overlap is between computer science and math, because you\u2019d think if you go into computer science, it\u2019s heavily mathematics-based. But, if you\u2019re a mathematician, you\u2019re not necessarily a computer scientist.<\/strong><\/p>\nKristin Lauter: Absolutely. And even as an undergraduate at the University of Chicago, I was struck by the fact that some of the interesting mathematics was actually being picked up and taught in the computer science department, because they realized even at that time, which was many years ago now, in the \u201880s, that this mathematics was very important. It was the foundation for things like cryptography, which computer science students study. And so they were teaching this interesting mathematics in the computer science department, which was frustrating to me because I said, \u201cHey, we should be teaching this to undergraduates in math departments.\u201d And I still feel that way. I still feel we should be doing more cryptography in math departments. We should be doing more machine learning, more \u2013 these are fun areas that students love to learn. They\u2019re very motivating for students.<\/p>\n
(Music plays)<\/strong><\/p>\nHost: Tell us about your involvement as a fellow in the Association for Women in Mathematics and your work as a cofounder in Women in Numbers Network.<\/strong><\/p>\nKristin Lauter: Well, I will not lie to you. There\u2019s still a lot of challenges for women to face in science in our society, and in particular in mathematics and computer science. And I found that creating the Women in Numbers Network, which is a research network for women in number theory, gave me a huge boost in my career. What we did was to bring together all of the, kind of, leading women that we knew in number theory and asked them to kind of work together with us to design research projects that students and post docs could come and work on, collaboratively at a conference. So that was our first conference in 2008 called the WIN Conference. And we\u2019ve built on it from there to build up the WIN Network. And the WIN Network consists of now more than 200 women in number theory. And we have regular conferences. We publish volumes of research papers. So, we\u2019ve published around 50 research papers in number theory. Each paper written by a group of women number theorists, anywhere from four to seven number theorists. And this has been a really fun environment to get involved in. Because as the young women come into this network and see that they can contribute, and that they\u2019re valued, they get inspired, and they start to help lead the effort and organize the conferences. And so, we now have kind of a whole generation of women in WIN that work together to support each other and do research together and have fun together.<\/p>\n
Host: So, how is that, then, reaching out to say the next generation of women in mathematics or number theory or computer science? Do you have any evangelical efforts for your organization?<\/strong><\/p>\nKristin Lauter: Absolutely. So, what happened for me is that when I saw the excitement that this model generated \u2013 we call it the WIN model \u2013 I thought, this is too good to be true. We need to spread this model to other areas of mathematics. Because for decades, we\u2019ve had pipeline issues and kind of the \u201cleaky pipeline\u201d issue of women leaving the profession at different stages. And so we still have somewhere between 5 to 10 percent women faculty at the top research universities. And that\u2019s a number that is way too low. When I visit math departments today, I like to say, \u201c30 percent. That\u2019s the number you\u2019re shooting for. Get to 30 percent female faculty, and from there, you can get to 50 percent.\u201d Because of course, we should be at 50\/50. And we find that when we have more women faculty, that that encourages more women students as well. But the WIN model was obviously a powerful tool for advancing this vision. And so what I did was I decided to get involved in the AWM, the Association for Women in Mathematics, which is an almost 50-year-old professional society, with somewhere around 5,000 members, and to try to bring this idea and this model into the AWM. And I became president of the organization, and during that time, we got an NSF grant for $750,000 to spread this model to the other areas. And now we\u2019re in year three of the grant, and so far, we\u2019ve created almost 20 research networks for women in mathematics. So, the other networks are not as old as WIN, so they don\u2019t have as many researchers. But each of those networks probably has at least around 50 women researchers in their area. So that represents a huge boost for women in research and math.<\/p>\n
Host: Is this international, or is it in the United States, or how does it spread globally?<\/strong><\/p>\nKristin Lauter: It is international. For example, for WIN, we have a whole \u2018nother series of conferences called WINE, which is Women in Numbers in Europe. And I particularly like that acronym, WINE.<\/p>\n
Host: I\u2019m going. I\u2019m not even in numbers, but I like wine.<\/strong><\/p>\nKristin Lauter: It\u2019s fun. And so there\u2019s a series of WIN conferences in Europe. But in each of these networks \u2013 for example, Women in Topology is co-organized by a woman in Europe \u2013 There\u2019s a number of people from around the world that both attend and take part in these research conferences that also help to organize them.<\/p>\n
Host: So, Kristin, Grace Hopper is a conference that\u2019s for women in technology. How is it impacting the field for women in general, and what else can you tell us about what we might be thinking for the future of women in technology?<\/strong><\/p>\nKristin Lauter: What I really like about Grace Hopper is it helps to celebrate the achievements of women in computer science. It helps to generate excitement and confidence for younger women in the field. And it serves as a recruiting platform for high-tech to attract the top talent in computer science. So, what I really wish is that we had a Grace Hopper conference for women in mathematics as well. And so hopefully we\u2019ll get there. But that pipeline is so important that at the undergraduate level, we\u2019ve got so much talent in young women going into science. And we just need to support them and motivate them to continue in the field and show that there are great career paths where they can really make a difference and have an impact in the world.<\/p>\n
Host: So, maybe it\u2019ll be the Kristin Lauter Conference for Women in Mathematics.<\/strong><\/p>\nKristin Lauter: I don’t know about that, but I think that Grace Hopper is a great achievement, and I hope that we can spread that model to other fields.<\/p>\n
Host: I love this so much. SO much. So, tell me what brought you to Microsoft Research, and why might others in your field want to come here?<\/strong><\/p>\nKristin Lauter: When I first came to Microsoft, I couldn\u2019t believe how great the research environment was. Everybody had their doors open, and people actually cared about what I worked on. So, when I had my first meeting where I had to explain elliptic curve cryptography to lawyers, and they had a video camera set up and they were videotaping me, I said, \u201cI\u2019ve got to have it. This is what I want to do.\u201d But I also really like the interdisciplinary nature of it. Clearly, coming from a math background and working with computer scientists was very exciting. But also, the opportunity to have a real-world impact. So, to talk to our product teams, to talk to customers, to learn what their problems are and how we can help solve them, has been a really exciting and rewarding aspect of my career here.<\/p>\n
Host: What would you say to aspiring researchers, especially to women, who might want to get into this field and take up the research baton and run with it?<\/strong><\/p>\nKristin Lauter: I would say I think it\u2019s a very rewarding career. And coming to Microsoft Research as, for example, an intern or a visitor, is a great way to kind of get your foot in the door and test the waters. You can see if you like the kind of fast-paced, collaborative environment. And my experience is that most interns that come to my group in the summer, the answer is, yes, they love it. They\u2019re more productive than when they\u2019re just working by themselves, and they\u2019re inspired by the challenging problems and seeing all the great people around them doing great research.<\/p>\n
Host: Yeah, yeah. So, it\u2019s obvious what gets you up in the morning. Ummm\u2026 Is there anything that keeps you up at night in your field? Because I mean, there\u2019s a lot of things to keep us up at night.<\/strong><\/p>\nKristin Lauter: Nothing really keeps me up at night. But…<\/p>\n
Host: I keep other people up at night\u2026<\/strong><\/p>\nKristin Lauter: I would say that I\u2019m particularly motivated to help make change for women in society and in science. I think that there\u2019s a great place for women to help us solve our challenges in science. And I\u2019m particularly disturbed by the low numbers that we still see for women in scientific careers, so that\u2019s the problem I\u2019d like to solve.<\/p>\n
(Music plays)<\/strong><\/p>\nHost: That\u2019s a good problem to solve. Kristin Lauter, thank you so much for sharing your passion with us, and taking time out of your schedule to come be on the podcast today.<\/strong><\/p>\nKristin Lauter: Thank you. It was a great pleasure talking with you.<\/p>\n
(Music plays)<\/strong><\/p>\nHost: To learn more about Dr. Kristin Lauter, and the not-so-secret world of computer cryptography, visit Microsoft.com\/research<\/a><\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"Episode 19, April 11, 2018 – Dr. Lauter tells us why she feels lucky to do math for a living, explains the singular beauty of elliptic curves and the singular difficulty of supersingular isogeny graphs, talks about how homomorphic encryption allows us to operate on, while still protecting, our most sensitive data, and shares her dream of one day, seeing a Grace Hopper-like conference to celebrate women in mathematics.<\/p>\n","protected":false},"author":37074,"featured_media":479178,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"msr-url-field":"https:\/\/player.blubrry.com\/id\/33086058","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","footnotes":""},"categories":[240054],"tags":[],"research-area":[13561,13556,13546,13558],"msr-region":[256048],"msr-event-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-impact-theme":[],"msr-promo-type":[],"msr-podcast-series":[],"class_list":["post-478605","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-msr-podcast","msr-research-area-algorithms","msr-research-area-artificial-intelligence","msr-research-area-computational-sciences-mathematics","msr-research-area-security-privacy-cryptography","msr-region-global","msr-locale-en_us"],"msr_event_details":{"start":"","end":"","location":""},"podcast_url":"https:\/\/player.blubrry.com\/id\/33086058","podcast_episode":"","msr_research_lab":[199565],"msr_impact_theme":[],"related-publications":[],"related-downloads":[],"related-videos":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-events":[],"related-researchers":[],"msr_type":"Post","featured_image_thumbnail":"","byline":"","formattedDate":"April 11, 2018","formattedExcerpt":"Episode 19, April 11, 2018 - Dr. Lauter tells us why she feels lucky to do math for a living, explains the singular beauty of elliptic curves and the singular difficulty of supersingular isogeny graphs, talks about how homomorphic encryption allows us to operate on,…","locale":{"slug":"en_us","name":"English","native":"","english":"English"},"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/478605"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/users\/37074"}],"replies":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/comments?post=478605"}],"version-history":[{"count":4,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/478605\/revisions"}],"predecessor-version":[{"id":485682,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/478605\/revisions\/485682"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/479178"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=478605"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/categories?post=478605"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/tags?post=478605"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=478605"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=478605"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=478605"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=478605"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=478605"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=478605"},{"taxonomy":"msr-promo-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-promo-type?post=478605"},{"taxonomy":"msr-podcast-series","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-podcast-series?post=478605"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}