[PDF][PDF] Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves.
A Stolbunov - Adv. Math. Commun., 2010 - pdfs.semanticscholar.org
We propose a public-key encryption scheme and key agreement protocols based on a
group action on a set. We construct an implementation of these schemes for the action of the …
group action on a set. We construct an implementation of these schemes for the action of the …
Two-party ECDSA from hash proof systems and efficient instantiations
ECDSA is a widely adopted digital signature standard. Unfortunately, efficient distributed
variants of this primitive are notoriously hard to achieve and known solutions often require …
variants of this primitive are notoriously hard to achieve and known solutions often require …
[图书][B] Solving the Pell equation
MJ Jacobson, HC Williams - 2009 - Springer
Solving the Pell Equation Page 1 Michael J. Jacobson, Jr. Hugh C. Williams CMS Books in
Mathematics Solving the Pell Equation Canadian Mathematical Society Société mathématique …
Mathematics Solving the Pell Equation Canadian Mathematical Society Société mathématique …
Linearly homomorphic encryption from
G Castagnos, F Laguillaumie - Cryptographers' Track at the RSA …, 2015 - Springer
We design a linearly homomorphic encryption scheme whose security relies on the
hardness of the decisional Diffie-Hellman problem. Our approach requires some special …
hardness of the decisional Diffie-Hellman problem. Our approach requires some special …
Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p
Functional encryption (FE) is a modern public-key cryptographic primitive allowing an
encryptor to finely control the information revealed to recipients from a given ciphertext …
encryptor to finely control the information revealed to recipients from a given ciphertext …
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups
We introduce BICYCL an open-source C++ library that implements arithmetic in the ideal
class groups of imaginary quadratic fields, together with a set of cryptographic primitives …
class groups of imaginary quadratic fields, together with a set of cryptographic primitives …
[PDF][PDF] Cryptographic schemes based on isogenies
A Stolbunov - 2012 - ntnuopen.ntnu.no
In this thesis we use isogenies between ordinary elliptic curves for the construction of new
cryptographic schemes. The thesis is organized into an introductory chapter followed by …
cryptographic schemes. The thesis is organized into an introductory chapter followed by …
Encryption Switching Protocols Revisited: Switching Modulo p
Abstract At CRYPTO 2016, Couteau, Peters and Pointcheval introduced a new primitive
called encryption switching protocols, allowing to switch ciphertexts between two encryption …
called encryption switching protocols, allowing to switch ciphertexts between two encryption …
Security estimates for quadratic field based cryptosystems
JF Biasse, MJ Jacobson Jr, AK Silvester - Australasian Conference on …, 2010 - Springer
We describe implementations for solving the discrete logarithm problem in the class group of
an imaginary quadratic field and in the infrastructure of a real quadratic field. The algorithms …
an imaginary quadratic field and in the infrastructure of a real quadratic field. The algorithms …
Solving the Pell equation
HC Williams - Number Theory for the Millennium III, 2023 - taylorfrancis.com
Let D be a positive nonsquare integer. The misnamed Pell equation is an expression of the
form (1.1) https://www. w3. org/1998/Math/MathML"> T 2− DU 2= 1 https://s3-euw1-ap-pe-df …
form (1.1) https://www. w3. org/1998/Math/MathML"> T 2− DU 2= 1 https://s3-euw1-ap-pe-df …