글번호
2304873
일 자
11.09.23
조회수
691
글쓴이
수리과학연구소
[9월29일-30일] 2세부 집중강연
Intensive Lectures (집중 강연)

speaker: Professor Jon-Lark Kim, University of Louisville


On, Sep. 29, 2011 (9:0010:45 am)
Place: Posco 359, Ewha Womans University


Title: What color is my hat? (introductory talk)

Abstract: This talk is an introduction to Coding Theory related to Game Theory. I will begin with a famous game which appeared in New York Times. There is a team of three players, and a red or blue hat is placed randomly on each person´s head by a referee. Each person can see the others´ hats but not his own.
The team wins if at least one player guesses correctly and no players guess incorrectly (can say pass if not sure) or loses otherwise. What is the best strategy? What happens if there are seven players?
In this talk, I give some basic concepts of Coding Theory and answer these questions from the Coding Theory point of view.


On, Sep. 30, 2011 (10:0011:45 am)
Place: Posco 365, Ewha Womans University


Title: A new class of linear codes for cryptographic uses  (research talk)

Abstract: The physical implementation of cryptosystems on devices such as smart cards leaks information. This information can be used in differential power analysis or in other kinds of side channel attacks. Until recently, it was believed that for increasing the resistance to attacks, new masks have to be added. It is shown by Maghrebi et. al. (2011) that another option consists in encoding the masks, which is much less costly than adding fresh masks. This idea connects linear error-correcting codes with cryptographic uses. In this talk, we introduce a new class of linear codes, called complementary information set (CIS) codes. We give optimal or best known CIS codes of lengths < 130. We also describe a building-up construction of CIS codes and give a classification of all CIS codes of lengths up to 12.
첨부파일 첨부파일:
다음글 [12월21일] 2세부 집중강연
이전글 [August 24-26, 2011] International conference on Coding and Cryptography