Filters








296 Hits in 14.3 sec

Full Text PDF of The JBBA Vol 2, Issue 1, May 2019

Naseem Naqvi
2019 The Journal of British Blockchain Association  
Acknowledgements: The authors would like to thank Bobby Ong and the Coingecko team for their proactive support. Acknowledgements: MS would like to thank Dr.  ...  Ahrash Dianat -MSc Supervisor University of Essex, Navroop Sahdev -MIT and Halla Al-Razouq  ...  to recover the plaintext from the ciphertext without knowledge of the key.  ... 
doi:10.31585/jbba-2-1-(8)2019 fatcat:6mlccu2l4ng4flan6627iw5rqq

Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue [article]

2013
Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue  ...  The talk concludes with experimental results, including the first security proof of the preloading countermeasure, based on an actual x86 executable of AES.  ...  We use this combination for deriving bounds on the leakage of executables of standard AES implementations, demonstrating that automatically deriving security guarantees against cache attacks is indeed  ... 
doi:10.4230/dagrep.2.11 fatcat:rptzxpnrmzdbrmrrgehfnggq2u

IEEE Microwave Theory and Techniques Society

2006 IEEE Microwave Magazine  
Compliance with the provisions of this standard does not imply compliance to any applicable regulatory requirements.  ...  IEEE does not, by the publication of its standards, intend to urge action that is not in compliance with applicable laws, and these documents may not be construed as doing so.  ...  The purpose of this sub clause is to define the context that belongs to each key, how it is obtained and the scope of its usage.  ... 
doi:10.1109/mmw.2006.1634021 fatcat:tgzwn33birghjdtgzmj7uo6z3m

An introduction to Block Cipher Cryptanalysis

C. de Canniere, A. Biryukov, B. Preneel
2006 Proceedings of the IEEE  
This has led, over the last decades, to the development of several general techniques to analyze the security of block ciphers.  ...  Since the introduction of the Data Encryption Standard (DES) in the mid-1970s, block ciphers have played an ever-increasing role in cryptology.  ...  The SQUARE attack, which was also applicable to the RIJNDAEL structure, allowed to break six rounds out of ten.  ... 
doi:10.1109/jproc.2005.862300 fatcat:7r2f6t67unbo5cu4vb7z4p5loa

Privacy-Preserving Payment Splitting

Saba Eskandarian, Mihai Christodorescu, Payman Mohassel
2020 Proceedings on Privacy Enhancing Technologies  
We find that, for realistic group sizes, it requires fewer than 50 milliseconds per round of computation on a user's phone and the server requires fewer than 300 microseconds per round for each group,  ...  AbstractWidely used payment splitting apps allow members of a group to keep track of debts between members by sending charges for expenses paid by one member on behalf of others.  ...  Acknowledgment We would like to thank the anonymous reviewers and our shepherd Melissa Chase for their helpful feedback in improving the paper.  ... 
doi:10.2478/popets-2020-0018 fatcat:nlrorxfs7rhfxlyj6psgr2cm5m

Algebraic Analysis of a Simplified Encryption Algorithm GOST R 34.12-2015

Evgenia Ishchukova, Ekaterina Maro, Pavel Pristalov
2020 Computation  
The complexity of the XL algebraic analysis of a four-round S-KN2 cipher with three text pairs was 236.33 s (took 1.191 Gb RAM).  ...  The algebraic analysis of an eight-round Magma (68 key bits were fixed) with the CryptoMiniSat solver demanded four known text pairs and took 3029.56 s to complete (the search took 416.31 s).  ...  The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.  ... 
doi:10.3390/computation8020051 fatcat:gkvnjfkipjfazi6rqzlibhpjge

Fake BTS Attacks of GSM System on Software Radio Platform

Yubo Song, Kan Zhou, Xi Chen
2012 Journal of Networks  
solutions to this field, as the rapid development of communication technology, utilizing network to realize global communications has become the trend of information exchange.  ...  The contradictory characteristic of survivability of borderless network is explained. The extension model and algorithms of recognition and resistance of attacks is presented.  ...  . □ We know from Proposition 1 that an m-GFNPS has the same safety with an m-GFNSP under known plaintext attacks. Hence it is enough to study the design and analysis of m-GFNSP. Definition 5.  ... 
doi:10.4304/jnw.7.2.275-281 fatcat:3ejjimllcvewjeifopbvhl3zmi

Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard

Susan Landau
2004 The American mathematical monthly  
To set the stage, I will begin with a discussion of a decidedly nonalgebraic algorithm, the 1975 U.S.  ...  In this paper I will show how polynomials came to play a critical role in what may become the most widely-used algorithm of the new century.  ...  Knudsen showed how to extend this to an attack on six rounds that took 2 72 steps.  ... 
doi:10.2307/4145212 fatcat:57fabdawj5ad7e2xhxcbef7vsq

Attack Determination and its Security Analysis for Personal Communication in VoIP Networks

Dr.K. Venkatachalapathy
2013 IOSR Journal of Computer Engineering  
For encryption, each round of AES (except the last round) consists of four stages: 2.5.1 Add Round Key --each byte of the state is combined with the round key; each round key is derived from the cipher  ...  The final round replaces the Mix Columns stage with another instance of Add Round Key. III. Flow Analysis Attacks In this section, we describe flow analysis attacks on VoIP networks.  ...  We also thankful to all the Staff members of the Department of Computer Engineering of Gokhale Education Society's R. H.  ... 
doi:10.9790/0661-0920109 fatcat:atnqdia7kbhbtghde74ong6qry

Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard

Susan Landau
2004 The American mathematical monthly  
To set the stage, I will begin with a discussion of a decidedly nonalgebraic algorithm, the 1975 U.S.  ...  In this paper I will show how polynomials came to play a critical role in what may become the most widely-used algorithm of the new century.  ...  Knudsen showed how to extend this to an attack on six rounds that took 2 72 steps.  ... 
doi:10.1080/00029890.2004.11920055 fatcat:yf2gazszynaffh474w6qppdoeu

Scalable Private Set Intersection Based on OT Extension

Benny Pinkas, Thomas Schneider, Michael Zohner
2018 ACM Transactions on Privacy and Security  
We demonstrate the feasibility of our new PSI protocol by processing two sets with a billion elements each.  ...  Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the intersection.  ...  AES with a fixed key and send the resulting ciphertext to the client.  ... 
doi:10.1145/3154794 fatcat:rans6apzyfghvkywqa6rxyesoq

Low-power emerging memristive designs towards secure hardware systems for applications in internet of things

Nan Du, Heidemarie Schmidt, Ilia Polian
2021 Nano Materials Science  
For the low-power security applications in IoT, it is essential to understand how to best realize cryptographic circuitry using memristive circuitries, and to assess the implications of memristive crypto  ...  computing, their application-level impacts on the novel implementations of secret key generation, crypto functions and machine learning attacks are explored, respectively.  ...  N.D. and H.S. acknowledges the funding by the Fraunhofer Internal Programs under Grant No. Attract 600768. We are thankful to two anonymous reviewers for their constructive feedback.  ... 
doi:10.1016/j.nanoms.2021.01.001 fatcat:ellxqwgigvfizbtkgqznvpat44

Security issues in cloud environments: a survey

Diogo A. B. Fernandes, Liliana F. B. Soares, João V. Gomes, Mário M. Freire, Pedro R. M. Inácio
2013 International Journal of Information Security  
The possibility of paying-as-you-go mixed with an on-demand elastic operation is changing the enterprise computing model, shifting on-premises infrastructures to offpremises data centers, accessed over  ...  Besides of the issues derived from web technologies and the Internet, clouds introduce new issues that should be cleared out first in order to further allow the number of cloud deployments to increase.  ...  Acknowledgements We would like to thank all the anonymous reviewers for constructively criticizing this work.  ... 
doi:10.1007/s10207-013-0208-7 fatcat:55o67epb6zfspchxuzvuduzr4a

A Compact and Scalable Hardware/Software Co-design of SIKE

Pedro Maat C. Massolino, Patrick Longa, Joost Renes, Lejla Batina
2020 Transactions on Cryptographic Hardware and Embedded Systems  
In particular, any of the current SIKE parameters equivalent to the post-quantum security of AES-128/192/256 and SHA3-256 can be selected and run on-the-fly.  ...  In order to be better equipped for different post-quantum scenarios, our architectures were designed to feature high-flexibility by covering all the currently available parameter sets and with support  ...  Acknowledgments We would like to thank the TCHES reviewers for their useful comments and feedback.  ... 
doi:10.13154/tches.v2020.i2.245-271 dblp:journals/tches/MassolinoLRB20 fatcat:2ysxgsa6hjcshfknto322kfmea

Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds [chapter]

Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, Adi Shamir
2010 Lecture Notes in Computer Science  
We show attacks on reduced-round variants of AES-256 with up to 10 rounds with complexity which is feasible.  ...  One of our attacks uses only two related keys and 2 39 time to recover the complete 256-bit key of a 9-round version of AES-256 (the best previous attack on this variant required 4 related keys and 2 120  ...  The Complexity of the Attack. The data complexity is 2 38 chosen plaintexts (composed of 2 37 arbitrary plaintexts P along with their 2 37 companions P ).  ... 
doi:10.1007/978-3-642-13190-5_15 fatcat:imjhqrpk6zb6dgsjzgcmtdwfyq
« Previous Showing results 1 — 15 out of 296 results