Log in

Relevant bibliographies by topics / Round Complexity / Journal articles

To see the other types of publications on this topic, follow the link: Round Complexity.

Journal articles on the topic 'Round Complexity'

Author: Grafiati

Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Round Complexity.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zhang, Feng, Feng Li, and Wenzheng Zhang. "Differential-Linear Cryptanalsis on SIMECK32/64 and SIMON32/64." Journal of Physics: Conference Series 2504, no. 1 (2023): 012068. http://dx.doi.org/10.1088/1742-6596/2504/1/012068.

Full text

Abstract:

Abstract In this paper, we give differential-linear cryptanalysis of SIMON, which is a family of lightweight block ciphers published by the National Security Agency, and SIMECK, which is a family of lightweight block ciphers proposed by Yang et al. Firstly, all input difference and output masks with one active bit are traversed to obtain a 9-round SIMON32/64 differential-linear distinguisher and a 10-round SIMECK32/64 differential-linear distinguisher. Then, a 12-round SIMON32/64 differential-linear distinguisher with bias 2−12.69 and a 13-round SIMECK32/64 differential-linear distinguisher wi

APA, Harvard, Vancouver, ISO, and other styles

2

Zhang, Kai, Xuejia Lai, Lei Wang, et al. "Related-Key Multiple Impossible Differential Cryptanalysis on Full-Round LiCi-2 Designed for IoT." Security and Communication Networks 2022 (May 25, 2022): 1–11. http://dx.doi.org/10.1155/2022/3611840.

Full text

Abstract:

LiCi-2 is an ultralightweight block cipher designed for constrained IoT devices. It is a successor of LiCi and has even better performance in both software and hardware implementation. In this paper, based on the idea of related-key multiple impossible differential cryptanalysis, a key recovery attack on full-round LiCi-2 is proposed. First, an interesting property is revealed that, with a single bit difference in the related key, a 10-round differential character with probability of 1 exists on LiCi-2. With an automatic approach, the boundaries of impossible differential distinguishers in ter

APA, Harvard, Vancouver, ISO, and other styles

3

Grošek, Otokar, Peter Horák, and Pavol Zajac. "On complexity of round transformations." Discrete Mathematics 309, no. 18 (2009): 5527–34. http://dx.doi.org/10.1016/j.disc.2008.03.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pandurangan, Gopal, Peter Robinson, and Michele Scquizzato. "On the Distributed Complexity of Large-Scale Graph Computations." ACM Transactions on Parallel Computing 8, no. 2 (2021): 1–28. http://dx.doi.org/10.1145/3460900.

Full text

Abstract:

Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where k ≥ 2 machines jointly perform computations on graphs with n nodes (typically, n >> k). The input graph is assumed to be initially randomly partitioned among the k machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation. Our main contribution is the G

APA, Harvard, Vancouver, ISO, and other styles

5

Xing, Zhaohui, Wenying Zhang, and Guoyong Han. "Improved Conditional Differential Analysis on NLFSR-Based Block Cipher KATAN32 with MILP." Wireless Communications and Mobile Computing 2020 (November 23, 2020): 1–14. http://dx.doi.org/10.1155/2020/8883557.

Full text

Abstract:

In this paper, a new method for constructing a Mixed Integer Linear Programming (MILP) model on conditional differential cryptanalysis of the nonlinear feedback shift register- (NLFSR-) based block ciphers is proposed, and an approach to detecting the bit with a strongly biased difference is provided. The model is successfully applied to the block cipher KATAN32 in the single-key scenario, resulting in practical key-recovery attacks covering more rounds than the previous. In particular, we present two distinguishers for 79 and 81 out of 254 rounds of KATAN32. Based on the 81-round distinguishe

APA, Harvard, Vancouver, ISO, and other styles

6

Magniez, Frédéric, and Ashwin Nayak. "Quantum Distributed Complexity of Set Disjointness on a Line." ACM Transactions on Computation Theory 14, no. 1 (2022): 1–22. http://dx.doi.org/10.1145/3512751.

Full text

Abstract:

Given \( x,y\in \lbrace 0,1\rbrace ^n \) , Set Disjointness consists in deciding whether \( x_i=y_i=1 \) for some index \( i \in [n] \) . We study the problem of computing this function in a distributed computing scenario in which the inputs \( x \) and \( y \) are given to the processors at the two extremities of a path of length \( d \) . Each vertex of the path has a quantum processor that can communicate with each of its neighbours by exchanging \( \operatorname{O}(\log n) \) qubits per round. We are interested in the number of rounds required for computing Set Disjointness with constant p

APA, Harvard, Vancouver, ISO, and other styles

7

Weng, Tianling, Tingting Cui, Ting Yang, and Yinghua Guo. "Related-Key Differential Attacks on Reduced-Round LBlock." Security and Communication Networks 2022 (September 16, 2022): 1–15. http://dx.doi.org/10.1155/2022/8464960.

Full text

Abstract:

LBlock, as one of the typical lightweight encryption schemes, is a 32-round block cipher with 64 bit block and 80 bit master key. It can be widely applied in the IoT environment because of its friendly software and hardware implementations. Since it came out, it has encountered many attacks. In this paper, we evaluate LBlock’s ability against related-key differential attack more accurately based on SMT method. On the one hand, we propose tighter lower bounds on the minimal number of active S-boxes for up to 19 rounds of LBlock, which are 8 more rounds than previous ones. Then, we propose the u

APA, Harvard, Vancouver, ISO, and other styles

8

Kremer, I., N. Nisan, and D. Ron. "On Randomized One-round Communication Complexity." Computational Complexity 8, no. 1 (1999): 21–49. http://dx.doi.org/10.1007/s000370050018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Song, Junghwan, Kwanhyung Lee, and Hwanjin Lee. "Biclique Cryptanalysis on the Full Crypton-256 and mCrypton-128." Journal of Applied Mathematics 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/529736.

Full text

Abstract:

Biclique cryptanalysis is an attack which reduces the computational complexity by finding a biclique which is a kind of bipartite graph. We show a single-key full-round attack of the Crypton-256 and mCrypton-128 by using biclique cryptanalysis. In this paper, 4-round bicliques are constructed for Crypton-256 and mCrypton-128. And these bicliques are used to recover master key for the full rounds of Crypton-256 and mCrypton-128 with the computational complexities of 2253.78and 2126.5, respectively. This is the first known single-key full-round attack on the Crypton-256. And our result on the mC

APA, Harvard, Vancouver, ISO, and other styles

10

Lacko-Bartošová, Lucia. "Linear and differential cryptanalysis of reduced-round AES." Tatra Mountains Mathematical Publications 50, no. 1 (2011): 51–61. http://dx.doi.org/10.2478/v10127-011-0036-y.

Full text

Abstract:

ABSTRACT The subject of this paper is linear and differential cryptanalysis of two rounds of the Advanced Encryption Standard (AES) with estimation of com- plexity for three-round AES attack. Presented linear attack is based on finding highly probable linear expressions and presented differential attack is based on finding specific bitwise differences. Data complexity of described linear and diffe- rential attack is 228 and 227, respectively, where 8 bits of subkey are recovered. Minimal complexity of linear attack on three-round AES is bigger than d × 260, where d is a small constant.

APA, Harvard, Vancouver, ISO, and other styles

11

Liu, Wenhao, and Yang Yang. "The 7-Round Subspace Trail-Based Impossible Differential Distinguisher of Midori-64." Security and Communication Networks 2021 (November 9, 2021): 1–15. http://dx.doi.org/10.1155/2021/6269604.

Full text

Abstract:

This paper analyzes the subspace trail of Midori-64 and uses the propagation law and mutual relationship of the subspaces of Midori-64 to provide a 6-round Midori-64 subspace trail-based impossible differential key recovery attack. The data complexity of the attack is 2 54.6 chosen plaintexts, and the computational complexity is 2 58.2 lookup operations. Its overall complexity is less than that of the known 6-round truncated impossible differential distinguisher. This distinguisher is also applicable to Midori-128 with a secret S -box. Additionally, utilizing the properties of subspaces, we pr

APA, Harvard, Vancouver, ISO, and other styles

12

Tse, Savio S. H. "Belated Analyses of Three Credit-Based Adaptive Polling Algorithms." International Journal of Foundations of Computer Science 27, no. 05 (2016): 579–94. http://dx.doi.org/10.1142/s0129054116500179.

Full text

Abstract:

We study the problem of credit-based adaptive polling in undirected arbitrary point-to-point asynchronous networks. Polling consists of two rounds, namely propagation (broadcast) and feedback (confirmation, response) rounds. By adaptive polling, a spanning tree of unknown topology is built dynamically during the propagation round, and feedback messages are free to choose their paths back to the initiator — a specific node who initiates the polling algorithm. The freedom in the feedback round relies on the use of credits in the propagation round. We re-visit three existing algorithms and analys

APA, Harvard, Vancouver, ISO, and other styles

13

Zhao, Bo, Zhihong Chen, Hai Lin, and XiangMin Ji. "A Constant Round Write-Only ORAM." Applied Sciences 10, no. 15 (2020): 5366. http://dx.doi.org/10.3390/app10155366.

Full text

Abstract:

The write-only oblivious RAM (ORAM) is proposed to efficiently protect the privacy of applications such as cloud storage synchronization and encrypted hidden volumes. For N blocks with size B = Ω(log2N), the most efficient write-only ORAM, DetWoORAM, achieves O(B) communication complexity with O(logN) rounds per logical write. We propose a two-level write-only ORAM and achieve O(B) communication complexity with O(1) rounds. Similar to the traditional bucket-based ORAM schemes, we set a rate for the write operation to further reduce the communication complexity. The top-level stores data blocks

APA, Harvard, Vancouver, ISO, and other styles

14

Sanghvi, Saurabh, and Salil Vadhan. "The Round Complexity of Two-Party Random Selection." SIAM Journal on Computing 38, no. 2 (2008): 523–50. http://dx.doi.org/10.1137/050641715.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kremer, Ilan, Noam Nisan, and Dana Ron. "Errata for: "On randomized one-round communication complexity"." Computational Complexity 10, no. 4 (2001): 314–15. http://dx.doi.org/10.1007/s000370100003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Liu, Yu, Xiaolei Liu, and Yanmin Zhao. "Security Cryptanalysis of NUX for the Internet of Things." Security and Communication Networks 2019 (June 12, 2019): 1–12. http://dx.doi.org/10.1155/2019/2062697.

Full text

Abstract:

In order to adopt the restricted environment, such as radio frequency identification technology or sensor networking, which are the important components of the Internet of Things, lightweight block ciphers are designed. NUX is a 31-round iterative ultralightweight cipher proposed by Bansod et al. In this paper, we examine the resistance of NUX to differential and linear analysis and search for 1~31-round differential characteristics and linear approximations. In design specification, authors claimed that 25-round NUX is resistant to differential and linear attack. However, we can successfully

APA, Harvard, Vancouver, ISO, and other styles

17

TSE, SAVIO S. H., and FRANCIS C. M. LAU. "ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS." International Journal of Foundations of Computer Science 10, no. 02 (1999): 211–23. http://dx.doi.org/10.1142/s0129054199000150.

Full text

Abstract:

We study the problem of adaptive polling in undirected general networks. Polling, also known as broadcast-confirm, consists a propagation round and a feedback round. In adaptive polling, a spanning tree of unknown topology is built dynamically during the propagation round, and feedback messages are free to choose their paths in order to adapt to traffic and fault situations. We study three adaptive polling algorithms and analyze their worst-case communication bit complexities in the propagation round. Then, we prove a lower bound on the worst-case communication bit complexity of Ω(e+n log n) i

APA, Harvard, Vancouver, ISO, and other styles

18

Fan, Ruya, Ting Cui, Shiwei Chen, Chenhui Jin, and Haoran Zheng. "Multiset Structural Attack on Generalized Feistel Networks." Mathematical Problems in Engineering 2019 (April 14, 2019): 1–7. http://dx.doi.org/10.1155/2019/2390462.

Full text

Abstract:

In this paper, we present new generic multiset attacks against generalized Feistel networks, by which we can recover all the unknown round functions completely instead of deciding whether an unknown encryption oracle is such network or a random permutation. With one r-round multiset distinguisher, we can recover the outermost round functions for r+1-round block cipher. Next we propose the dummy-round technique, which allows us to make a full-round decomposition if the outermost round is recovered. Moreover, the dummy-round technique barely increases the complexity of our attack. Using this gen

APA, Harvard, Vancouver, ISO, and other styles

19

Han, Guoyong, and Wenying Zhang. "Improved Biclique Cryptanalysis of the Lightweight Block Cipher Piccolo." Security and Communication Networks 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/7589306.

Full text

Abstract:

Biclique cryptanalysis is a typical attack through finding a biclique which is a type of bipartite diagram to reduce the computational complexity. By investigating the subkey distribution and the encryption structure, we find out a weakness in the key schedule of Piccolo-80. A 6-round biclique is constructed for Piccolo-80 and a 7-round biclique for Piccolo-128. Then a full round biclique cryptanalysis of Piccolo is presented. The results of the attacks are with data complexity of 240and 224chosen ciphertexts and with computational complexity of 279.22and 2127.14, respectively. They are superi

APA, Harvard, Vancouver, ISO, and other styles

20

Saikia, Parikshit, and Sushanta Karmakar. "Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE." International Journal of Foundations of Computer Science 31, no. 07 (2020): 941–68. http://dx.doi.org/10.1142/s0129054120500367.

Full text

Abstract:

The Steiner tree problem is one of the fundamental and classical problems in combinatorial optimization. In this paper we study this problem in the CONGESTED CLIQUE model (CCM) [29] of distributed computing. For the Steiner tree problem in the CCM, we consider that each vertex of the input graph is uniquely mapped to a processor and edges are naturally mapped to the links between the corresponding processors. Regarding output, each processor should know whether the vertex assigned to it is in the solution or not and which of its incident edges are in the solution. We present two deterministic

APA, Harvard, Vancouver, ISO, and other styles

21

Wagh, Sameer. "Pika: Secure Computation using Function Secret Sharing over Rings." Proceedings on Privacy Enhancing Technologies 2022, no. 4 (2022): 351–77. http://dx.doi.org/10.56553/popets-2022-0113.

Full text

Abstract:

Machine learning algorithms crucially depend on non-linear mathematical functions such as division (for normalization), exponentiation (for softmax and sigmoid), tanh (as an activation function), logarithm (for crossentropy loss), and square root (for back-propagation of normalization layers). However, when machine learning is performed over secure computation, these protocols incur a large communication overhead and high round complexity. In this work, we propose new multi-party computation (MPC) protocols for such functions. Our protocols achieve constant round complexity (3 for semi-honest,

APA, Harvard, Vancouver, ISO, and other styles

22

Burden, Marisha, Lauren McBeth, and Angela Keniston. "Salient Measures of Hospitalist Workload." JAMA Network Open 6, no. 8 (2023): e2328165. http://dx.doi.org/10.1001/jamanetworkopen.2023.28165.

Full text

Abstract:

ImportanceThe ideal hospitalist workload and optimal way to measure it are not well understood.ObjectiveTo obtain expert consensus on the salient measures of hospitalist workload.Design, Setting, and ParticipantsThis qualitative study used a 3-round Delphi technique between April 5 and July 13, 2022, involving national experts within and external to the field. Experts included hospitalist clinicians, leaders, and administrators, as well as researchers with expertise in human factors engineering and cognitive load theory.Main Outcomes and MeasuresThree rounds of surveys were conducted, during w

APA, Harvard, Vancouver, ISO, and other styles

23

Cucker, Felipe, and Steve Smale. "Complexity estimates depending on condition and round-off error." Journal of the ACM 46, no. 1 (1999): 113–84. http://dx.doi.org/10.1145/300515.300519.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Apon, Daniel, Jonathan Katz, and Alex J. Malozemoff. "One-round multi-party communication complexity of distinguishing sums." Theoretical Computer Science 501 (August 2013): 101–8. http://dx.doi.org/10.1016/j.tcs.2013.07.026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Enright, Helen Patricia, and Amy Gray. "Unpacking the learning on consultant-led ward rounds: Lessons from ethnography in paediatrics." Focus on Health Professional Education: A Multi-Professional Journal 21, no. 3 (2020): 30–43. http://dx.doi.org/10.11157/fohpe.v21i3.336.

Full text

Abstract:

Introduction: Consultant-led ward round education in a busy paediatric setting is a complex process and is often ad hoc. We aimed to observe ward rounds to better understand the education opportunities available.Methods: Drawing on Argyris and Schön's (1974) theory of action, we used an ethnographic approach to observe 30 general medical ward rounds over a 3-month period, from September to December 2016. For this study we analysed the learning opportunities and the content that is explicitly taught in relation to the domains of professional practice that we espouse to teach.Results: There were

APA, Harvard, Vancouver, ISO, and other styles

26

Zajac, Pavol, and Michal Ondroš. "ROTATIONAL CRYPTANALYSIS OF GOST WITH IDENTICAL S-BOXES." Tatra Mountains Mathematical Publications 57, no. 1 (2013): 1–19. http://dx.doi.org/10.2478/tmmp-2013-0032.

Full text

Abstract:

ABSTRACT Rotational cryptanalysis was introduced by Khovratovich and Nikoli ´c as a tool to analyse ARX-type cipher designs. GOST 28147-89 is a former Soviet Union cipher standard based on a Feistel construction with 32 rounds. Each round function adds the round key modulo 232, transforms the result with 4-to-4 bit S-boxes, and rotates the output. We apply the rotational cryptanalysis to a version of GOST using eight identical S-boxes, such as GOST-PS. We show the existence of (practical) rotational distinguisher in related key model for full GOST. Furthermore, there is a set of weak keys (rot

APA, Harvard, Vancouver, ISO, and other styles

27

Yang, Fan, Xinyu Chen, Dafa Zhao, et al. "Quantum Multi-Round Resonant Transition Algorithm." Entropy 25, no. 1 (2022): 61. http://dx.doi.org/10.3390/e25010061.

Full text

Abstract:

Solving the eigenproblems of Hermitian matrices is a significant problem in many fields. The quantum resonant transition (QRT) algorithm has been proposed and demonstrated to solve this problem using quantum devices. To better realize the capabilities of the QRT with recent quantum devices, we improve this algorithm and develop a new procedure to reduce the time complexity. Compared with the original algorithm, it saves one qubit and reduces the complexity with error ϵ from O(1/ϵ2) to O(1/ϵ). Thanks to these optimizations, we can obtain the energy spectrum and ground state of the effective Ham

APA, Harvard, Vancouver, ISO, and other styles

28

Gąsecki, Arkadiusz. "LOW DATA COMPLEXITY DIFFERENTIAL - ALGEBRAIC ATTACK ON REDUCED ROUND DES." Tatra Mountains Mathematical Publications 57, no. 1 (2013): 35–43. http://dx.doi.org/10.2478/tmmp-2013-0034.

Full text

Abstract:

ABSTRACT At IMA 2007 Courtois and Bard presented low-data complexity attacks 011 up to 6 rounds of DES bv software algebraic attack methods and SAT solvers. With current methods it appears that 8 rounds of DES should be able to resist such attacks [Courtois, N. T. Gawinecki, A. Song, G.: Contradiction immunity and guess-then-determine attacks on GOST, Tatra Mt. Math. Publ. 53 (2012), 65 79|. An explicit challenge with a price was proposed: break 8 rounds of DES in less than a week 011 one PC with maximum 2 gigabytes of RAM and given at most 16 chosen plaintexts. In this paper we propose a new

APA, Harvard, Vancouver, ISO, and other styles

29

Xie, Xiaofeng, and Tian Tian. "A Low-Complexity Key-Recovery Attack on 6-Round Midori64." Journal of Systems Science and Complexity 36, no. 4 (2023): 1738–56. http://dx.doi.org/10.1007/s11424-023-1452-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Shi, Guanwen, Simin Yu, and Qianxue Wang. "Security Analysis of the Image Encryption Algorithm Based on a Two-Dimensional Infinite Collapse Map." Entropy 24, no. 8 (2022): 1023. http://dx.doi.org/10.3390/e24081023.

Full text

Abstract:

This paper analyzes the security of the image encryption algorithm based on a two-dimensional (2D) infinite collapse map. The encryption algorithm adopts a permutation–diffusion structure and can perform two or more rounds to achieve a higher level of security. By cryptanalysis, it is found that the original diffusion process can be split into a permutation–diffusion structure, which comes after the original permutation, so these two permutations can be merged into one. Then, some theorems about round-down operation are summarized, and the encryption and decryption equations in the diffusion p

APA, Harvard, Vancouver, ISO, and other styles

31

Al-Mekhlafi, Muneer Abdullah Saeed, and Nashwan Nagi Saleh Al-Marbe. "Lower and Upper Quartiles Enhanced Round Robin Algorithm for Scheduling of Outlier Tasks in Cloud Computing." Journal of Engineering and Technological Sciences - JOEATS 1, no. 1 (2023): 67–87. http://dx.doi.org/10.59421/joeats.v1i1.1420.

Full text

Abstract:

Cloud computing is one of the top emerging technologies with huge market and enterprise potential as it provides on-demand, -based access to large-scale shared computing resources. Task scheduling is one of the most important issues in cloud computing in order to enhance performance and resource utilization while minimizing costs. Because of its simplicity and fairness, the round-robin algorithm is the ideal task scheduling algorithm, although it suffers from time complexity and cannot handle outlier tasks. Several modifications of Round Robin have bee

APA, Harvard, Vancouver, ISO, and other styles

32

Badanidiyuru, Ashwinkumar, Arpita Patra, Ashish Choudhury, Kannan Srinathan, and C. Pandu Rangan. "On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission." Journal of the ACM 59, no. 5 (2012): 1–35. http://dx.doi.org/10.1145/2371656.2371657.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Hosseini Beghaeiraveri, Seyed Amir, Mohammad Izadi, and Mohsen Rezvani. "Broadcast Complexity and Adaptive Adversaries in Verifiable Secret Sharing." Security and Communication Networks 2020 (August 1, 2020): 1–10. http://dx.doi.org/10.1155/2020/9428457.

Full text

Abstract:

Verifiable secret sharing (VSS) is one of the basic problems in the theory of distributed cryptography and has an important role in secure multiparty computation. In this case, it is tried to share a confidential data as secret, between multiple nodes in a distributed system, in the presence of an active adversary that can destroy some nodes, such that the secret can be reconstructed with the participation of certain size of honest nodes. A dynamic adversary can change its corrupted nodes among the protocol. So far, there is not a formal definition and there are no protocols of dynamic adversa

APA, Harvard, Vancouver, ISO, and other styles

34

Aghaji, Ada, Helen E. D. Burchett, Wanjiku Mathenge, et al. "Technical capacities needed to implement the WHO’s primary eye care package for Africa: results of a Delphi process." BMJ Open 11, no. 3 (2021): e042979. http://dx.doi.org/10.1136/bmjopen-2020-042979.

Full text

Abstract:

ObjectiveThe aim of the study was to establish the technical capacities needed to deliver the WHO African Region’s primary eye care package in primary healthcare facilities.DesignA two-round Delphi exercise was used to obtain expert consensus on the technical complexity of each component of the package and the technical capacities needed to deliver them using Gericke’s framework of technical feasibility. The panel comprised nine eyecare experts in primary eyecare in sub-Saharan Africa. In each round panel members used a 4-point Likert scale to indicate their level of agreement. Consensus was p

APA, Harvard, Vancouver, ISO, and other styles

35

Applebaum, Benny, Dariusz R. Kowalski, Boaz Patt-Shamir, and Adi Rosén. "Clique Here: On the Distributed Complexity in Fully-Connected Networks." Parallel Processing Letters 26, no. 01 (2016): 1650004. http://dx.doi.org/10.1142/s0129626416500043.

Full text

Abstract:

We consider a message passing model with n nodes, each connected to all other nodes by a link that can deliver a message of B bits in a time unit (typically, B = O(log n)). We assume that each node has an input of size L bits (typically, L = O(n log n)) and the nodes cooperate in order to compute some function (i.e., perform a distributed task). We are interested in the number of rounds required to compute the function. We give two results regarding this model. First, we show that most boolean functions require ‸ L/B ‹ − 1 rounds to compute deterministically, and that even if we consider rando

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Huijiao, Jiapeng Tian, Xin Zhang, Yongzhuang Wei, and Hua Jiang. "Multiple Differential Distinguisher of SIMECK32/64 Based on Deep Learning." Security and Communication Networks 2022 (September 14, 2022): 1–12. http://dx.doi.org/10.1155/2022/7564678.

Full text

Abstract:

Currently, deep learning has provided an important means to solve problems in various fields. Intelligent computing will bring a new solution to the security analysis of lightweight block cipher as its analysis becomes more and more intelligent and automatic. In this study, the novel multiple differential distinguishers of round-reduced SIMECK32/64 based on deep learning are proposed. Two kinds of SIMECK32/64’s 6–11 rounds deep learning distinguishers are designed by using the neural network to simulate the case of the multiple input differences and multiple output differences in multiple diff

APA, Harvard, Vancouver, ISO, and other styles

37

Weiss, Mor. "Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience." Entropy 24, no. 7 (2022): 970. http://dx.doi.org/10.3390/e24070970.

Full text

Abstract:

Probabilistically Checkable Proofs (PCPs) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x∈L” by querying only a few proof bits. Zero-Knowledge PCPs (ZK-PCPs) enhance standard PCPs to additionally guarantee that the view of any (possibly malicious) verifier querying a bounded number of proof bits can be efficiently simulated up to a small statistical distance. The first ZK-PCP construction of Kilian, Petrank and Tardos (STOC 1997), and following constructions employing similar techniques, necessitate that the h

APA, Harvard, Vancouver, ISO, and other styles

38

Lian, Ji Hong, and Kai Chen. "Implementation of DES Encryption Algorithm Based on FPGA and Performance Analysis." Applied Mechanics and Materials 130-134 (October 2011): 2953–56. http://dx.doi.org/10.4028/www.scientific.net/amm.130-134.2953.

Full text

Abstract:

This paper introduced the principle of DES encryption algorithm, designed and realized the DES encryption algorithm with verilog hardware description language, realized module simulation with Quartus II. Two comprehensive considerations from the resources and performance, one pipeline stage control is set in round function to improve the processing speed, Synchronous pipeline architecture of data XOR key round function and Key transformation function is realized on hardware to reducing logic complexity of the adjacent pipeline, round function multiplexing is realized by setting the round count

APA, Harvard, Vancouver, ISO, and other styles

39

Price, Jonathan, Alison Rushton, Vasileios Tyros, and Nicola R. Heneghan. "Expert consensus on the important chronic non-specific neck pain motor control and segmental exercise and dosage variables: An international e-Delphi study." PLOS ONE 16, no. 7 (2021): e0253523. http://dx.doi.org/10.1371/journal.pone.0253523.

Full text

Abstract:

Background Chronic non-specific neck pain is highly prevalent, resulting in significant disability. Despite exercise being a mainstay treatment, guidance on optimal exercise and dosage variables is lacking. Combining submaximal effort deep cervical muscles exercise (motor control) and superficial cervical muscles exercise (segmental) reduces chronic non-specific neck pain, but evaluation of optimal exercise and dosage variables is prevented by clinical heterogeneity. Objective To gain consensus on important motor control and segmental exercise and dosage variables for chronic non-specific neck

APA, Harvard, Vancouver, ISO, and other styles

40

Katz, Jonathan, Chiu-Yuen Koo, and Ranjit Kumaresan. "Improving the round complexity of VSS in point-to-point networks." Information and Computation 207, no. 8 (2009): 889–99. http://dx.doi.org/10.1016/j.ic.2009.03.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Okun, Michael. "On the round complexity of Byzantine agreement without initial set-up." Information and Computation 207, no. 12 (2009): 1351–68. http://dx.doi.org/10.1016/j.ic.2009.07.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Vaya, Shailesh. "Round complexity of leader election and gossiping in bidirectional radio networks." Information Processing Letters 113, no. 9 (2013): 307–12. http://dx.doi.org/10.1016/j.ipl.2013.02.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Biran, Ofer, Shlomo Moran, and Shmuel Zaks. "Tight bounds on the round complexity of distributed 1-solvable tasks." Theoretical Computer Science 145, no. 1-2 (1995): 271–90. http://dx.doi.org/10.1016/0304-3975(94)00157-e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Zhang, Silan, Jianhua Chen, Jingbo Xia, and Xiaochuan Ai. "An XTR-Based Constant Round Key Agreement Scheme." Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/596868.

Full text

Abstract:

A new XTR-based key agreement scheme with constant rounds is presented. Three theorems are formulated to reveal the logarithmic computational complexity of this scheme. Furthermore, the computation framework of XTR-based key agreement scheme is introduced, and security of the scheme is proven under the formal model.

APA, Harvard, Vancouver, ISO, and other styles

45

Michail, Othon, George Skretas, and Paul G. Spirakis. "Distributed computation and reconfiguration in actively dynamic networks." Distributed Computing 35, no. 2 (2021): 185–206. http://dx.doi.org/10.1007/s00446-021-00415-5.

Full text

Abstract:

AbstractWe study here systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration to carry out a given task. Also, the distributed task itself may now require a global reconfiguration from a given initial network $$G_s$$ G s to a target network $$G_f$$ G f from a desirable family of networks. To formally capture costs associated with creating and maintaining connections, we define three edge-complexity measures: the total edge activations, the maximum activ

APA, Harvard, Vancouver, ISO, and other styles

46

He, Yong, Lei Gao, Gui Kai Liu, and Yu Zhen Liu. "A Dynamic Round-Robin Packet Scheduling Algorithm." Applied Mechanics and Materials 347-350 (August 2013): 2203–7. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2203.

Full text

Abstract:

This paper puts forward a new dynamic round-robin (DYRR) packet scheduling algorithm with high efficiency and good fairness. DYRR algorithm introduces dynamic round-robin concept, that is, the allowance given to each of the flows in a given round is not fixed, but is related with the number of bytes sent of this and other flows of the last round scheduling. The time complexity of the DYRR algorithm is O(1). Results from performance simulation analysis shows that DYRR algorithm can effectively smooth output burst, realize fair scheduling, and have a good time delay characteristic.

APA, Harvard, Vancouver, ISO, and other styles

47

Sjöstedt, Gunnar. "NGOs in WTO Talks: Patterns of Performance and What They Mean." International Negotiation 17, no. 1 (2012): 91–114. http://dx.doi.org/10.1163/157180612x630947.

Full text

Abstract:

AbstractNon-governmental organizations (NGOs) have remained outside all the GATT rounds since the 1950s. In contrast, hundreds of NGOs have taken part in the current WTO round. This article maps the formal participation of NGOs in five ministerial conferences during the Doha round. It also analyzes various forms of NGO involvement in the WTO trade talks, such as lobbying and capacity-building of developing countries. An assessment of the current and potential capacities of NGOs in the Doha round requires that their performance be seen from an explicit negotiation perspective. Both NGO particip

APA, Harvard, Vancouver, ISO, and other styles

48

Kim, Eunkyung, Hyang-Sook Lee, and Jeongeun Park. "Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS." International Journal of Foundations of Computer Science 31, no. 02 (2020): 157–74. http://dx.doi.org/10.1142/s012905412050001x.

Full text

Abstract:

Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC) protocols, MFHE can be more advantageous than usual fully homomorphic encryption (FHE) since users do not need to agree with a common public key before the computation when using MFHE. In EUROCRYPT 2016, Mukherjee and Wichs constructed a secure MPC protocol in only two rounds via MFHE which deals with a common random/reference string (CRS) in key generation. After then, Brakerski et al. replaced the role of CRS wi

APA, Harvard, Vancouver, ISO, and other styles

49

Courtois, Nicolas T., Jerzy A. Gawinecki, and Guangyan Song. "Contradiction Immunity and Guess-Then-Determine Attacks on Gost." Tatra Mountains Mathematical Publications 53, no. 1 (2012): 65–79. http://dx.doi.org/10.2478/v10127-012-0039-3.

Full text

Abstract:

ABSTRACT GOST is a well-known government standard cipher. Since 2011 several academic attacks on GOST have been found. Most of these attacks start by a so called “Complexity Reduction” step [Courtois Cryptologia 2012] the purpose of which is to reduce the problem of breaking the full 32-round GOST to a low-data complexity attack on a reduced-round GOST. These reductions can be viewed as optimisation problems which seek to maximize the number of values inside the cipher determined at given “cost” in terms of guessing other values. In this paper we look at similar combinatorial optimisation ques

APA, Harvard, Vancouver, ISO, and other styles

50

GONCHENKO, S. V., O. V. STEN’KIN та D. V. TURAEV. "COMPLEXITY OF HOMOCLINIC BIFURCATIONS AND Ω-MODULI". International Journal of Bifurcation and Chaos 06, № 06 (1996): 969–89. http://dx.doi.org/10.1142/s0218127496000539.

Full text

Abstract:

Bifurcations of two-dimensional diffeomorphisms with a homoclinic tangency are studied in one-and two-parameter families. Due to the well-known impossibility of a complete study of such bifurcations, the problem is restricted to the study of the bifurcations of the so-called low-round periodic orbits. In this connection, the idea of taking Ω-moduli (continuous invariants of the topological conjugacy on the nonwandering set) as the main control parameters (together with the standard splitting parameter) is proposed. In this way, new bifurcational effects are found which do not occur at a one-pa

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!