Results 1 to 10 of about 34 (24)
A Ring-LWE-based digital signature inspired by Lindner–Peikert scheme
Journal of Mathematical Cryptology, 2022 In this article, we give a digital signature by using Lindner–Peikert cryptosystem. The security of this digital signature is based on the assumptions about hardness of Ring-LWE and Ring-SIS problems, along with providing public key and signature of ...
Sharafi Javad, Daghigh Hassan
doaj +1 more source
The polynomial learning with errors problem and the smearing condition
Journal of Mathematical Cryptology, 2022 As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana +4 more
doaj +1 more source
On the supersingular GPST attack
Journal of Mathematical Cryptology, 2021 The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange.
Basso Andrea, Pazuki Fabien
doaj +1 more source
Flattening NTRU for Evaluation Key Free Homomorphic Encryption
Journal of Mathematical Cryptology, 2020 We propose a new FHE scheme F-NTRU that adopts the flattening technique proposed in GSW to derive an NTRU based scheme that (similar to GSW) does not require evaluation keys or key switching.
Doröz Yarkın, Sunar Berk
doaj +1 more source
Quantum Strongly Secure Ramp Secret Sharing [PDF]
, 2014 Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed.
Matsumoto, Ryutaroh, Zhang, Paul
core +2 more sources
Quantum Bilinear Optimization [PDF]
, 2016 We study optimization programs given by a bilinear form over noncommutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical channels, and quantum ...
Berta, Mario +2 more
core +2 more sources
Open Mathematics, 2018 The implantation of Remote Electronic Voting (REV) systems to Electoral Processes is happening at a slower pace than anticipated. One of the relevant factors explaining that reality is the lack of studies about the Cryptographic Schemes and Primitives ...
Marcos del Blanco David Yeregui +2 more
doaj +1 more source
Constructing elliptic curve isogenies in quantum subexponential time
Journal of Mathematical Cryptology, 2014 Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source
Scientometric dimensions of cryptographic research [PDF]
, 2015 Information security has been a crucial issue in modern information management; thus cryptographic techniques have become inevitable to safeguard the digital information assets as well as to defend the invasion of privacy in modern information society ...
Pal, Jiban K.
core +1 more source
Private quantum codes: introduction and connection with higher rank numerical ranges
, 2013 We give a brief introduction to private quantum codes, a basic notion in quantum cryptography and key distribution. Private code states are characterized by indistinguishability of their output states under the action of a quantum channel, and we show ...
Kribs, D. W., Plosker, S.
core +1 more source