40 Hits in 0.47 sec

News from Latin America

Alfredo Viola
2012 Bulletin of the European Association for Theoretical Computer Science  
In this issue I present the 1st Latin American Theoretical Informatics School and the call for papers of Latincrypt 2012.  ...  Call for papers: Latincrypt 2012 Latincrypt 2012 is the Second International Conference on Cryptology and Information Security in Latin America, and will take place from October 7th to October 10th 2012  ...  Original papers on all technical aspects of cryptology are solicited for submission to Latincrypt 2012.  ... 
dblp:journals/eatcs/Viola12 fatcat:epdwrbgc5bbmnekjluzhixe4tm

Fault Analysis of Infective AES Computations

Alberto Battistello, Christophe Giraud
2013 2013 Workshop on Fault Diagnosis and Tolerance in Cryptography  
2012 Countermeasure • Conclusion Overview • Introduction • Attacks •FDTC 2012 Countermeasure •LatinCrypt 2012 Countermeasure • Conclusion Dummy A Useful Remark Redundant Effective Dummy  ...  , Otto, Seifert] 2003 [Qin, Li, Kong] 2008 • [• Symmetric: • [Lomné, Roche, Thillard] 2012 • [Gierlichs, Schmidt, Tunstall] 2012 Overview • Introduction • Attacks •FDTC 2012 Countermeasure •LatinCrypt  ... 
doi:10.1109/fdtc.2013.12 dblp:conf/fdtc/BattistelloG13 fatcat:fpxicvqhlnf6dhbi6vk4dmy23m

Defeating with Fault Injection a Combined Attack Resistant Exponentiation [chapter]

Benoit Feix, Alexandre Venelli
2013 Lecture Notes in Computer Science  
In that vein Schmidt et al. published at Latincrypt 2010 an efficient exponentiation algorithm supposedly resistant against this combined attack category.  ... 
doi:10.1007/978-3-642-40026-1_3 fatcat:ym2dqyft5nfavoareed6pk6bt4

Secure Number Theoretic Transform and Speed Record for Ring-LWE Encryption on Embedded Processors [chapter]

Hwajeong Seo, Zhe Liu, Taehwan Park, Hyeokchan Kwon, Sokjoon Lee, Howon Kim
2018 Lecture Notes in Computer Science  
In LATINCRYPT'15, Pöppelmann et al. studied and compared implementations of Ring-LWE encryption and BLISS on an 8-bit Atmel ATxmega128 microcontroller [16] .  ...  Previous Implementations of NTT In LATINCRYPT'15, Pöppelmann et al. optimized the NTT operation by merging inverse NTT and multiplication by powers of ψ −1 .  ... 
doi:10.1007/978-3-319-78556-1_10 fatcat:sqzb33a3grfmnf7mxt6zcyovfu

Destroying Fault Invariant with Randomization [chapter]

Harshal Tupsamudre, Shikha Bisht, Debdeep Mukhopadhyay
2014 Lecture Notes in Computer Science  
One such countermeasure for AES was proposed in LatinCrypt 2012, which masks the faulty output with secret values.  ...  We bring out the major weakness in the infection mechanism of the LatinCrypt 2012 countermeasure which not only makes the attack of FDTC 2013 much more flexible, but also enables us to break this seemingly  ...  In LatinCrypt 2012, Gierlichs [10] proposed an infection countermeasure for AES which infects the faulty computation with random values.  ... 
doi:10.1007/978-3-662-44709-3_6 fatcat:tpmbrtp7evcdviigtv7pze3vaa

Fast Number Theoretic Transform for Ring-LWE on 8-bit AVR Embedded Processor

Hwajeong Seo, Hyeokdong Kwon, Yongbeen Kwon, Kyungho Kim, Seungju Choi, Hyunjun Kim, Kyoungbae Jang
2020 Sensors  
In LATINCRYPT'15, Pöppelmann et al. introduced implementations of Ring-LWE encryption and BLISS on low-end 8-bit AVR ATxmega128 microcontrollers [27] .  ...  In LATINCRYPT'15, Pöppelmann et al. introduced implementations of Ring-LWE encryption and BLISS on low-end 8-bit AVR ATxmega128 microcontrollers [27] .  ... 
doi:10.3390/s20072039 pmid:32260497 fatcat:lhyenpnuyre75jthlklvyumyr4

Cryptanalysis of the Hidden Matrix Cryptosystem [chapter]

Jean-Charles Faugère, Antoine Joux, Ludovic Perret, Joana Treger
2010 Lecture Notes in Computer Science  
.): LATINCRYPT 2010, LNCS 6212, pp. 241-254, 2010. c Springer-Verlag Berlin Heidelberg 2010 i.e., the F4 algorithm which uses the F5 criteria [8] .  ... 
doi:10.1007/978-3-642-14712-8_15 fatcat:gtxwk5rcgnbsfjkn6uoplmhrfu

Cryptanalysis of the Full Spritz Stream Cipher [chapter]

Subhadeep Banik, Takanori Isobe
2016 Lecture Notes in Computer Science  
We determine the probability of encountering such a state, and demonstrate a state recovery algorithm that betters the 2 1400 step algorithm of Ankele et al. at Latincrypt 2015.  ... 
doi:10.1007/978-3-662-52993-5_4 fatcat:ovvrjj232nfgrkuahuhnvhea7u

Another Perspective on Automatic Construction of Integral Distinguishers for ARX Ciphers

Kai Zhang, Xuejia Lai
2022 Symmetry  
At Latincrypt 2021, Ghosh and Dunkelman derived a more compact model for SAT (Boolean Satisfiability Problem)/CP (Constraint Programming) and realized the automatic search for bit-based division property  ... 
doi:10.3390/sym14030461 fatcat:rmiwf6356jbixhuhx7ls7zjz4i

Block Cipher Speed and Energy Efficiency Records on the MSP430: System Design Trade-Offs for 16-Bit Embedded Applications [chapter]

Benjamin Buhrow, Paul Riemer, Mike Shea, Barry Gilbert, Erik Daniel
2015 Lecture Notes in Computer Science  
resources are very constrained relative to general purpose 32-or 64bit processors but they are abundant relative to devices like RFID tags or smart The final publication will be available at Springer via the Latincrypt  ... 
doi:10.1007/978-3-319-16295-9_6 fatcat:xrkczjckpfhetmyq6ddtccejsu

Tuning GaussSieve for Speed [chapter]

Robert Fitzpatrick, Christian Bischof, Johannes Buchmann, Özgür Dagdelen, Florian Göpfert, Artur Mariano, Bo-Yin Yang
2015 Lecture Notes in Computer Science  
Acknowledgments The authors would like to thank the anonymous reviewers of Latincrypt 2014 for their helpful comments and suggestions which substantially improved this paper.  ... 
doi:10.1007/978-3-319-16295-9_16 fatcat:wv3eqv7t3rfpnnp5d2y33ehcqy

Lyra2: Password Hashing Scheme with improved security against time-memory trade-offs

Ewerton R. Andrade, Marcos A. Simplicio Junior
2017 Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC)   unpublished
. • Extended abstract: in (Andrade and Simplicio Jr 2014b), we present the initial ideas and results of Lyra2; in (Andrade and Simplicio Jr 2014a), we gave an oral presentation at LatinCrypt'14 with some  ... 
doi:10.5753/ctd.2017.3455 fatcat:dh5fhdmvzjaqvpsxd6nnmk4e3a

Improved Lattice-Based Threshold Ring Signature Scheme [chapter]

Slim Bettaieb, Julien Schrek
2013 Lecture Notes in Computer Science  
We present in this paper an improvement of the lattice-based threshold ring signature proposed by Cayrel, Lindner, Rückert and Silva (CLRS) [LATINCRYPT '10].  ... 
doi:10.1007/978-3-642-38616-9_3 fatcat:73g4ekox2nhf7kwlpdm7yz4hwq

Indifferentiable Hashing to Barreto–Naehrig Curves [chapter]

Pierre-Alain Fouque, Mehdi Tibouchi
2012 Lecture Notes in Computer Science  
Acknowledgments We would like to thank Paulo Barreto for suggesting this problem, Sorina Ionica and himself for fruitful discussions, and the reviewers of LATINCRYPT 2012 for numerous useful comments.  ... 
doi:10.1007/978-3-642-33481-8_1 fatcat:5spghveipbeiher5ineoggxgbu

The Simplest Protocol for Oblivious Transfer [chapter]

Tung Chou, Claudio Orlandi
2015 Lecture Notes in Computer Science  
versions of this paper; Yehuda Lindell for useful comments on our proof of security; Peter Schwabe for various helps on implementation, including providing low-level code for field arithmetic; the anonymous LATINCRYPT  ... 
doi:10.1007/978-3-319-22174-8_3 fatcat:wqaiqviqfbctbfxp46ptolsjra
« Previous Showing results 1 — 15 out of 40 results