Filters








684 Hits in 6.9 sec

Differential Fault Attacks on Deterministic Lattice Signatures

Leon Groot Bruinderink, Peter Pessl
2018 Transactions on Cryptographic Hardware and Embedded Systems  
We show how two deterministic lattice-based signature schemes, Dilithium and qTESLA, are vulnerable to such attacks.  ...  In this paper, we extend the applicability of differential fault attacks to lattice-based cryptography.  ...  In this paper, we show the applicability of differential fault attacks on deterministic lattice-based signature schemes. We focus on Dilithium, but all our attacks apply to qTESLA as well.  ... 
doi:10.13154/tches.v2018.i3.21-43 dblp:journals/tches/BruinderinkP18 fatcat:ao3qkoxeh5ajxemjwwfkgrne4a

Combined Attack on CRT-RSA [chapter]

Guillaume Barbu, Alberto Battistello, Guillaume Dabosville, Christophe Giraud, Guénaël Renault, Soline Renner, Rina Zeitoun
2013 Lecture Notes in Computer Science  
The principle of our attack is to inject a fault during the signature computation and to perform a Side-Channel Analysis targeting a sensitive value processed during the Fault Injection countermeasure  ...  Indeed, such a value would allow the attacker to recover the RSA private key by computing the gcd of the public modulus and the faulty signature.  ...  We would also like to thank Jean-Sébastien Coron and the anonymous reviewers of PKC'13 for their valuable comments and suggestions.  ... 
doi:10.1007/978-3-642-36362-7_13 fatcat:q343go6pkjdojeqktiyqvvjrbi

Experimenting with Faults, Lattices and the DSA [chapter]

David Naccache, Phong Q. Nguyên, Michael Tunstall, Claire Whelan
2005 Lecture Notes in Computer Science  
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques.  ...  We employ a particular type of fault attack known as a glitch attack, which will be used to actively modify the DSA nonce k used for generating the signature: k will be tampered with so that a number of  ...  Use of Lattice Reduction to Retrieve α We are now in a position to apply the well-known lattice attacks of [9, 14] on El Gamal-type signature schemes: given many DSA signatures for which a few bits of  ... 
doi:10.1007/978-3-540-30580-4_3 fatcat:i3vqh4wcgnhodouhpgbshgzoxu

Quantum-resistant digital signatures schemes for low-power IoT [article]

Hannes Hattenbach
2021 arXiv   pre-print
Quantum computers are on the horizon to get to a sufficient size. These will then be able to break most of the encryption and signature schemes currently in use.  ...  In this paper i am comparing some signature schemes currently in the process of standardization by the NIST.  ...  Since this sparsity of alternatives we we also focus on hash and lattice based signatures in this paper. 1) Hash Based Signatures (HBS): Hash based signatures have their security based upon the hardness  ... 
arXiv:2106.11710v1 fatcat:kqkiaeodofh7pj24q2h52usgoy

New Bleichenbacher Records: Fault Attacks on qDSA Signatures

Akira Takahashi, Mehdi Tibouchi, Masayuki Abe
2018 Transactions on Cryptographic Hardware and Embedded Systems  
As a separate contribution, we present new fault attacks against the qDSA signature scheme of Renes and Smith (ASIACRYPT 2017) when instantiated over the Curve25519 Montgomery curve, and we validate some  ...  These fault attacks enable an adversary to generate signatures with 2 or 3 bits of the nonces known.  ...  We would like to also thank Samuel Neves, Tatsuaki Okamoto, Tsuyoshi Takagi, and anonymous reviewers for valuable comments and suggestions.  ... 
doi:10.13154/tches.v2018.i3.331-371 dblp:journals/tches/TakahashiTA18 fatcat:y72kdfhb6fgpvgchzzl4j26d74

Physical Security in the Post-quantum Era: A Survey on Side-channel Analysis, Random Number Generators, and Physically Unclonable Functions [article]

Sreeja Chowdhury, Ana Covic, Rabin Yu Acharya, Spencer Dupee, Fatemeh Ganji, Domenic Forte
2021 arXiv   pre-print
While considerable effort has been devoted to the design of quantum-resistant and quantum-enhanced schemes, little effort has been made to understanding their physical security.  ...  Besides, proposals for quantum random number generation and quantum physically unclonable functions are compared to their classic counterparts and further analyzed to give a better understanding of their  ...  Side-channel attacks on hash-based post-quantum algorithms are rarely performed, compared to lattice-and code-based schemes, but work in and [Castelnovi et al. 2018] proposed DPA and fault injection  ... 
arXiv:2005.04344v2 fatcat:jstlhwebznfadf5g2zdri4sb6i

Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks

Tiago M. Fernandez-Carames, Paula Fraga-Lamas
2020 IEEE Access  
Furthermore, extensive comparisons are provided on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.  ...  However, the fast progress of quantum computing has opened the possibility of performing attacks based on Grover's and Shor's algorithms in the near future.  ...  CRYPTOSYSTEMS Among the different lattice-based signature schemes described in the literature, the ones based on Short Integer Solution (SIS) [165] seem to be promising due to their reduced key size  ... 
doi:10.1109/access.2020.2968985 fatcat:7wsxhxrfojdmzcxtjtrk6cmcci

Evaluation of Post-Quantum Distributed Ledger Cryptography

Robert Campbell
2019 The Journal of British Blockchain Association  
lattice-based cryptography countermeasure that can be implemented near-term and provide a basis for a coordinated industrywide lattice-based public-key implementation.  ...  Commercial quantum computing research and development is rapid and unpredictable, and it is difficult to predict the arrival of fault-tolerant quantum computing.  ...  The scope of this work evaluates the lattice-based digital signature scheme qTESLA, based on the verifiable hardness of the decisional Ring Learning With Errors (R-LWE) [4] .  ... 
doi:10.31585/jbba-2-1-(4)2019 fatcat:gmgojklruvgz7ppbnvxfejw4l4

Efficient and Secure ECDSA Algorithm and its Applications: A Survey [article]

Mishall Al-Zubaidie, Zhongwei Zhang, Ji Zhang
2019 arXiv   pre-print
These algorithms heighten security against various attacks and at the same time improve performance to obtain efficiencies (time, memory, reduced computation complexity, and energy saving) in an environment  ...  Public-key cryptography algorithms, especially elliptic curve cryptography (ECC) and elliptic curve digital signature algorithm (ECDSA) have been attracting attention from many researchers in different  ...  Acknowledgements We would like to acknowledge and thank the efforts of Dr. Barbara Harmes, and Hawa Bahedh as well as the valuable feedback of the reviewers.  ... 
arXiv:1902.10313v1 fatcat:7k44pfghujbzdmoxpkynavzone

Symmetric Cryptography [chapter]

2006 Security in Fixed and Wireless Networks  
Encryption algorithms are essential to protect sensitive information such as medical data, financial information and Personal Identification Numbers (PINs) from prying eyes.  ...  They are essential to protect our on-line bank transactions, credit cards, medical and personal information and to support e-commerce and e-government. They come in different flavors.  ...  Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, Journal of Cryptology 2008 Lattice-based signature schemes following the Goldreich-Goldwasser-Halevi (GGH) design have the unusual property  ... 
doi:10.1002/0470863722.ch3 fatcat:kye7h3pmnbhkjksvyr4tj4nj7e

symmetric cryptography [chapter]

Martin H. Weik
2000 Computer Science and Communications Dictionary  
Encryption algorithms are essential to protect sensitive information such as medical data, financial information and Personal Identification Numbers (PINs) from prying eyes.  ...  They are essential to protect our on-line bank transactions, credit cards, medical and personal information and to support e-commerce and e-government. They come in different flavors.  ...  Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, Journal of Cryptology 2008 Lattice-based signature schemes following the Goldreich-Goldwasser-Halevi (GGH) design have the unusual property  ... 
doi:10.1007/1-4020-0613-6_18768 fatcat:24uzmmq3pbekxhlquwjzglnsve

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

Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
2021 Cryptography  
This threat triggered post-quantum cryptography research to design and develop post-quantum algorithms that can withstand quantum computing attacks.  ...  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  ...  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

Fault Attacks on Encrypted General Purpose Compute Platforms [article]

Robert Buhren, Shay Gueron, Jan Nordholz, Jean-Pierre Seifert, Julian Vetter
2016 arXiv   pre-print
In response, several main-memory encryption schemes have been proposed to prevent such attacks.  ...  Adversaries with physical access to a target platform can perform cold boot or DMA attacks to extract sensitive data from the RAM.  ...  ., we follow a well-known lattice-based recovery algorithm from [41] to determine the secret key.  ... 
arXiv:1612.03744v1 fatcat:4we5egnbm5bnvj4wu6gttecmya

Attacking RSA–CRT signatures with faults on montgomery multiplication

Pierre-Alain Fouque, Nicolas Guillermin, Delphine Leresteux, Mehdi Tibouchi, Jean-Christophe Zapalowicz
2013 Journal of Cryptographic Engineering  
They apply to any padding function, including randomized paddings, and as such are the first fault attacks effective against RSA-PSS.  ...  In this paper, we present several efficient fault attacks against implementations of RSA-CRT signatures that use modular exponentiation algorithms based on Montgomery multiplication.  ...  Our results do suggest, however, that exponentiation algorithms based on Montgomery multiplication are quite sensitive to a very realistic type of fault attacks and that using RSA-CRT countermeasures is  ... 
doi:10.1007/s13389-013-0050-x fatcat:bvk4jadqzbdvtd3dnlec5tx5em

Quantum Computing: A Taxonomy, Systematic Review and Future Directions [article]

Sukhpal Singh Gill, Adarsh Kumar, Harvinder Singh, Manmeet Singh, Kamalpreet Kaur, Muhammad Usman, Rajkumar Buyya
2021 arXiv   pre-print
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  ...  A detailed overview of quantum software tools and technologies, post-quantum cryptography and quantum computer hardware development to document the current state-of-the-art in the respective areas.  ...  There are equally likely chances of chi-square attack, cyclotomic vulnerabilities, inherent structure exploitability, and sensitive dependence to field parameters in the majority of existing schemes  ... 
arXiv:2010.15559v4 fatcat:y6cuttww5fd5jdmvcer352lh4e
« Previous Showing results 1 — 15 out of 684 results