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

A New Algorithm Based on DES and ECC for CSCW

学校读者我要写书评

暂无评论

A New Algorithm Based on DES and ECC for CSCW

The 8th International Conference on Computer Supported Cooperative Work in Design(第八届计算机支持的协同工作设计国际会议)(CSCWD2004)

作者： Meng Liu Peng Gong Feng-jiao Qiu Department of Computer Science of Shandong University at Weihai 264209 Department of Computer Science of Shandong University at Weihai 264209

ISBN: (纸本)0780379411

CSCW (Computer Supported Cooperative Work )means a group of people cooperate to finish the sametask with the help of computers. Under such a workingenvironment, a safety mechanism is vital important toensure unwanted information leakage. At present theencryption algorithms widely used in CSCW system areinefficient, and can't realize the Real-TimeCommunication Model satisfactorily. DES and ECC areboth widely recognized data encryption algorithms,which have already been applied to CSCW securitysystem, but each has his own strengths and *** is efficient but its key is easily revealed, the key ofECC is well managed, but the process efficiency is lowerthan DES. This paper puts forward a combinedencryption algorithm based on 3DES and ECC toimprove the performance of the CSCW system *** is proved that the algorithm is feasible and effective.

关键词： groupware cryptography real-time systems DES ECC computer supported cooperative work encryption algorithms real-time communication model data encryption CSCW system encryption

Optimized Homomorphic Permutation From New Permutation Decomposition Techniques

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ma, Xirong Fang, Junling Duong, Dung Hoang Jiang, Yali Ge, Chunpeng Li, Yanbin School of Software Shandong University China School of Computing and Information Technology University of Wollongong Australia China

Homomorphic permutation is fundamental to privacy-preserving computations based on batch-encoding homomorphic encryption. It underpins nearly all homomorphic matrix operation algorithms and predominantly influences their complexity. Permutation decomposition as a potential approach to optimize this critical component remains under-explored. In this paper, we enhance the efficiency of homomorphic permutations through novel decomposition techniques, advancing homomorphic encryption-based privacy-preserving computations. We start by estimating the ideal effect of decompositions on permutations, then propose an algorithm that searches depth-1 ideal decomposition solutions. This helps us ascertain the full-depth ideal decomposability of permutations used in specific secure matrix transposition and multiplication schemes, allowing them to achieve asymptotic improvement in speed and rotation key reduction. We further devise a new method for computing arbitrary homomorphic permutations, considering that permutations with weak structures are unlikely to be ideally factorized. Our design deviates from the conventional scope of decomposition. But it better approximates the ideal effect of decomposition we define than the state-of-the-art techniques, with a speed-up of up to ×2.27 under minimal rotation key requirements. Copyright © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

Generalized cryptographic semi-regular sequences: A variant of Fröberg conjecture and a simple complexity estimation for Gröbner basis computation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kudo, Momonari Yokoyama, Kazuhiro Fukuoka Institute of Technology 3-30-1 Wajiro-higashi Higashi-ku Fukuoka811-0295 Japan Rikkyo University 3-34-1 Nishi-Ikebukuro Toshima-ku Tokyo171-8501 Japan

In this paper, we study generalized cryptographic semi-regular sequences, which are expected to generic in the space of homogeneous polynomial sequences on which the coordinate rings have Krull dimension one. We provi... 详细信息

关键词： encryption algorithms

A review of Mobile Banking Security

学校读者我要写书评

暂无评论

A review of Mobile Banking Security

IEEE Canadian Conference on Electrical and Computer Engineering

作者： Leili Nosrati Amir Massoud Bidgoli Islamic Azad University-Tehran North Branch Tehran Iran Islamic Azad University-Tehran North Branch MIEEE Manchester University Tehran Iran

ISBN: (纸本)9781467387224

Nowadays, IT has an important role in people's life. Bank is one of the example of institute which using IT in its daily tasks. Customer's personal information which has stored by the bank is considered as private and has to be saving securely by bank. Only legal staff of bank, also legal customers can operate any of the tasks. Hence, bank has own system to protect its transaction tasks such as online and offline transactions. Bank account hacking has caused millions money losses around the world. It is important to achieve how the security aspects in a banking system can influence great lost to the financial institution. This paper reports on the aiming at identifying and classifying Mobile banking payment security challenges. First, different security risks of mobile banking have been presented. In addition, different methods of encryption have been presented. Moreover, our method which has two layers of security has been presented. Furthermore, for preparing the security of the Network Layer, our method will authorize the Message format with Check sum.

关键词： mobile banking Security of mobile banking encryption algorithms

Post-Quantum Security: Origin, Fundamentals, and Adoption

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Barzen, Johanna Leymann, Frank University of Stuttgart IAAS Universitätsstr. 38 Stuttgart70569 Germany

We first describe the relation between discrete logarithms and two well-known asymmetric security schemes, RSA and Elliptic Curve Cryptography. Next, we present the foundations of lattice-based cryptography which is the basis of schemes that are considered to be safe against attacks by quantum algorithms (as well as by classical algorithms). Then we describe two such quantum-safe algorithms (Kyber and Dilithium) in more detail. Finally, we give a very brief and selective overview of a few actions currently taken by governments and industry as well as standardization in this area. The article has a pedagogical character, not presenting any new research results. Especially it strives towards being self-contained, e.g. the required mathematical foundations to understand post-quantum cryptography are provided and examples are given. Thus, a reader interested in getting a first comprehensive overview on the subject doesn’t have to consult text books or several research papers. Copyright © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

Tiny Keys Hold Big Secrets: On Efficiency of Pairing-Based Cryptography in Iot

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Perazzo, Pericle Vallati, Carlo Department of Information Engineering University of Pisa Italy

Pairing-Based Cryptography (PBC) is a sub-field of elliptic curve cryptography that has been used to design ingenious security protocols including Short Signatures (SS), Identity-Based encryption (IBE), and Attribute-Based encryption (ABE). These protocols have extremely promising applications in diverse scenarios, including Internet of Things (IoT), which usually involves computing devices with limited processing, memory, and energy capabilities. Many studies in the literature evaluated the performance of PBC on typical IoT devices, giving promising results, and showing that a large class of constrained devices can run PBC schemes. However, in the last years, new advancements in Number Field Seive algorithms threatened the security of PBC, so that all protocols must be re-parametrized with larger keys to maintain the same security level as before. Therefore, past literature reporting PBC performance on IoT devices must be redone because optimistic, and it is not clear whether present IoT devices will bear PBC. In this paper we evaluate the performance of some prominent PBC schemes on a very constrained device, namely the Zolertia RE-Mote platform, which is equipped with an ARM Cortex-M3 processor. From our experiments, the usage of IBE and SS schemes is still possible on IoT devices, but the security level is limited to 80 or 100 bits. Reaching greater security levels leads to higher execution times, which might not be compatible with many IoT applications. The usage of ABE is efficient only with IoT-oriented schemes, which offer good performance at the cost of a limited policy expressiveness. © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

Research on Elliptic Curve Cryptography

学校读者我要写书评

暂无评论

Research on Elliptic Curve Cryptography

The 8th International Conference on Computer Supported Cooperative Work in Design(第八届计算机支持的协同工作设计国际会议)(CSCWD2004)

作者： Qizhi Qiu Qianxing Xiong Wuhan University of Technology WuhanP.R.China

ISBN: (纸本)0780379411

There are many drawbacks in current encryptionalgorithms in respect of security, real-time performanceand so on, and researchers are presenting variousalgorithms. Among them, the Elliptic CurveCryptography (ECC) is evolving as an importantcryptography, and shows a promise to be an alternativeof RSA. Small size, high security and other featurescharacterize ECC. Based on the theory of ECC, thispaper analyzes its advantages over othercryptographies and focuses on its principle. A practicalapplication implemented by Java is also presented. Atlast, some future works in ECC are indicated.

关键词： Java cryptography elliptic curve cryptography encryption algorithms security real-time performance RSA Java public key cryptosystem

Evaluating Post-Quantum Cryptography on Embedded Systems: A Performance Analysis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dong, Ben Wang, Qian University of California Merced United States

The National Institute of Standards and Technology (NIST) has finalized the selection of post-quantum cryptographic (PQC) algorithms for use in the era of quantum computing. Despite their integration into TLS protocol for key establishment and signature generation, there is limited study on profiling these newly standardized algorithms in resource-constrained communication systems. In this work, we integrate PQC into both TLS servers and clients built upon embedded systems. Additionally, we compare the performance overhead of PQC pairs to currently used non-PQC schemes. © 2024, CC BY-NC-SA.

关键词： encryption algorithms

Bad Crypto: Chessography and Weak Randomness of Chess Games

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Stanek, Martin Department of Computer Science Faculty of Mathematics Physics and Informatics Comenius University Slovakia

This short communication shows that the Chessography encryption scheme is incorrect, redundant, and the the security claims based on the complexity of chess games are unjustified. It also demonstrates an insufficient ... 详细信息

关键词： encryption algorithms