000			03456nam a22003495i 4500
001			316602
003			MX-SnUAN
005			20160429160946.0
007			cr nn 008mamaa
008			160108s2014 gw | s |||| 0|eng d
020			_a9783319067346 _9978-3-319-06734-6
035			_avtls000417199
039		9	_y201601081129 _zstaff
050		4	_aQA76.9.A25
245	1	0	_aProgress in cryptology – africacrypt 2014 : _b7th international conference on cryptology in africa, marrakesh, morocco, may 28-30, 2014. Proceedings / _cedited by David Pointcheval, Damien Vergnaud.
264		1	_aCham : _bSpringer International Publishing : _bSpringer, _c2014.
300			_axiv, 476 páginas : _b92 ilustraciones
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v8469
500			_aSpringer eBooks
505	0		_aNew Results for Rank-Based Cryptography -- Public-Key Cryptography -- Proxy Re-Encryption Scheme Supporting a Selection of Delegatees -- Trapdoor Privacy in Asymmetric Searchable Encryption Schemes -- Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited -- Hash Functions -- Differential Biases in Reduced-Round Keccak -- Practical Distinguishers against 6-Round Keccak-f Exploiting Self-Symmetry -- Preimage Attacks on Reduced-Round Stribog -- Secret-Key Cryptanalysis -- Breaking the IOC Authenticated Encryption Mode -- New Treatment of the BSW Sampling and Its Applications to Stream Ciphers -- Multidimensional Zero-Correlation Linear Cryptanalysis of E2 -- Public-Key Cryptanalysis and Number Theory Further Improvement of Factoring RSA Moduli with Implicit Hint -- New Attacks on the RSA Cryptosystem -- Formulae for Computation of Tate Pairing on Hyperelliptic Curve Using Hyperelliptic Nets -- Hardware Implementation -- New Speed Records for Montgomery Modular Multiplication on 8-bit AVR Microcontrollers -- Minimizing S-Boxes in Hardware by Utilizing Linear Transformations -- Efficient Masked S-Boxes Processing – A Step Forward -- A More Efficient AES Threshold Implementation -- Protocols -- Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum -- Position-Based Cryptography from Noisy Channels -- Lattice-Based Cryptography -- A Comparison of the Homomorphic Encryption Schemes FV and YASHE -- Towards Lattice Based Aggregate Signatures -- Public-Key Cryptography -- A Second Look at Fischlin’s Transformation -- Anonymous IBE from Quadratic Residuosity with Improved Performance -- Expressive Attribute Based Signcryption with Constant-Size Ciphertext -- Secret-Key Cryptography.-DRECON: DPA Resistant Encryption by Construction -- Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions -- Universal Hash-Function Families: From Hashing to Authentication.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aPointcheval, David, _eeditor. _9330419
700	1		_aVergnaud, Damien, _eeditor. _9336632
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783319067339
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-06734-6 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c316602 _d316602