Výsledky vyhľadávania - Symbolic Computing in Algebraic Geometry and Cryptography

  • Zobrazené výsledky 1 - 12 z 12
Upresniť hľadanie
  1. 1

    Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property Autor Bodirsky, Manuel, Bodor, Bertalan

    Vydavateľské údaje: IEEE 29.06.2021
    “…Constraint satisfaction problems for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might…”
    Získať plný text
    Konferenčný príspevok..
  2. 2

    A new two-round certificateless authenticated key agreement protocol without bilinear pairings Autor He, Debiao, Chen, Yitao, Chen, Jianhua, Zhang, Rui, Han, Weiwei

    ISSN: 0895-7177, 1872-9479
    Vydavateľské údaje: Kidlington Elsevier Ltd 01.12.2011
    Vydané v Mathematical and computer modelling (01.12.2011)
    “…Certificateless public key cryptography (CLPKC), which can simplify the complex certificate management in the traditional public key cryptography and resolve the key escrow problem in identity-based cryptography, has been widely studied…”
    Získať plný text
    Journal Article
  3. 3

    A Note on the Complexity of Classical and Intuitionistic Proofs Autor Baaz, Matthias, Leitsch, Alexander, Reis, Giselle

    ISSN: 1043-6871
    Vydavateľské údaje: IEEE 01.07.2015
    “…We show an effective cut-free variant of Glivenko's theorem extended to formulas with weak quantifiers (those without eigenvariable conditions): "There is an…”
    Získať plný text
    Konferenčný príspevok..
  4. 4
  5. 5
  6. 6
  7. 7

    Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography Autor Laskari, E.C., Meletiou, G.C., Stamatiou, Y.C., Tasoulis, D.K., Vrahatis, M.N.

    ISSN: 0895-7177, 1872-9479
    Vydavateľské údaje: Oxford Elsevier Ltd 01.07.2007
    Vydané v Mathematical and computer modelling (01.07.2007)
    “…Cryptographic systems based on elliptic curves have been introduced as an alternative to conventional public key cryptosystems. The security of both kinds of…”
    Získať plný text
    Journal Article Konferenčný príspevok..
  8. 8

    Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields Autor Sohn, Gyoyong, Kim, Hoil

    ISSN: 0895-7177, 1872-9479
    Vydavateľské údaje: Kidlington Elsevier Ltd 2009
    “…In this paper, we describe an algorithm for computing the order of the Jacobian varieties of Picard curves over finite fields…”
    Získať plný text
    Journal Article
  9. 9

    Discrete Gaussian measures and new bounds of the smoothing parameter for lattices Autor Zheng, Zhongxiang, Zhao, Chunhuan, Xu, Guangwu

    ISSN: 0938-1279, 1432-0622
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021
    “…In this paper, we start with a discussion of discrete Gaussian measures on lattices. Several results of Banaszczyk are analyzed, a simple form of uncertainty…”
    Získať plný text
    Journal Article
  10. 10

    A new construction of two-, three- and few-weight codes via our GU codes and their applications Autor Eddie, Arrieta A, Janwa, Heeralal

    ISSN: 0938-1279, 1432-0622
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2022
    “…Linear codes with few weights have applications in cryptography, association schemes, designs, strongly regular graphs, finite group theory, finite geometries, and secret sharing schemes, among other disciplines…”
    Získať plný text
    Journal Article
  11. 11

    Solving sparse polynomial systems using Groebner bases and resultants Autor Bender, Matías R

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 19.05.2022
    Vydané v arXiv.org (19.05.2022)
    “… Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain…”
    Získať plný text
    Paper
  12. 12

    Quantum-Resistant Key Generation Using QBLH Geometric Structures and Tetrahedral Trinary Encoding: A Novel Approach in Post-Quantum Cryptography Autor Andris lukss

    ISSN: 2581-9615, 2581-9615
    Vydavateľské údaje: 30.08.2025
    “…The dawn of the disruptive quantum computing scenario marks a serious threat to the existence of traditional cryptosystems…”
    Získať plný text
    Journal Article