Montgomery multiplication in GF(2k)

被引：0
|
作者：
机构：
来源：
Des Codes Cryptography | / 1卷 / 57-69期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] 2K x 2K InSb for astronomy
    Hoffman, AW
    Corrales, E
    Love, PJ
    Rosbeck, J
    Merrill, M
    Fowler, A
    McMurtry, C
    OPTICAL AND INFRARED DETECTORS FOR ASTRONOMY, 2004, 5499 : 59 - 67
  • [32] High performance elliptic curve GF(2k) cryptoprocessor architecture for multimedia
    Gutub, AAA
    Ibrahim, MK
    2003 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOL III, PROCEEDINGS, 2003, : 81 - 84
  • [33] Compact bit-parallel systolic montgomery multiplication over GF(2m) generated by trinomials
    Lee, Chiou-Yng
    Chen, Chin-Chin
    Lu, Erl-Huei
    TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2006, : 259 - 262
  • [34] Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)
    Hariri, Arash
    Reyhani-Masoleh, Arash
    IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (10) : 1332 - 1345
  • [35] On the equation x2l+1+x+a=0 over GF(2k)
    Helleseth, Tor
    Kholosha, Alexander
    FINITE FIELDS AND THEIR APPLICATIONS, 2008, 14 (01) : 159 - 176
  • [36] Low Complexity Montgomery Multiplication Architecture for Elliptic Curve Cryptography over GF(pm)
    Talapatra, Somsubhra
    Rahaman, Hafizur
    PROCEEDINGS OF THE 2010 18TH IEEE/IFIP INTERNATIONAL CONFERENCE ON VLSI AND SYSTEM-ON-CHIP, 2010, : 219 - 224
  • [37] Construction of pseudorandom binary sequences using additive characters over GF(2k)
    János Folláth
    Periodica Mathematica Hungarica, 2008, 57 : 73 - 81
  • [38] CONSTRUCTION OF PSEUDORANDOM BINARY SEQUENCES USING ADDITIVE CHARACTERS OVER GF (2k)
    Follath, Janos
    PERIODICA MATHEMATICA HUNGARICA, 2008, 57 (01) : 73 - 81
  • [39] AREA/PERFORMANCE EVALUATION OF DIGIT-DIGIT GF(2K) MULTIPLIERS ON FPGAS
    Morales-Sandoval, Miguel
    Diaz-Perez, Arturo
    2013 23RD INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS (FPL 2013) PROCEEDINGS, 2013,
  • [40] A Parallel k-Partition Method to perform Montgomery Multiplication
    Neto, Joao Carlos
    Tenca, Alexandre Ferreira
    Ruggiero, Wilson Vicente
    ASAP 2011 - 22ND IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 2011), 2011, : 251 - 254
12345