检索结果-内蒙古大学图书馆

On the equivalence of RSA and factoring regarding generic ring algorithms

12th International Conference on the Theory of Application of Cryptology and Information Security

作者： Leander, Gregor Rupp, Andy Ruhr Univ Bochum Horst Gortz Inst IT Secur Univ Str 150 D-4630 Bochum Germany

ISBN: (纸本)9783540494751

To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides some evidence towards the validity of this equivalence. We show that any efficient generic ring algorithm which solves the (flexible) low-exponent RSA problem can be converted into an efficient factoring algorithm. Thus, the low-exponent RSA problem is intractable w.r.t. generic ring algorithms provided that factoring is hard.

关键词： computational equivalence RSA problem factorization problem generic algorithms

来源：评论

学校读者我要写书评

暂无评论

A generic Approach for Analysis of White-Light Interferometry Data via User-Defined algorithms

A Generic Approach for Analysis of White-Light Interferometr...

引用

14th International Conference on Computational Science and Its Applications (ICCSA)

作者： Schneider, Max Fey, Dietmar Wenzel, Kay Machleidt, Torsten Univ Erlangen Nurnberg Erlangen Germany Gesell Bild & Signalverarbeitung GBS mbH Ilmenau Germany

ISBN: (纸本)9783319091471;9783319091464

The non-destructive and automatic 3D surface analysis using white-light interferometry has very high demands on the required computing systems. This is due to both, the high volume of data that are collected and the tremendous computational power, required by algorithms which evaluate the data. Furthermore, material characteristics and environmental influences like temperature or ambient light have a not negligible effect on the scan procedure, such that the algorithmic approaches must be adjusted to assess the correct surface profile. Thus, to obtain the desired analysis results and to fulfill the computational requirements, the application developer has to consider the physical characteristics of the white-light interferometry process as well as the attributes of the computational platform used. This paper describes the generic computational module of a new framework for the white-light interferometry surface scanning procedure to address these problems. This framework allows a user-transparent automatic assessment and usage of available computational resources.

关键词： White-light interferometry High-performance computing Function objects GPGPU generic algorithms

来源：评论

学校读者我要写书评

暂无评论

Breaking RSA generically Is Equivalent to Factoring

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第11期62卷 6251-6259页

作者： Aggarwal, Divesh Maurer, Ueli Natl Univ Singapore Dept Comp Sci Ctr Quantum Technol Singapore 117543 Singapore ETH Dept Comp Sci CH-8092 Zurich Switzerland

Let N be a random variable distributed according to some appropriate distribution over the set of products of two primes, such that factoring N is believed to be hard. The RSA assumption states that, given an a chosen uniformly at random from Z(N) and an e is an element of N \ {1} such that gcd(e, phi(N)) = 1, it is computationally hard to find an x is an element of Z(N) such that x(e) - a = 0 (mod N). When complexity-theoretic (relative) lower bounds for certain cryptographic problems in a general model of computation seem to elude discovery, a common practice in cryptography is to give proofs of computational security in meaningful restricted models of computation. An example of such a restricted model that is interesting in cryptography is the generic group model that has been used for proving lower bounds for the discrete logarithm problem and other related problems. A generic model captures that an algorithm does not exploit the bit representation of the elements other than for testing equality. In this paper, we prove that the problem of factoring N can be efficiently reduced to solving the RSA problem on ZN in the generic ring model of computation, where an algorithm can perform ring operations, inverse ring operations, and test equality. This provides evidence toward the soundness of the RSA encryption and digital signature scheme, in particular showing that under the factoring assumption, they are not vulnerable to certain kinds of cryptanalytic attacks.

关键词： generic algorithms reductions factoring RSA

来源：评论

学校读者我要写书评

暂无评论

Secured distributed algorithms without hardness assumptions

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2023年 171卷 130-140页

作者： Barenboim, Leonid Levin, Harel Open Univ Israel Dept Math & Comp Sci POB 808 Raanana Israel Nucl Res Ctr Negev Dept Phys POB 9001 Beer Sheva Israel

We study algorithms in the LOCAL model that produce secured output. Specifically, each vertex computes its part in the output, the entire output is correct, but each vertex cannot discover the output of other vertices, with a certain probability. As the extensive research in the distributed algorithms field yielded efficient decentralized algorithms, the discussion about the security of distributed algorithms was somewhat neglected. Nevertheless, many protocols and algorithms were devised in the research area of secure multi-party computation problem. However, the focus in those protocols was to work for every function f at the expense of increasing the round complexity, or the necessity of several computational assumptions. We present a novel approach, which identifies and develops those algorithms that are inherently secure (which means they do not require any further constructions). This approach yields efficient secure algorithms for various labeling and decomposition problems without requiring any hardness assumption, but only a private randomness generator in each vertex.(c) 2022 Elsevier Inc. All rights reserved.

关键词： Distributed algorithms Privacy preserving Graph coloring generic algorithms Multi-party computation

来源：评论

学校读者我要写书评

暂无评论

A comparative study of global optimization approaches to MEG source localization

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2003年第3期80卷 305-324页

作者： Jiang, TZ Luo, A Li, XD Kruggel, F Chinese Acad Sci Inst automat Natl Lab Pattern Recognit Beijing 100080 Peoples R China Max Planck Inst Cognit Neurosci D-04103 Leipzig Germany

It is well-known that the problem of MEG source localization can be cast as an optimization problem. So far, there have been many works in which various optimization methods were adopted for source localization. In this paper, we compare the performance of three typical and widely used optimization techniques for a specific MEG source localization problem. We first introduce a hybrid algorithm by combining genetic and local search strategies to overcome disadvantages of conventional genetic algorithms. Second, we apply the tabu search, a widely used optimization method in combinational optimization and discrete mathematics, to source localization. To the best of our knowledge, this is the first attempt in the literature to apply tabu search to MEG/EEG source localization. Third, in order to further compare the performance of the above algorithms, simulated annealing is also applied to MEG source localization problem. The computer simulation results show that our local genetic algorithm is the most effective approach to dipole localization, and the tabu search method is also a very good strategy for this problem.

关键词： magnetoencephalogram (MEG) dipoles global optimization generic algorithms simulated annealing tabu search

来源：评论

学校读者我要写书评

暂无评论

Automatic segmentation of dermoscopy images using self-generating neural networks seeded by genetic algorithm

引用

PATTERN RECOGNITION 2013年第3期46卷 1012-1019页

作者： Xie, Fengying Bovik, Alan C. Beihang Univ Image Proc Ctr Sch Aeronaut & Astronaut Beijing 100191 Peoples R China Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

A novel dermoscopy image segmentation algorithm is proposed using a combination of a self-generating neural network (SGNN) and the genetic algorithm (GA). Optimal samples are selected as seeds using GA;taking these seeds as initial neuron trees, a self-generating neural forest (SGNF) is generated by training the rest of the samples using SGNN. Next the number of clusters is determined by optimizing the SD index of cluster validity, and clustering is completed by treating each neuron tree as a cluster. Since SGNN often delivers inconsistent cluster partitions owing to sensitivity relative to the input order of the training samples, GA is combined with SGNN to optimize and stabilize the clustering result. In the post-processing phase, the clusters are merged into lesion and background skin, yielding the segmented dermoscopy image. A series of experiments on the proposed model and the other automatic segmentation methods (including Otsu's thresholding method, k-means, fuzzy c-means (FCM) and statistical region merging (SRM)) reveals that the optimized model delivers better accuracy and segmentation results. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Dermoscopy images Self-generating neural network Image clustering Automatic segmentation generic algorithms

来源：评论

学校读者我要写书评

暂无评论

The essence of constraint propagation

引用

THEORETICAL COMPUTER SCIENCE 1999年第1-2期221卷 179-210页

作者： Apt, KR CWI NL-1009 AB Amsterdam Netherlands Univ Amsterdam Dept Math Comp Sci Phys & Astron NL-1012 WX Amsterdam Netherlands

We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, filtering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify and compare these algorithms and to establish in a uniform way their basic properties. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： constraint propagation chaotic iteration generic algorithms

来源：评论

学校读者我要写书评

暂无评论

Development of constrained-genetic-algorithm load-flow method

引用

IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION 1997年第2期144卷 91-99页

作者： Wong, KP Li, A Law, MY WESTERN POWER CORP PLANNING & CONTRACTS SECTPERTHWA 6000AUSTRALIA

A genetic-algorithm load-flow algorithm is developed. Methods for satisfying the power balance requirement and the voltage magnitude constraint are then developed and incorporated into the genetic-algorithm method to form a constrained-genetic-algorithm load-flow algorithm for solving the load-flow problem. The robustness of the new load-flow algorithm is enhanced by the dynamic population method, the technique for accelerating the convergence of the optimisation process and the network node sequencing procedure described in the paper. The paper presents study results obtained by applying the new algorithm to study the practical Klos-Kerner 11-busbar system under light-load and heavy-load conditions.

关键词： generic algorithms

来源：评论

学校读者我要写书评

暂无评论

The role of commutativity in constraint propagation algorithms

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2000年第6期22卷 1002-1036页

作者： Apt, KR CWI NL-1090 GB Amsterdam Netherlands Univ Amsterdam NL-1012 WX Amsterdam Netherlands

Constraint propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps. First, we introduce a generic iteration algorithm on partial orderings and prove its correctness in an abstract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the notions commutativity and semi-commutativity, we show that the AC-3, PC-2, DAC, and DPC algorithms for achieving (directional) are consistency and (directional) path consistency are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt [1999a].

关键词： constraint propagation generic algorithms commutativity

来源：评论

学校读者我要写书评

暂无评论

SPARE Parts: a C++ toolkit for string pattern recognition

引用

SOFTWARE-PRACTICE & EXPERIENCE 2004年第7期34卷 697-710页

作者： Watson, BW Cleophas, L Univ Pretoria Dept Comp Sci ZA-0002 Pretoria South Africa Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands

In this paper, we consider the design and implementation of SPARE Parts, a C++ toolkit for pattern matching. SPARE Parts (in particular, the 2003 version presented in this article) is the second generation string pattern matching toolkit by the authors. The toolkit, the first generic program for keyword pattern matching, contains implementations of the well-known Knuth-Morris-Pratt, Boyer-Moore, Aho-Corasick and Commentz-Walter algorithms (and their variants). The toolkit is freely available for non-commercial use. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： keyword pattern matching C plus plus toolkits C plus plus frameworks generic algorithms foundation classes taxonomies

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：