网站地图  |  联系我们  |  中国科学院
 首 页  机构概况 新闻中心 科研成果 研究队伍 合作交流 教育培训 党群园地 创新文化 信息公开
 
新闻中心
图片新闻
综合新闻
X-NUCA2017
科研动态
学术报告
媒体聚焦
通知公告
  当前位置:首页>新闻中心>学术报告
【学术报告】Real Plots of Automata Mappings
文章来源:一室  |  发布时间:2013-11-21  |  【 】 【打印】 【关闭】  |  浏览:

  Title: Real Plots of Automata Mappings

  Speaker: Prof. Vladimir Anashin(Lomonosov Moscow State University)

  Time: 2013年11月22日下午14:00-15:00

  Address: Room 3224

  Abstract:

  Every transducer over an alphabet of p elements maps words of length N to words of length N; therefore to every transducer there corresponds a mapping f of finite words to finite words. Every word W of length N can be considered as a base-p expansion of  suitable natural number w. A real plot of the transducer  is  a set of all accumulation points of the closure of the set of all points (w/p^N, f(w)/p^N), N=1,2,3,…, in the unit real square.

  The talk is about recent development in the study of automata plots related to information security.

  Vladimir Anashin's Short Bio:

  Vladimir Anashin is a professor in the Institute for Information Security at Lomonosov Moscow State University. His main research interests are mostly focused at algebraic dynamic systems and their applications. He is one of the designers of the famous stream cipher ABC, which has been accepted to the second phase of eSTREAM. Up to now, he has published more than 70 international journal and conference papers.

  Professor Anashin was awarded the Chinese Academy of Sciences Visiting Professorship for Senior International Scientist in 2010.

 
 
版权所有 © 中国科学院信息工程研究所 备案序号:京ICP备11011297号-1
单位地址:北京市海淀区闵庄路甲89号 邮编:100093