咨询与建议

限定检索结果

文献类型

  • 84 篇 期刊文献
  • 48 篇 会议
  • 1 册 图书
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 94 篇 工学
    • 66 篇 计算机科学与技术...
    • 49 篇 电气工程
    • 20 篇 信息与通信工程
    • 16 篇 电子科学与技术(可...
    • 7 篇 软件工程
    • 3 篇 仪器科学与技术
    • 2 篇 测绘科学与技术
    • 2 篇 网络空间安全
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 动力工程及工程热...
    • 1 篇 控制科学与工程
    • 1 篇 土木工程
    • 1 篇 交通运输工程
    • 1 篇 生物医学工程(可授...
  • 60 篇 理学
    • 53 篇 数学
    • 4 篇 物理学
    • 2 篇 生物学
    • 1 篇 化学
    • 1 篇 地球物理学
    • 1 篇 系统科学
  • 6 篇 医学
    • 6 篇 临床医学
    • 1 篇 特种医学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
  • 3 篇 军事学
    • 2 篇 军队指挥学
  • 1 篇 哲学
    • 1 篇 哲学

主题

  • 134 篇 lll algorithm
  • 23 篇 lattice reductio...
  • 22 篇 lattice
  • 20 篇 rsa
  • 16 篇 cryptanalysis
  • 13 篇 lattice basis re...
  • 13 篇 mimo
  • 12 篇 coppersmith's me...
  • 11 篇 lattices
  • 7 篇 mmse
  • 7 篇 factorization
  • 6 篇 ntru
  • 6 篇 closest vector p...
  • 6 篇 lattice-reductio...
  • 6 篇 signal estimatio...
  • 6 篇 semi-infinite li...
  • 5 篇 shortest vector ...
  • 5 篇 unravelled linea...
  • 5 篇 explicit auxilia...
  • 5 篇 cryptography

机构

  • 7 篇 univ electrocomm...
  • 7 篇 chinese acad sci...
  • 6 篇 chinese acad sci...
  • 4 篇 univ chinese aca...
  • 3 篇 ewha womans univ...
  • 3 篇 hong kong baptis...
  • 3 篇 southwest univ c...
  • 3 篇 ewha womans univ...
  • 2 篇 indian stat inst...
  • 2 篇 univ saskatchewa...
  • 2 篇 tsinghua univ in...
  • 2 篇 univ london impe...
  • 2 篇 tsinghua univ de...
  • 2 篇 stellenbosch uni...
  • 2 篇 univ chinese aca...
  • 2 篇 aristotle univ t...
  • 2 篇 indian stat inst...
  • 2 篇 univ caen basse ...
  • 2 篇 beijing res inst...
  • 2 篇 univ tokyo

作者

  • 9 篇 fujino tadashi
  • 8 篇 hu lei
  • 8 篇 sarkar santanu
  • 8 篇 xu jun
  • 6 篇 wu qiang
  • 6 篇 peng liqiang
  • 5 篇 huang zhangjie
  • 5 篇 nitaj abderrahma...
  • 5 篇 kunihiro noboru
  • 4 篇 bi jingguo
  • 4 篇 qiao sanzheng
  • 4 篇 luk franklin t.
  • 4 篇 maitra subhamoy
  • 3 篇 ling cong
  • 3 篇 bremner murray r...
  • 3 篇 hou wei
  • 3 篇 takagi tsuyoshi
  • 3 篇 pan yanbin
  • 3 篇 takayasu atsushi
  • 3 篇 lee hyang-sook

语言

  • 123 篇 英文
  • 10 篇 其他
  • 1 篇 中文
检索条件"主题词=LLL Algorithm"
134 条 记 录,以下是21-30 订阅
排序:
A PARAMETRIC VERSION OF lll AND SOME CONSEQUENCES: PARAMETRIC SHORTEST AND CLOSEST VECTOR PROBLEMS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2020年 第4期34卷 2363-2387页
作者: Bogart, Tristram Goodrick, John Woods, Kevin Univ Los Andes Dept Matemat Bogota 11001000 Colombia
Given a parametric lattice with a basis given by polynomials in Z[t], we give an algorithm to construct an lll-reduced basis whose elements are eventually quasi-polynomial in t: that is, they are given by formulas tha... 详细信息
来源: 评论
lll & ABC
收藏 引用
JOURNAL OF NUMBER THEORY 2004年 第1期107卷 161-167页
作者: Dokchitser, T Univ Durham Dept Math Sci Durham DH1 3HP England
This note is an observation that the lll algorithm applied to prime powers can be used to find "good" examples for the ABC and Szpiro conjectures. (C) 2004 Elsevier Inc. All rights reserved.
来源: 评论
Improved Herrmann-May's Attack with Merging Variables and Lower lll Bound  19th
Improved Herrmann-May's Attack with Merging Variables and Lo...
收藏 引用
19th International Conference on Information Security and Cryptology (Inscrypt)
作者: Cheng, Qingfeng Zhao, Chunzhi Cao, Jinzheng Wei, Fushan Informat Engn Univ Zhengzhou 450001 Peoples R China
Using side information to attack RSA is a practical method. In reality, it's possible to intercept some bits of an unknown divisor p of a known composite integer N for us. Then we can utilize Coppersmith's met... 详细信息
来源: 评论
Cryptanalysis of Prime Power RSA with two private exponents
收藏 引用
Science China(Information Sciences) 2015年 第11期58卷 59-66页
作者: ZHENG MengCe HU HongGang Key Laboratory of Electromagnetic Space Information Chinese Academy of Sciences School of Information Science and Technology University of Science and Technology of China
In this paper, we consider a variant of RSA schemes called Prime Power RSA with modulus N= prq for r 2, where p, q are of the same bit-size. May showed that when private exponent d<N;/(r+1);or d < N;, N can be... 详细信息
来源: 评论
Generalized cryptanalysis of RSA with small public exponent
收藏 引用
Science China(Information Sciences) 2016年 第3期59卷 97-106页
作者: Mengce ZHENG Honggang HU Zilong WANG Key Laboratory of Electromagnetic Space Information Chinese Academy of Sciences (CAS) School of Information Science and Technology University of Science and Technology of China
In this paper, we demonstrate that there exist weak keys in the RSA public-key cryptosystem with the public exponent e = NαN0.5. In 1999, Boneh and Durfee showed that when α≈ 1 and the private exponent d = Nβ< ... 详细信息
来源: 评论
Small CRT-Exponent RSA Revisited
收藏 引用
JOURNAL OF CRYPTOLOGY 2019年 第4期32卷 1337-1382页
作者: Takayasu, Atsushi Lu, Yao Peng, Liqiang Univ Tokyo Tokyo Japan Natl Inst Adv Ind Sci & Technol Tokyo Japan Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing Peoples R China Chinese Acad Sci Data Assurance & Commun Secur Res Ctr Beijing Peoples R China
Since May (Crypto'02) revealed the vulnerability of the small CRT-exponent RSA using Coppersmith's lattice-based method, several papers have studied the problem and two major improvements have been made. (1) B... 详细信息
来源: 评论
Deterministic polynomial time equivalence between factoring and key-recovery attack on Takagi's RSA
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年 第9期E91A卷 2356-2364页
作者: Kunihiro, Noboru Kurosawa, Kaoru Univ Electrocommun Chofu Tokyo 1828585 Japan Ibaraki Univ Hitachi Ibaraki 3168511 Japan
For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA... 详细信息
来源: 评论
A Unified Framework for Small Secret Exponent Attack on RSA
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2014年 第6期E97A卷 1285-1295页
作者: Kunihiro, Noboru Shinohara, Naoyuki Izu, Tetsuya Univ Tokyo Kashiwa Chiba 2778561 Japan NICT Koganei Tokyo 1848795 Japan Fujitsu Labs Kawasaki Kanagawa 2118588 Japan
In this paper, we present a lattice based method on small secret exponent attack on the RSA scheme. Boneh and Durfee reduced the attack to finding the small roots of the bivariate modular equation: x(N + 1 + y)+1 0 (m... 详细信息
来源: 评论
Improving BDD Enumeration for LWE Problem Using GPU
收藏 引用
IEEE ACCESS 2020年 8卷 19737-19749页
作者: Esseissah, Mohamed S. Bhery, Ashraf Bahig, Hatem M. Ain Shams Univ Fac Sci Math Dept Comp Sci Div Cairo 11566 Egypt
In this paper, we present a GPU-based parallel algorithm for the Learning With Errors (LWE) problem using a lattice-based Bounded Distance Decoding (BDD) approach. To the best of our knowledge, this is the first GPU-b... 详细信息
来源: 评论
Jug measuring: algorithms and complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1-3期396卷 50-62页
作者: Shieh, Min-Zheng Tsai, Shi-Chun Natl Chiao Tung Univ Dept Comp Sci Hsinchu 30050 Taiwan
We study the hardness of the optimal jug measuring problem. By proving tight lower and upper bounds on the minimum number of measuring steps required, we reduce an inapproximable NP-hard problem (i.e., the shortest GC... 详细信息
来源: 评论