Hi everybody, welcome to another barns takeout. Your daily serving of art. My name is Kaylyn Jewel, senior instructor in adult education at the Barnes Foundation. And today I wanted to spend some time with you all in gallery number 23 up on the second floor. This is a gallery that I have spent time chatting with you guys about. When we looked at the two cute little bird sculptures that are on top of this American chest. So this guy right here and this guy right here made by an American artist named Tom mailing in the 1940s. But what I wanted to talk about today was the big picture that hangs up above it painted in the summer of 1916 by the French artist Henri Matisse. Before we dip into it though, let's do a quick little survey of the paintings and objects that are on display on this ensemble. And what's kind of cool about it is that this ensemble that we are looking at is relatively simple when we compare it to some of the other more expansive ensembles in the collection. So from left to right we've got a painting up above by an Austrian female painter from the 1940s of a couple of dancers across a stream. Down below we have an American painting also from the 1940s of a juggler. We've got our great ensemble in the middle with Matisse's still life with gourds in the center. American objects placed in sort of a still life fashion on top of this American chest over drawers. Up above the Matisse painting is a piece of a Conestoga wagon part from the 19th century. And then if we go over to the right side of this ensemble on the other side of these beautiful windows, we can see that we've got a couple of more paintings. So the painting down below is a small picture from the 1930s by an artist named Biagio Pinto who was very closely connected to the Barnes Foundation, very good friends of Dr. Barnes. And then up above what's called a Santo or a religious image that was made by an artist in New Mexico in the 1840s. And it's an image of the Virgin of Guadalupe. So we've got this really cool smattering of objects from different time periods, different geographical locations and different subject matters, which is very much in keeping with Dr. Barnes' interest in having us look at and bring together objects that we might not normally see together in a kind of art collection. So let's zoom into our painting in the middle and spend some time looking at this Matisse picture. So here we go. As I mentioned, it was painted in the summer of 1916. It's called Still Life with Gourds. And it is a picture that was painted during an intense period of experimentation for the French artist Henri Matisse. There are a lot of Matisse pictures in the Barnes Foundation. Those of you who've been to the Barnes probably already know that there are 59 pictures in our collection by Matisse. And this is one of my personal favorites. One of the things I love about it are the colors and this kind of emphasis on the geometric organization of the picture, which seems to be a little bit at odds with what we think of, when we usually think of paintings by Henri Matisse. One of the most famous pictures that we have, probably arguably the most famous picture that we have by Henri Matisse in our collection at the Barnes is a picture called Bernard de Vieve, which we can see right here. I'm not gonna talk about it, but it is one of our most important pictures at Barnes Foundation. It was painted in 1905, 1906. And it was a painting that was deeply inspirational for other artists at the time, including a very famous artist named Pablo Picasso. And Picasso, when he saw this painting in 1906, he was so shook by it and so artistically kind of troubled by it and inspired by it that he ended up starting to create a new style of painting with a colleague of his, George Brock, called Cubism. So Bernard de Vieve was done in 1905, 1906. If we move forward into the future, into a painting that is also in gallery number 23, if we sort of turn around from our picture of still life with gourds. And it's this painting in the corner here. You can see the edge of this still life. Let's look at it more closely for just a minute. This was painted by honor Matisse in 1906,07. And so this is at a period when we know that Matisse and Picasso are sort of battling it out on the canvas. And they are trying to, in many cases, kind of outdo each other and push each other into new artistic territory. So we can see that Matisse here is using his bright color palette that we so closely associate with him, the kind of compression of space that we also love about Matisse, but also the kind of circulation of air that can kind of move around this compressed space. It's a little bit different than what Picasso was doing around the same time. So if we travel downstairs into gallery number 11 on the first floor and look at this painting above the Modigliani, it was painted by Pablo Picasso in 1914. And it's one of the kind of nice examples of Picasso's Cubist style that we have in the foundation. And it's a picture of some sheet music, a violin, and a bottle. It's hard to kind of pick that stuff out if we didn't know what the title was. We would be kind of confused as to what we're looking at. So I'm showing this to you to give you a little bit more context for why Matisse is wanting to engage with the Cubist style and the Cubist aesthetic that Picasso was so famous for kind of breaking into. So when we look at Still Life with Gord's, painted in 1916, we can see that there's sort of a, an aspect of a grid-like pattern that is formed by these vertical lines here. We've got sort of a window in the background.  The room itself is a sort of slate gray color. We don't get a sense where the wall and the floor meet. There's no kind of line that's been painted here to give us a sense of that three-dimensional space. We've got a couple of tables here, maybe three tables, this pink tabletop here, this lighter gray tabletop here, and then this darker one kind of the skew in the sort of middle ground. We've got a sculpture on one of the tables. The sculpture is in profile. We've got a bouquet of flowers in sort of a clearish green, a sort of transparent green glass vase. And then we've got the namesake of the painting, the gourds here that are on this sort of very light gray dish. It's always nice to sort of zoom in and look at these aspects. And when we look at the composition as a whole, as I mentioned, there's a sense of a grid-like pattern here, which is sort of in keeping with that idea of cubism to an extent. So if we think about what cubism is, the basic sort of understanding of cubism is that it's artists who are interested in taking the three-dimensional world around them and rendering them on a two-dimensional surface.  And so when that happens, you have a flattening of the picture plane. So no longer does the picture plane feel like it's moving back into space, but it has a sort of frontality to it as though aspects of the painting or images in the painting are starting to be pushed forward to the front of the picture plane. And we can see that here. We can see Matisse engaging with those strategies when we look at this tabletop in the foreground. Notice how the tabletop is tipped forward so that we can see what is on top of it. We're not looking at the side of the tabletop. We're looking at it tipped forward. The same is true for this pink tabletop in sort of, and where is that? Is that behind the tabletop? We were just looking at it in front of. That kind of confusion of space is another aspect of cubism. We know that Matisse himself when he is engaging in this period of experimentation was really interested in pushing himself beyond cubism. He found cubism to be sort of a frustrating point in his artistic career, something that he felt like he needed to almost conquer in a way. And it's with this painting Still Life with Gordes that he gets the sense that he's finally pushed past that cubist desire to restrict things, to restrict visual images to a kind of grid-like pattern. And so how is he doing that? When we look at this, notice how there are aspects of the painting where the color of an object and its black outline are no longer aligning with each other. We can see that most clearly in this portion of the painting here with the pink tabletop. We don't necessarily know exactly what it is that he's representing. Some kind of maybe a dish, maybe a sculpture. It's sort of unclear, but we have these black outlines and then the fields of color are sort of wrapping around it. They're not lining up here. You can see this undulating form here of the pink and then the black outline sort of going over it. But he does allow, in this part of the picture with the Gordes on the plate, he does allow those outlines to adhere to the borders of the color fields. So even within this one painting, he's using multiple visual strategies. I mean, there are a thousand ways to talk about this painting. We could spend forever talking about it. And one of the things that I always come back to with it is that it really seems to be Matisse exploring how he can free himself from the strict grid of cubism, which we sort of have in the right side of the picture and it seems to dissolve in some ways as we move over to the left side of the picture. So we know that after he's painting in this way, that Matisse ends up painting in a looser kind of freer style where he's utilizing a different kind of mixture of paint, paint that tends to be a little bit thinner. So if we turn around when we're in this gallery, so this photograph is taken as though we are standing in front of Still Life with Gordes and we've turned around and we're looking into the rest of room 23. And one of the great things about this photograph is that we can see into gallery number 19 just through the doorway. And through that doorway, we can see just the edge of a picture done in 1917 by Matisse called the Music Lesson, which is painted in a very kind of thin, almost washy-like style. The paint application is very, very thin and you can see lots of drips in the paint and it has a different kind of aesthetic feeling than we had with his pictures from the period of experimentation where he's kind of battling with Picasso in many ways. And so to kind of ramp up, one of the other interesting things about this painting and really this period of experimentation between Matisse and Picasso is that we know about 20 years later or so, Picasso paints a picture that scholars have referred to as being part of his Matisse period. So we know that not only was Picasso having a huge impact on Matisse, but Matisse was actually having a huge impact on Picasso. So this kind of artistic rivalry was really intense and something that kept both of these artists moving into new artistic territory. So when you come back to the Barnes Foundation, when we all go back, keep an eye out for Still Life with Gordes and think about it in relation to the other Matisse paintings in the collection and the other Picasso paintings in the collection because it serves as a really interesting kind of pivot point between a bunch of them. So thank you for joining me today. I hope you've enjoyed our chat about this picture. And again, this is one of many, many ways you can talk about this painting and it just happens to be the way that I like to think about it. Join us for another Barnes Takeout. Thanks, take care. I'm Tom Collins, Newbauer Family Executive Director of the Barnes Foundation. I hope you enjoyed Barnes Takeout. Subscribe and make sure your post notifications are on to get daily servings of art. Thanks for watching and for your support of the Barnes Foundation.


What is up everybody, welcome to Super Bowl week and the Fandall hurry up. I'm Brandon Godulla, managing editor at numberfire.com. Here to break down my three favorite value plays for the single game slate on Fandall for Super Bowl 56. I've got a lot of studs we want to target, so we need some values to help round out those rosters. My favorite value for this week is going to be Tyler Boyd at a salary of 8,500. Yes, there's a lot of reasons I like the primary pass catchers with Jamar Chase and T Higgins for Cincinnati, but Boyd's available at a much lower salary and yes, he has a much lower projectable ceiling, but that's alright because it's a really good match up for Boyd in the slot. He's going to play out of the slot as usual on Sunday, but there's a high probability basically guarantee that Jamar Ramsey's not going to play out of the slot. He's going to lock up with Jamar Chase and T Higgins on the outside. He's lobbying to shadow chase, I don't know if that'll happen, but the point being it's a good situation for Boyd if Ramsey is playing on the outside because, according to pro football focus, Jamar Ramsey has played the most coverage snaps from the slot out of all Rams defenders and he's allowed only 0.84 yards per coverage snap. The other Rams are at a 1.11 with the NFL average being a 1.19, so basically he's getting a league average match up and not a tough match up in the slot. CGU is almost not going to be 100% that should open up more work in the middle of the field for Boyd, who has run fittingly 83% of the available routes for the Bengals in the playoffs. My second value is a little bit of a risk, but I still think there's a path for Sony Michelle to have a strong game on Sunday. Darrell Henderson is returning, Kim Akers is still likely to play on Sunday and we're looking at what should be a hot hand approach according to head coach Sean McVeigh, which is never what you want to hear for a DFS running back. However, in the NFC Championship game, Sony Michelle carved out a really sizable role for the Rams offense, making him what I would call a risky differentiation option for the Super Bowl. Michelle had 3-4 red zone rushes, a 53% route rate against the 49ers, so if we're looking at an opportunity to prove you have the hot hand, the opportunity first should belong to Michelle, who was in on high leverage snaps in the NFC Championship. He should be more likely to have red zone work, receiving work than Akers, I don't know what Darrell Henderson's workload is going to look like coming back from his injury. So, you know, plan on having a mixing in from Henderson, from Kim Akers, but I really think that the best option out of the three running backs is going to be Michelle and he's also the lowest salaried out of the three for Sunday. My third value is going to be Van Jefferson. I sort of get why Jefferson's salary is only 7,000, but I also don't. Jefferson has the same route rate in the playoffs as Odell Beckham. Now he has generated just a 9.4% target share, which is only 3 targets per game, but it still comes with 1.3 downfield targets per game. Downfield has in the sense of 20 plus air yards in the playoffs. The 19.4 yard ADOT leading to 58 air yards per game, that's not bad for the salary at all. And last game Van actually had more air yards with 118 than Cooper Cup with 112 on 5 targets compared to Cups 14. Is that to say that Van had the better roll? No, not at all. But there's a lot of leverage on his targets. He's out there running rounds. Tyler Higby's not going to be 100% if he even plays. And like the phrase, it only takes one, is really overstated on main slates. You need more than just one, but on a single game setup, it's a lot truer. So I think that Van Jefferson is an elite boomer bust option for the Super Bowl on Sunday. That'll do it for my favorite NFL value picks for Super Bowl 56. That's of luck this weekend.


What was your question? What was the question? I said, what's it like dating Asia? Oh, what is like dating me? Yeah, like are we going on trips? Are we in spot? Oh, dating me is fine. Like what we doing? Like do they get the public pictures or they got to wait for that? Oh, you see, okay, look, so boom, this how they should go. If you a fiend, I'm going to stop there, like from the jump. I already know how to speak. Like I know how to speak my mind when it comes to niggas. I like, I like saying everything as it happened.  You can't, none of like, you cannot do that. Like for real. But other than that, like I feel like I'll be just like, I'm just a vibe. I like your best friend. So I feel like that's what like my relationship is really about. Be like a friendship.  But I like your friend. I don't judge you. I don't look down on you. I like encourage you like feel me. So they means like a blessing. Okay. Okay. So do you feel like you have a type? Yes. So what's the type? Like bro, everybody, everybody in my type. It's like everybody in my type. I don't want to be like everybody in my type. What's my type? They was rappers. The clip made me done, but there's still more to come. Make sure y'all like comment and subscribe to stay up to date with the latest talk of the town interviews.


My take was completely to look at the objective situation in the National Register of Citizens Process at the ground and it was not with any agenda and actually we did not even have much information or knowledge systems to prejudice us so we did not carry any baggage and we went with completely open minds with open doors of perception and windows open windows of enlightenment and as we spoke across spectrum of people first in Guwahati, lawyers, activists, civil society groups, individuals, journalists, then we moved into Guwalpala district, Barpenan district, Koklajhar and Bangai Gau and we travelled inside the interiors of deep interior villages and to discover basically what is happening to the National Register of Citizens Process. While we came back on the last day we were able to meet the former twice Chief Minister Prahlamanta for a long discussion and with the former Chief Minister Taran Gowai also along with other intellectuals like Professor Hiran Gohan and Mr. Bora and other local intellectuals, lawyers, etc. journalists, editors and of course we met also Akhil Gugoi social activist in the end. Briefly let me tell you very simple let us not get into the complexity of the history of Assam because it's a pre-1947 history is a complex history of part of being greater Bengal with Dhaka as the capital and larger geographical mapping. So pre-1947 it was an open border and it was a different scenario of British administration, 1905 Bengal partition etc. we are going into that. Post-1947 also we are only going to 1971 that is the tripartite accord between the Assam Assum or Assam Student Union, the state Assam government and the Raju Gandhi's communist government Delhi which made 24th midnight or 24th August 1971 as a cut of date, 24th August 1985 actually the accord was signed and 24th March midnight 1971 cut of date that is before that date after that date anybody who comes is a foreigner that is I think the basic criteria on which the national register of citizens is operating and by large I think the spectrum of the civil society including the villagers and locals including Tharan Gugoi who said actually he started the NRC process and the process slowed down after there was massive protest in Barpeta on fudging of electoral lists and elimination of names from electoral lists and then there was a police firing and some three four people died during Mr. Tharan Gugoi's regime and then the process slowed down and more committees etc. were formed. The process actually began and was spearheaded and fast tracked by the BJP led government in which our AGP is in an alliance which came to power in 2018. Of course no human being is an no human being can be treated as you know as as outside in this world when everyone is part of this world and geographically you can be located somewhere to the other and migrations are a process which is a complex process which is for thousands of years has happened it is it will continue to happen when Bangladeshis are not only in India they are also in Pakistan they are also in South Africa they are all over the place and migrations across borders are something as as as transparent and as continuous as the infinite as changing of maps the maps also change continuously Bangladesh did not exist before 1971 it was East Pakistan and before 1947 the map was different so we are also situated here in a kind of human condition which is a which is part of the location of the human human being where does the human being what is the human beings residence on earth but that is a philosophical question here the simple question is that the NRC process has been activated and it has been activated through as the report says and we have tried to make a very balanced impartial objective report it is not based on it is not based on any you know a feeling of disharmony against energy whether the BJP government or Congress government we are not involved in the political party process here we're only involved in the in the in the in the tracking down of what is happening or the mapping of what is happening in the NRC project in the ground what we found through documentary evidence and through our own objective I think as a journalist I found several cases where the mother is elderly mother is in jail and the jail is also the detention camp there are six detention camps right now Koclajar has got a women's detention camp most of the district jails have been turned into detention camps and the people have no rights business rights they don't have fundamental rights that it is the under trials and like golf or a district jail we did go and found out some information but we were not allowed to go inside but then local sources have told us which we have quoted there are 239 foreign nationals are there within course or which 195 are D voters now don't get you know confused because D voter is basically doubtful voter a doubtful voter is that keep the foreign tribunal and the and the divisional bench of the High Court there's a divisional bench of the High Court which which is the next authority you can go after your petition is rejected in the foreigners tribunal petition means that you have to prove your identity in Assam no situation is that you have to prove your identity in rest of the country some article rule 4 in the citizen rules I don't have to prove my identity if somebody have to ask me that then they have to prove my identity here they have to if the onus is on the on the accused and and there are some 16 or documents which have to be given and and then then then that system all documents have to be ratified with a foreigner's tribunal and then the foreigners if you if you don't agree or you want to go to appeal you have to go to the High Court there's a divisional bench of Judge Ujjal Burya is there I heard that Ujjal Burya has been changed because the roster system was not being applied and there was a complaint that came in Guwahati High Court also the roster system should apply as it is should be as it was the demand of the four judges justices in the Supreme Court so yesterday we heard the roster system was changed because Ujjal Burya has been changed and our new judges come which is a very significant thing because there's a lot of pressure on Ujjal Burya as much as the foreigners tribunal because they were accusations and there are controversies there are there's fear there is trauma there's insecurity I will not give you a lot of examples I will give you a couple of examples for this I just tell you that we might have three adults sons in Jaipur village in Bharatpetha and whose mother is in a deportation in jail and a father a father was an Indian citizen the three sons are Indian citizens but the mother has been declared a devotee and devotee is not foreigner devotee is that some of the documents are not correct like your school's going certificate has your age some age difference is there between a middle school or small school there's some discrepancy in the panchayat certificate some little little old technical your village name has changed a lot of people's villages name change in Assam as you would know that because the Brahmaputra flows in a very fierce manner and there is a lot of erosion over history the villages disappear and even very good records disappear even documents disappear because if your village disappears and it floods many times documents disappear so many times people move from village to village and they have new villages so their social identity and geographical identity also changes so it's a very complex and difficult thing for NRC also we think it's a very gigantic difficult and complex process and so we are not here to pass a judgment on the NRC we are going to say we are only trying to say that there are anomalies which are happening on the ground like the mother's case like like Bakhar Ali's case which has been video recorded by news click of he met us in a highway and he came and he is an underground he's highly and he is his birth certificate says 1985 birthday he's forced to make his birth certificate sign that his birth is 1970 by the police under duress and he was forced to say that his villages Bangladesh where his villages were not Bangladesh and he was declared a foreigner right for ten years he would not have rights but his mother and brother were Indians right and he's a teacher in a government school then then the police forces into in a SP office the registrar office he's forced to sign those documents where his age is changed from 85 to 70 then he goes to appeal after the appeal they get so angry apparently so angry that they declare the mother and the brother also foreigner now all three of them are under hiding because they are under hiding and they met us in hiding and they vanished into the darkness but these are this is a case which we come to us we have to verify it we're not saying that is absolutely correct case so as reporters we would say reportedly or allegedly or the claim of Bakhar Ali but at similar many many cases we have found in many many places one brother Zakir Ali is in jail family in abject poverty literally nothing in the house they cut Suparis to live mother is crying all the time daughter is dropped out of school the village is also very poor and they are in Guarpara and and they don't know what to do because losing one's identity as a citizen is one of the losses we just cannot understand it's like something else it's like it's like your everything is gone you don't belong to this country you're a no man's land so I would just say very simply in brief that a kind of a crisis is brewing in which could lead to lakhs of people or thousands of people directly affected in which there are accusations that the foreign tribunal foreigners tribunal is not completely partial that the foreigners tribunal is not completely not biased that the foreigners tribunal is not completely efficient and that there are also accusations that evidence is being punched and that evidence D is being marked against people who have voted in the past and who have voted in the future or who might vote in the future whose parents have voted your father grandfather has voted etc and it's a very difficult thing to trace all documents in some of the land documents have vanished one of the most significant things which you must notice there and I will conclude the best is that condition of women largely women are getting affected because both it's a lot let us think that let us let us accept the fact that people are getting directly impacted on Bengali speaking religious and linguistic minorities and there's no communal angle to it it is just that they are being impacted about Bengali speaking the tribals of Rajbongshis for the original inhabitants and the Rajbongshis whose language is a little Bangladeshi in their accent the Aomia also they speak is a little Bangladeshi accent and there's a language synthesis also in local level and there's a lot of differences of language also because Assam is a very complex demographically complex culturally very complex state and also it has been it has gone through impact of migration over the years before 47 of course 1947 71 war and a lot of people were given shelter and let us also accept the fact that most of India welcomed them in 71 and it was a war which India participated and all of us paid five paisa tax on postcards and there was a disease called Joy Bangla which was the inflammation of eyes where we used to take locula there was one locula eye drop and all over the country people were having eye solid eyes but nobody felt bad that Bangladeshis are here because 71 we accepted the Bangladeshis as you know as as neighbors or as part of our own geographical entities in the subcontinent before partition so women women are having great problems because one villages change more many of them because of patriarchal society anyway so they don't have birth certificates many of them don't have school certificates because they have not gone to school many of them don't even have married certificates their names change from say Khatum to Begum or after death to Beva huh or the villages change because they get married or or or their villages disappear because of erosion so when they go to testify they really don't have great documents to prove themselves so they go to the panchayat and the panchayat is the very has got legislative powers and gives a certificate according to which the village elders the neighbors the local post office man the local cop everyone will be there so yeah this girl was here she studied here we have seen her since childhood she got married here we went to her marriage that is how so much of illumination in India has done the illuminators go door to door and illuminators go to the village husband and they get a assessment key this is the village there these are people seven people in the family he's head of the family he's she's got married gone away etc or the village principal will come her she's studying her father will say he's my daughter she's my daughter so now women are really facing a lot of problem there and the huge number of women are directly implanted some even Pratik Hajjala the IS officer who has been appointed as a model officer by Supreme Court it has said that he's about a 40-50 thousand people directly employed people are saying they could move into tens of thousands and many many women are in prison one pregnant woman was put in prison whose entire family are is Indian and in in in and she she was put in prison and she was pregnant and then she came out because High Court allowed her to have a delivery and she's right now in bail in complete uncertainty uncertainty anytime she can her case is now in the Supreme Court so it's a kind of a very emotional social crisis combined with the fact that the NRC is a genuine process to identify second Hindi with Dood Ka Dood or Panika Pani kid you've identified who's a foreigner who is not a foreigner and then there is no logical basis to not deny this logic because there is a problem in Kashi in Assam and a lot of us means people and also movement had the problem that key that demographically they are getting isolated culturally they're getting dominated etc. and there is a local angst also so we have to take into consideration in a plurals democratic secular society all viewpoints so in that you point we have to take that you point that the fact that can oppose 97 71 if there are foreigners they should go back but the fact is that the NRC being such a gigantic complex and difficult task and the fact that the BJP government is there and the fact that the BJP government to many eyes and to locals and as a journalist I can say it is derived from an agenda and there seems to be an agenda and it is a agenda which locals feel is happening of say partisan behavior or prejudice or bias in which both Bengali Hindus and Bengali Muslims are getting involved in which genuine citizens might get directly impacted or in which genuine Indians might get you know emotionally and socially and politically isolated and the rights fundamental rights can be taken away which Taran Gowai has also said and which are local intellectuals are feeling I think there is a crisis situation there and one must look at it so this report is kind of a gateway to that crisis not a solution to the crisis but a gateway to the crisis in the sense in mainstream India people are not even thinking about it or talking about it that in Assam there might be a serious kind of a trauma fear mass insecurity developing thank you


China is now British Columbia's second largest trading partner. Last year, our exports to China exceeded $10 billion just from this province. People come from Shanghai to what you see behind me today, they really, they can't believe it. And they're really, it gets them excited about making an investment, creating jobs right here. I've done three visits to China since I became Premier. And one of the things I've learned is that relationships really matter. You've got to spend some, invest the time getting to know people. And once you have those relationships, it might start with wine, move to real estate, move to something else. Who knows? But that's how British Columbia creates jobs. It's by making sure that we attract investment from around the world. And you know, we've been really successful in China with lumber. We need to translate that to all the other sectors now. And I want you to know this. In British Columbia, we have a strong record and commitment to supporting business, keeping taxes low, making sure our borders are open to investment, and making sure that you can find ways to help your business grow. Because when you do that, you help yourselves. You help China and you help British Columbia as well. Thank you.


So, my name is Kelvin Watson. I am the Executive Director of the Las Vegas Clark County Library District. I've been here as Director for a little over five months. The Las Vegas Clark County Library District consists of 25 locations covering 8,000 square miles here in Southern Nevada. The changes that I made in my library system, specifically in the Rower County libraries before I came here to Las Vegas, was that we increased our cleaning staff. We also developed a schedule for the library staff, so that they could actually participate in the cleaning of physical spaces. We also used Plexiglas as other libraries around the country and retailers and others did as well. We began curbside service to our customers. What I'll say was unique about the Rower County libraries compared to Las Vegas Clark County Library District was Rower County libraries from March of 2020 through about November of 2020, we were not serving the customers inside the library, but we had all of the library staff reporting to work every day.  We did other projects that libraries don't specifically have an opportunity to do, so we inventoried all 2 million items in our collection. We focused on building up our virtual programming capacity by adding and buying new technology because we weren't traveling, so we used those funds to help build up our tech infrastructure. Here in Las Vegas, it was different. The staff were not reporting to work at all. They were paid and they were at home. They did start doing some virtual programming. So those were changes and the changes that we're still making, we still are requiring masks now that the changes continue to come down from the CDC. We continue to increase our cleaning of our facilities. We also have the air filtering here as well, which is something we didn't have in Broward. And all of the library staff are considered essential workers and so that's something different from Broward as well. So when I got here in February as the executive director, I actually was vaccinated. I took my first vaccination within two weeks. So it was being offered essential workers. I was able to get an appointment and get it. So we actually pay people for the time that they take the staff when they go take the vaccination. We actually pay them here in Las Vegas. We're still encouraging our staff to get vaccinated. We're encouraging the public as well in a subtle way with our signage. And we believe that even after, if there isn't after COVID, that we will continue to have increased cleaning of our facilities. Our work has changed. We're looking at our spaces differently. We're looking at how do we come back programmatically inside the library, but also how do we continue to deliver virtual programming as well. One of the things that we did in Broward, which was interesting, not knowing COVID, but we built our school relationship with digital library cards back in 2017. So when COVID happened, we didn't have all the students with a library card, but we had almost a third of the entire school district students with a library card. So nearly 90,000 students had a digital library card in Broward. So that made that usage of those resources and that accessibility much easier. It was, you know, something we didn't have to work on and develop. So we had put a solution in place and that was to provide the students with that, the access to the public library resources in advance of COVID. And so the impacts that staff now have to focus on, and myself included, is how do we have these types of processes in place for the next COVID. What I've learned that can be useful to other libraries and museums is to continue to leverage our partnerships and collaborations. In the five months I've been here, we already have a partnership with our Regional Transit Commission to provide the library services to our commuters. We're also working closely with actually with our museum, the Children's Discovery Museum here in Las Vegas. So it's those partnerships and collaborations that if I've learned anything or really maybe reiterated anything for me, it's been that I'm not in this alone. We're all in this together. We need to work together as a community. I need to continue to work with partners. Partners need to continue to work with me. And I've been to some of our most rural communities that have no access at all, little to no access. And so that's what I'm learning is that it's not just urban, it's rural, and that's something that really was an exponential issue for families and students during this past year and a half. It's been here, but it really came to the forefront during COVID that the access, the discovery, and the delivery of library resources. One of the things that I focused on probably for the past four plus years has been about transforming the libraries and library staff and transforming ourselves so that we could transform our services to the customers. So I think that the next steps are continuing on with that transformation. It's thinking about and implementing the programs and services where our communities can and will continue to access the library on their own terms, whether that's coming into the physical space and or continuing to access the library virtually. So next steps is to continue to promote the library, push the libraries out that we are continuing to serve our missions and deliver on our missions and that is to support our communities through literacy and education and research and also entertainment. We want to get entertained. We have that as well. So I think the next steps are to continue for libraries, continue on, continue to watch what's happening, continue to be flexible and nimble and agile because that's going to be required. If we didn't learn anything for the past year and a half, that's something that we need to be.


Words appear. Equal access, universal design of an academic department. Young people walk on a campus. The student population at universities and colleges is becoming increasingly diverse. Both students and staff need equal access to courses, facilities and all aspects of campus life. Two young women in wheelchairs roll down a sidewalk side by side. Yet people with disabilities still find inaccessible websites, course materials and facilities. One solution is the implementation of universal design. Architect Ron Mays defined it as the design of products and environments to be usable by all people to the greatest extent possible without the need for adaptation or specialized design. Namisha Ghoshroy, program manager. The value of universal design is that it's simple and it's easy and it will be able to impact all of your students. It suggests that rather than designing departmental offerings for the average user, design them for people with a broad range of abilities, disabilities, reading levels, learning styles, native languages and other characteristics. Richard Ladner, professor. Universal design is a... Department of Computer Science and Engineering. It's really a goal. It's a way to... UW. Approach education so that you maximize the number of people that are benefiting from the education. Words appear. Planning and policies. Four people are at a table including the two women in wheelchairs. Campus stakeholders need to think about planning and policies. Ask yourself if people with disabilities and members of other underrepresented groups are on your staff, faculty or student body. Jim Gorski, director. Looking at developing policy at a university level, I think it's important to recognize... Disability Resource Center. First of all, gathering the right collection of folks to have that discussion. And not just include... University of Florida. You know, faculty representation, but also includes folks that provide services. Students are the recipient of those services. Students that are in those classes. People that will be a part of, you know, the design of what's going to be then the effect of the policy. When courses or services are being evaluated, be sure to include items that ask about the experiences of those with disabilities. Tony Delisle, post-doctoral associate. I think if... University of Florida. An institution, a college and a department is going to be friendly to people with disabilities. I think it's really a cultural aspect. A social normative attitudes and beliefs that's prevalent and pervasive throughout the institution and colleges and into the departments. Words appear. Facility and environment. Campus facilities should be accessible and welcoming. Ensure physical access, comfort and safety for visitors with a variety of abilities, racial and ethnic backgrounds, genders and ages. John McGuff, assistant director. A great place to start assessing your accessible facilities is in the parking lot. You should make sure that you have a sufficient number of accessible parking spots and they should be well-marked. Disability resources. Routes from the accessible parking to a building should be well-marked with large high-contrast signs. A front door should be for all users, whether they're in a wheelchair or are walking up to the front door. A front door for one should be a front door for all. Susan Gilmesli. Students need to know where they are. Director of Disability Resource Center. The signage needs to be plentiful. Bellevue College. Really accurate. High contrast. It can't blend into the facade of the campus. None of this lovely brushed silver nickel stuff that blends into the building. It has to stand out. A girl wheels to an elevator. As far as elevators go, I think that the most important thing for me is having the controls at the lower level so that I can reach them. She presses one. Restrooms should be wheelchair accessible with well-marked signs. Handicap signs. Counters and desks in students' surface areas should be accessible from a seated position and aisles should be wide and clear of obstructions. So faculty who require students to use labs on campus to complete coursework have to also be mindful of if a lab itself is accessible. So yes, can they get in the building? Yes, can they get into the lab itself? But within the lab, there's features that they may not think of. So is there adjustable height workstation? For someone who may need to move the table up or down, are there Zoom text or screen readers on lab stations within it? If there's somebody who is there to help, help desk, can someone go and ask a question? And is that an accessible desk or area? Or are there things like printers or phones that might need to be used? All those things still need to be accessible to a student with a disability. Before faculty brings technology into classroom, they definitely need to be aware of what it is and just use it because it's a new hot, flashy technology on the market. If you really know how to use it and the pros and cons of how accessible it is or how it will impact a student's learning environment. It's also important to consider computing equipment and software and to provide access to assistive technology for those who need it. And software can range from text to speech, voice recognition software, screen enlargement can be used in the classroom, outside of the classroom and really benefits of wide variety of users. How do you run Gene? I believe we should have at least a minimum accessibility requirement checklist so we can ask the campus to follow that. So if you are going to buy a product or develop a product, we have to ensure those minimum accessibility checklists are met. Websites are a very interesting place for a department to start because where else does a student go to find out basic information or even their initial information about an academic department they are looking at. So if a student with a disability cannot find out how to contact you, what you do, how are they even going to be able to get more information or pursue you as a program? So I personally think it should be the responsibility of their respective web developers or webmasters to ensure that first their own framework, their own application or websites are accessible and at the same time they have to provide training. They just need to consider accessibility as important as say security and privacy. Words appear. Courses. A man lectures on screen. Faculty members should deliver courses that are accessible to all students and accommodations must be provided in a timely manner. Make sure that video presentations used in courses have captions and where appropriate audio descriptions. Captions allow a wide variety of people to understand content and captions can often be searched to accelerate access to information. Al Suma, counselor and faculty member. By doing so, we're reaching a large number of individuals and those include Seattle Central College, deaf and hard of hearing people who would get nothing out of a video that's not captioned. Individuals whose English is their second language. Individuals with ADD and LD, for example, may help them focus more on the words as they see it go across the screen. Lisa Elliott. I don't think that we totally understand how people take in and use information. So the more ways that we can offer it up, the better we all are. Jeffrey Bigum. As an instructor in a course, you can make your material accessible. You can make sure that the student isn't excluded. Associate professor. Even if you can't, in a short amount of time, change the policy on a university, you can change the policy in your own classroom. Carnegie Mellon University. I always feel like if I have a student that has an accommodation, that I as a teacher have to give a little too. I can't just do everything exactly the same way. So we have to be a little adaptable as a professor so that you can reach the most students. And that's what I practice. Speaking as both a student and an instructor, assessment really needs to be flexible. We focus as instructors on exams, but there are many ways to assess student learning. Problem sets, exams, projects, writing. Words appear. Accommodation requests. Although applying universal design minimizes the need for accommodations for students, faculty, and staff with disabilities, it's also important to have a plan in place to respond to additional accommodation requests. Stefan Smith. And so the way that we ensure Executive Director. Timely and effective accommodations. Ahead. Is by planning our policies and planning our practices that include our academic departments. Jose Blackerby. We have to do it faster. Center director. We have to do it with fewer resources. SRI International. And we have to do it for a broader range of the population. And we're all under the hook for that. And we should be. Described by Audio Eyes. For more information, consult Dewitt's Center on Universal Design and Education www.uw.edu slash d-o-i-t slash c-u-d-e. This video is based on work supported by the National Science Foundation under grant number HRD 0833504. Any opinions, findings, or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. Copyright 2015, University of Washington. Permission is granted to copy these materials for educational non-commercial purposes provided the source is acknowledged. Thank you.


hash function. I'm going to start with the timeline and I have some old hash function like snafru, md2, md4 up to recent functions or more recent functions like SHA1 and SHA2. And I want to make a point here, I took this timeline from these websites so if you want to know exactly what's going on here you can check the website of Valerie Aurora. But I want to make a point here that if we look at the past hash functions in the previous years we've seen a pattern. And the pattern is that we usually see some green and at the end we usually see some red. So the green usually means that it's considered strong for a number of years. People use those hash functions and the red usually means that it's broken. So broken here usually means that we find a collision. Collision meaning that for example you took two different words, the word mother, the word father. You hash them with the same hash function maybe md5 and you get the same output. So collision is very very bad. You usually don't want to find that on a cryptographically secure hash function. And as soon as you find one collision you usually say that the hash function is broken. So this is what happened here and you might have heard of the SHA1 collision, right? Ellie talked about that at Black Hat if you were there a few days ago. And pretty much a lot of people think that because of that we cannot build cryptography that can withstand the test of time. So this is not quite true and this is kind of a pattern that you see not even not only on hash functions but also SSL and TLS. Those things have gotten broken, broken over the years. And this is mostly because we didn't really know how to build these. Especially if you look at SSL and TLS the involvement of the cryptographic community was almost in existence. So this is something that is changing and in TLS 1.3 there's a huge involvement from the cryptographic community and this is kind of unheard of and this is pretty good. So here another thing that kind of came out of that is that when you look at SHA2 it's still considered strong nowadays. But a lot of people thought what if it breaks? So SHA2 is based on the same miracle dam guard construction which is also the core construction of SHA1, SHA0, MD5, MD4, etc. And all those hash functions have been broken, right? So we might wonder what if SHA2 also followed the same fate? Also if SHA2 breaks one day, well everything used SHA2. SHA2 is used all over the place as the hash function. So with that in mind, the NIST, an American organization decided to come up with a competition for SHA3, the next standard for hash function that could be used as a replacement in case SHA2 would come to bad points. So the SHA3 competition lasted five years. It was started in 2007. Had 64 candidates from all over the world. So previously SHA2 and SHA1 were not competitions so SHA3 was, that was new. Three rounds and the winner was Ketchak. So Ketchak finally won in 2012. Other candidates that didn't win but made it to the third round, the last round were Blake, Grustle, J.H. and Skyn. I'm not sure how to pronounce them but it wasn't that they were not secure. It's mostly because we only had one spot and Ketchak was quite different and quite supported so it won. But remember Blake because I'll be talking about that hash function after. So I'll use the next slide to kind of explain to you how Ketchak works. Ketchak is a sponge construction. So SHA3 is a sponge construction. And the sponge, sponges were invented as part of the competition, SHA3. At its core it used a permutation. So we'll say it's a permutation based cryptography. If you don't know what a permutation is, you can think of AES with a fixed key. It takes all the possible inputs of 128 bits and it gives you all the possible output of 128 bits. Right? So you have one plain text, one cipher text. There is a map. There is a mapping. So that's a permutation and the same thing here. You have an input of, for SHA3, 1600 bits and an output of 1600 bits. So here we'll start by having zeros for the inputs. You can think of that as an initialization vector. And we'll separate the inputs into two parts. The first part is called the rate. I'll call the public part of the input. And the second part is called the capacity. I'll call the secret part of the input. And it's kind of an arbitrary division. You can place it wherever you want and you'll see that in SHA3. You have different parameters where the secret part is larger or smaller. And the output is divided into two parts, the same two parts. So I'm calling that the public parts above and the secret parts on the bottom. And this is for a reason. We usually only touch the public part and the secret part we don't really want to touch. So we're hashing a message, right? So what we do is that we take our message and we XOR it with our state, which is the public part of the sponge. If our message is bigger than this public part, which is maybe like 1300 bits, something like that, then you take the next part of the message and you XOR it after you permute that state, you XOR it with the public part. And if your message is a bit longer, you permute again and you XOR it with the public part again. I'm not talking about padding, but it's basically like block ciphers or any of that. You usually have a padding so that you can reach the block size or the size of the public part. So, and you permute. So this is how you get the message into this sponge construction. And it's called absorbing. Makes sense, right? It's a sponge. So you absorb the message and once you want an output, once you want your digest, your hash, what you do is that you take the public part, right? It's public. So you really don't touch the secret part, but you can just use the public part which might be 1300 bits or so for Shafri. And if it's not enough, you permute and you continue using the public part and you append that to your digest. If it's not enough, you permute and so on. And this is called the squeezing part. Makes sense, right? You absorb your message and after when you need the output, you just squeeze it. So the K-Track team gave a paper proof of this. So basically this is secure as long as the underlying permutation is secure. How can we prove that the underlying permutation is secure? Well, we don't really know. We don't have good ways of doing that. The only way we know how to do that is to try to break it. So for five years, pretty much the Shafri competition was just cryptanalysis after cryptanalysis, trying to break this permutation. So in Shafri, this permutation is secure. So again, you can think of it like an AES kind of thing where AES has like what, 10 rounds for one of its variants. So Shafri has 24 rounds of a bunch of steps that you apply on the input, on the state. So Shafri or K-Track receive the huge amount of cryptanalysis. So this is a page they have where they list the amount of cryptanalysis that they have. And it's a lot. So that's mostly why K-Track was chosen as the new Shafri. Why did it receive so much cryptanalysis where maybe you have a clue in the list of its inventors? So inventors of K-Track are Guido Bertoni, Johan Damon, Michael Peters and Jill Van Ash. I'm not too sure how to pronounce their name but those are Italian and Belgian people. One of them, Johan Damon, is the author of AES. So that might be why so many people were really interested into trying to break it. Anyway, let's look at the timeline. So this is the Shafri competition, right? From 2007 to 2012. At the end, K-Track becomes the winner but it's not standardized yet, just nominated as the winner. And at this time also, Blake, which was one of the non-winner of the last round, decides to come up with a new hash function called Blake2. And pretty much what they did is that they looked at the cryptanalysis that they received during the competition and they said, well, we have a number of rounds, like K-Track, like AES, blah, blah, blah. And the security margin that we have is actually pretty big. So we're going to reduce the number of rounds we have to make it faster. They made a number of changes but this was the biggest change and it actually made Blake2 very, very fast.  And I'll come back on this slide after. But basically Blake2 was really, really fast. And people liked that. It looked secure because during the competition it received a substantial amount of cryptanalysis and people started using it. So this is a list, a non-exhaustive list of different projects that use Blake2. In them you can see WireGuard, which is kind of the next generation VPN that use Blake2 at its core. WireGuard also used Noise, which is a protocol framework that you can use to build something like TLS. So I didn't introduce myself but I'm a security consultant at NCC Group and I see a lot of custom made TLS protocols proprietary TLS thingies and usually they're looking for trouble and that's what the recommendation is usually to use Noise. If you really don't want to use TLS because it's cumbersome, because it's too big, because it's not secure, whatever your good or bad reason is, Noise is usually the answer. So Noise at its center, at its core use Blake2 as one of its hash functions. Argon2, if you don't know how to store passwords, we have a state-of-the-art password hashing function which is called Argon2, which came out of the password hashing competition that ended up last year, I believe, and it uses Blake2 at its core. Last but not least, Libsodium is the crypto library we usually recommend. It's based on salts and it pretty much has very good APIs and that's why we recommend it. It's very hard to make a mistake when you use it and for if you want to hash something, there is something called hash. It doesn't tell you what it is, it's just called hash and basically it's Blake2. Alright, so a lot of things use Blake2. Let's go back to Shafri. So Shafri finally was standardized three years after the end of the competition in 2015 in these documents called FIPS 202. So you don't have to remember the name if you want to see the standard, just Google. Shafri standard, that's enough. So it came out in 2015 and in that time, right, in three years Blake2 had the time to take over the market. Nonetheless, they came out with a reference implementation. If you want to use Shafri, this is the Kechak code package. I'll have that slide again at the end but this is the reference implementation in C and it's pretty good. There is another implementation that I want to tell you about. It's a Twitter implementation and it's basically if you go on the Twitter accounts, there are nine tweets I believe and if you concatenate those nine tweets, you get an implementation in C of Shafri. I'm not telling you to use it but it's pretty interesting how small the final implementation is and it could lead you to believe it's easy to implement. It's not easy to implement but they still did it in nine tweets. Anyway, let's look at this diagram from Blake2. Remember Blake2 is blazing fast and you can see at the end that Shafri is kind of slow. So Shafri was chosen, one of the reasons it was chosen was because it was the fastest of the hash functions in hardware but not in software.  So fast in hardware but not so much in software. And you might think that, well, Intel will one day implement it or support it in hardware. You might be right but if you look at the past support of Intel for hash functions and cryptographic functions, it usually takes a lot of time so don't hold your breath. And also we've seen that speed drives adoption. This is clearly true for Blake2 but this is true for, for example, elliptic curves with the curve 25519. This is true for authenticated ciphers, for example, Shasha 20, Poly 1305, which is very fast in software, which is the replacement for ASGCM and which will be Intel S1.3 as one of the new cipher. And if right now you have an Android phone and you use it to connect to Google, that's what you use. You use Shasha 20, Poly 1305, just because it's fast in software. Another one of these last example is if you look at TLS 1.3, if you look at Quick, if you look at these kind of modern protocols that kind of look like TLS 1.3, you have this new feature called zero RTT, which stands for zero round trip. And it basically allows you to encrypt data. So in TLS right you have the handshake and then you can encrypt your data. But this zero RTT thing allows you to encrypt your data in the very first message as part of your handshake. And it allows you to be very, very fast and that's why big players like it. But the security of it is kind of shaky, which made it the most controversial, I believe, feature of TLS 1.3. So if you look at the mailing list, there's a lot of discussions around that. And I believe if the big players didn't really want to optimize and didn't want this big speed, we wouldn't have this feature in TLS 1.3. All right, so in the next couple of slides, I'm going to explain to you why Shafri is slow, slowish. So let's talk about bit security. What is the bit security of AES 128? Well, it's pretty easy. It's around 128 bits. That means that if you want to break AES, approximately you have to do two to the 128 operations. So that would be two to the 128 encryption of AES. Now, what is the bit security of AES 256? Well, it's 256 bits. And this is usually the kind of security you want. It's either 128, which is what most people use. Or if you're really paranoid, if you really care too much, or if you want to market your application as military grade encryption, you usually choose the latest one, the latter. Now, what about SHA-256? If we look at the bit security of SHA-256 against pre-image attacks, pre-image attacks are not collision attacks, right? We're not trying to find a collision. But rather we see the hash of something. So you can imagine a dump of hash password. Maybe they hash the password with MD5 or something like that. And you're trying to find the original passwords out of the hashes. So that's a pre-image attack. So the security for this kind of attacks for SHA-256 is actually 256 bits, which is already very large. Now, if you look at the bit security of SHA-512, you can guess it's 512 bits of security against that kind of attack, which is absurd. It's a very big number. And nobody really needs that kind of security. Now, SHA-2 has that kind of security, not because they made bad decisions, but it's mostly because of how it's designed. It's just a nice property, I guess, of SHA-2. The way it's designed brings you that amount of security. Now, the NIST wanted something with SHA-3 that was something secure and something you could use as a drop-in replacement for SHA-2. So they decided to have the same kind of security. And SHA-3-512 actually provides 512-bit of security, which again is absurd. And here, it doesn't really make sense because they could have had less and could have mirrored the security of AES with 128-bit security and 256-bit security. But it chose not to do it. So this was kind of a weird decision. And it led SHA-3 to be slow. Basically, the explanation, if you remember, SHA-3 has these public parts. The sponge has a public part and a secret part. And to attend this kind of security, they made the secret parts larger. What does it mean? It means that you can store less message in your public parts because it's smaller. And also, when you get the outputs, you can use less because this part is smaller. So you have to use more permutations in the end to hash the message. So yeah, another reason might be that a lot of people have lost their trust in the NIST organization mostly because of backdoors and duality and that kind of stuff. And so they might have wanted to show people that they were not going to mess around with SHA-3 and actually make something that was very secure. And if you look at it, they actually increased the number of rounds. Kitchak was not 24 rounds in the beginning. And they increased it to 24 to make it even more secure, which made it even more slow. Anyway, this is the explanation. Now, we can ask the question, where is SHA-3 being used? Well, I give you some hints. You have to think of crypto-friendly kind of companies. You have to think of modern or recent kind of bleeding edge companies. And if you haven't picked up the answer yet, the answer is blockchain, cryptocurrencies, Bitcoin, and that kind of stuff. Usually, a new one come up every day, so they can afford to use the last hash functions. And this is what it is. Actually, I've looked at their forums, some cryptocurrencies forums, and I've seen that some of the people there market their last cryptocurrencies, their new cryptocurrencies by saying, oh, it uses SHA-3. Look at it. It's shiny. It's beautiful, et cetera. So just one problem I'll mention is that they say they use SHA-3. Some of them will use, well, I think some of them don't use SHA-3, but derive function from SHA-3. And also, some of them started using SHA-3 before it was standardized. And so they use a different number of rounds, which is not a problem by itself. But if they try to interact one day, it will be a problem. All right, so let's go back to the FIPS publication, which has SHA-3 inside of it. And I kind of didn't tell you the whole story. This standardized SHA-3, but it also standardized something new called SHAKE. SHAKE is exof. It's an extensible output function. It's something new. And basically, I have this picture, so like that, when you'll try to think about what David talked about today, you'll try to think about that picture. You can also think about me shaking. And what is exof? Well, exof is an extensible output function. It's basically a hash, which has an infinite output. So pretty much you can decide what length your output is. You can decide for your output to be a very, very long length, or it could be one byte. Well, don't do that because it's not secure, but theoretically, you could choose it to be one byte. It also has better parameters. So it has a 128-bits version of SHAKE and a SHAKE 256, which provides 256-bit of security, which make it faster than SHA-3. So that's one of the recommendation I'll make today. If you want to use SHA-3, I think it's a better choice to use SHAKE. It's exactly the same construction, except that it has center parameters and it's faster. Although I'll still say that SHA-3 is a standard. It's a rock solid, and it's good for people who don't really know what hash functions they can use. They can just Google the standard, and the standard is here. So this is really interesting. And if you're a developer, or if you're a consultant, or if you look one day at something like that and you want to use it, and if you're wondering what kind of output you should get, you can check this page, which is called the Tune Page of K-Chack. And pretty much, it tells you what kind of length, what kind of output length you can use for what kind of security. If you ever have to look for it, just look for tuning K-Chack or tuning SHAKE, and you'll find it. And it's pretty handy page. Now, SHAKE was so useful and so cool, actually, that Denise decided to release another document called Spatial Publication for SP, or SP for Spatial Publication, 800, 185. Again, you don't have to remember that, just Google derived SHAFRI functions or something like that. It's not really SHAFRI derived functions, it's rather SHAKE derived functions. So a year after the standard of SHAFRI, and it basically had a bunch of functions, three functions, K-MAC, tuple hash, and parallel hash, it also had a customizable version of SHAKE, but I won't be talking about that here because it's not too useful, but maybe if you want to use SHAKE in your product and you want to customize it with a string saying, it's my SHAKE, it's my protocol, it's for me, you can use SHAKE, which is a customizable SHAKE. And actually, these functions are derived from SHAKE. But you don't have to remember what I just said, it's a detail. So this document had a lot of these, and you think of SHAFRI, you have to think of SHAFRI, SHAKE, K-MAC, tuple hash, and parallel hash. It can be kind of confusing, and this is kind of why I'm here today. I'll tell you about all these functions and what you can use them for. So K-MAC, to explain K-MAC, I'll start with a very simple example. Imagine you want to send a message to Alice, you don't want to encrypt it, you don't care about encrypting it, you just want to send this message across the wire, and you want to make sure nobody in the middle can modify it. So what you do is that you send a message and you open, I don't know, SHA256 of the message next to it. I hope everybody in this room is aware that you shouldn't do that, right? Anybody in the middle can just take that hash, modify the message, and recompute the hash on the message, right? It's trivial. Now what if I do this? What if I add a key to the message? Actually, who thinks here in this room, who thinks that is secure? Show of hands. The what? So is this thing secure? It is putting a key next to your message, allowing you to protect the integrity of your message. So if you send that across the wire, does that mean that nobody can modify this message? And the receiver, the recipient, do you think it's secure? The what? Well, the recipient has the key. Well, not necessarily. You can keep the same key for every message. It basically looks like a net Mac, if you think about it. It's a message code authentication, and it looks like it should work. That's what we use usually when we authenticate messages. The problem is that you cannot do that with SHA256. You cannot do that with a lot of Miracle Damguard-based construction, actually. And the problem is that when SHA256 gives you the output of a hash, it gives you the output of the states. So basically, it hashes the key opponent to the message, and it gives you the states. Well, there is some padding to it. So like every hash functions, or most of them, and like AES, and like actually Shafri, you have a padding, right? And here you get key opponent to the message, opponent to the padding. But this is the states of the function, as the attacker, if you get that, you can pretend that it hasn't finished hashing. And you can continue to hash like it's not the end of the message. And basically what it allows you to do is to get the hash of key opponent to the message, opponent to some padding, and opponent to anything you want, without knowing the key. This attack might allow you to do some weird things, might allow you to exploit some applications that use SHA-256 or SHA-512 that way. It's not always the case. It's kind of a, because of the padding, because of that kind of thing. But it might be a problem. And it shouldn't be a problem. A hash function, if it behaves like a random oracle, should allow you to do that kind of thing. And actually Shafri or any Shafri contestants like Black2 and all the others allow you to do that kind of thing without being a security issue. So here, if you use Shafri or just check, it works. And this is basically what K-Mac is. I omitted a few details, but this is basically what K-Mac does. It takes check, opens a key to the message, and it allows you to create a Mac out of it. Kind of like H-Mac. Topple hash. So let me talk about the following problem. Imagine I'm using one of these secure messaging app. I have end to an encryption. And I'm using RSS public key to encrypt messages to Alice. And Alice's public key is an RSS public key, so if you don't know what an RSS public key is, it's basically a small number E and a big number N. And to make sure I'm really talking to Alice, I take a fingerprint of that key, which will be shot to 56, a hash of that key, the small part, appended to the big parts. And Alice will do the same thing on her phone and will compare that in real life or out of band. Now, you can imagine that basically I'm doing this. E is a small number in bits, and N is a very large number, something like 2048 bits, probably. Is that thing secure? Again, who thinks this is fine? And if I make a fingerprint, if I compute a fingerprint out of Alice's public key and she does the same with her public key, we can compare that and I can make sure that I'm really using her public key. So maybe show of hands who thinks this is secure. Who thinks this is not secure? All right, not so many people. So the answer is that you can create a different public key that will have the same fingerprint. How do you do that? Well, what if I do that? What if I choose a larger E? It's the same E, but it steals bits from the modulus N. And then N is kind of the rest of the bits. It's a different public key, right? But it hashes to the same value, the same fingerprint. It's the exact same sequence of bits. So, and here again, the modulus might be small enough that it's weak and you might be able to crack it, reverse it, use the private key to use that public key. So really here the problem is that you're not, you're hashing something in an ambiguous way. So what you should do is to hash the length of the first value, then the first value, then the length of the second value, then the second value. And you can even go further and have the type of the first value, the length of the first value, and the value, the type of the second value, and so on. This is actually called a TLV for tag length value. And this is what is used in smart cards. So I believe there are no real standards on how to do that correctly. And tuple hash is actually pretty much hashing the length of the first tuple, of the first object of your tuple, then the first value, then the second length, then the second value, the third length, the third value, to hash something in a non-ambiguous way. So if you're wondering how to do that, if one day you need to hash something in a non-ambiguous way, tuple hash is one of the answer. And actually I believe it's the only answer. If somebody knows something better, you can tell me. Parallel hash, the last one. And kind of like with the others, you can kind of guess what it is from the name. If we look at this sponge construction, remember we absorb the message and then we squeeze it. And we might wonder how we could optimize this thing. Can we parallelize this computation? So now if I want to compute this permutation here, I need the output of this permutation first. And to compute this permutation, I need the output of this permutation first. So it's not very parallelizable, it's very serial, and this is a problem for big inputs. So parallel hash is basically using what they call a tree hashing construction, and they divide the inputs into large blocks. They hash those large blocks individually, obtaining a smaller input, a smaller output. And then finally they have a hash of all these outputs. It's a pretty simple construction, right? Yeah, it actually allows you to hash big inputs, large files, very quickly. So I believe a block is around 4,000 bytes, something like that. The problem here, if you have something smaller than 4,000 bytes, basically you'll hash it and then you'll hash it again. So you have kind of a penalty, so it doesn't work that well with small inputs, but if what you do is only hashing large inputs, then this is a very good thing to use. And it's actually very, very fast. So again, timeline, kind of a recap. Black 2, one of the very fast hash function, which is an alternative to Shaffery. Shaffery, the standard, rock solid. If you want something more flexible and faster than Shaffery, you have Sheck. If you have different usages, you have tuple hash, parallel hash, and Kmac. All right. Here, something I didn't mention, I believe Black 2 also has something like parallel hash, something like Sheck, and so on. If you want to know more about that, you can go on the Black 2 website, but my talk is mostly focused on Shaffery. All right, so different things for different usage. Now, I want to mention Kayak and Keche. Those are two things based on Kechak as well, from the Kechak team. And those are candidates to the Caesar competition. So the Caesar competition is a non-going competition for authenticated encryption. So think of ASGCM. So it's still going on, and those are some of the candidates. I don't know when this is going to finish. Nobody knows, it's been taking a very long time. But one day, maybe you'll be using not ASGCM, but maybe you'll be using one of the sponge construction even when you encrypt and authenticate your messages. Who knows? So I'm not going to explain these things, I just wanted to mention them. In 2016, I believe end of 2016, the Kechak team kind of concedes in the war of speed. So they see that Black 2 is being used all over the place. They don't really like that. And they end up constructing something that will be faster than Shaffery, but based on Shaffery. And the solution they came up with is called Kangaroo 12 and Marsupilami 14. If you don't know Marsupilami, it's a French comic, some kind of beast with a, I should have had a picture of that. Just Google it, it's a kind of an animal, fictive animal with a yellow animal with like black dots. It's very funny, you should read it. Anyway, it's very fast. The what? Astro, some new place? Oh, anyway, all right, can't tell me again. Basically, it's what Black 2 is to Black. Does that mean something? Anyway, they reduced the number of rounds of Shaffery to obtain something that was way faster and still practically secure. So the theoretical security is lower because they reduced the number of rounds of that permutation. It's not 24 anymore, it's 12. It's quite a drastic reduction, but the practical security is still here. We believe we still have a margin of security that is significant enough. Marsupilami, Kangaroo 12 is blazing fast. It's faster than parallel hash, it's faster than Sha-1, Sha-2, Shaffery and all these constructions. I don't know if it's faster than Black 2, I believe it plays in the same ballpark, but it's not very important. At this point, it's so fast that your hash function is not really the bottleneck of your application anyway. And one very cool thing about Kangaroo 12 is that it has tree hashing by default. So Sha-3 doesn't have that, Kangaroo 12 has that. So it's kind of the mature hash function that we deserve. So it has this tree hashing that allows you to hash large inputs very quickly, like parallel hash, but it doesn't have this penalty for small inputs. So for small inputs, it doesn't do the double hashing thing that parallel hash does. So it's fast for large inputs, it's fast for small inputs. So yeah, very exciting hash function. And if you care about speed, my recommendation will be to use either Black 2 or Kangaroo 12. Again, if you want to use any of the shake functions, any of Kangaroo 12, Sha-3, shake, et cetera, all of these can be obtained from the K-Chack code package that you have on this page. And this is all I have to say about Sha-3 and derived functions from Sha-3. I have a Part 2 on Strobe, it's a bit more involved and it's quite different. So I'll start with that. Strobe is a protocol framework, kind of like noise, but it focus on the symmetric parts of your protocol. And it's very sexy in the way that it only use K-Chack, only use shake. So you can think of it as, you can use it to create protocols. So not the handshake parts, but rather the symmetric part of your protocol. And you can use it pretty much to do any symmetric crypto. So you can use it to encrypt, authenticate, generate random numbers, derive keys, you can use it to hash. You can use it pretty much for anything and also create your protocols. And it's only one primitive, only this shake at the center. The good thing is that if you look at the code, it's tiny. It only has a very, very small code base and it's easy to audit. It's pretty straightforward to understand. So how does it work? Well, if you look at the sponge construction, the thing we had earlier, you absorb messages and then you squeeze messages, right?  And then absorb again and then squeeze it again. And actually this is a valid question and K-Chack came with an answer. Yes, it's possible. And this is not called the sponge construction but it's called the duplex construction. It basically allows you to absorb, squeeze, absorb, squeeze, on and on. The point of that kind of construction is that if you look at the third one, when you absorb and you squeeze, the result you get actually depends on what happened previously, on everything that was absorbed previously. So this is a very nice property to have in protocols where you want every messages you send or something like that to depend on every messages that happened previously. This is what we call consistency of the protocol. It means that nothing is going to work if someone reordered your messages, replayed some of them or dropped some of them in the middle. So you always depend on what happened previously. So this is what's at the heart, the core of Strobe. You can build protocols that have this nice property. So I'll give you a very simple example before I explain to you how Strobe works. Imagine that you're on the client side but since it's symmetric, you would do pretty much the same on the server side. You instantiate your instance of the Strobe protocol with some custom string. So the custom string could be mywebsite.com if your protocol is called mywebsite.com. It could be anything you want but it basically describe your protocol and it has to be the same on the other side, on the server side. Now you can key your protocol. You can insert some key. It could be a pre-shared secret, right? It could be a shared secret coming out of a key exchange. So you could do a noise key exchange actually and use the shared secret that you obtained from the D-filment key exchange inside of this. So on the server, you would use the same one. And now you can do some fun stuff. So if you want to encrypt the request to the server, while you use what they call the send-encrypt call on Strobe on the request gets the roots of the domain. For example, if it's some sort of a web protocol. And you append that to the buffer. Now before sending the buffer, you also want to authenticate your encryption, right? So you use the send-mack call on Strobe with a length of 16 bytes. That's usually enough for an authentication tag. You append that to your buffer. You send it, right? Pretty straightforward and the server receives that. And the server on the other side would do something similar but the inverse of those functions. Now you receive an answer from the server and this is the inverse of the function. You would do the receive encryption. And you would keep the last 16 bytes as the tag. So you would use the receive-mack on the last 16 bytes. And you would make sure that the Mac is okay. And if it's not, I don't know, you reset the connection. You crash. That's not a good idea, but you could do a different kind of things. So that's a very basic example just to tell you how you can call these functions that Strobe defines in the specification.  Those are all the function you can use and you can use combinations of that. If you want to re-key your protocol at some point in time, you can use key. If you want to have forward secrecy in your protocol, you can use ratchets. You can send some non-uncryptom messages with send clear and receive clear and so on. What it does every time is that it absorbs those operations so that every following operations depend on these operations. Before I explain to you how it exactly works, I'm going to talk to you about the internal of Strobe. This is really detailed. So bear with me, but basically you don't have to understand this part. This is very, it's really, if you're curious. So you have a default internal operation and this is what happens every time you use some kind of operation. Or this is the default that happens when you use some of the Strobe operation. The default is to basically absorb your inputs inside the sponge, right? Or inside the duplex construction. So how do you absorb? Remember you XOR your inputs, your message, who is the states? Remember that's the absorbing phase. So usually you'll do that. Now sometimes you want to replace the state with your inputs. That might be when you want forward secrecy or when you want to key your protocol, you replace the bits of your state with your inputs. Like that, if you leak the states, nobody can guess what the previous state was without knowing the previous bits that were erased by this operation. One last operation, it's called the see after. And basically you do the same thing. You absorb your input with the states. That becomes the states. But you might have wondered, does that look like a one time pad or a stream cipher? And basically you can think of the states as a key stream, your input as your plain text and that could be the cipher text. So if you retrieve that outputs, you can say that it's the cipher text and that's how you encrypt in strobe. And I believe this is how KAC and KCHE does the authentication cipher work also. One last one, it's called forceF and this is to force the permutation to happen before you do anything. And this is basically when you really want your operation to rely on what happened previously. So every time you encrypt, for example, you really want your encryption operation to be dependent on maybe a key that you inserted in your states. So you're gonna force the permutation before doing anything. So very quickly, an example. Here is your state, right? It has the public part and the secret part. I'm saying it comes from somewhere, maybe you did something previously. And here I'm gonna key the states. So before I do it, I'm going to absorb the operation I'm doing. Strobe is very verbose. And so I'm going to absorb the key operation. I mean, I'm simplifying here, there is some padding, et cetera, but basically this is what we do. We first absorb the operation. Now we permute because we're keying and we want to have this forward secrecy property. We want to erase the bits of the states with our key. And this is pretty much how the key operation works on this duplex construction. Now if I want to send some encryption, I will first absorb the operation, right? I permute because I want to depend on the key that was absorbed or that was replaced in the state.  I have a bunch of examples like that. For example, the AD for authenticating more data, you don't need to permute, right? Because you're not sending anything right now, so you don't permute the thing. That means that you can have several operation in the same block before permuting. And then before sending the MAC, you really want the MAC, the authentication tag to depend on that data that you want to authenticate so you permute and then you get the output which will be the authentication tag. Again, you don't have to understand all of this. If you're really wondering how it works and one day you look at the specification, you can look at my slides and they can kind of help you to understand the specification and how it works. But this is really to arouse your curiosity. I said that you can use Strobe to do other things than protocol. For example, if you want to use the code base of Strobe to just hash, what you will do is that you just initiate your Strobe instance like you're initiating a protocol but you just initiate a hash function so you can call that hash or anything you want, my hash, my hash David Wong, something like that. Then you add what you want to hash, you absorb what you want to hash and then you squeeze it with the PRF function. And you can use this thing also to generate random numbers and so on. The specification kind of tells you every time you want to do something, how you can combine those operations. Key derivation function, again an example where you can use different calls to derive a key out of a key itself. I'm not going over all the details here but if you want to know more about this cool Strobe protocol framework, you can check the specification on this page. It basically helps you to implement it. There is an implementation in C, I have an implementation in Go which is more of a readable implementation to help you understand how it works. I don't have an optimized implementation yet but it's coming. I don't have a part three yet but it's coming. I'm doing some research currently on Disco. Disco is basically a noise which is this protocol framework but basically focused on the handshake part of protocols and Strobe which is focused on the symmetric parts. And together I believe that it can be more efficient, easier to implement and you can get rid of all the symmetric implementations just by having Strobe and this is called Disco. There is a draft of the extension on this page. If you want to find it, you can check my blog or check my Twitter. I usually talk about it. So read my blog, follow me on Twitter and this is basically the end. I don't know if I have time for questions. Do I have time? One minute for questions. Yes. No more developer. All right, that's a good question. My recommendation is that if you already used Shattu and HMAC, there are no real reasons to move. If you're trying to choose hash functions and authentication, it's something like message authentication codes and so on, you have no reason to choose Shattu since we have those new modern hash functions and all of that where you can use only one construction to do all your symmetric crypto. Unless you're using Shattu to do this weird Mac thing where you have the key and the message, then you might have a problem here. But if you're using Shattu correctly, I don't see any reason to move right now. Yes? Yeah, yeah, basically you can abuse it to use it as a stream cipher. I think some people are already using that as a stream cipher. And I mean, basically their proposition in the Caesar competition looks like a stream cipher and strobe is kind of like a stream cipher as well. Yeah? It looks like a stream cipher. I mean, you can use it to pretty much generate random numbers like a stream cipher and explore that with your plaintext. Right, so this is what strobe does. What's your question? Yeah, we're moving away from stream ciphers, but it's mostly for bad reasons that was because RC4 was kind of broken. And also, I think we realized that block ciphers were easier to implement in hardware, which was a good reason at the time, but no software is very fast. So if you look at the last cipher in a TLS 1.3, it's actually a Shasha 20 Poly 1305 is actually a stream cipher. Correct me if I'm wrong, but. Yeah, yeah, so ASGCM is also kind of a stream cipher based on the block cipher is true, but. So I don't believe people can screw up stream ciphers more easily than, I don't believe this is too correct, but I'd be happy to be wrong if you have a good argument for that. Do I have to stop here or? All right, all right. Another question? Yeah? So have I compared strobe to edge KDEF or other key derivation functions? I have not, but it has the same properties. So yeah, so the reason to use strobe instead of edge KDEF would be that you're using strobe to do all the stuff. So if you already have strobe to do all the different stuff, there is no reason to add edge KDEF to add another implementation on top of that. When you could be smaller and you already have the implementation for a key derivation and so on. So who uses strobe? Yeah, so it's rather a consequence of using KTAC at the core is that you can do so many things with it that you only need one primitive, one implementation. So it's, yeah, that's a consequence of using that is that you can use all these. So as a consequence, it does reduce the cut size tremendously. Yeah. Oh, I can repeat the question, I guess, but I'm not sure I understood it. So you're saying you have to verify the mark and it's like separated. It's not like. Okay. Okay, so the API of strobe is not too developer friendly. Strobe is still very experimental at the moment. And this is the kind of thing we're discussing right now. The last discussion is to make send encrypts, to rename it to send a non-authenticated, I cannot say this word, non-authenticated encrypts. Like that it might make developers understand that this is not authenticated. Another one would be to have just a send authenticated encryption, which would combine send encrypt and send MAC. So yeah, we're still like trying to see how this could be made more, less dangerous to use, let's say. So this is very experimental. This is, if you know what you're doing, this is a good idea, but if you don't know what you're doing, this is kind of edgy. So you're saying that there are so many derived functions from that. Is there like an easier way to use them? Or an easy API? I don't believe so. I think my talk is kind of the easiest way to understand all of these constructions. I don't think there is really any work in there to make it easy for developers to understand what are all these dysfunctions. I'd say they're not, KMAC is not a hash, right? It's really like a message authentication code for the rest. I'd say just use kangaroo 12 because it pretty much is the mature construction that derives from a shake. It's an extendable output function. It derives from parallel hash. You can parallelize it. And it derives from a chaffery. You can hash anything. So kangaroo 12 is kind of the easy API to use. Yeah, all right, thank you.