Las siguientes son reseñas solicitadas por “Zentralblatt MATH”. En cada una aparece el identificador de la reseña, de acuerdo con el catálogo de “Zentralblatt MATH” (European Mathematical Society, FIZ Karlsruhe, Heidelberg Academy of Sciences), la fecha de la reseña, la referencia del texto reseñado y el URL donde se puede consultar la reseña.
1.
Brieulle, Ludovic; De Feo, Luca; Doliskani, Javad; Flori, Jean Pierre; Schost, Éric
Computing isomorphisms and embeddings of finite fields; ACM Commun. Comput. Algebra 52, No. 4, 117-119 (2018)
https://zbmath.org/07659252
2.
Zhang, Liyu; Quweider, Mahmoud; Khan, Fitra; Lei, Hansheng
Splitting NP-complete sets infinitely; Inf. Process. Lett. 186, Article ID 106472, 8 p. (2024)
https://zbmath.org/07861403
3.
Moldovyan, Alexandr A.; Complete signature randomization in an algebraic cryptoscheme with a hidden group; Quasigroups Relat. Syst. 32, 95-108 (2024)
https://zbmath.org/07867922
4.
Bartoli, Daniele; Bonini, Matteo; Timpanella, Marco; Minimal codewords in norm-trace codes; Aequationes Math. 98, 333-346 (2024)
https://zbmath.org/07811722
5.
de Melo-Hernández, Fernanda D.; Hernández-Melo, César A.; Tapia-Recillas, Horacio
LCD codes arising from wavelets; São Paulo J. Math. Sci. 17, 300-305 (2023)
https://zbmath.org/07713851
6.
Kim, Hyoseung; Sanders, Olivier; Abdalla, Michel; Park, Jong Hwan
Practical dynamic group signatures without knowledge extractors
Des. Codes Cryptography 91, No. 3, 853-893 (2023).
https://zbmath.org/1515.94101
7. Mashahdi, Samaneh; Bagherpour, Bagher; Zaghian, Ali
A non-interactive -publicly verifiable multi-secret sharing scheme
Des. Codes Cryptography 90, 1761-1782 (2022).
https://zbmath.org/?q=07567894
8. Budroni, Alessandro; Pintore, Federico
Efficient hash maps to on BLS curves
Appl. Algebra Eng. Commun. Comput. 33, 261-281 (2022).
https://zbmath.org/?q=07530649
9. Biswas, Aniruddha; Sarkar, Palash Separation results for Boolean function classes Cryptogr. Commun. 13, 451-458 (2021). https://zbmath.org/?q=07500434
10. Carlet, Claude; Mesnager, Sihem
On those multiplicative subgroups of
which are Sidon sets and/or sum-free sets
J. Algebr. Comb. 55, 43-59 (2022).
https://zbmath.org/?q=07490048
11. Zhang, Jiang; Yu, Yu; Fan, Shuqin; Zhang, Zhenfeng; Yang, Kang Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes. Kiayias, Aggelos (ed.) et al., Public-key cryptography ? PKC 2020. 23rd IACR international conference on practice and theory of public-key cryptography, Edinburgh, UK, May 4?7, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12111, 37-65 (2020) https://zbmath.org/?q=07436967
12. Joye, Marc Protecting ECC against fault attacks: the ring extension method revisited J. Math. Cryptol. 14, 254-267 (2020). https://zbmath.org/?q=07342051
13. Zbl 07056604
Xie, Huiqin; Yang, Li
Using Bernstein-Vazirani algorithm to attack block ciphers
Des. Codes Cryptography 87, No. 5, 1161-1182 (2019).
https://zbmath.org/?q=07056604
14. Zbl 07136847
Ding, Jintai; Deaton, Joshua; Schmidt, Kurt
Giophantus distinguishing attack is a low dimensional learning with errors
Adv. Math. Commun. 14, No. 1, 171-175 (2020).
https://zbmath.org/?q=07136847
15. Zbl 1408.68057
Derler, David; Slamanig, Daniel
Practical witness encryption foralgebraiclanguagesor how to encrypt under Groth- Sahai proofs
Des. Codes Cryptography 86, No. 11, 2525-2547 (2018).
https://zbmath.org/?q=1408.68057
16. Zbl 06864547
Rösnick-Neugebauer, Carsten
Closed sets and operators thereon: representations, computability and complexity
Log. Methods Comput. Sci. 14, No. 2, Paper No. 1, 41 p. (2018).
https://zbmath.org/?q=06864547
17. Zbl pre06894023
Ernvall-Hytönen, Anne-Maria; Vesalainen, Esa V.
On the secrecy gain of -modular lattices
SIAM J. Discrete Math. 32, No. 2, 1441-1457 (2018).
https://zbmath.org/?q=an:06894023
18. Zbl 1390.94001
El Aimani, Laila
Verifiable composition of signature and encryption. A comprehensive study of the design paradigms
Cham: Springer (ISBN 978-3-319-68111-5/hbk; 978-3-319-68112-2/ebook). xx, 145 p. (2017).
https://zbmath.org/?q=an:1390.94001
19. Zbl 1270.94001
Batten, Lynn Margaret
Public key cryptography. Applications and attacks
IEEE Press Series on Information and Communication Networks Security. Hoboken, NJ: John Wiley & Sons; Piscataway, NJ: IEEE Press (ISBN 978-1-118-31712-9/hbk; 978-1-118-48226-1/ebook). xvii, 201 p. EUR 64.20; sterling 53.50/hbk (2013).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1270.94001
20. Zbl 1267.94043
Bracken, Carl; Tan, Chik How; Tan, Yin
Binomial differentially 4 uniform permutations with high nonlinearity
Finite Fields Appl. 18, No. 3, 537-546 (2012).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1267.94043
21. Zbl 1262.14025
Chinburg, Ted; Zhang, Ying
Every binary self-dual code arises from Hilbert symbols
Homology Homotopy Appl. 14, No. 2, 189-196 (2012).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1262.14025
22. Zbl 1262.68041
Kasher, Roy; Kempe, Julia
Two-source extractors secure against quantum adversaries
Theory Comput. 8, Paper No. 21, 461-486, electronic only (2012).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1262.68041
23. Zbl 1248.94006
Myasnikov, Alexei; Shpilrain, Vladimir; Ushakov, Alexander
Non-commutative cryptography and complexity of group-theoretic problems. With an appendix by Natalia Mosina
Mathematical Surveys and Monographs 177. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-5360-3/hbk). xiv, 385 p. $ 105.00 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1248.94006
24. Zbl 1248.03060
Buss, Sam; Chen, Yijia; Flum, Jörg; Friedman, Sy-David; Müller, Moritz
Strong isomorphism reductions in complexity theory
J. Symb. Log. 76, No. 4, 1381-1402 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1248.03060
25. Zbl 1228.94030, 2011-11-24,
Yue, Zhihong; Xu, Maozhi.
Hierarchical management scheme by local fields. (English).
Acta Math. Sin., Engl. Ser. 27, No. 1, 155-168 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:05912876
26. Zbl 1230.68077, 2011-11-09,
Bonfante, G.; Marion, J.-Y.; Moyen, J.-Y.
Quasi-interpretations a way to control resources.
Theor. Comput. Sci. 412, No. 25, 2776-2796 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:05904446
27. Zbl 1229.94041, 2011-11-07,
Carlet, Claude.
Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions.
Des. Codes Cryptography 59, No. 1-3, 89-109 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:05876227
28. Zbl 1218.14017, 2011-08-05,
Joshua, Roy; Akhtar, Reza.
Toric residue codes. I.
Finite Fields Appl. 17, No. 1, 15-50 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1218.14017
29. Zbl 1228.11002, 2011-06-24,
Meunier, Pierre.
Arithmétique modulaire et cryptologie (Modular arithmetic and cryptology).
Toulouse: Cépaduès-Éditions (ISBN 978-2-85428-954-1/pbk). 179 p. EUR 20.00 (2010).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:05837622
30. Zbl 1209.13037, 2011-03-23,
Rentería-Márquez, Carlos; Simis, Aron; Villarreal, Rafael H.
Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields.
Finite Fields Appl. 17, No. 1, 81-104 (2011).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1209.13037
31. Zbl 1209.94054, 2011-03-21,
Schinzel, Andrzej; Spieź, Stanisław; Urbanowicz, Jerzy.
Admissible tracks in Shamir's scheme
Finite Fields Appl. 16, No. 6, 449-462 (2010).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1209.94054
32. Zbl 1175.11028, 2010-11-18,
Satoh, Takakazu
Closed formulae for the Weil pairing inversion
Finite Fields Appl. 14, No. 3, 743-765 (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1175.11028
33. Zbl 1201.94096, 2010-11-18,
Shi, Hongsong; Jiang, Shaoquan; Qin, Zhiguang
More efficient DDH pseudorandom generators
Des. Codes Cryptography 55, No. 1, 45-64 (2010).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:pre05686955
34. Zbl 1200.94043
Farashahi, Reza R.; Shparlinski, Igor E.; Voloch, José Felipe
On hashing into elliptic curves
J. Math. Cryptol. 3, No. 4, 353-360 (2009).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:pre05704450
35. Zbl 1202.68164, 2010-11-17,
Beiter, Bernd Michael
Secret sharing schemes on general access structures.
Berichte aus der Informatik. Aachen: Shaker Verlag; Tübingen: Univ. Tübingen, Fakultät für Informations- und Kognitionswissenschaften (Diss.) (ISBN 978-3-8322-7866-3/pbk). xiii, 187 p. EUR 48.80 (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:pre05651257
36. Zbl 1188.68149, 2010-05-17,
Sherstov, Alexander A.
Separating AC from depth-2 majority circuits. (English)
SIAM J. Comput. 38, No. 6, 2113-2129 (2009). ISSN 0097-5397; ISSN 1095-7111.
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1188.68149
37. Zbl 1185.14020, , 2010-04-17,
Romanczuk, Urszula
A new encryption and signing algorithm. (English)
[J] Albanian J. Math. 2, No. 3, 215-220, electronic only (2008). ISSN 1930-1235.
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1185.14020
38. Zbl 1174.03017, 2009-10-23, Mycka, Jerzy, A simple observation regarding iterations of finite-valued polynomial-time functions, Rep. Math. Logic 44, 19-29 (2009).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1174.03017
39. Zbl 1171.11062, 2009-08-21, Charpin, Pascale; Kyureghyan, Gohar M., Cubic monomial bent functions: a subclass of , SIAM J. Discrete Math. 22, No. 2, 650-665 (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1171.11062
40. Zbl 1163.11027, 2009-06-04, Hartung, Rupert J.; Schnorr, Claus-Peter, Identification and signatures based on NP-hard problems of indefinite quadratic forms, J. Math. Cryptol. 2, No. 4, 327-341 (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1163.11027
41. Zbl 1160.03020, 2009-04-21, Poizat, Bruno, On the search for the definition of the space complexity for the calculation of polynomials using Valiant's method, J. Symb. Log. 73, No. 4, 1179-1201 (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1160.03020
42. Zbl 1155.03023, 2009-02-17, Montoya, Juan Andrés
On parameterized counting, Freiburg im Breisgau: Univ. Freiburg, Fakultät für Mathematik und Physik (Dissertation). 111 p. (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1155.03023
43. Zbl 1154.11045, 2009-02-17, Sathyanarayana, S.V.; Ashwatha Kumar, M.; Hari Bhat, K.N., Generation of pseudorandom sequence over elliptic curve group and their properties, J. Discrete Math. Sci. Cryptography 10, No. 6, 731-747 (2007).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1154.11045
44. Zbl 1154.68056, 2009-01-22, Goldreich, Oded, Computational complexity. A conceptual perspective. Cambridge: Cambridge University Press (ISBN 978-0-521-88473-0/hbk). xxiv, 606 p. 40.00; $ 70.00 (2008).
http://www.zentralblatt-math.org/zmath/en/search/?q=an:1154.68056
45. Zbl 1154.94008, 2008-10-17, Boyd, Colin, Applications of elliptic curve pairings in cryptography
Dorfer, G. (ed.) et al., Proceedings of the 73rd workshop on general algebra “73. Arbeitstagung Allgemeine Algebra", 22nd conference of young algebraists, Alps-Adriatic-University of Klagenfurt, Austria, February 1–4, 2007. Klagenfurt: Verlag Johannes Heyn (ISBN 978-3-7084-0303-8/pbk). Contributions to General Algebra 18, 5-16 (2008).
http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:pre05301966&format=complete
46. Zbl 1145.94022, 2008-10-16, Park, Kyoung Ho; Uehara, Tsuyoshi, Construction of evaluation codes from Hermitian curves, Kyushu J. Math. 61, No. 2, 415-429 (2007).
http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:pre05247346&format=complete
47. Zbl 1143.94001, 2008-07-29, Katz, Jonathan; Lindell, Yehuda, Introduction to modern cryptography.
Chapman & Hall/CRC Cryptography and Network Security. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-58488-551-1/hbk). xviii, 534 p. $ 79.95 (2008).
http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:1143.94001&format=complete
48. Zbl 1143.94016, 2008-06-24, Huang, Hui-Feng; Chang, Chin-Chen, A new -out-
oblivious transfer with low bandwidth, Appl. Math. Sci., Ruse 1, No. 5-8, 311-320 (2007).
http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:1143.94016&format=complete
49. Zbl 1138.03034, 2008-06-24, Chen, Yijia; Flum, Jörg, The parameterized complexity of maximality and minimality problems, Ann. Pure Appl. Logic 151, No. 1, 22-61 (2008).
http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:1138.03034&format=complete
50. Zbl 1133.94017, 2008-02-12, Tso, Raylin; Miao, Ying; Okamoto, Eiji, On algorithms for searching a consistent set of shares in a threshold scheme and the related covering problem, J. Comb. Math. Comb. Comput. 60, 47-63 (2007).
http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:1133.94017&format=complete
Otras reseñas son las siguientes:
51. G. Morales-Luna, “Variedades diferenciales: O. A. Biberstein”, Carta Informativa, Sociedad Matemática Mexicana. No. 51, pp: 5-6. Enero 2007.
52. G. Morales-Luna, “Geometría Diferencial: O. A. Biberstein”, Carta Informativa, Sociedad Matemática Mexicana. No. 48, pp: 5-6. Octubre 2006.
53. Reseña del libro Foundations of Inductive Logic Programming, S. H. N. Cheng , R. de Wolf, (Erasmus University of Rotterdam), Lecture Notes in Artificial Intelligence 1228 (Subseries of LNCS), Springer-Verlag, 1997, ISBN 3-540-62927-0. “Computación y sistemas: Revista Iberoamericana de Computación”, ISSN 1405-5546, Vol: II, No. 1.
54. Reseña del libro Un curso de lógica matemática, de Carlos Videla, editado en la serie “Aportaciones matemáticas” de la Sociedad Matemática Mexicana. La reseña se publicó en el “Miscelánea matemática”.