一、基本资料
姓名：李银
职称/学位：副教授/博士
研究方向：密码学
主讲课程：概率论与数理统计、计算机组成原理
籍贯：河南固始
Email：lusterli@126.com
二、个人简介
李银，讲师，博士，以色列本-古里安大学博士后。主要从事密码学与大数据安全研究。发表学术论文20余篇，其中SCI、EI收录13篇，主持国家自然科学基金青年项目1项，参与承担国家自然科学基金项目2项、上海市重点实验室开放课题基金1项，授权国际发明专利1项。
三、学习工作简历
2007.09–2011.06，上海交通大学，计算机科学与技术专业，博士研究生
2004/09–2007.06，解放军信息工程大学，密码学专业，硕士研究生
2000.09–2004.06，解放军信息工程大学，信息研究专业，本科
四、项目成果
1. 国家自然科学基金青年项目，61601396，相位正则化参数矩阵化的压缩感知磁共振成像，2017.01-2019.12，22万元，在研，参与
2. 国家自然科学基金青年项目，61402393，GF(2^m)时空权衡乘法器算法研究，2015.01-2017.12，26万元，在研，主持
3. Secret shared random access machine, 国际专利，批准编号PCT/IL2016/050044
五、发表论文
[1] Yin Li#*, Xingpo Ma, Yu Zhang, Chuanda Qi, Mastrovito Form of Non-recursive Karatsuba Multiplier for All Trinomials, IEEE Transactions on Computers, DOI: 10.1109/TC.2017.2677913 (SCI)
[2] Shlomi Dolev#, Yin Li, Shantanu Sharma*, Private and secure secret shared MapReduce, IFIP Annual Conference on Data and Applications Security and Privacy 2016, Springer, pp.151-160
[3] Shlomi Dolev#*, Ephraim Korach, Ximing Li, Yin Li, Galit Uzan, Magnifying computing gaps: Establishing encrypted communication over unidirectional channels, Theoretical Computer Science, 2016, Vol. 636: pp.17-26. (SCI)
[4] Yin Li*, Yiyang Chen, New bit-parallel Montgomery multiplier for trinomials using squaring operation, Integration, the VLSI Journal. 2016, 52: 142–155 (SCI)
[5] Shlomi Dolev#, Yin Li*, Secret Shared Random Access Machine, Algorithmic Aspects of Cloud Computing, 2015, Volume 9511 Lecture Notes in Computer Science, pp 19-34.
[6] Alexander Binun#*, Shlomi Dolev, Yin Li, Archiving Programs for the Future, 6th International Workshop on Software Knowledge, SKY 2015, Lisbon, Portugal. pp.53–57
[7] Xiao-ning Xie#, Gongliang Chen, Yin Li*, Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm, Information Processing Letters, 2014, 114(3): 140–146. (SCI)
[8] Yin Li#*, Gongliang Chen, Jian-hua Li, An alternative class of irreducible polynomials for optimal extension fields, Designs, Codes and Cryptography, 2011, 60(2): 171–182 (SCI)
[9] Yin Li#*, Gongliang Chen, Jian-hua Li, Speedup of bit-parallel Karatsuba multiplier in GF(2m) generated by trinomials, Information Processing Letters, 2011, 111(8): 390–394 (SCI)
[10] Yin Li#*, Gongliang Chen, Yiyang Chen, Jian-hua Li, An extension of TYT inversion algorithm in polynomial basis, Information Processing Letters, 2010, 110(8-9): 300–303 (SCI)
[11] Yin Li#*, Gongliang Chen, Yiyang Chen, Jian-hua Li, An improvement of TYT algorithm for GF(2m) based on reusing intermediate computation results, Communications in Mathematical Science, 2010, 9(1): 277–287 (SCI)
[12] Yin Li#*, Gongliang Chen, Jian-hua Li, Fast forth power and its application in inversion computation for a special class of trinomials, Computational Science and Its Applications, ICCSA 2010, Fukuoka, Japan. LNCS6017, pp.14–24
[13] 李银#*, 陈恭亮, 李建华, P元扩域上的快速乘法, 通信学报, 2009, 30(11): 101-105 (EI)
李银#*, 陈恭亮, 李建华, 基于扩展FFT的NTRU密码体制的优化实现, 密码学进展—中国密码学会2009年会论文集, 广州，中国科学出版社出版, 336-343
[14] 李银#*, 陈恭亮, 李建华, 一种P元扩域上的快速乘法, 信息和通信安全CCICS'2009第六届中国信息和通信安全学术会议论文集, 南京，2009: 768-771 (Best paper)
[15] Yin Li#, Christophe Negre*, An efficient multiplication algorithm using binomial residue representation, International Conference on Security and Cryptography, SECRYPT 2008, Proto, Portugal. pp.319–324
[16] 李银#*, 金晨辉, 适合AES算法硬件实现的新S盒, 计算机应用, 2007, 27(4): 852-853
