UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Recent progress on the elliptic curve discrete logarithm problem

Designs, codes, and cryptography, 2016-01, Vol.78 (1), p.51-72

2016

Volltextzugriff (PDF)

Computational problems in supersingular elliptic curve isogenies

Quantum information processing, 2018-10, Vol.17 (10), p.1-22, Article 265

2018

Volltextzugriff (PDF)

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems

Journal of cryptology, 2020, Vol.33 (1), p.130-175

2020

Volltextzugriff (PDF)

Proving knowledge of isogenies: a survey

Designs, codes, and cryptography, 2023-11, Vol.91 (11), p.3425-3456

2023

Volltextzugriff (PDF)

Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem

Journal of cryptology, 2019-01, Vol.32 (1), p.35-83

2019

Volltextzugriff (PDF)

Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves

Journal of cryptology, 2011-07, Vol.24 (3), p.446-469

2011

Volltextzugriff (PDF)

Failing to Hash Into Supersingular Isogeny Graphs

Computer journal, 2024-08, Vol.67 (8), p.2702-2719

2024

Volltextzugriff (PDF)

A non-uniform birthday problem with applications to discrete logarithms

Discrete Applied Mathematics, 2012-07, Vol.160 (10-11), p.1547-1560

2012

Volltextzugriff (PDF)

Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm

Advances in mathematics of communications, 2017, Vol.11 (3), p.453-469

2017

Volltextzugriff (PDF)

The Kelmscott/Goudy Printing Press: Printing History as a Living History

RBM : a journal of rare books, manuscripts, and cultural heritage, 2016-04, Vol.17 (1), p.15-16

Galbraith, Steven K.

2016

Volltextzugriff (PDF)

Efficient pairing computation on supersingular Abelian varieties

Designs, codes, and cryptography, 2007-03, Vol.42 (3), p.239-271

2007

Volltextzugriff (PDF)

Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7 (2013), 31–42]

Journal of mathematical cryptology, 2014-02, Vol.8 (1), p.93-93

2014

Volltextzugriff (PDF)

Algorithms for the approximate common divisor problem

LMS journal of computation and mathematics, 2016, Vol.19 (A), p.58-72

2016

Volltextzugriff (PDF)

Obfuscation of evasive algebraic set membership

Advances in mathematics of communications, 2024-04

2024

Volltextzugriff (PDF)

Computing discrete logarithms in an interval

Mathematics of computation, 2013-04, Vol.82 (282), p.1181-1195

2013

Volltextzugriff (PDF)

Pairings for cryptographers

Discrete Applied Mathematics, 2008-09, Vol.156 (16), p.3113-3121

2008

Volltextzugriff (PDF)

Self-pairings on hyperelliptic curves

Journal of mathematical cryptology, 2013-07, Vol.7 (1), p.31-42

2013

Volltextzugriff (PDF)

Sampling from discrete Gaussians for lattice-based cryptography on a constrained device

Applicable algebra in engineering, communication and computing, 2014-06, Vol.25 (3), p.159-180

2014

Volltextzugriff (PDF)

“English” Black-Letter Type and Spenser’s Shepheardes Calender

Spenser studies, 2008-01, Vol.23, p.13-40

Galbraith, Steven K.

2008

Volltextzugriff (PDF)

Elliptic curve Paillier schemes

Journal of cryptology, 2002-01, Vol.15 (2), p.129-138

GALBRAITH, Steven D

2002

Volltextzugriff (PDF)

Distortion maps for supersingular genus two curves

Journal of mathematical cryptology, 2009-05, Vol.3 (1), p.1-18

2009

Volltextzugriff (PDF)

Guest editorial: Special issue on Mathematics of Zero-Knowledge

Designs, codes, and cryptography, 2023-11, Vol.91 (11), p.3331-3332

2023

Volltextzugriff (PDF)

Improved algorithm for the isogeny problem for ordinary elliptic curves

Applicable algebra in engineering, communication and computing, 2013-06, Vol.24 (2), p.107-131

2013

Volltextzugriff (PDF)

Hidden Slavic and Eastern European Materials at the Folger Shakespeare Library

Slavic & East European information resources, 2010-09, Vol.11 (2-3), p.59-63

2010

Volltextzugriff (PDF)

Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$ F p

Designs, codes, and cryptography, 2016-02, Vol.78 (2), p.425-440

2016

Volltextzugriff (PDF)

1 – 25 von 135

Menü

Weitere Dienste

Einstellungen

Recent progress on the elliptic curve discrete logarithm problem

Computational problems in supersingular elliptic curve isogenies

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems

Proving knowledge of isogenies: a survey

Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem

Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves

Failing to Hash Into Supersingular Isogeny Graphs

A non-uniform birthday problem with applications to discrete logarithms

Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm

The Kelmscott/Goudy Printing Press: Printing History as a Living History

Efficient pairing computation on supersingular Abelian varieties

Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7 (2013), 31–42]

Algorithms for the approximate common divisor problem

Obfuscation of evasive algebraic set membership

Computing discrete logarithms in an interval

Pairings for cryptographers

Self-pairings on hyperelliptic curves

Sampling from discrete Gaussians for lattice-based cryptography on a constrained device

“English” Black-Letter Type and Spenser’s Shepheardes Calender

Elliptic curve Paillier schemes

Distortion maps for supersingular genus two curves

Guest editorial: Special issue on Mathematics of Zero-Knowledge

Improved algorithm for the isogeny problem for ordinary elliptic curves

Hidden Slavic and Eastern European Materials at the Folger Shakespeare Library

Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$ F p

Aktive Filter

Suchergebnisse filtern