Статті в журналах з теми "Round Complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Round Complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Zhang, Feng, Feng Li, and Wenzheng Zhang. "Differential-Linear Cryptanalsis on SIMECK32/64 and SIMON32/64." Journal of Physics: Conference Series 2504, no. 1 (May 1, 2023): 012068. http://dx.doi.org/10.1088/1742-6596/2504/1/012068.
Повний текст джерелаZhang, Kai, Xuejia Lai, Lei Wang, Jie Guan, Bin Hu, Senpeng Wang, and Tairong Shi. "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.
Повний текст джерелаGrošek, Otokar, Peter Horák, and Pavol Zajac. "On complexity of round transformations." Discrete Mathematics 309, no. 18 (September 2009): 5527–34. http://dx.doi.org/10.1016/j.disc.2008.03.020.
Повний текст джерелаPandurangan, Gopal, Peter Robinson, and Michele Scquizzato. "On the Distributed Complexity of Large-Scale Graph Computations." ACM Transactions on Parallel Computing 8, no. 2 (June 30, 2021): 1–28. http://dx.doi.org/10.1145/3460900.
Повний текст джерела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.
Повний текст джерелаMagniez, Frédéric, and Ashwin Nayak. "Quantum Distributed Complexity of Set Disjointness on a Line." ACM Transactions on Computation Theory 14, no. 1 (March 31, 2022): 1–22. http://dx.doi.org/10.1145/3512751.
Повний текст джерела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.
Повний текст джерелаKremer, I., N. Nisan, and D. Ron. "On Randomized One-round Communication Complexity." Computational Complexity 8, no. 1 (June 1, 1999): 21–49. http://dx.doi.org/10.1007/s000370050018.
Повний текст джерела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.
Повний текст джерелаLacko-Bartošová, Lucia. "Linear and differential cryptanalysis of reduced-round AES." Tatra Mountains Mathematical Publications 50, no. 1 (December 1, 2011): 51–61. http://dx.doi.org/10.2478/v10127-011-0036-y.
Повний текст джерела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.
Повний текст джерелаTse, Savio S. H. "Belated Analyses of Three Credit-Based Adaptive Polling Algorithms." International Journal of Foundations of Computer Science 27, no. 05 (August 2016): 579–94. http://dx.doi.org/10.1142/s0129054116500179.
Повний текст джерелаZhao, Bo, Zhihong Chen, Hai Lin, and XiangMin Ji. "A Constant Round Write-Only ORAM." Applied Sciences 10, no. 15 (August 3, 2020): 5366. http://dx.doi.org/10.3390/app10155366.
Повний текст джерелаSanghvi, Saurabh, and Salil Vadhan. "The Round Complexity of Two-Party Random Selection." SIAM Journal on Computing 38, no. 2 (January 2008): 523–50. http://dx.doi.org/10.1137/050641715.
Повний текст джерелаKremer, Ilan, Noam Nisan, and Dana Ron. "Errata for: "On randomized one-round communication complexity"." Computational Complexity 10, no. 4 (December 1, 2001): 314–15. http://dx.doi.org/10.1007/s000370100003.
Повний текст джерела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.
Повний текст джерела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 (June 1999): 211–23. http://dx.doi.org/10.1142/s0129054199000150.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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 (November 2020): 941–68. http://dx.doi.org/10.1142/s0129054120500367.
Повний текст джерелаWagh, Sameer. "Pika: Secure Computation using Function Secret Sharing over Rings." Proceedings on Privacy Enhancing Technologies 2022, no. 4 (October 2022): 351–77. http://dx.doi.org/10.56553/popets-2022-0113.
Повний текст джерелаBurden, Marisha, Lauren McBeth, and Angela Keniston. "Salient Measures of Hospitalist Workload." JAMA Network Open 6, no. 8 (August 10, 2023): e2328165. http://dx.doi.org/10.1001/jamanetworkopen.2023.28165.
Повний текст джерелаCucker, Felipe, and Steve Smale. "Complexity estimates depending on condition and round-off error." Journal of the ACM 46, no. 1 (January 1999): 113–84. http://dx.doi.org/10.1145/300515.300519.
Повний текст джерела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.
Повний текст джерела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 (December 1, 2020): 30–43. http://dx.doi.org/10.11157/fohpe.v21i3.336.
Повний текст джерелаZajac, Pavol, and Michal Ondroš. "ROTATIONAL CRYPTANALYSIS OF GOST WITH IDENTICAL S-BOXES." Tatra Mountains Mathematical Publications 57, no. 1 (November 1, 2013): 1–19. http://dx.doi.org/10.2478/tmmp-2013-0032.
Повний текст джерелаYang, Fan, Xinyu Chen, Dafa Zhao, Shijie Wei, Jingwei Wen, Hefeng Wang, Tao Xin, and Guilu Long. "Quantum Multi-Round Resonant Transition Algorithm." Entropy 25, no. 1 (December 28, 2022): 61. http://dx.doi.org/10.3390/e25010061.
Повний текст джерелаGąsecki, Arkadiusz. "LOW DATA COMPLEXITY DIFFERENTIAL - ALGEBRAIC ATTACK ON REDUCED ROUND DES." Tatra Mountains Mathematical Publications 57, no. 1 (November 1, 2013): 35–43. http://dx.doi.org/10.2478/tmmp-2013-0034.
Повний текст джерелаXie, Xiaofeng, and Tian Tian. "A Low-Complexity Key-Recovery Attack on 6-Round Midori64." Journal of Systems Science and Complexity 36, no. 4 (August 2023): 1738–56. http://dx.doi.org/10.1007/s11424-023-1452-1.
Повний текст джерела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 (July 25, 2022): 1023. http://dx.doi.org/10.3390/e24081023.
Повний текст джерела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 (March 20, 2023): 67–87. http://dx.doi.org/10.59421/joeats.v1i1.1420.
Повний текст джерела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 (October 2012): 1–35. http://dx.doi.org/10.1145/2371656.2371657.
Повний текст джерела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.
Повний текст джерелаAghaji, Ada, Helen E. D. Burchett, Wanjiku Mathenge, Hannah Bassey Faal, Rich Umeh, Felix Ezepue, Sunday Isiyaku, 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 (March 2021): e042979. http://dx.doi.org/10.1136/bmjopen-2020-042979.
Повний текст джерела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 (March 2016): 1650004. http://dx.doi.org/10.1142/s0129626416500043.
Повний текст джерела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.
Повний текст джерелаWeiss, Mor. "Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience." Entropy 24, no. 7 (July 13, 2022): 970. http://dx.doi.org/10.3390/e24070970.
Повний текст джерела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.
Повний текст джерела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 (July 1, 2021): e0253523. http://dx.doi.org/10.1371/journal.pone.0253523.
Повний текст джерела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 (August 2009): 889–99. http://dx.doi.org/10.1016/j.ic.2009.03.007.
Повний текст джерелаOkun, Michael. "On the round complexity of Byzantine agreement without initial set-up." Information and Computation 207, no. 12 (December 2009): 1351–68. http://dx.doi.org/10.1016/j.ic.2009.07.002.
Повний текст джерелаVaya, Shailesh. "Round complexity of leader election and gossiping in bidirectional radio networks." Information Processing Letters 113, no. 9 (May 2013): 307–12. http://dx.doi.org/10.1016/j.ipl.2013.02.001.
Повний текст джерела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 (July 1995): 271–90. http://dx.doi.org/10.1016/0304-3975(94)00157-e.
Повний текст джерела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.
Повний текст джерелаMichail, Othon, George Skretas, and Paul G. Spirakis. "Distributed computation and reconfiguration in actively dynamic networks." Distributed Computing 35, no. 2 (December 19, 2021): 185–206. http://dx.doi.org/10.1007/s00446-021-00415-5.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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 (February 2020): 157–74. http://dx.doi.org/10.1142/s012905412050001x.
Повний текст джерела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 (December 1, 2012): 65–79. http://dx.doi.org/10.2478/v10127-012-0039-3.
Повний текст джерела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.
Повний текст джерела