Filters








12 Hits in 7.6 sec

Efficient Masking of ARX-Based Block Ciphers Using Carry-Save Addition on Boolean Shares [chapter]

Daniel Dinu, Johann Großschädl, Yann Le Corre
2017 Lecture Notes in Computer Science  
Then, we introduce a new technique for direct modular addition/subtraction on Boolean shares using a simple Carry-Save Adder (CSA) in an iterative fashion.  ...  We show that the average complexity of CSA-based addition on Boolean shares grows logarithmically with the operand size, similar to the Kogge-Stone carry-lookahead addition, but consists of only a single  ...  Therefore, it is still unclear how fast a modular addition on Boolean shares can be in the real world and how its execution time impacts the performance of an ARX-based cipher.  ... 
doi:10.1007/978-3-319-69659-1_3 fatcat:uweahyajcjhdlmy2daiewhacs4

Bricklayer Attack: A Side-Channel Analysis on the ChaCha Quarter Round [chapter]

Alexandre Adomnicai, Jacques J. A. Fournier, Laurent Masson
2017 Lecture Notes in Computer Science  
ChaCha is a family of stream ciphers that are very efficient on constrainted platforms.  ...  First, we present the ChaCha family of stream ciphers before providing an outline of side-channel attacks.  ...  ChaCha is an ARX-based cipher, which means that it only uses modular additions, rotations and bitwise XORs.  ... 
doi:10.1007/978-3-319-71667-1_4 fatcat:ulzfwu2nejaibi7ff6khozwqrq

Boolean Masking for Arithmetic Additions at Arbitrary Order in Hardware

Florian Bache, Tim Güneysu
2022 Applied Sciences  
Modular addition is an important component of many cryptographic algorithms such as ARX-ciphers and lattice-based post-quantum secure schemes.  ...  All architectures are fully pipelined and achieve a throughput of one addition per cycle.  ...  For example, in Addition-Rotation-XOR (ARX) ciphers they perform similar function to S-boxes in classical block ciphers, being the only non-linear part of the algorithm.  ... 
doi:10.3390/app12052274 doaj:f8a76d3b7aab4e1196fffa57c7013a99 fatcat:dwc4rntjw5gsfd2x2ss6w6coqa

Masking the Lightweight Authenticated Ciphers ACORN and Ascon in Software [article]

Alexandre Adomnicai, Jacques J. A. Fournier, Laurent Masson
2018 IACR Cryptology ePrint Archive  
Especially, we focus on software implementations and provide benchmarks for several security levels on an ARM Cortex-M3 embedded microprocessor.  ...  The ongoing CAESAR competition aims at finding authenticated encryption schemes that offer advantages over AES-GCM for several use-cases, including lightweight applications.  ...  Note that reusing the random shares used during the initialization should not compromise the security of the masking scheme, saving the generation of additional random numbers.  ... 
dblp:journals/iacr/AdomnicaiFM18 fatcat:kayywuiqsnbevlmjsh7hartnta

Comparing the Cost of Protecting Selected Lightweight Block Ciphers against Differential Power Analysis in Low-Cost FPGAs

William Diehl, Abubakr Abdulgadir, Jens-Peter Kaps, Kris Gaj
2018 Computers  
We then apply an equivalent level of protection to the above ciphers using 3-share threshold implementations (TI) and verify the improved resistance to DPA.  ...  Ongoing cryptographic contests and standardization efforts evaluate lightweight block ciphers on their resistance to power analysis side channel attack (SCA), and the ability to apply countermeasures.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/computers7020028 fatcat:zdm7bm5pwvc6lotedvaldjrwby

Lightweight AEAD and Hashing using the Sparkle Permutation Family

Christof Beierle, Alex Biryukov, Luan Cardoso Dos Santos, Johann Großschädl, Léo Perrin, Aleksei Udovenko, Vesselin Velichkov, Qingju Wang
2020 IACR Transactions on Symmetric Cryptology  
These properties are allowed by our use of an ARX component (the Alzette S-box) as well as a carefully chosen number of rounds.  ...  We introduce the Sparkle family of permutations operating on 256, 384 and 512 bits.  ...  Acknowledgments Part of the work of Christof Beierle was performed while he was at the University of Luxembourg and funded by the SnT CryptoLux RG budget.  ... 
doi:10.13154/tosc.v2020.is1.208-261 dblp:journals/tosc/BeierleBSGPUVW20 fatcat:cqmv2ppxtvcczlupmduourbaye

Privacy-Preserving Social Search: Primitives and Realisation

SHANGQI LAI
2020
The system can process queries on the encrypted data, and it can be used to support real-world social network services.  ...  To further improve the security of the system, this thesis reviews the underlying cryptographic primitives used by the system and propose a new cryptographic primitive to address an attack with a moderate  ...  when sorting (i.e., the other additive share in LOCALSORT(x) and the masked score/mask in GLOBALSORT(x)).  ... 
doi:10.26180/5e9cd4b7483eb fatcat:youemnagozhtpfnwmodissse7i

Online) International Journal of Network Security is published both in traditional paper form (ISSN 1816-353X) and in Internet

Min-Shiang Hwang, Shu-Fen Chiou, Chia-Chun Wu, Cheng-Yi Yang, Ajith Abraham, Korea, Wael Adi, Iqbal Sheikh, Ahamed, Vijay Atluri, Mauro Barni, Andrew Blyth (+36 others)
2016 unpublished
Acknowledgments This research was supported in part by the National Nature Science Foundation of China (grant number: 61202228) and the College Natural Science Key Project of Anhui Province of China (grant  ...  Acknowledgments The research work was supported by New Century Excellent Talents Acknowledgments The work described in this paper was supported by the Key program of National Science Fund of Tianjin  ...  However, for the ARX based block cipher, it is inconvenient to estimate the upper bound of differential trails in traditional way since the size of differential table of ARX based block cipher can be considered  ... 
fatcat:xjcy7wc2hzbhzl3bfxwniqvjhy

PROCEEDINGS of the 2017 Symposium on Information Theory and Signal Processing in the Benelux

Richard Heusdens, Jos Weber
unpublished
Pollin's lab for taking care of us during our stay in Leuven. Acknowledgments The author likes to thank Andries Hekstra, Frans Willems and Semih Serbetli for stimulating discussions.  ...  We stated conditions that ensure stability of the scheme and existence of the infinitetime horizon solution.  ...  More Constructions for strong 8-bit S-boxes with efficient masking in hardware 1 Introduction As the only non-linear component in most block ciphers, S-boxes are one of the most important building blocks  ... 
fatcat:kn4dxrad7zf2reqejkwnvzepna

PRACTICAL CONFIDENTIALITY-PRESERVING DATA ANALYTICS IN UNTRUSTED CLOUDS

Savvas Savvides
2020
, or trusted hardware re-encryption based on Intel Software Guard eXtensions (SGX) to overcome the limitations of PHE.  ...  To address this stalemate, both software-based and hardware-based solutions have been proposed yet all have substantial limitations in terms of efficiency, expressiveness, and security.  ...  homomorphic operation to carry out the multiplication, as it saves the need to re-encrypt the product before performing the subsequent addition.  ... 
doi:10.25394/pgs.12645440.v1 fatcat:h6doy3t5qfe3lebjbof2z3zlay

Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing (Dagstuhl Seminar 14022) Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031) Planning with Epistemic Goals (Dagstuhl Seminar 14032)

Frederik Armknecht, Helena Handschuh, Tetsu Iwata, Bart, Bernd Bremer, Valerio Mohr, Martin Pascucci, Schulz, Erika Ábrahám, Alberto Avritzer, Anne Remke, William Sanders (+13 others)
2014 unpublished
In this talk we describe a tool for automatic search for differential trails in ARX (Addition, Rotation, XOR) ciphers.  ...  Finally, we present results from the application of the threshold search tool to four ARX-based ciphers: TEA, XTEA, RAIDEN and SPECK.  ...  Ethical considerations of using information obtained from online file sharing sites the case of the PirateBay.  ... 
fatcat:iqk466everfcdhf5guvz5ph2ee

Special Issue: Ant Colonies and Multi-Agent Systems Guest Editors: Nadia Nedjah Luiza de Macedo Mourelle

Anton Železnikar, Matjaž Gams, Jožef Stefan, Drago Torkar, Jožef Stefan, Tomaž Banovec, Ciril Baškovič, Andrej Jerman-Blažič, Jožkočuk Jožkočuk, Vladislav Rajkovič, Ivan Bratko, Marko Jagodič (+14 others)
unpublished
Hence we improve the efficiency of modular exponentiation. We compare the yielded addition sequences with those obtained using Brun's algorithm.  ...  other one is based on Polynomial Network (PN's).  ...  A dynamic selection of the XOR-mask position according to the nature of the program may bring additional improvement.  ... 
fatcat:u7nd4jn3jbbjrczrovyu24o4be