995 Hits in 8.5 sec

Dynamic keys generation for internet of things

Omar Sapti Guma'a, Qasim Mohammed Hussein, Ziyad Tariq Mustafa Al-Ta'i
2020 Indonesian Journal of Electrical Engineering and Computer Science  
This paper proposes modifications to NTRU public key cryptosystem to be secure against the lattice-based attack by using LLL algorithm, as well as a method for generating a new keys sequence dynamically  ...  NTRU is one of a LB-PKC that based on truncated polynomial ring, it has good features, which make it to be an effective alternative to the RSA and ECC algorithms.  ...  This means that the modification has not effect on the complexity and at the same time be more efficient in terms of security against lattice-based attack by LLL algorithm. .  ... 
doi:10.11591/ijeecs.v18.i2.pp1066-1073 fatcat:w6uyzpvpcbfqrgjqhhtpfcxncm

Lighting the Way to a Smart World: Lattice-Based Cryptography for Internet of Things [article]

Rui Xu, Chi Cheng, Yue Qin, Tao Jiang
2018 arXiv   pre-print
In this paper, we summarize the advantages of lattice-based cryptography and the state of art of their implementations for IoT devices.  ...  As a promising candidate for the future post-quantum cryptography standard, lattice-based cryptography enjoys the advantages of strong security guarantees and high efficiency, which make it extremely suitable  ...  ACKNOWLEDGMENTS The work presented in this paper was supported in part by the National Natural Science Foundation of China under Grant no. 61672029.  ... 
arXiv:1805.04880v1 fatcat:327pcoavungejelvhpvd3ofwky

lattice based cryptography.pdf

ganesh E N
In this paper, we summarize the advantages of lattice-based cryptography and the state of art of their implementations for IoT devices  ...  As a promising candidate for the future post-quantum cryptography standard, lattice-based cryptography enjoys the advantages of strong security guarantees and high efficiency, which make it extremely suitable  ...  The worst-case to average-case reduction essentially guarantees that lattice-based cryptography is secure on average unless every instance of the underlying lattice problem is easy.  ... 
doi:10.6084/m9.figshare.19802590.v1 fatcat:5ksga2srmrh33fcnizsicdrvte

Lattice-based Key Sharing Schemes - A Survey [article]

Prasanna Ravi, James Howe, Anupam Chattopadhyay, Shivam Bhasin
2020 IACR Cryptology ePrint Archive  
Lattice-based cryptography offers a very attractive alternative to traditional public-key cryptography mainly due to the variety of lattice-based schemes offering varying flavors of security and efficiency  ...  general algorithmic frameworks, practical implementation aspects and physical attack security, with special focus on lattice-based key sharing schemes competing in the NIST's standardization process.  ...  PHYSICAL ATTACKS ON LATTICE-BASED CRYPTOGRAPHY There also exists a large body of work done on physical security of lattice-based schemes such as Side-Channel Attacks (SCA) and Fault Attacks (FA).  ... 
dblp:journals/iacr/RaviHCB20 fatcat:gwfp7xfzbbgxnldzbngfc4ru7q

A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE [chapter]

Florian Göpfert, Christine van Vredendaal, Thomas Wunderer
2017 Lecture Notes in Computer Science  
In the case of lattice-based cryptography, currently existing quantum attacks are mainly classical attacks, carried out with quantum basis reduction as subroutine.  ...  Our quantum attack is based on Howgrave-Graham's Classical Hybrid Attack and is suitable for LWE instances in recent cryptographic proposals.  ...  Introduction Over the past decade lattice-based cryptography [31] has proven to be one of the most promising candidates for post-quantum cryptography.  ... 
doi:10.1007/978-3-319-59879-6_11 fatcat:343hw4m3cnaalhfxdrea6lxolu

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Zulianie Binti Jemihin, Soo Fun Tan, Gwo-Chin Chung
2022 Cryptography  
Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities.  ...  While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based  ...  Acknowledgments: This research was supported by the Universiti Malaysia Sabah Research Grant-SDK0165-2020.  ... 
doi:10.3390/cryptography6030040 fatcat:h3zmbvouwvchvnb54as7zsa3li

Q-NTRU Cryptosystem for IoT Applications

Omar Sapti Guma'a, Qasim Mohammed Hussein, Ziyad Tariq Mustafa Al-Ta'i
2019 Journal of Southwest Jiaotong University  
This expansion is accompanied by a number of challenges; one of them is the need for solving the problem of security challenges by using algorithms with high security and the adversaries unable to attack  ...  NTRU (Nth-degree TRUncated polynomial ring) is one of lattice-based cryptosystems that meets these requirements.  ...  Security against Lattice-based attack Secure Broken The dimension of the lattice increases to 16N Table 4 . 4 Example Results Identity.  ... 
doi:10.35741/issn.0258-2724.54.4.15 fatcat:x6wobwkpvncc3kggkukl2n5bdi

Guest Editors' Introduction to the Special Issue on Cryptographic Engineering in a Post-Quantum World: State of the Art Advances

Zhe Liu, Patrick Longa, Cetin Kaya Koc
2018 IEEE transactions on computers  
The authors look in particular at fault attacks against implementations of lattice-based signatures and key exchange protocols.  ...  The (in alphabetic order of the authors) first paper, by Thomas Espitau, Pierre-Alain Fouque, Benoit G erard, and Mehdi Tibouchi, reports on "Loop-Abort Faults on Lattice-Based Signatures and Key Exchange  ...  The authors study all know attacks against the NTRU-Encrypt parameter set and show that it delivers 256 bits of security against classical attacker and 128 bits of security against quantum attacks.  ... 
doi:10.1109/tc.2018.2869611 fatcat:aw4i4jifm5ftrgmwn5bgonucje

Another Look at Tightness II: Practical Issues in Cryptography [chapter]

Sanjit Chatterjee, Neal Koblitz, Alfred Menezes, Palash Sarkar
2017 Lecture Notes in Computer Science  
We discuss nontightness in connection with complexity leveraging, HMAC, lattice-based cryptography, identity-based encryption, and hybrid encryption.  ...  How to deal with large tightness gaps in security proofs is a vexing issue in cryptography.  ...  Of course, none of them is responsible for any of the opinions expressed in this article.  ... 
doi:10.1007/978-3-319-61273-7_3 fatcat:auyw65hh2rfh3k3hphhrf6mcra

Efficient FPGA Implementation of Modular Multiplication and Exponentiation

M Issad, M Anane, B Boudraa, A M Bellemou, N Anane
2020 Malaysian Journal of Computing and Applied Mathematics  
This paper presents an FPGA implementation of the most critical operations of Public Key Cryptography (PKC), namely the Modular Exponentiation (ME) and the Modular Multiplication (MM).  ...  Our implementation approach is based on the digit-serial method for performing the basic arithmetic operations.  ...  The best tools used to prove the security and the efficiency of an LBC is Hybrid Attack combined with Lattice reduction attack with LLL(Lenstra, Lenstra, Lovasz) and BKZ2 (Blockwise-Korkine-Zolotarev)  ... 
doi:10.37231/myjcam.2020.3.1.37 fatcat:2dfcacmq7rahpbmw5ja7unbptu

spKEX: An optimized lattice-based key exchange [article]

Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen
2017 IACR Cryptology ePrint Archive  
Lattice-based cryptography is one of the most attractive post-quantum cryptographic families due to its well-understood security, efficient operation and versatility.  ...  Lattice-based cryptography is a promising candidate for quantum-resistant cryptography due to its (relatively) good performance, versatility in different cryptographic schemes and resistance against all  ...  We thank Zhenfei Zhang for fruitful discussions on the hybrid attack.  ... 
dblp:journals/iacr/BhattacharyaGRT17 fatcat:7rye6atmgrautk2lohhsso3xou

Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
2021 Cryptography  
Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems, based on modular arithmetic to the contemporary cryptosystems based on quantum computing  ...  This paper provides an overview of the various research directions that have been explored in post-quantum cryptography and, specifically, the various code-based cryptography research dimensions that have  ...  Acknowledgments: This research work has been carried out under the leadership of the Institute for Technological Research SystemX, and therefore granted within the scope of the program "Recherche Exploratoire  ... 
doi:10.3390/cryptography5040038 fatcat:wkb43zunwjagbnljc6brfou4ty

Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project [chapter]

Douglas Stebila, Michele Mosca
2017 Lecture Notes in Computer Science  
We review two protocols for quantum-resistant key exchange based on lattice problems: BCNS15, based on the ring learning with errors problem, and Frodo, based on the learning with errors problem.  ...  We discuss their security and performance characteristics, both on their own and in the context of the Transport Layer Security (TLS) protocol.  ...  Acknowledgements Research on LWE and ring-LWE based key exchange discussed in this paper includes joint work with Joppe W.  ... 
doi:10.1007/978-3-319-69453-5_2 fatcat:lhen3goh6rb4nft6ui6p4gjuoa

Revisiting the Hybrid attack on sparse and ternary secret LWE [article]

Yongha Son, Jung Hee Cheon
2019 IACR Cryptology ePrint Archive  
This use of small secret also benefits to attack algorithms against LWE, and currently LWEbased cryptosystems including homomorphic encryptions (HE) set parameters based on the attack complexity of those  ...  In the practical use of the Learning With Error (LWE) based cryptosystems, it is quite common to choose the secret to be extremely small: one popular choice is ternary (±1, 0) coefficient vector, and some  ...  It is well-known that for NTRU, a hybrid of lattice reduction and meetin-the-middle attack (the hybrid attack from now) was proposed by [29] , and this is still considered as one of the most powerful  ... 
dblp:journals/iacr/SonC19 fatcat:xp2e7mhxdjbo3lbnn52j7ee6xa

Public-Key Cryptography (Dagstuhl Seminar 16371)

Marc Fischlin, Alexander May, David Pointcheval, Tal Rabin, Marc Herbstritt
2017 Dagstuhl Reports  
The goal of the seminar was to bring together different subareas from public-key cryptography and to promote research among these areas.  ...  This report documents the program and results of Dagstuhl seminar 16731 "Public-Key Cryptography" which took place September 11-16, 2016.  ...  Since the dimension of the subfield is smaller, the dimension of the lattice decreases, and lattice reduction algorithm will perform better.  ... 
doi:10.4230/dagrep.6.9.46 dblp:journals/dagstuhl-reports/Fischlin0PR16 fatcat:figv27hq4feibl5nzb7snrtm2i
« Previous Showing results 1 — 15 out of 995 results