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

Improved impossible differential cryptanalysis of large-block Rijndael

学校读者我要写书评

暂无评论

science China(information sciences) 2019年第3期62卷 5-18页

作者： Ya LIU Yifan SHI Dawu GU Bo DAI Fengyu ZHAO Wei LI Zhiqiang LIU Zhiqiang ZENG Engineering Research Center of Optical Instrument and System Ministry of Education Shanghai Key Lab of Modern Optical System University of Shanghai for Science and Technology State Key Laboratory of Cryptology Department of Computer Science and Engineering Shanghai Jiao Tong University School of Computer Science and Technology Donghua University Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Science and Technology on Information Assurance Laboratory

Rijndael is a substitution-permutation network（SPN） block cipher for the AES development process. Its block and key sizes range from 128 to 256 bits in steps of 32 bits, which can be denoted by Rijndael-b-k, where b and k are the block and key sizes, respectively. Among them, Rijndael-128-128/192/256,that is, AES, has been studied by many researchers, and the security of other large-block versions of Rijndael has been exploited less frequently. However, more attention has been paid to large-block versions of block ciphers with the fast development of quantum computers. In this paper, we propose improved impossible differential attacks on 10-round Rijndael-256-256, 10-round Rijndael-224-256, and 9-round Rijndael-224-224 using precomputation tables, redundancies of key schedules, and multiple impossible differentials. For 10-round Rijndael-256-256, the data, time, and memory complexities of our attack were approximately 2244.4chosen plaintexts, 2240.1encryptions, and 2181.4blocks, respectively. For 10-round Rijndael-224-256, the data, time, and memory complexities of our attack were approximately 2214.4chosen plaintexts, 2241.3encryptions, and 2183.4blocks, respectively. For 9-round Rijndael-224-224, the data, time, and memory complexities of our attack are approximately 2214.4chosen plaintexts, 2113.4encryptions, and 287.4blocks,respectively, or 2206.6chosen plaintexts, 2153.6encryptions, and 2111.6blocks, respectively. To the best of our knowledge, our results are currently the best on Rijndael-256-256 and Rijndael-224-224/256.

关键词： block cipher Rijndael precomputation tables impossible di?erentials multiple impossible differential attacks

Calibration of Flux Crosstalk in Large-Scale Flux-Tunable Superconducting Quantum Circuits

学校读者我要写书评

暂无评论

PRX Quantum 2021年第4期2卷 040313-040313页

作者： X. Dai D.M. Tennant R. Trappen A.J. Martinez D. Melanson M.A. Yurtalan Y. Tang S. Novikov J.A. Grover S.M. Disseler J.I. Basham R. Das D.K. Kim A.J. Melville B.M. Niedzielski S.J. weber J.L. Yoder D.A. Lidar A. Lupascu Institute for Quantum Computing and Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo Ontario N2L 3G1 Canada Northrop Grumman Corporation Linthicum Maryland 21090 USA MIT Lincoln Laboratory 244 Wood Street Lexington Massachusetts 02421 USA Departments of Electrical & Computer Engineering Chemistry and Physics and Center for Quantum Information Science & Technology University of Southern California Los Angeles California 90089 USA Waterloo Institute for Nanotechnology University of Waterloo Waterloo Ontario N2L 3G1 Canada

Magnetic flux tunability is an essential feature in most approaches to quantum computing based on superconducting qubits. Independent control of the fluxes in multiple loops is hampered by crosstalk. Calibrating flux crosstalk becomes a challenging task when the circuit elements interact strongly. We present a novel approach to flux crosstalk calibration, which is circuit model independent and relies on an iterative process to gradually improve calibration accuracy. This method allows us to reduce errors due to the inductive coupling between loops. The calibration procedure is automated and implemented on devices consisting of tunable flux qubits and couplers with up to 27 control loops. We devise a method to characterize the calibration error, which is used to show that the errors of the measured crosstalk coefficients are all below 0.17%.

关键词： Adiabatic quantum optimization Quantum information architectures & platforms Quantum information processing Superconducting qubits

Randomised benchmarking for characterizing and forecasting correlated processes

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Xinfang Wu, Zhihao White, Gregory A.L. Xiang, Zhongcheng Hu, Shun Peng, Zhihui Liu, Yong Zheng, Dongning Fu, Xiang Huang, Anqi Poletti, Dario Modi, Kavan Wu, Junjie Deng, Mingtang Guo, Chu Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Physics and Astronomy Monash University VIC3800 Australia Dahlem Center for Complex Quantum Systems Freie Universität Berlin Berlin14195 Germany Institute of Physics Chinese Academy of Sciences Beijing100190 China Key Laboratory of Low-Dimensional Quantum Structures and Quantum Control of Ministry of Education Department of Physics Synergetic Innovation Center for Quantum Effects and Applications Hunan Normal University Changsha410081 China Science Mathematics and Technology Cluster and Engineering Product Development Pillar Singapore University of Technology and Design 8 Somapah Road 487372 Singapore Centre for Quantum Technologies National University of Singapore 117543 Singapore MajuLab CNRS-UNS-NUS-NTU International Joint Research Unit UMI 3654 Singapore Quantum for NSW Sydney2000 Australia

The development of fault-tolerant quantum processors relies on the ability to control noise. A particularly insidious form of noise is temporally correlated or non-Markovian noise. By combining randomized benchmarking with supervised machine learning algorithms, we develop a method to learn the details of temporally correlated noise. In particular, we can learn the time-independent evolution operator of system plus bath and this leads to (i) the ability to characterize the degree of non-Markovianity of the dynamics and (ii) the ability to predict the dynamics of the system even beyond the times we have used to train our model. We exemplify this by implementing our method on a superconducting quantum processor. Our experimental results show a drastic change between the Markovian and non-Markovian regimes for the learning accuracies. Copyright © 2023, The Authors. All rights reserved.

关键词： Benchmarking

FAIR for AI: An interdisciplinary and international community building perspective

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Huerta, E.A. Blaiszik, Ben Brinson, L. Catherine Bouchard, Kristofer E. Diaz, Daniel Doglioni, Caterina Duarte, Javier M. Emani, Murali Foster, Ian Fox, Geoffrey Harris, Philip Heinrich, Lukas Jha, Shantenu Katz, Daniel S. Kindratenko, Volodymyr Kirkpatrick, Christine R. Lassila-Perini, Kati Madduri, Ravi K. Neubauer, Mark S. Psomopoulos, Fotis E. Roy, Avik Rübel, Oliver Zhao, Zhizhen Zhu, Ruike Data Science and Learning Division Argonne National Laboratory LemontIL60439 United States Department of Computer Science University of Chicago ChicagoIL60637 United States Globus University of Chicago ChicagoIL60637 United States Department of Mechanical Engineering and Materials Science Duke University DurhamNC27708 United States Scientific Data Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Biological Systems & Engineering Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Helen Wills Neuroscience Institute University of California Berkeley BerkeleyCA94720 United States Department of Physics University of California La Jolla San DiegoCA92093 United States Lund University Department of Physics Box 118 Lund221 00 Sweden School of Physics & Astronomy The University of Manchester ManchesterM13 9PL United Kingdom Leadership Computing Facility Argonne National Laboratory LemontIL60439 United States Biocomplexity Institute Department of Computer Science University of Virginia CharlottesvilleVA22904 United States Department of Physics Massachusetts Institute of Technology CambridgeMA02139 United States Technical University Munich Arcisstraße 21 München80333 Germany Computational Science Initiative Brookhaven National Laboratory UptonNY11973 United States Electrical and Computer Engineering Rutgers The State University of New Jersey PiscatawayNJ08854 United States National Center for Supercomputing Applications University of Illinois Urbana-Champaign UrbanaIL61801 United States Department of Computer Science University of Illinois at Urbana-Champaign UrbanaIL61801 United States Department of Electrical & Computer Engineering University of Illinois at Urbana-Champaign UrbanaIL61801 United States School of Information Sciences University of Illinois at Urbana-Champaign UrbanaIL61801 United States San Diego Supercomputer Center University of California La Jolla San DiegoCA

A foundational set of findable, accessible, interoperable, and reusable (FAIR) principles were proposed in 2016 as prerequisites for proper data management and stewardship, with the goal of enabling the reusability of scholarly data. The principles were also meant to apply to other digital assets, at a high level, and over time, the FAIR guiding principles have been reinterpreted or extended to include the software, tools, algorithms, and workflows that produce data. FAIR principles are now being adapted in the context of AI models and datasets. Here, we present the perspectives, vision, and experiences of researchers from different countries, disciplines, and backgrounds who are leading the definition and adoption of FAIR principles in their communities of practice, and discuss outcomes that may result from pursuing and incentivizing FAIR AI research. The material for this report builds on the FAIR for AI Workshop held at Argonne National laboratory on June 7, 2022. Copyright © 2022, The Authors. All rights reserved.

关键词： information management

Quantum computing: A taxonomy, systematic review and future directions

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Gill, Sukhpal Singh Kumar, Adarsh Singh, Harvinder Singh, Manmeet Kaur, Kamalpreet Usman, Muhammad Buyya, Rajkumar School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom Department of Systemics School of Computer Science University of Petroleum and Energy Studies Dehradun India Department of Virtualization School of Computer Science University of Petroleum and Energy Studies Dehradun India Jackson School of Geosciences University of Texas at Austin United States Pune India Seneca International Academy Seneca Toronto Canada School of Computing and Information Systems The University of Melbourne ParkvilleVIC Australia Laboratory School of Computing and Information Systems The University of Melbourne Australia

Quantum computing is an emerging paradigm with the potential to offer significant computational advantage over conventional classical computing by exploiting quantum-mechanical principles such as entanglement and superposition. It is anticipated that this computational advantage of quantum computing will help to solve many complex and computationally intractable problems in several application domains such as drug design, data science, clean energy, finance, industrial chemical development, secure communications, and quantum chemistry. In recent years, tremendous progress in both quantum hardware development and quantum software/algorithm have brought quantum computing much closer to reality. Indeed, the demonstration of quantum supremacy marks a significant milestone in the Noisy Intermediate Scale Quantum (NISQ) era - the next logical step being the quantum advantage whereby quantum computers solve a real-world problem much more efficiently than classical computing. As the quantum devices are expected to steadily scale up in the next few years, quantum decoherence and qubit interconnectivity are two of the major challenges to achieve quantum advantage in the NISQ era. Quantum computing is a highly topical and fast-moving field of research with significant ongoing progress in all facets. A systematic review of the existing literature on quantum computing will be invaluable to understand the state-of-the-art of this emerging field and identify open challenges for the quantum computing community to address in the coming years. This article presents a comprehensive review of quantum computing literature and proposes taxonomy of quantum computing. The proposed taxonomy is used to map various related studies to identify the research gaps. A detailed overview of quantum software tools and technologies, post-quantum cryptography and quantum computer hardware development captures the current state-of-the-art in the respective areas. The article identifies and highlights va

关键词： Taxonomies

Cross-lingual Semantic Role Labeling with Model Transfer

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Fei, Hao Zhang, Meishan Li, Fei Ji, Donghong Department of Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Department of School of New Media and Communication Tianjin University Tianjin300072 China Department of Computer Science University of Massachusetts Lowell LowellMA United States

—Prior studies show that cross-lingual semantic role labeling (SRL) can be achieved by model transfer under the help of universal features. In this paper, we fill the gap of cross-lingual SRL by proposing an end-to-end SRL model that incorporates a variety of universal features and transfer methods. We study both the bilingual transfer and multi-source transfer, under gold or machine-generated syntactic inputs, pre-trained high-order abstract features, and contextualized multilingual word representations. Experimental results on the Universal Proposition Bank corpus indicate that performances of the cross-lingual SRL can vary by leveraging different cross-lingual features. In addition, whether the features are gold-standard also has an impact on performances. Precisely, we find that gold syntax features are much more crucial for cross-lingual SRL, compared with the automatically-generated ones. Moreover, universal dependency structure features are able to give the best help, and both pre-trained high-order features and contextualized word representations can further bring significant improvements. Copyright © 2020, The Authors. All rights reserved.

关键词： Syntactics

An overview of signal processing techniques for RIS/IRS-aided wireless systems

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Pan, Cunhua Zhou, Gui Zhi, Kangda Hong, Sheng Wu, Tuo Pan, Yijin Ren, Hong Renzo, Marco Di Lee Swindlehurst, A. Zhang, Rui Zhang, Angela Yingjun National Mobile Communications Research Laboratory Southeast University Nanjing210096 China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom Information Engineering School of Nanchang University Nanchang330031 China Department of Information Engineering The Chinese University of Hong Kong Shatin Hong Kong Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et Systèmes 3 Rue Joliot-Curie Gif-sur-Yvette91192 France Center for Pervasive Communications and Computing University of California IrvineCA92697 United States Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

In the past as well as present wireless communication systems, the wireless propagation environment is regarded as an uncontrollable black box that impairs the received signal quality, and its negative impacts are compensated for by relying on the design of various sophisticated transmission/reception schemes. However, the improvements through applying such schemes operating at two endpoints (i.e., transmitter and receiver) only are limited even after five generations of wireless systems. Reconfigurable intelligent surface (RIS) or intelligent reflecting surface (IRS) have emerged as a new and revolutionary technology that can configure the wireless environment in a favorable manner by properly tuning the phase shifts of a large number of quasi passive and low-cost reflecting elements, thus standing out as a promising candidate technology for the next-/sixth-generation (6G) wireless system. However, to reap the performance benefits promised by RIS/IRS, efficient signal processing techniques are crucial, for a variety of purposes such as channel estimation, transmission design, radio localization, and so on. In this paper, we provide a comprehensive overview of recent advances on RIS/IRS-aided wireless systems from the signal processing perspective. We also highlight promising research directions that are worthy of investigation in the future. © 2021, CC BY.

关键词： Channel estimation

Feature Location Benchmark for Decomposing and Reusing Android Apps

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tang, Yutian Zhou, Hao Xu, Zhou Luo, Xiapu Cai, Yan Zhang, Tao Department of Computing Hong Kong Polytechnic University Hong Kong School of Big Data and Software Engineering Chongqing University China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Faculty of Information Technology Macau University of Science and Technology China

Software reuse enables developers to reuse architecture, programs and other software artifacts. Realizing a systematical reuse in software brings a large amount of benefits for stakeholders, including lower maintenance efforts, lower development costs, and time to market. Unfortunately, currently implementing a framework for large-scale software reuse in Android apps is still a huge problem, regarding the complexity of the task and lacking of practical technical support from either tools or domain experts. Therefore, proposing a feature location benchmark for apps will help developers either optimize their feature location techniques or reuse the assets created in the benchmark for reusing. In this paper, we release a feature location benchmark, which can be used for those developers, who intend to compose software product lines (SPL) and release reuse in apps. The benchmark not only contributes to the research community for reuse research, but also helps participants in industry for optimizing their architecture and enhancing modularity. In addition, we also develop an Android Studio plugin named caIDE for developers to view and operate on the benchmark. Copyright © 2020, The Authors. All rights reserved.

关键词： computer software reusability

Feature-aware Multi-task feature learning for Predicting Cognitive Outcomes in Alzheimer's disease

学校读者我要写书评

暂无评论

Feature-aware Multi-task feature learning for Predicting Cog...

IEEE International Conference on Bioinformatics and Biomedicine

作者： Peng Cao Jinzhu Yang Shanshan Tang Dazhe Zhao Osmar Zaiane Min Huang Amine Trabelsi College of Computer Science and Engineering Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University College of Computer Science and Engineering Northeastern University College of Information Science and Engineering Northeastern University Department of Computing Science University of Alberta Department of Computing Science University of Alberta

ISBN: (纸本)9781728118680

Machine learning algorithms and multivariate data analysis methods have been widely utilized in the field of Alzheimer's disease (AD) research in recent years. Predicting cognitive performance of subjects from neuroimage measures and identifying relevant imaging biomarkers are important research topics in the study of Alzheimer's disease. Multi-task based feature learning (MTFL) have been widely studied to select a discriminative feature subset from MRI features, and improve the performance by incorporating inherent correlations among multiple clinical cognitive measures. It is known that the brain imaging measures are often correlated with each other, and AD is closely related to the inter-correlation among different brain regions. However, the multitask based feature learning (MTFL) method neglects the inherent correlation among brain imaging measures. We present a novel regularized multi-task learning approach via a joint sparsity-inducing regularization to effectively incorporate both a relatedness among multiple cognitive score prediction tasks and a useful inherent correlation between brain imaging measures by exploiting correlations among features. It allows the simultaneous selection of a common set of biomarkers for all tasks and the preservation of the inherent structure of imaging measures. The reported experiments on the ADNI dataset show that the proposed method is effective and promising.

关键词： Alzheimer's disease Regression model Multi-task learning Magnetic resonance imaging Biomarkers discovery Alzheimer Disease simple regression (model) Magnetic Resonance Imaging PARALLEL PROCESSING (computerS) Learning Machine learning algorithms Diencephalon