Filters








10,405 Hits in 5.6 sec

The Impact of Decryption Failures on the Security of NTRU Encryption [chapter]

Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte
2003 Lecture Notes in Computer Science  
The appropriate countermeasure is to change the parameter sets and possibly the decryption process so that decryption failures are vanishingly unlikely, and to adopt a padding scheme that prevents an attacker  ...  NTRUEncrypt is unusual among public-key cryptosystems in that, with standard parameters, validly generated ciphertexts can fail to decrypt.  ...  Acknowledgments We would like to thank Jeff Hoffstein and Jill Pipher for fruitful discussions and contributions.  ... 
doi:10.1007/978-3-540-45146-4_14 fatcat:bhrs5vc2xjfzdbn53vln4vn34q

AN ENHANCED CRYPTO ALGORITHM FORSECURE DATA STORAGE USING AES ALGORITHM

2020 International Journal of Emerging Trends in Engineering Research  
It is common knowledge that countless professionals continue to access the cloud for various requirements and from the point of view of absolute security of the cloud computing that needs to be insulated  ...  Only we had plotted success cases into graph in order to display time taken for decryption alone, because if we plot failure cases time taken for encryption will be zero and it looks like it had provided  ...  Only we had plotted success cases into graph in order to display time taken for encryption alone, because if we plot failure cases the time taken for encryption will be zero and it looks like it had provided  ... 
doi:10.30534/ijeter/2020/808102020 fatcat:66lrtbwagzerzcrli6q62rwqku

Plaintext Recovery Attacks against SSH

Martin R. Albrecht, Kenneth G. Paterson, Gaven J. Watson
2009 2009 30th IEEE Symposium on Security and Privacy  
Note that the attacker can verify when he has been successful in his attack, so this attack has the same success probability but is more powerful than the attack that simply guesses 14 bits of plaintext  ...  Using this proof-of-concept code (including the server patch to increase the success probability), we were able to reliably recover the value of the packet length field after decryption, and hence recover  ... 
doi:10.1109/sp.2009.5 dblp:conf/sp/AlbrechtPW09 fatcat:nbha7b57vvef3paxnpwbgxlxw4

Improved Cryptographic Protection of Information using Robust Authentication Algorithms

Natasa Zivic
2013 Procedia - Social and Behavioral Sciences  
Such a hard condition is not suitable for some applications.  ...  Information is typically transmitted in telecommunication systems in form of messages.  ...  If, after i max iterations, the message and/or its CCV are not corrected, SID gives a FAILURE information.  ... 
doi:10.1016/j.sbspro.2013.02.018 fatcat:c4cjazirqnbozmga4e7wkb743i

Improved Cryptographic Protection of Information using Robust Authentication Algorithms

Natasa Zivic
2013 Procedia - Social and Behavioral Sciences  
Such a hard condition is not suitable for some applications.  ...  Information is typically transmitted in telecommunication systems in form of messages.  ...  If, after i max iterations, the message and/or its CCV are not corrected, SID gives a FAILURE information.  ... 
doi:10.1016/j.sbspro.2013.02.020 fatcat:7tmxsbhxnvfbzaxfmwf77553em

PudgyTurtle: Using Keystream to Encode and Encrypt

David A. August, Anne C. Smith
2020 SN Computer Science  
Compared to normal binary-additive stream ciphers, this process is less efficient (i.e., more time is required to generate extra keystream nibbles, and more space is needed for the codewords than for the  ...  Since it can use keystream from any stream cipher, PudgyTurtle functions somewhat like an encryption mode.  ...  If any table contains one or more valid hits, the attack is deemed a success; otherwise it's a failure.  ... 
doi:10.1007/s42979-020-00221-z fatcat:hltlrxyavnc5hko4lvkcuhaftm

E-Voting with Aadhar

Seema D. Thakar
2018 International Journal for Research in Applied Science and Engineering Technology  
Besides electronic recording and counting of votes will be faster, more accurate and less labour intensive.  ...  The design of this system will make voting process more convenient and may therefore lead to improve the turnout.  ...  P={E,D} E={parameter, Voter Details.}D=parameter, Availability, Fingerprint} Identify failure cases as F S={I,O,P,F,. F=Failure occurs when the data is accessed by an unauthorized user.  ... 
doi:10.22214/ijraset.2018.3601 fatcat:4oo2ca4ibrbjhe56ges7aynhhy

The impact of error dependencies on Ring/Mod-LWE/LWR based schemes

Jan-Pieter D'Anvers, Frederik Vercauteren, Ingrid Verbauwhede
2019 Zenodo  
This higher-than-expected failure rate could lead to more efficient cryptanalysis of the scheme through decryption failure attacks.  ...  We provide a method to estimate the decryption failure probability, taking into account the bit failure dependency.  ...  Intuitively, one can make the following reasoning: (c c c T s s s + g) with high norm for s s s and c c c is more likely to produce bit errors, and conversely, bit errors are also more likely to stem from  ... 
doi:10.5281/zenodo.2641881 fatcat:iltheahsijfotkx7c5lopeinbu

A novel stochastic-encryption-based P2P Digital Rights Management scheme

Majing Su, Hongli Zhang, Xiaojiang Duy, Qiong Dai
2015 2015 IEEE International Conference on Communications (ICC)  
Digital right protection in P2P systems is attracting more and more attentions.  ...  In our scheme, peers make a payment after downloading, and this prevents user loss due to download failures (caused by the dynamics of P2P).  ...  This indicates that: to a given swarm, the larger ω is, the more likely that each peer get different decryption keys. A large N (e.g., N > 1000) ensures that P success is small.  ... 
doi:10.1109/icc.2015.7249205 dblp:conf/icc/SuZDD15 fatcat:lnzwc3pe2ffcthparijr7su2xy

A wrap error attack against NTRUEncrypt

Tommi Meskanen, Ari Renvall
2006 Discrete Applied Mathematics  
The attack is based on the fact that wrap errors occur more frequently if blinding polynomials with larger coefficients are used.  ...  We assume that the attacker can detect wrap errors, that the blinding polynomial is generated from three parts (as specified in the standards) and that the attacker has a large database of carefully selected  ...  Based on which decryptions failed, the attacker then could quite easily find out information about the private key. After attacks like this NTRU was changed.  ... 
doi:10.1016/j.dam.2005.03.019 fatcat:3s66lqqrzjfenkn4mvustr5eca

Mobile phone based RFID architecture for secure electronic Payments using RFID credit cards

Geethapriya Venkataramani, Srividya Gopalan
2007 The Second International Conference on Availability, Reliability and Security (ARES'07)  
RFID system has tremendous potential to render electronic payments more secure than normal credit cards.  ...  In an electronic payment scheme using normal credit cards there is no way to genuinely identify owner of the credit card. Credit card fraud is the fastest growing crime all over the world.  ...  Acknowledgements We like to thank Mr.Gopi.K.L of Satyam Computer Services Limited, for his valuable inputs and reviews.  ... 
doi:10.1109/ares.2007.105 dblp:conf/IEEEares/VenkataramaniG07 fatcat:epcdejciargabh23fnkkkvbha4

Additively Homomorphic Ring-LWE Masking [chapter]

Oscar Reparaz, Ruan de Clercq, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede
2016 Lecture Notes in Computer Science  
When the masking is turned off, the decryption failure rate is 3.6 × 10 −5 per bit. The failure rate increases to 3.3 × 10 −3 per bit when the masking turned on.  ...  This larger noise increases the decryption failure rate.  ...  Note that the distribution of (c 1 + c 1 ) · s when s = 0 and c 1 + c 1 is uniform random is different from the distribution of (c 1 + c 1 ) · s when s = 0.  ... 
doi:10.1007/978-3-319-29360-8_15 fatcat:sqy3uce2f5ehfkycte7v425ulm

Practical verification of WPA-TKIP vulnerabilities

Mathy Vanhoef, Frank Piessens
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
The first attack is a Denial of Service attack that can be executed by injecting only two frames every minute.  ...  We show that this can be used to efficiently decrypt arbitrary packets sent towards a client. We also report on implementation vulnerabilities discovered in some wireless devices.  ...  ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers and the shepherd for their valuable feedback. This research is partially funded by the Research Fund  ... 
doi:10.1145/2484313.2484368 dblp:conf/ccs/VanhoefP13 fatcat:gxn7sf7nzfe4lcqtih5mz4ohmm

Spam Control Mechanism using Identity based Message Admission

Mahesh P, Basappa B. Kodada, Shivakumar K. M
2013 International Journal of Computer Applications  
During decryption the Key mediator does partial decryption and the recipient does full decryption of message.  ...  Also DKIM does not verify the author and does not provide security after signature generation/verification.  ...  In a binomial experiment there are two mutually exclusive outcomes, often referred to as "success" and "failure". If the probability of success is p, the probability of failure is 1 -p.  ... 
doi:10.5120/12865-9696 fatcat:3ywogllrb5f7no6qnqo7otvbvy

Hiding Data into Reserve Space before Image Encryption using Blowfish Algorithm

Pradnya P., Samruddhi S., Samiksha M., Priti Mithari
2016 International Journal of Computer Applications  
Reversible Data Hiding (RDH) maintains the tremendous property that is the original content can be losslessly recover after embedding data.  ...  This paper is about encryption and decryption of images using a private-key block cipher called 64-bits. Blowfish designed to increase security and to improve performance.  ...  Despite the assistance of so many people and our best efforts, there are still likely to be some unintentional omissions or errors.  ... 
doi:10.5120/ijca2016909474 fatcat:o5roaqaqhbdklgkmizamkw3jge
« Previous Showing results 1 — 15 out of 10,405 results