咨询与建议

限定检索结果

文献类型

  • 31 篇 期刊文献
  • 24 篇 会议

馆藏范围

  • 55 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 51 篇 工学
    • 41 篇 计算机科学与技术...
    • 29 篇 电气工程
    • 8 篇 电子科学与技术(可...
    • 6 篇 网络空间安全
    • 5 篇 信息与通信工程
    • 5 篇 软件工程
    • 2 篇 机械工程
    • 2 篇 控制科学与工程
  • 7 篇 理学
    • 7 篇 数学
  • 1 篇 医学
    • 1 篇 临床医学
  • 1 篇 军事学
    • 1 篇 军队指挥学

主题

  • 55 篇 montgomery algor...
  • 12 篇 cryptography
  • 11 篇 modular multipli...
  • 8 篇 fpga
  • 7 篇 rsa
  • 6 篇 modular exponent...
  • 5 篇 rsa algorithm
  • 5 篇 residue number s...
  • 4 篇 systolic array
  • 4 篇 public key crypt...
  • 3 篇 elliptic curve c...
  • 3 篇 asic
  • 3 篇 digital arithmet...
  • 3 篇 microprocessor c...
  • 2 篇 chinese remainde...
  • 2 篇 data security
  • 2 篇 cmos integrated ...
  • 2 篇 multiplication
  • 2 篇 computer archite...
  • 2 篇 common-multiplic...

机构

  • 2 篇 kyungpook natl u...
  • 2 篇 bengal engn & sc...
  • 2 篇 worcester polyte...
  • 2 篇 informat engn un...
  • 2 篇 school of comput...
  • 2 篇 kyungpook natl u...
  • 1 篇 natl def univ ch...
  • 1 篇 anna univ coimba...
  • 1 篇 govt coll techno...
  • 1 篇 psna coll engn &...
  • 1 篇 univ lisbon ines...
  • 1 篇 sun yat sen univ...
  • 1 篇 state key labora...
  • 1 篇 natl cheng kung ...
  • 1 篇 chinese acad sci...
  • 1 篇 mohamed first un...
  • 1 篇 cicese res ctr e...
  • 1 篇 tech univ brauns...
  • 1 篇 air force inst t...
  • 1 篇 natl chiao tung ...

作者

  • 3 篇 lee kj
  • 3 篇 yoo ky
  • 2 篇 wu tao
  • 2 篇 wang wei
  • 2 篇 paludo rogerio
  • 2 篇 huang xinming
  • 2 篇 sousa leonel
  • 2 篇 talapatra somsub...
  • 2 篇 rahaman hafizur
  • 2 篇 wu chia-long
  • 1 篇 shang mingsheng
  • 1 篇 zhang shao-wu
  • 1 篇 min h
  • 1 篇 wang d. m.
  • 1 篇 alkar az
  • 1 篇 lee jen-wei
  • 1 篇 duan cheng-hua
  • 1 篇 ding y. y.
  • 1 篇 mangalam h.
  • 1 篇 rashid muhammad

语言

  • 51 篇 英文
  • 3 篇 其他
  • 1 篇 中文
检索条件"主题词=Montgomery algorithm"
55 条 记 录,以下是1-10 订阅
montgomery algorithm over a Prime Field
收藏 引用
Chinese Journal of Electronics 2019年 第1期28卷 39-44页
作者: YU Wei WANG Kunpeng LI Bao TIAN Song State Key Laboratory of Information Security the Institute of Information EngineeringChinese Academy of Sciences Data Assurance and Communication Security Research Center Chinese Academy of Sciences University of Chinese Academy of Sciences
New formulae for point addition and point doubling on elliptic curves over prime fields are *** on these formulae, an improved montgomery algorithm is proposed. The theoretical analysis indicates that it is about 13.4... 详细信息
来源: 评论
Fast RNS Implementation of Elliptic Curve Point Multiplication on FPGAs
收藏 引用
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2024年 第11期96卷 673-684页
作者: Wu, Tao Sun Yat Sen Univ Shenzhen Res Inst Yuehai Rd Shenzhen 518057 Guangdong Peoples R China
Elliptic curve cryptography is the second most important public-key cryptography following RSA cryptography. The fundamental arithmetic of elliptic curve cryptography is a series of modular multiplications and modular... 详细信息
来源: 评论
NTT Architecture for a Linux-Ready RISC-V Fully-Homomorphic Encryption Accelerator
收藏 引用
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2022年 第7期69卷 2669-2682页
作者: Paludo, Rogerio Sousa, Leonel Univ Lisbon INESC ID Inst Super Tecn P-1649004 Lisbon Portugal
This paper proposes two architectures for the acceleration of Number Theoretic Transforms (NTTs) using a novel montgomery-based butterfly. We first design a custom NTT hardware accelerator for Field-Programmable Gate ... 详细信息
来源: 评论
Boosted Performances of NTRUencrypt Post-Quantum Cryptosystem
收藏 引用
Journal of Cyber Security and Mobility 2021年 第4期10卷 725-744页
作者: Laaji, El Hassane Azizi, Abdelmalek Mohamed First University Oujda Morocco
The bottleneck of all cryptosystems is the difficulty of the computational complexity of the polynomials multiplication, vectors multiplication, etc. Thus most of them use some algorithms to reduce the complexity of t... 详细信息
来源: 评论
Number Theoretic Transform Architecture suitable to Lattice-based Fully-Homomorphic Encryption  32
Number Theoretic Transform Architecture suitable to Lattice-...
收藏 引用
32nd IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)
作者: Paludo, Rogerio Sousa, Leonel Univ Lisbon INESC ID Inst Super Tecn Lisbon Portugal
The Number Theoretic Transform (NTT) plays a central role for supporting high-performance polynomial multiplication on Post-Quantum Cryptography (PQC) and Fully-Homomorphic Encryption (FHE). This paper proposes a nove... 详细信息
来源: 评论
The Novel Efficient Dual-field FIPS Modular Multiplication
收藏 引用
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2020年 第2期14卷 738-756页
作者: Zhang, Tingting Zhu, Junru Liu, Yang Chen, Fulong Anhui Normal Univ Sch Comp & Informat Wuhu 241002 Anhui Peoples R China Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing Peoples R China Anhui Prov Key Lab Network & Informat Secur Wuhu 241002 Anhui Peoples R China
The modular multiplication is the key module of public-key cryptosystems such as RSA (Rivest-Shamir-Adleman) and ECC (Elliptic Curve Cryptography). However, the efficiency of the modular multiplication, especially the... 详细信息
来源: 评论
An Area Aware Accelerator for Elliptic Curve Point Multiplication  27
An Area Aware Accelerator for Elliptic Curve Point Multiplic...
收藏 引用
27th IEEE International Conference on Electronics, Circuits and Systems (IEEE ICECS)
作者: Imran, Malik Pagliarini, Samuel Rashid, Muhammad Tallinn Univ Technol TalTech Dept Comp Syst Tallinn Estonia Umm Al Qurah Univ UQU Dept Comp Engn Mecca Saudi Arabia
This work presents a hardware accelerator, for the optimization of latency and area at the same time, to improve the performance of point multiplication process in Elliptic Curve Cryptography. In order to reduce the o... 详细信息
来源: 评论
Asynchronous hardware implementations for crypto primitives
收藏 引用
MICROPROCESSORS AND MICROSYSTEMS 2019年 64卷 221-236页
作者: Bashi, Mohamed Asan M. Shukla, Sandeep K. Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 Uttar Pradesh India
Cryptography plays a major role in all the modern applications, where the Galois field (GF) arithmetic circuits are inevitable. In this paper, asynchronous GF(2(m)) and m-bits GF(p) multiplier, inverter, and exponenti... 详细信息
来源: 评论
FPGA Realization of Low Register Systolic All-One-Polynomial Multipliers Over GF(2m) and Their Applications in Trinomial Multipliers
收藏 引用
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2017年 第2期25卷 725-734页
作者: Chen, Pingxiuqi Basha, Shaik Nazeem Mozaffari-Kermani, Mehran Azarderakhsh, Reza Xie, Jiafeng Wright State Univ Dept Elect Engn Dayton OH 45435 USA Rochester Inst Technol Dept Microelect & Elect Engn Rochester NY 14623 USA Rochester Inst Technol Dept Comp Engn Rochester NY 14623 USA
Systolic all-one-polynomial (AOP) multipliers usually suffer from the problem of high register complexity, especially in field-programmable gate array (FPGA) platforms where the register resources are not that abundan... 详细信息
来源: 评论
A Novel Logic Locking Technique for Hardware Security
A Novel Logic Locking Technique for Hardware Security
收藏 引用
IEEE International Conference on Electrical, Instrumentation and Communication Engineering (ICEICE)
作者: Thangam, T. Gayathri, G. Madhubala, T. PSNA Coll Engn & Technol Dept Elect & Commun Engn Dindigul Tamil Nadu India
Due to globalization of IC, hardware is defenseless to new sorts of assaults, for example, counterfeiting, figuring out and IP piracy. Logic locking technique is used for the hardware security. Logic locking conceals ... 详细信息
来源: 评论