Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Mathematical Cryptology, Volume 13
Volume 13, Number 1, March 2019
- Thomas Wunderer:
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack. 1-26 - Abdelmalek Azizi
, Idriss Jerrari, Abdelkader Zekhnini, Mohammed Talbi:
Capitulation of the 2-ideal classes of type (2, 2, 2) of some quartic cyclic number fields. 27-46 - Nina Bindel, Johannes Buchmann, Florian Göpfert, Markus Schmidt:
Estimation of the hardness of the learning with errors problem with a restricted number of samples. 47-67
Volume 13, Number 2, June 2019
- Shizuo Kaji, Toshiaki Maeno, Koji Nuida, Yasuhide Numata:
Polynomial expressions of p-ary auction functions. 69-80 - Julien Lavauzelle, Françoise Levy-dit-Vehel:
Generic constructions of PoRs from codes and instantiations. 81-106 - Károly Harsányi, Péter Ligeti:
Exact information ratios for secret sharing on small graphs with girth at least 5. 107-116 - Tarun Kumar Bansal, Xavier Boyen, Josef Pieprzyk:
Signcryption schemes with insider security in an ideal permutation model. 117-150
Volume 13, Numbers 3-4, October 2019
- Jean-François Biasse, Fang Song:
On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in. 151-168 - Arnaud Sipasseuth, Thomas Plantard, Willy Susilo:
Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices. 169-196 - Mridul Nandi, Tapas Pandit:
Predicate signatures from pair encodings via dual system proof technique. 197-228 - Stavros Kousidis, Andreas Wiemers:
On the first fall degree of summation polynomials. 229-237
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-19 21:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
