咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是51-60 订阅
排序:
Solving Generalized Small Inverse Problems
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2011年 第6期E94A卷 1274-1284页
作者: Kunihiro, Noboru Univ Tokyo Kashiwa Chiba 2778561 Japan
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x(0), x(1),...x(n)) = x(0)h(x(1),...,x(n))+C = ... 详细信息
来源: 评论
An application of lattice basis reduction to polynomial identities for algebraic structures
收藏 引用
LINEAR ALGEBRA AND ITS APPLICATIONS 2009年 第2-3期430卷 642-659页
作者: Bremner, Murray R. Peresi, Luiz A. Univ Saskatchewan Dept Math & Stat Saskatoon SK S7N 0W0 Canada Univ Sao Paulo Dept Matemat BR-05508 Sao Paulo Brazil
The authors' recent classification of trilinear operations includes, among other cases, a fourth family of operations with parameter q epsilon Q boolean OR {infinity}, and weakly commutative and weakly anticommuta... 详细信息
来源: 评论
Density attack to the knapsack cryptosystems with enumerative source encoding
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2004年 第6期E87A卷 1564-1569页
作者: Omura, K Tanaka, K Ricoh Co Ltd Software R&D Grp Tokyo 1120002 Japan Tokyo Inst Technol Dept Math & Comp Sci Tokyo 1528552 Japan
We analyze the Lagarias-Odlyzko low-density attack precisely, and show that this low-density attack can be applied to the Chor-Rivest and the Okamoto-Tanaka-Uchiyama cryptosystemes, which are considered to be secure a... 详细信息
来源: 评论
A New Attack on RSA with Known Middle Bits of the Private Key
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年 第12期E98A卷 2677-2685页
作者: Wang, Shixiong Qu, Longjiang Li, Chao Fu, Shaojing Natl Univ Def Technol Coll Sci Changsha Hunan Peoples R China Natl Univ Def Technol Coll Comp Sci Changsha Hunan Peoples R China
In this paper, we investigate the security property of RSA when some middle bits of the private key d are known to an attacker. Using the technique of unravelled linearization, we present a new attack on RSA with know... 详细信息
来源: 评论
Experimental quality evaluation of lattice basis reduction methods for decorrelating low-dimensional integer least squares problems
收藏 引用
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING 2013年 第1期2013卷 1页
作者: Xu, Peiliang Kyoto Univ Disaster Prevent Res Inst Kyoto 6110011 Japan
Reduction can be important to aid quickly attaining the integer least squares (ILS) estimate from noisy data. We present an improved lll algorithm with fixed complexity by extending a parallel reduction method for pos... 详细信息
来源: 评论
Modular Las Vegas algorithms for polynomial absolute factorization
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2010年 第12期45卷 1280-1295页
作者: Bertone, Cristina Cheze, Guillaume Galligo, Andre Univ Nice Sophia Antipolis Lab JA Dieudonne Nice France Univ Turin Dipartimento Matemat I-10124 Turin Italy Univ Toulouse 3 Inst Math Toulouse F-31062 Toulouse France
Let f (X, Y) is an element of Z[X, Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope off, or more precisely, off modulo some prime inte... 详细信息
来源: 评论
THE ABSOLUTE Sk-MEASURE OF TOTALLY POSITIVE ALGEBRAIC INTEGERS
收藏 引用
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY 2023年 第2期107卷 239-249页
作者: Wang, Cong Pang, Xiaojuan Wu, Qiang Southwest Univ China Dept Math 2 Tiansheng Rd Chongqing 400715 Peoples R China
Let alpha be a totally positive algebraic integer of degree d, with conjugates alpha(1) = alpha, alpha(2),..., alpha(d). The absolute S-k-measure of alpha is defined by s(k)(alpha) = d(-1)Sigma(d)(i=1) alpha(k)(i). We... 详细信息
来源: 评论
FINDING WELL APPROXIMATING LATTICES FOR A FINITE SET OF POINTS
收藏 引用
MATHEMATICS OF COMPUTATION 2019年 第315期88卷 369-387页
作者: Hajdu, A. Hajdu, L. Tijdeman, R. Univ Debrecen Fac Informat POB 12 H-4010 Debrecen Hungary Univ Debrecen Inst Math POB 12 H-4010 Debrecen Hungary Leiden Univ Math Inst Postbus 9512 NL-2300 RA Leiden Netherlands
In this paper we address the task of finding well approximating lattices for a given finite set A of points in R-n motivated by practical texture analytic problems. More precisely, we search for o, d(1),..., d(n) is a... 详细信息
来源: 评论
An exponential Diophantine equation related to the sum of powers of two consecutive terms of a Lucas sequence and x-coordinates of Pell equations
收藏 引用
PERIODICA MATHEMATICA HUNGARICA 2021年 第2期83卷 165-184页
作者: Erazo, Harold S. Gomez, Carlos A. Inst Nacl Matemat Pura & Aplicada Estr Dona Castorina 110 Rio De Janeiro Brazil Univ Valle Dept Matemat Calle 13 100-00 Cali Colombia
For the Fibonacci sequence the identity F-n(2) + F-n+1(2) = F2n+1 holds for all n >= 0. Let X := (X-l)(l >= 1) be the sequence of X-coordinates of the positive integer solutions (X, Y) of the Pell equation X-2 -... 详细信息
来源: 评论
Integer estimation methods for GPS ambiguity resolution: an applications oriented review and improvement
收藏 引用
SURVEY REVIEW 2012年 第324期43卷 59-71页
作者: Xu, Peiliang Shi, Chuang Liu, Jingnan Kyoto Univ Disaster Prevent Res Inst Kyoto 6110011 Japan Wuhan Univ GNSS Res Ctr Wuhan 430071 Peoples R China
The integer least squares (ILS) problem, also known as the weighted closest point problem, is highly interdisciplinary, but no algorithm can find its global optimal integer solution in polynomial time. We first outlin... 详细信息
来源: 评论