Suchergebnisse - Symbolic Computing in Algebraic Geometry and Cryptography

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

“… Constraint satisfaction problems for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might …”
Volltext

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

“… 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 …”
Volltext

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

“… We show an effective cut-free variant of Glivenko's theorem extended to formulas with weak quantifiers (those without eigenvariable conditions): "There is an …”
Volltext

Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography: Advanced Theory and Practice for Cryptography and Future Security von VASYLTSOV, Ihor, SALDAMLI, Gokay

Volltext

Enhanced secure anonymous authentication scheme for roaming service in global mobility networks: Advanced Theory and Practice for Cryptography and Future Security von MUN, Hyeran, HAN, Kyusuk, YAN SUN LEE, CHAN YEOB YEUN, HYO HYUN CHOI

Volltext

Adaptively secure identity-based broadcast encryption with constant size private keys and ciphertexts from the subgroups: Advanced Theory and Practice for Cryptography and Future Security von LEYOU ZHANG, YUPU HU, QING WU

Volltext

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

“… Cryptographic systems based on elliptic curves have been introduced as an alternative to conventional public key cryptosystems. The security of both kinds of …”
Volltext

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

“… In this paper, we describe an algorithm for computing the order of the Jacobian varieties of Picard curves over finite fields …”
Volltext

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

“… 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 …”
Volltext

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

“… 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 …”
Volltext

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

“… Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain …”
Volltext

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

“… The dawn of the disruptive quantum computing scenario marks a serious threat to the existence of traditional cryptosystems …”
Volltext