Filters








507 Hits in 6.0 sec

Breaking Symmetric Cryptosystems using Quantum Period Finding [article]

Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia
2016 arXiv   pre-print
We study applications of a quantum procedure called Simon's algorithm (the simplest quantum period finding algorithm) in order to attack symmetric cryptosystems in this model.  ...  Following previous works in this direction, we show that several classical attacks based on finding collisions can be dramatically sped up using Simon's algorithm: finding a collision requires Ω(2^n/2)  ...  Generic quantum attacks against symmetric cryptosystems have also been considered.  ... 
arXiv:1602.05973v3 fatcat:qmlnmfubvvhhzmsxmsku2qnjke

Breaking Symmetric Cryptosystems Using Quantum Period Finding [chapter]

Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia
2016 Lecture Notes in Computer Science  
We study applications of a quantum procedure called Simon's algorithm (the simplest quantum period finding algorithm) in order to attack symmetric cryptosystems in this model.  ...  Following previous works in this direction, we show that several classical attacks based on finding collisions can be dramatically sped up using Simon's algorithm: finding a collision requires Ω(2 n/2  ...  Generic quantum attacks against symmetric cryptosystems have also been considered.  ... 
doi:10.1007/978-3-662-53008-5_8 fatcat:zmmqzo3tn5ggdnuo7axmpc4n2a

Development of digital signature algorithm based on the Niederriter crypto-code system

О.С. Циганенко
2020 Системи обробки інформації  
The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms.  ...  The advent of a full-scale quantum computer based on the Shore and Grover algorithms greatly increases the capabilities of cybercriminals and reduces the resilience of cryptosystems used in protocols for  ...  To ensure security, as a rule, symmetric cryptosystems with temporary strength are used, but fast (by 3-5 orders of magnitude) crypto transformations, in comparison with asymmetric cryptosystems that provide  ... 
doi:10.30748/soi.2020.162.09 fatcat:xs6v4myjvbfvhd3sbjbkjypoti

Development of a Lattice-based Cryptosystem

S. I.Anyanwu, B. K. Alese, O. O. Obe
2013 International Journal of Computer Applications  
This work proposes a lattice-based cryptosystem using embedded technique of the closest vector problem (CVP).  ...  The three division of cryptography are Symmetric-key cryptography, Public-key (asymmetric-key) cryptosystems and Hash function.  ...  Symmetric-key cryptography refers to the use of a single key by both the sender and receiver for encryption and decryption. Thus use to achieve confidentiality and privacy.  ... 
doi:10.5120/14038-9131 fatcat:5qcsmhvczzhuziuvchvxa7t4ca

Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research [article]

Ritik Bavdekar, Eashan Jayant Chopde, Ashutosh Bhatia, Kamlesh Tiwari, Sandeep Joshua Daniel, Atul
2022 arXiv   pre-print
Major breakthroughs in quantum computing will render all the present-day widely used asymmetric cryptosystems insecure.  ...  This paper analyzes the vulnerability of the classical cryptosystems in the context of quantum computers discusses various post-quantum cryptosystem families, discusses the status of the NIST post-quantum  ...  The second part is the quantum part that takes advantage of quantum parallelism for the period-finding problem. It uses the quantum Fourier transformation algorithm to find the period.  ... 
arXiv:2202.02826v1 fatcat:ghq4lqiu4rf5vpuv6gbk7ws4jm

The Hidden Subgroup Problem and Post-quantum Group-based Cryptography [article]

Kelsey Horan, Delaram Kahrobaei
2018 arXiv   pre-print
We also overview some platforms for group-based cryptosystems. Notably, efficient algorithms for solving HSP in such infinite group platforms are not yet known.  ...  In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography.  ...  Shor's algorithm solves period finding as a special case of HSP, allowing for an efficient quantum algorithm for factoring and discrete log.  ... 
arXiv:1805.04179v2 fatcat:4pt43jdwqfhutiylezwk6y4w3q

The Impact of Quantum Computing on Present Cryptography

Vasileios Mavroeidis, Kamer Vishi, Mateusz D., Audun Jøsang
2018 International Journal of Advanced Computer Science and Applications  
, quantum algorithms (Shor's and Grover's), public key encryption schemes affected, symmetric schemes affected, the impact on hash functions, and post quantum cryptography.  ...  In particular the reader can delve into the following subjects: present cryptographic schemes (symmetric and asymmetric), differences between quantum and classical computing, challenges in quantum computing  ...  The number of qubits needed to break a cryptosystem is relative to the algorithm proposed. In addition, they show in some detail how to use Shor's algorithm to break ECC over GF(p).  ... 
doi:10.14569/ijacsa.2018.090354 fatcat:odfnypuofnfkjkdq4wdd5yvabe

Untitled Item

Oluyemi Amujo, M.B Hammawa, A.Y. Atumoshi, A. Abdulrahman
2021 figshare.com  
In other words, by the evolvement of high-speed computers such as quantum computers, the popular schemes used in modern cryptography are becoming insignificant.  ...  The scope of this paper covers the weaknesses of modern/classical cryptosystems, the fundamental concepts of quantum cryptography that contributes to its strength such as entanglement, superposition and  ...  The problem of finding the period r of the function f(a) ≡ xa 1 (mod n), where x is any integer that is coprime (sharing no common factors) with n.  ... 
doi:10.6084/m9.figshare.17134601.v1 fatcat:ihx6rf65izdnzmcqsqmx7v65i4

Review on DNA Cryptography [article]

Mandrita Mondal, Kumar S. Ray
2019 arXiv   pre-print
Thus it is the high time to find the alternative of traditional cryptosystem.  ...  Symmetric encryption is difficult to break for large key size and primarily used for bulk encryption. Confidentiality is the only security service provided by this technique.  ... 
arXiv:1904.05528v1 fatcat:i3djbfwanjbatmiro2i5fawgqy

Cybersecurity Challenges Associated with the Internet of Things in a Post-Quantum World

Ohood Althobaiti, Mischa Dohler
2020 IEEE Access  
In this study, we discuss techniques able to provide security in a post-quantum IoT.  ...  To this end, we present promising lattice-driven cryptographic techniques which we prove quantum resistance.  ...  ACKNOWLEDGEMENT This study is part of this research project "Quantum-Resistant Cryptography for the Internet of Things based on Location-Based Lattices" at King's College London.  ... 
doi:10.1109/access.2020.3019345 fatcat:5h7ac7zngvazndjyhemkco6hhi

A one-way function from thermodynamics and applications to cryptography

Norbert Hungerbühler, Michael Struwe
2003 Elemente der Mathematik  
Actually, for no presently used cryptosystem it is proven, that it is difficult (i.e. not possible in polynomial time) to break it.  ...  To break the cryptosystem, Eve would have to find out the value of the key, either by guessing or exhaustive search (which is hopeless if the key space is large enough), or by analyzing the structure of  ... 
doi:10.1007/s000170300008 fatcat:ic4qqdycgzcizokq36xqvpa2ui

Cloud computing in the quantum era

Mustafa Kaiiali, Sakir Sezer, Ayesha Khalid
2019 2019 IEEE Conference on Communications and Network Security (CNS)  
On the other hand, quantum technology is developing very rapidly. Experts are expecting to get an efficient quantum computer within the next decade.  ...  This paper analyses the reciprocal impact of quantum technology on cloud computing and vice versa.  ...  Therefore, quantum computing can be looked at as a twoedged sword. While it breaks several asymmetric cryptosystems currently in use, it creates more advanced ones that are even harder to break.  ... 
doi:10.1109/cns44998.2019.8952589 dblp:conf/cns/KaiialiSK19 fatcat:bl77k4nervempggjz5tcuy6roi

ON QUANTUM CRYPTOGRAPHY

Stevo Jacimovski, Jovan Setrajcic, Jelena Lamovec
2019 ЖУРНАЛ ЗА БЕЗБЈЕДНОСТ И КРИМИНАЛИСТИКУ  
Quantum cryptography is arelatively new field ensuring safe communication between the sender and therecipient using the laws of quantum physics.  ...  This paper seeks to address theprinciples of the quantum distribution of a key for information encryption andthe fundamental problems arising from the execution.  ...  In symmetric cryptosystems, the sender and the recipient use the same secret key (Figure 1 ). An item of information is also encrypted and decrypted with this secret key.  ... 
doi:10.7251/zbk1901043j fatcat:ne5nl2buujfl7adw42tte5hkmu

О КВАНТНОЈ КРИПТОГРАФИЈИ

Стево Јаћимовски, Јован Шетрајчић, Јелена Ламовец
2019 ЖУРНАЛ ЗА БЕЗБЈЕДНОСТ И КРИМИНАЛИСТИКУ  
In symmetric cryptosystems, the sender and the recipient use the same secret key (Figure 1 ). An item of information is also encrypted and decrypted with this secret key.  ...  to encrypt the data being transferred using a symmetric cipher.  ... 
doi:10.7251/zbken1901041j fatcat:3xvefsmp7fg27a5qxv5ucdwt5m

Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms

Rameez Asif
2021 IoT  
Lattices have been widely used in cryptography, somewhat peculiarly, and these algorithms have been used in both; (a) cryptoanalysis by using lattice approximation to break cryptosystems; and (b) cryptography  ...  This streamlined post-quantum algorithm is ideal for levelled IoT device security.  ...  Alan Woodward from University of Surrey, UK for the valuable discussions and lectures on post-quantum cryptography. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/iot2010005 fatcat:ja6nldq4mjafhb2bcyzhxa7efu
« Previous Showing results 1 — 15 out of 507 results