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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

280 篇 会议
104 篇 期刊文献
4 篇 学位论文
1 册 图书

馆藏范围

389 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

333 篇 工学
- 284 篇 计算机科学与技术...
- 135 篇 软件工程
- 106 篇 信息与通信工程
- 86 篇 控制科学与工程
- 84 篇 电气工程
- 51 篇 网络空间安全
- 31 篇 电子科学与技术（可...
- 25 篇 机械工程
- 24 篇 石油与天然气工程
- 23 篇 交通运输工程
- 23 篇 安全科学与工程
- 15 篇 动力工程及工程热...
- 13 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 5 篇 材料科学与工程（可...
- 5 篇 环境科学与工程（可...
- 4 篇 航空宇航科学与技...
135 篇 理学
- 88 篇 数学
- 41 篇 物理学
- 15 篇 统计学（可授理学、...
- 14 篇 化学
- 11 篇 系统科学
59 篇 管理学
- 52 篇 管理科学与工程(可...
- 16 篇 图书情报与档案管...
- 11 篇 公共管理
- 4 篇 工商管理
15 篇 医学
- 11 篇 公共卫生与预防医...
- 5 篇 临床医学
9 篇 法学
- 6 篇 社会学
4 篇 教育学
4 篇 文学
- 4 篇 新闻传播学
1 篇 经济学
1 篇 农学

主题

389 篇 encryption algor...
17 篇 cryptography
10 篇 security
7 篇 cloud computing
5 篇 elliptic curve c...
5 篇 aes
5 篇 encryption
4 篇 internet of thin...
4 篇 iot
4 篇 rsa
3 篇 decryption algor...
3 篇 block cipher
3 篇 cryptanalysis
3 篇 ecc
3 篇 information secu...
3 篇 blockchain
3 篇 des
3 篇 cloud security
3 篇 chaos
3 篇 blowfish

机构

4 篇 school of comput...
3 篇 karnataka bangal...
3 篇 department of co...
3 篇 maharishi school...
3 篇 brno university ...
2 篇 department of me...
2 篇 emilio aguinaldo...
2 篇 v. n. karazin kh...
2 篇 business school ...
2 篇 technological in...
2 篇 beijing electron...
2 篇 shanwei institut...
2 篇 tei western gree...
2 篇 g.e. pukhov inst...
2 篇 rajalakshmi engi...
2 篇 saveetha institu...
2 篇 school of comput...
2 篇 the university o...
2 篇 shandong fundame...
2 篇 karnataka bengal...

作者

3 篇 lutsenko vladisl...
3 篇 ye jun
3 篇 medina ruji p.
3 篇 sison ariel m.
3 篇 thangaraj s. joh...
2 篇 wang chunpeng
2 篇 carlson albert
2 篇 alomari mohammad...
2 篇 sun yunge
2 篇 gabr mohamed
2 篇 kudo momonari
2 篇 adamek janis
2 篇 faisal
2 篇 ramli abdul rahm...
2 篇 binfet philipp
2 篇 qu junpeng
2 篇 petropoulos ch.
2 篇 chovanec martin
2 篇 samsudin khairul...
2 篇 rozlomii inna

语言

308 篇 英文
78 篇 其他
6 篇 中文
1 篇 德文
1 篇 法文
1 篇 斯洛文尼亚文

检索条件"主题词=Encryption algorithms"

共 389 条记录，以下是261-270 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Application of Genetics algorithms in Cryptography 28

Application of Genetics Algorithms in Cryptography

引用

28th IEEE International Conference on Intelligent Engineering Systems (INES)

作者： Pekarcik, Peter Chovancova, Eva Chovanec, Martin Stancel, Martin Tech Univ Kosiciach Fak Elektrotechn Informat Katedra Pocitacov Informat Letna 9 Kosice 04200 Slovakia

ISBN: (纸本)9798350367607;9798350367591

One of the most essential subfields of modern IT is undoubtedly cybersecurity. The cybersecurity practice, also known as cryptology, combines various disciplines like computer science, computer engineering, and mathematics to create complex algorithms. In our work, we combine cryptology with the field of genetics algorithms to develop new encryption algorithms. Firstly, we introduced the fundamental theories of these two fields. It aims to teach basic knowledge of using genetic algorithms to select specific parts of encryption algorithms (chromosomes) and combine them to produce new encryption algorithms (offspring). The standard flow of the genetic algorithm is divided into the initial population's creation process, evaluation, fitness score assignments, selection, crossover, and mutation. We will take a deeper look at the process of assignments of fitness score and crossover. These processes ' new design, implementation, and testing allow us to reach the results presented.

关键词： crossover cryptography decryption decryption algorithms encryption encryption algorithms fitness score genetic algorithms initial population mutation selection

来源：评论

学校读者我要写书评

暂无评论

On the Gini-impurity Preservation For Privacy Random Forests 37

On the Gini-impurity Preservation For Privacy Random Forests

引用

37th Conference on Neural Information Processing Systems (NeurIPS)

作者： Xie, Xin-Ran Yuan, Man-Jie Bai, Xue-Tong Gao, Wei Zhou, Zhi-Hua Nanjing Univ Natl Key Lab Novel Software Technol Nanjing Peoples R China Nanjing Univ Sch Artificial Intelligence Nanjing Peoples R China

ISBN: (纸本)9781713899921

Random forests have been one of the successful ensemble algorithms in machine learning. Various techniques have been utilized to preserve the privacy of random forests, such as anonymization, differential privacy, homomorphic encryption, etc. This work takes one step towards data encryption by incorporating some crucial ingredients of learning algorithm. Specifically, we develop a new encryption to preserve data's Gini impurity, which plays an important role during the construction of random forests. The basic idea is to modify the structure of binary search tree to store several examples in each node, and encrypt the data features by incorporating label and order information. Theoretically, our scheme is proven to preserve the minimum Gini impurity in ciphertexts without decrypting, and we also present the security guarantee for encryption. For random forests, we encrypt data features based on our Gini-impurity-preserving scheme, and take the homomorphic encryption scheme CKKS to encrypt data labels owing to their importance and privacy. We finally present extensive empirical studies to validate the effectiveness, efficiency and security of our proposed method.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid Algorithm for Secure Routing in MANET Using Cryptographic Applications

Hybrid Algorithm for Secure Routing in MANET Using Cryptogra...

引用

2024 IEEE International Conference on Electronic Systems and Intelligent Computing, ICESIC 2024

作者： Muruganandam, S. Gnanavel, S. Narayana, K.E. Jaeyalakshmi, M. Antony Kumar, K. Panimalar Engineering College Department of Computer Science and Business Systems Chennai India SRM Institute of Science and Technology Kattankulathur Campus Faculty of Engineering and Technology Department of Computing Technologies Chengalpattu India Rajalakshmi Engineering College Department of Information Technology Chennai India Rajalakshmi Engineering College Department of Computer Science and Engineering Chennai India Vel Tech Rangarajan Dr Sagunthala R and D Institute of Science and Technology Department of Computer Science and Engineering Chennai India

ISBN: (纸本)9798331522988

In Mobile sensor Networks, Each and every wireless node dynamically changes its location due to its mobility nature. The routing information is maintained by the master node to deliver a data packet from source to destination. The attackers easily hack this wireless network. The performance of the complete networks is dropped by packets transmission attacks. Attacker node drops the packet. An enhanced protection technique in response to packets transmission misbehaviour attacks is provided to increase the energy efficiency of mobile nodes. This paper proposed the Cryptographic formed Malicious Node Detection and Secure Routing framework (CMNDSR). This model incorporates three various strategies specially algorithm for control of access, to protects initial illegal node in the network. The suspected identification and prevention techniques based on hop count value. Secure routing method with a private key generated at random like one time password (OTP). The proposed methods are power efficient, by operating a minimum number of nodes in challenging environment. The misbehaviour nodes are promptly identified and isolated using this proposed approach. The Cryptographic based Secure routing algorithm is applied to provide secure transmission in wireless networking environment. The outcomes of the simulation display how effectively the recommended approach can identify malicious nodes in a MANET. In comparison with previous methods, the energy consumption is 10% lower and the suspicious node detection rate is increased by 95%. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Exact Soft Analytical Side-Channel Attacks using Tractable Circuits 41

Exact Soft Analytical Side-Channel Attacks using Tractable C...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wedenig, Thomas Nagpal, Rishub Cassiers, Gaëtan Mangard, Stefan Peharz, Robert Institute of Theoretical Computer Science Graz University of Technology Graz Austria Institute of Applied Information Processing and Communications Graz University of Technology Graz Austria UCLouvain Ottignies-Louvain-la-Neuve Belgium

Detecting weaknesses in cryptographic algorithms is of utmost importance for designing secure information systems. The state-of-the-art soft analytical side-channel attack (SASCA) uses physical leakage information to make probabilistic predictions about intermediate computations and combines these "guesses" with the known algorithmic logic to compute the posterior distribution over the key. This attack is commonly performed via loopy belief propagation, which, however, lacks guarantees in terms of convergence and inference quality. In this paper, we develop a fast and exact inference method for SASCA, denoted as ExSASCA, by leveraging knowledge compilation and tractable probabilistic circuits. When attacking the Advanced encryption Standard (AES), the most widely used encryption algorithm to date, ExSASCA outperforms SASCA by more than 31% top-1 success rate absolute. By leveraging sparse belief messages, this performance is achieved with little more computational cost than SASCA, and about 3 orders of magnitude less than exact inference via exhaustive enumeration. Even with dense belief messages, ExSASCA still uses 6 times less computations than exhaustive inference. Copyright 2024 by the author(s)

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Cryptography Algorithm Based on Digital Identity Authentication 11th

Evaluation of Cryptography Algorithm Based on Digital Identi...

引用

11th International Conference on Applications and Techniques in Cyber Intelligence, ATCI 2023

作者： Zhang, Liang Sheng, Jianqiao Zhang, Yicao Wu, Qiuyang State Grid Anhui Electric Power Co. Ltd. Information and Communication Branch Anhui Hefei China

Cryptography algorithm is an important means to achieve identity authentication, and it is also a key technology to achieve identity authentication. In recent years, cryptography algorithms have been widely used in the field of identity authentication, and some major breakthroughs have been made. However, in specific applications, there are still some security vulnerabilities and hidden dangers. The article first introduced various identity authentication algorithms, analyzed several typical security vulnerabilities that currently exist, and proposed corresponding security suggestions and improvement measures to address these vulnerabilities, so as to provide reference for the design and implementation of identity authentication schemes. The final results showed that the cryptography algorithm improved by digital identity authentication could improve the regularity of run distribution to an average of 86.95%. © 2024 The Authors. Published by Elsevier B.V.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Proof of unsecure in the polynomial time for the XOR of two random variables 14

A Proof of unsecure in the polynomial time for the XOR of tw...

引用

14th International Conference on Information Technology in Medicine and Education, ITME 2024

作者： Wu, Huiwen Liu, Chenglian Software Engineering Institute of Guangzhou Department of Networking Technology Guangzhou510900 China

ISBN: (纸本)9798350356670

Xoring (Exclusive-OR) two variables is a very simple way to build pseudorandom functions from pseudorandom permutations. The aim of this paper proves it may insecure for this type of form A⊕B when the two variables run XOR operation on specific environment. Because such constructions have many applications in cryptography, the problem is interesting from both theoretical and practical points of view. In this paper we will prove that for form A⊕B, we have in fact already unsecure when A and B are two numbers data type. The research results and conclusions are drawn at the end. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Study of Quantum-Secret Communication Technology and Its Application in Industrial IoT

A Study of Quantum-Secret Communication Technology and Its A...

引用

2024 International Conference on Innovative Design and Intelligent Manufacturing, IDIM 2024

作者： Peng, Dili Dong, Wu Chen, Xiaojin Peng, Linyu Chen, Keyu Long, Jiao Yan, Binyang Power Dispatching Control Center of Guizhou Power Grid Guiyang550002 China Guizhou Power Grid Co. Ltd. Guiyang Power Supply Bureau 550002 China

ISBN: (纸本)9781643685427

In order to achieve the balance between informatization and security in the process of using the Internet of Things, quantum secure communication technology and its application in the industrial Internet of Things were proposed. The use of quantum secure communication can effectively solve the security problems of devices, and can solve the security problems encountered in the distribution of quantum keys through endogenous security means. Secondly, aiming at the problem of massive access delay of IoT devices, this paper conducts software simulation tests. The simulation results show that the time delay of asymmetric encryption algorithm is longer than that of symmetric encryption algorithm, the time delay of asymmetric encryption algorithm SM2 is obvious, the time delay of symmetric encryption algorithm AES is longer than that of SM4 and XOR encryption method, and the time delay of XOR encryption method is the lowest among the three symmetric encryption methods. With the further increase of the number of terminals, The delay advantage of XOR encryption is more obvious. Conclusion: Quantum encryption has the characteristics of low delay and good stability in the working environment of IoT devices, which can effectively ensure the data security of IoT devices. © 2024 The Authors.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Time-based Secured Framework for Key-Exchange Between Trusted Parties: Quantum-Key Distribution Protocol

A Time-based Secured Framework for Key-Exchange Between Trus...

引用

2024 IEEE Silchar Subsection Annual Conference, SILCON 2024

作者： Bindu Madavi, K.P. Krishna Sowjanya, K. Patwari, Neha Shobharani, D.A. Christ University Dept. of Cse Bengaluru India Cmr Institute of Technology Dept. of Cse Bengaluru India Thakur College of Engineering & Technology Dept. of Cse Mumbai India Gitam University Dept. of Cse Bengaluru India

ISBN: (纸本)9798331540821

Cybersecurity attacks are rising day by day due to the explosive growth of the internet. Many encryption techniques and authentication mechanisms also came into existence to avoid or minimize cybersecurity attacks. However, these traditional encryption algorithms are facing new challenges because of quantum computers. Due to their high computational capacity, quantum computers will be able to decipher the messages which are encrypted by the encryption algorithms. To guard against these sophisticated cyber attacks, the Quantum-Key Distribution (QKD) protocol and the Time-Released encryption(TRE) algorithms are becoming popular. The paper proposes a Time-Based Quantum Key Distribution Protocol (TB-QKD), that enables a secure key exchange and decryption process between two trusted parties on an arbitrary time. The proposed TB-QKD protocol allows the sender and receiver to share the keys securely through the quantum channel with the help of QKD protocol. The algorithm encryption and decryption times for different messages have been observed and presented. Moreover, this protocol also provides a suitable solution that addresses many vulnerabilities that occur in the domain of data security and confidentiality. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Safeguarding Privacy for Cloud Computing's Encrypted Data Using Association Rule Mining Algorithm and FP Growth Algorithm 3

Safeguarding Privacy for Cloud Computing's Encrypted Data Us...

引用

3rd IEEE Delhi Section Flagship Conference, DELCON 2024

作者： Mohanapriya, D. Anu, P. Kalyani, N. Rekha, S. Praba, R. Sasikala, S. Psg College of Arts & Science Department of Computer Science Tamilnadu Coimbatore India School of Computing Sastra Deemed to be University Tamilnadu Thanjavur India Dr. N. G. P. Arts and Science College Department of Information Technology Tamilnadu Coimbatore India Tamilnadu Coimbatore India

ISBN: (纸本)9798331518592

In an effort to support data privacy, safeguarding privacy guidelines for association mining techniques have recently been presented. Nevertheless, the algorithms are unable to conceal data frequency and have an extra expense when inserting fictitious objects or transactions. In this research, we present a connection constraint mining technique for cloud computing encrypted data that protects confidentiality. In order to accomplish the data mining operations using the two cloud servers, the strategy first uses propagated encryption, which impairs the cloud infrastructure' encryption capabilities and shields the server from active attacks. Second, our approach uses combinations, coincidence masking, and cybernetic transactions in tandem to conceal the information while mining in order to safeguard the privacy of the association rule utilized in the extraction procedure. We use the FP growth algorithm for rule-mining for associations avoiding the need for extra fraudulent transactions. Therefore, the suggested technique can hide data frequency while ensuring query and data privacy. We show that, with regard to the time requirements of the Mining Association, the recommended strategy operates roughly three to five times better than the current algorithm. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis and strategy development for improving the performance of the Paillier cryptosystem algorithm in medical data processing 4

Analysis and strategy development for improving the performa...

引用

4th International Workshop on Information Technologies: Theoretical and Applied Problems, ITTAP 2024

作者： Semchyshyn, Volodymyr Mykhalyk, Dmytro Ternopil Ivan Puluj National Technical University 1 Ruska str 56 Ternopil46001 Ukraine

The Paillier cryptosystem, known for its additive homomorphic properties, plays a crucial role in preserving the confidentiality of computations with encrypted medical data. However, its computational complexity poses significant challenges when applied to large-scale medical datasets, affecting both performance and efficiency. This study focuses on analyzing the performance limitations of the Paillier cryptosystem and developing strategies to improve its performance for medical data processing. This study provides a comprehensive framework for improving the performance of the Paillier cryptosystem, contributing to its effectiveness in the secure processing of medical data and paving the way for future advances in privacy-preserving cryptographic techniques. Copyright © 2024 for this paper by its authors.

关键词： Cloud Computing Data Confidentiality encryption algorithms Medical Data Processing Paillier Cryptosystem

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共39页 << < 23 24 25 26 27 28 29 30 31 32 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：