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

19th International Conference on Information Security Practice and Experience

作者： Peng, Congrong Peng, Cong Yang, Xiaolin Luo, Qingcai Luo, Min Wuhan Univ Sch Cyber Sci & Engn Key Lab Aerosp Informat Secur & Trusted Comp Minist Educ Wuhan Peoples R China Inspur Acad Sci & Technol Jinan Peoples R China

ISBN: (纸本)9789819790524;9789819790531

At CRYPTO 2022, Abdalla et al. incorporate the ability to compute the quadratic twist of elliptic curves to extend the framework of group actions introduced by Alamati et al. (ASIACRYPT 2020), and proposed two password-authenticated key exchange (PAKE) protocols. Their first protocol X-GA-PAKE(l) is a provably secure one-round isogeny-based scheme with a password length of l, which improves security by increasing computation and communication overhead. In X-GA-PAKE(l), each party needs to choose 2l elements and perform 5l group actions. In this paper, we present an isogeny-based PAKE protocol that is more efficient than X-GA-PAKE(l). In our scheme, we reduce the number of set elements to l, thus the overhead of communication between users and servers is significantly decreased. By using the shuffle algorithm, the number of group actions that each party needs to perform is reduced to 2l, but our protocol can still prevent trivial attacks using twists. Due to the use of Merkle root and password in the shuffle function, the attackers cannot select a message from the received message. Also, the length of the message used for key derivation is reduced from 3l to l. We prove the security based on the security assumption in the isogeny-based setting.

关键词： Password-authenticated key exchange CSIDH Group actions shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Conversion of descriptor representations to state-space form: an extension of the shuffle algorithm

引用

INTERNATIONAL JOURNAL OF CONTROL 2018年第10期91卷 2199-2213页

作者： Harrop Galvao, Roberto Kawakami Kienitz, Karl Heinz Hadjiloucas, Sillas Inst Tecnol Aeronaut Dept Elect Engn Sao Jose Dos Campos Brazil Univ Reading Sch Biol Sci Biomed Engn Reading Berks England

This paper proposes a systematic procedure for the determination of state-space models from an available descriptor representation of a linear dynamic system. The goal is to determine a state equation, a set of algebraic equations and an output equation in terms of the state and input variables. It is shown that standard methods may fail to convert the descriptor representation to state-space form, even for simple electrical circuit models obtained from Kirchoff's laws and constitutive element equations. A novel procedure to address this problem is then proposed as an extension of the classic shuffle algorithm combined with a singular value decomposition approach. In addition to an illustrative example involving a simple electrical circuit, the proposed method is employed in a case study involving the modelling of three-dimensional RLC networks with a large number of components.

关键词： Descriptor representations state-space models shuffle algorithm singular value decomposition three-dimensional RLC networks

来源：评论

学校读者我要写书评

暂无评论

A Lossless Compression Method for JPEG Based on shuffle algorithm

A Lossless Compression Method for JPEG Based on Shuffle Algo...

引用

International Symposium on Image Analysis and Signal Processing

作者： Wang, W. Y. Guangxi Normal Univ Coll Elect Engn Guilin Peoples R China

ISBN: (纸本)9781424439867

Universal lossless algorithms of data compression always have very little effect on JPEG data. According to the characteristic of JPEG, a new shuffle algorithm is proposed to resize the JPEG and then use the universal lossless algorithms to compress the resized data. Experiment has been shown that the new algorithm has an effect on lossless compression JPEG image, and has been obtained a preferable compression ratio with little time cost. The new algorithm has been protected by China patent.

关键词： lossless JPEG shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

State vector estimation in descriptor electrical circuits using the shuffle algorithm 19th

State vector estimation in descriptor electrical circuits us...

引用

19th Polish Control Conference (KKA)

作者： Borawski, Kamil Bialystok Tech Univ Fac Elect Engn Wiejska 45D PL-15351 Bialystok Poland

Observers for descriptor electrical circuits by the use of the shuffle algorithm are proposed. Necessary and sufficient conditions for the existence of the observers are given. The effectiveness of the proposed method... 详细信息

ISBN: (纸本)9783319606996

关键词： Observer synthesis descriptor electrical circuit shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Data Hiding Using shuffle algorithm and LSB Method 26

Data Hiding Using Shuffle Algorithm and LSB Method

引用

26th IEEE Signal Processing and Communications Applications Conference (SIU)

作者： Akbay, Kemal Konyar, Mehmet Zeki Ilkin, Sumeyya Sondas, Adnan Kocaeli Univ Bilisim Sistemleri Muhendisligi Bolumu Umuttepe Kampusu TR-41380 Kocaeli Turkey

ISBN: (纸本)9781538615010

With the development of technology, secret communication with audio, image and video files has become important. In this case, encryption and steganography play a major role. While encryption deals with uncatchable of message content, steganography deals with failure to understand the existence of the messages used for secret communication. Because of these features steganography and encryption are the two main elements complementing each other. In this study, it is proposed to use the least significant bit (LSB) change method with a shuffle algorithm to hide data in color images in 24-bit JPEG format

关键词： steganography data hiding shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

A Modified Approach of Blowfish algorithm Based On S-Box Permutation using shuffle algorithm 2018

A Modified Approach of Blowfish Algorithm Based On S-Box Per...

引用

7th International Conference on Network, Communication and Computing (ICNCC)

作者： Corpuz, Reynaldo R. Gerardo, Bobby D. Medina, Ruji P. Technol Inst Philippines 938 Aurora Blvd Quezon City 1109 Philippines West Visayas State Univ Iloilo Philippines

ISBN: (纸本)9781450365536

Blowfish algorithm has been widely analyzed and gradually accepted as a good and powerful cryptographic algorithm offering several advantages among which is suitability and efficiency for implementing hardware and software;it satisfies the basic requirements in cryptography with high in attack immunity and relatively low in algorithm complexity. In spite of undeniable success in cryptography, Blowfish (BF) still has drawbacks in the substitution and permutation of values in the substitution box (Sbox) that can affect the encryption and decryption of the algorithm. This study adopted Fisher-Yates shuffle (FYS) also known as Knuth shuffle (KS) for the permutation of S-box, and a modified Function F was used to enhance the BF algorithm to address this issue. The results show that Modified approach in Blowfish algorithm outperformed the Original Blowfish in the encryption, decryption, and throughput of the algorithm.

关键词： shuffle algorithm Fisher-Yates shuffle Blowfish algorithm S-box Function F Substitution-permutation networks

来源：评论

学校读者我要写书评

暂无评论

A Lossless Compression Method for JPEG Based on shuffle algorithm

A Lossless Compression Method for JPEG Based on Shuffle Algo...

引用

2009图像分析与信号处理国际会议(2009 International Conference on Image Analysis and Signal Processing)

作者： W.Y Wang College of Electronic Engineering Guangxi Normal University Guilin China

ISBN: (纸本)9781424439874

关键词： lossless JPEG shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2006年第7期22卷 838-847页

作者： Benoit, Anne Plateau, Brigitte Stewart, William J. ENSIMAG Lab ID IMAG Antenne Montbonnot F-38330 Montbonnot St Martin France N Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA

We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as networks of stochastic automata. The tensor structure inherently involves a product state space but, inside this product state space, the actual reachable state space can be much smaller. For such cases, we propose an improvement of the standard numerical algorithm, the so-called "shuffle algorithm", which necessitates only vectors of the size of the actual state space. With this contribution, numerical algorithms based on tensor products can now handle larger models. (C) 2006 Elsevier B.V. All rights reserved.

关键词： large and sparse Markov chains stochastic automata networks generalized tensor algebra vector-descriptor multiplication shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

ON VECTOR-KRONECKER PRODUCT MULTIPLICATION WITH RECTANGULAR FACTORS

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2015年第5期37卷 S526-S543页

作者： Dayar, Tugrul Orhan, M. Can Bilkent Univ Dept Comp Engn TR-06800 Ankara Turkey

The infinitesimal generator matrix underlying a multidimensional Markov chain can be represented compactly by using sums of Kronecker products of small rectangular matrices. For such compact representations, analysis methods based on vector-Kronecker product multiplication need to be employed. When the factors in the Kronecker product terms are relatively dense, vector-Kronecker product multiplication can be performed efficiently by the shuffle algorithm. When the factors are relatively sparse, it may be more efficient to obtain nonzero elements of the generator matrix in Kronecker form on the fly and multiply them with corresponding elements of the vector. This work proposes a modification to the shuffle algorithm that multiplies relevant elements of the vector with submatrices of factors in which zero rows and columns are omitted. This approach avoids unnecessary floating-point operations that evaluate to zero during the course of the multiplication and possibly reduces the amount of memory used. Numerical experiments on a large number of models indicate that in many cases the modified shuffle algorithm performs a smaller number of floating-point operations than the shuffle algorithm and the algorithm that generates nonzeros on the fly, sometimes with a minimum number of floating-point operations and as little of memory possible.

关键词： Markov chain Kronecker representation vector-Kronecker product multiplication shuffle algorithm

来源：评论

学校读者我要写书评

暂无评论

Drazin inverse based numerical methods for singular linear differential systems

引用

ADVANCES IN ENGINEERING SOFTWARE 2012年 50卷 37-43页

作者： Coll, C. Ginestar, D. Sanchez, E. Thome, N. Univ Politecn Valencia Inst Univ Matemat Multidisciplinar Valencia 46022 Spain

In this paper, numerical methods for the solution of linear singular differential system are analysed. The numerical solution of initial value problems by means of a finite difference approach and a possible implementation of the Drazin inverse vector product is discussed. Examples of index 1 and index 2 differential algebraic equations have been studied numerically. (C) 2012 Civil-Comp Ltd and Elsevier Ltd. All rights reserved.

关键词： Singular systems Numerical methods shuffle algorithm Drazin inverse Index Differential equation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：