A method for obtaining digital signatures and public-key cryptosystems

From MaRDI portal

Publication:4145254

Jump to:navigation, search

DOI10.1145/359340.359342zbMath0368.94005OpenAlexW4232836212WikidataQ27177229 ScholiaQ27177229MaRDI QIDQ4145254

Ronald L. Rivest, Leonard M. Adleman, Adi Shamir

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.2023

zbMATH Keywords

cryptography security factorization privacy authentication digital signatures prime number public-key cryptosystems message-passing electronic mail

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Improvements to RSA key generation and CRT on embedded devices, On the verifiability of two-party algebraic protocols, On the distribution in short intervals of integers having no large prime factor, Milestone developments in quantum information and no-go theorems, A note on quadratic residuosity and UP, Cryptographic key assignment schemes for any access control policy, Optimal strong primes, A simple model of secure public communication, Reductions among number theoretic problems, Belief, awareness, and limited reasoning, Computing equilibria: a computational complexity perspective, On a public-key cryptosystem based on iterated morphisms and substitutions, Set signatures and their applications, Partitioned encryption and achieving simultaneity by partitioning, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Efficient hardware implementation of finite fields with applications to cryptography, A nonlinear public key cryptosystem, Partial information in public key cryptography, Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment, On using primes for public key encryption systems, On the semantics of Alice \& Bob specifications of security protocols, Is the data encryption standard a group? (Results of cycling experiments on DES), A key distribution system equivalent to factoring, Zero-knowledge proofs of identity, Towards minimal addition chains using ant colony optimisation, The plane vertical wavemaker problem - revisited, Applying quick exponentiation for block upper triangular matrices, A generalisation of Brickell's algorithm for fast modular multiplication, Encroaching lists as a measure of presortedness, Studying the performance of artificial neural networks on problems related to cryptography, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques, The generation of random numbers that are probably prime, New field of cryptography: DNA cryptography, An invisible hybrid color image system using spread vector quantization neural networks with penalized FCM, Univariate polynomial factorization over finite fields, Fast modular multi-exponentiation using modified complex arithmetic, Zero-knowledge proofs of knowledge for group homomorphisms, The distributions of individual bits in the output of multiplicative operations, Fault attacks on hyperelliptic curve discrete logarithm problem over binary field, A cryptosystem for multiple communication, A note on a signature system based on probabilistic logic, Spreading alerts quietly and the subgroup escape problem, Modified fidelity based on-demand secure (MFBOD) routing protocol in mobile ad-hoc network, New hash functions and their use in authentication and set equality, Factoring multi power RSA moduli with a class of secret exponents, Uniform complexity and digital signatures, Quantum cryptography beyond quantum key distribution, An efficient probabilistic encryption scheme, Recent developments in primality testing, The combinatorics of authentication and secrecy codes, A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, Über die mathematischen Grundlagen einiger Chiffrierverfahren, The influence of computers in the development of number theory, Polynomfunktionen auf primen Restklassen, A time-luck tradeoff in relativized cryptography, Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel, Efficient signature generation by smart cards, A two-codebook combination and three-phase block matching based image-hiding scheme with high embedding capacity, Which new RSA-signatures can be computed from certain given RSA- signatures!, A convertible multi-authenticated encryption scheme for group communications, Two distributed problems involving Byzantine processes, Deterministic six states protocol for quantum communication, New designing of cryptosystems based on quadratic fields, An RSA based public-key cryptosystem for secure communication, Joint watermarking and encryption of color images in the Fibonacci-Haar domain, A deterministic test for permutation polynomials, A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA, Providing data confidentiality against malicious hosts in shared data spaces, Improving e-payment security using elliptic curve cryptosystem, Highly parallel modular multiplication in the residue number system using sum of residues reduction, Totally secure classical communication utilizing Johnson (-like) noise and Kirchhoff's law, Unconditional secure communication: a Russian cards protocol, Fast binary multiplication by performing dot counting and complement recoding, Fast simultaneous scalar multiplication, Cryptanalysis of RSA with more than one decryption exponent, Refined quorum systems, Problems of cryptography as discrete optimization tasks, Secure information storage and retrieval using new results in cryptography, Factoring numbers in O(log n) arithmetic steps, An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation, The ring authenticated encryption scheme-how to provide a clue wisely, Distortion-free secret image sharing mechanism using modulus operator, Cryptology: The mathematics of secure communication, Rivest-Shamir-Adleman public key crytosystems do not always conceal messages, Password authentication using public-key cryptography, Hybrid commitments and their applications to zero-knowledge proof systems, Improvement of the Miyazaki-Takaragi threshold digital signature scheme, A calculus for cryptographic protocols: The spi calculus, \(\sqrt{2}+\sqrt{3}\): Four different views, New approaches for deniable authentication, High-performance hardware of the sliding-window method for parallel computation of modular exponentiations, Variations on a theme by Akl and Taylor: security and tradeoffs, Modifying YCN key assignment scheme to resist the attack from Hwang, Recover the tampered image based on VQ indexing, Probabilistic encryption, Number-theoretic functions which are equivalent to number of divisors, Transaction protection by beacons, Trapdoor knapsacks without superincreasing structure, Some classes of permutation polynomials of the form \(b(x^q +ax+\delta)^{\frac{i(q^2 -1)}{d}+1}+c(x^q +ax+\delta)^{\frac{j(q^2 -1)}{d}+1}+L(x)\) over \(\mathbb{F}_{q^2}\), Fractals and discrete dynamics associated to prime numbers, A new fractional one dimensional chaotic map and its application in high-speed image encryption, Lower bounds on lattice sieving and information set decoding, A quantum public-key cryptosystem without quantum channels between any two users based on quantum teleportation, A brief and understandable guide to pseudo-random number generators and specific models for security, Clairvoyant state machine replication, A detailed description of the binomial theorem and an application to permutation binomials over finite fields, Quantum digital signature with continuous-variable, Classical attacks on a variant of the RSA cryptosystem, Optimizing registration based encryption, When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead, The matrix reloaded: multiplication strategies in FrodoKEM, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Layering quantum-resistance into classical digital signature algorithms, Cryptanalysis of RSA variants with primes sharing most significant bits, Encrypted SQL arithmetic functions processing for secure cloud database, Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems, Practical decoy-state quantum digital signature with optimized parameters, Quantum \((t,n)\) threshold proxy blind signature scheme based on Bell states, On-line/off-line digital signatures, Currency stability using blockchain technology, Anamorphic encryption: private communication against a dictator, Fibonacci linear forms and parallel arithmetic algorithms for large numbers, On the oracle complexity of factoring integers, Permuted puzzles and cryptographic hardness, Quantum attacks on some Feistel block ciphers, Fast rebalanced RSA signature scheme with typical prime generation, Graph coloring applied to secure computation in non-abelian groups, Cryptanalytic results on `Dual CRT' and `Common Prime' RSA, Closed-form formula on quantum factorization effectiveness, RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems, Security of ping-pong protocol based on pairs of completely entangled qudits, A secure voting scheme based on rational self-interest, A quantum model of the distribution of prime numbers and the Riemann hypothesis, Homomorphic extensions of CRT-based secret sharing, Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\), Feebly secure cryptographic primitives, Circuit complexity of linear functions: gate elimination and feeble security, The case for algebraic biology: from research to education, Certain sequence of arithmetic progressions and a new key sharing method, On post-processing in the quantum algorithm for computing short discrete logarithms, An optimization of tree topology based parallel cryptography, A novel true random number generator based on mouse movement and a one-dimensional chaotic map, Analysis of the variable length nonzero window method for exponentiation, Quantum science and quantum technology, Broadcasting cryptosystem in computer networks, Cryptographic reverse firewalls for interactive proof systems, A novel ID-based group signature, A method for computing Lucas sequences, A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations, Cryptanalysis of a code-based full-time signature, Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons, On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography, Generic hardness of inversion on ring and its relation to self-bilinear map, Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution, The error probability of the Miller-Rabin primality test, Quantum conference, An efficient quantum digital signature for classical messages, A multivariate cryptosystem inspired by random linear codes, Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA, Efficient digital signatures from RSA without random oracles, Composable security against collective attacks of a modified BB84 QKD protocol with information only in one basis, A new public key cryptosystem based on Edwards curves, Robust synchronization of uncertain unified chaotic systems subject to noise and its application to secure communication, New number-theoretic cryptographic primitives, Protecting ECC against fault attacks: the ring extension method revisited, Survey on SAP and its application in public-key cryptography, Complexity bounds on Semaev's naive index calculus method for ECDLP, Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem, Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra, Some graph-based encryption schemes, Comment on ``Practical and secure outsourcing algorithms for solving quadratic congruences in Internet of Things, Quantum algorithms for computing general discrete logarithms and orders with tradeoffs, Threshold ECDSA with an offline recovery party, The randomized slicer for CVPP: sharper, faster, smaller, batchier, The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Efficient fully CCA-secure predicate encryptions from pair encodings, Indifferentiability for public key cryptosystems, Fast and secure updatable encryption, Verifiable registration-based encryption, Fully deniable interactive encryption, Chosen ciphertext security from injective trapdoor functions, RSA key recovery from digit equivalence information, PSI-stats: private set intersection protocols supporting secure statistical functions, Efficient chain-encryption-based quantum signature scheme with semi-trusted arbitrator, Cryptanalysis of the lifted unbalanced oil vinegar signature scheme, Cryptanalysis and improvement of a \((t, n)\) threshold group signature scheme, A quantum hash function with grouped coarse-grained boson sampling, Calculating the sum of multidigit values in a parallel computational model, Improved lattice enumeration algorithms by primal and dual reordering methods, A cluster-based networking approach for large-scale and wide-area quantum key agreement, Quantum permutation pad for universal quantum-safe cryptography, Provably secure arbitrated-quantum signature, Quantum signature without classical private key, Coin-based multi-party fair exchange, Security comparisons and performance analyses of post-quantum signature algorithms, SimS: a simplification of SiGamal, New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system, Permutation trinomials over \(\mathbb{F}_{2^m}\), The design of dynamic access control scheme with user authentication, An improved binary algorithm for RSA, Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks, On the analysis of cryptographic assumptions in the generic ring model, Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements, Data mining in electronic commerce, Elliptic curve scalar multiplication algorithm using complementary recoding, Security enhancement for digital signature schemes with fault tolerance in RSA, Threshold cryptography based on Asmuth-Bloom secret sharing, An efficient multi-receipt mechanism for uncoercible anonymous electronic voting, Prêt à voter with Paillier encryption, Constructing parallel long-message signcryption scheme from trapdoor permutation, Analysis and design of a secure key exchange scheme, A variant of Wiener's attack on RSA, A cryptographic watermarking technique for multimedia signals, Enhancements of trapdoor permutations, Acoustic cryptanalysis, Highly parallel modular multiplier for elliptic curve cryptography in residue number system, Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption, Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives, Privacy preservation for machine learning training and classification based on homomorphic encryption schemes, Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles, Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices, Cryptographic algorithms for privacy-preserving online applications, Theoretically extensible quantum digital signature with starlike cluster states, On constructing one-way permutations from indistinguishability obfuscation, A recursive construction of permutation polynomials over \(\mathbb F_{q^2}\) with odd characteristic related to Rédei functions, The number of rational points of hyperelliptic curves over subsets of finite fields, Cryptography on elliptic curves over \(p\) -adic number fields, How (not) to design strong-RSA signatures, Gröbner basis cryptosystems, On some connections between statistics and cryptology, Improvement on Meshram et al.'s ID-based cryptographic mechanism, Efficient multiple-precision integer division algorithm, Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\), Multilevel threshold secret sharing based on the Chinese remainder theorem, A provably secure short signature scheme based on discrete logarithms, New methods and abstractions for RSA-based forward secure signatures, Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics, Cryptanalysis of the RSA variant based on cubic Pell equation, Identity-based ring signatures from RSA, Convertible multi-authenticated encryption scheme, Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit, Computing the modular inverses is as simple as computing the GCDs, A lossless data hiding scheme based on three-pixel block differences, Further results on permutation polynomials over finite fields, Cryptanalysis of ISO/IEC 9796-1, An asymmetric image cryptosystem based on the adaptive synchronization of an uncertain unified chaotic system and a cellular neural network, Simple authenticated key agreement and protected password change protocol, Cryptanalysis of an authenticated encryption scheme using self-certified public keys, Standards and verification for fair-exchange and atomicity in e-commerce transactions, Cryptanalysis and improvement on batch verifying multiple RSA digital signatures, Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences, Index calculation attacks on RSA signature and encryption, Speeding up exponentiation using an untrusted computational resource, Cryptanalysis of RSA for a special case with \(d > e\), The RSA group is pseudo-free, Secure evolvable hardware for public-key cryptosystems, Security of the design of time-stamped signatures, A password authentication scheme over insecure networks, On two DES implementations secure against differential power analysis in smart-cards, One-way permutations on elliptic curves, An implementation for a fast public-key cryptosystem, A new construction of threshold cryptosystems based on RSA, Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization, A new attack on RSA with two or three decryption exponents, A unified approach to deterministic encryption: new constructions and a connection to computational entropy, Supporting dynamic updates in storage clouds with the Akl-Taylor scheme, Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing, A link between two classes of permutation polynomials, Key establishment à la Merkle in a quantum world, An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem, Quantum binary search algorithm, Generalized cryptanalysis of small CRT-exponent RSA, A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing, One-to-one mapping matrix, Remarks on some signature schemes based on factoring and discrete logarithms, Fail-stop blind signature scheme design based on pairings, A secure and efficient authentication protocol for anonymous channel in wireless communications, Cryptanalysis of some signature schemes with message recovery, An enhanced user authentication scheme for multi-server internet services, Security of Pon-Lu-Jeng's Meta-He digital signature schemes, Security analysis and improvement of a double-trapdoor encryption scheme, A research on new public-key encryption schemes, Cryptanalysis of large RSA exponent by using the LLL algorithm, Several security schemes constructed using ECC-based self-certified public key cryptosystems, A public key cryptosystem based on a subgroup membership problem, Efficient big integer multiplication and squaring algorithms for cryptographic applications, A provably secure proxy signcryption scheme using bilinear pairings, Conjugacy systems based on nonabelian factorization problems and their applications in cryptography, A pairing-based three-party authenticated encryption scheme without shared secrets, Computing on authenticated data, A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation., Implicit factorization of unbalanced RSA moduli, Cryptanalysis of a noncommutative key exchange protocol, Security pitfalls of an efficient threshold proxy signature scheme for mobile agents, Security issues in Sarkar's e-cash protocol, Cryptanalysis of RSA with a small parameter revisited, Dynamic threshold secret reconstruction and its application to the threshold cryptography, On the security of two identity-based signature schemes based on pairings, Pairings in local fields and cryptography, Relations between robustness and RKA security under public-key encryption, Breaking RSA may be as difficult as factoring, SoK: how (not) to design and implement post-quantum cryptography, The space complexity analysis in the general number field sieve integer factorization, Factoring multi-power RSA moduli with primes sharing least or most significant bits, On the Clark-Jacob version of SPLICE/AS, A simple approach for generating RSA keys, Authenticated encryption schemes with linkage between message blocks, An active attack on protocols for server-aided RSA signature computation, Efficient construction of vote-tags to allow open objection to the tally in electronic elections, Linear systolic multiplier/squarer for fast exponentiation, Partitioned systolic architecture for modular multiplication in \(\mathrm{GF}(2^{m})\), NSA and dual EC\(\_\)DRBG: Déjà vu all over again?, Primes in quadratic unique factorization domains, On the number of strong primes, Practical cryptanalysis of ISO 9796-2 and EMV signatures, Bug attacks, A branch hash function as a method of message synchronization in anonymous P2P conversations, A structure-based chaotic hashing scheme, Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\), Cryptographic hardness of random local functions. Survey, Public key protocols over the ring \(E_{p}^{(m)}\), A semantically secure public key cryptoscheme using bit-pair shadows, Quantum computing without entanglement, The complexity of computing the permanent, Complexity-style resources in cryptography, Technique for authenticating H.264/SVC and its performance evaluation over wireless mobile networks, Privacy and verifiability in voting systems: methods, developments and trends, Are electroencephalogram (EEG) signals pseudo-random number generators?, Small secret exponent attack on RSA variant with modulus \(N=p^rq\), On the inverses of some classes of permutations of finite fields, Layouts for improved hierarchical parallel computations, Efficient proxy signcryption scheme with provable CCA and CMA security, Parallel modular exponentiation using load balancing without precomputation, A public key cryptosystem based on three new provable problems, Fair exchange of valuable information: a generalised framework, Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\), Multi-verifier signatures, First-order side channel attacks on Zhang's countermeasures, A note on the average number of RSA fixed points, A note on linear permutation polynomials, A new strategy for generating shortest addition sequences, Star reduction among minimal length addition chains, Short undeniable signatures based on group homomorphisms, Permutation polynomials over finite fields from a powerful lemma, User efficient recoverable off-line e-cash scheme with fast anonymity revoking, Fault-based attack on Montgomery's ladder algorithm, Quantum-assisted QD-CFS signatures, Sequential aggregate signatures with lazy verification from trapdoor permutations, A general construction for monoid-based knapsack protocols, Security risk during the transient in a key exchange protocol using random signals and feedback, Permutation polynomials from piecewise functions, SimpleMatrix -- a multivariate public key cryptosystem (MPKC) for encryption, Modeling energy-efficient secure communications in multi-mode wireless mobile devices, Efficient quantum multi-proxy signature, Provably secure three party encrypted key exchange scheme with explicit authentication, A rational framework for secure communication, An attack on the Needham-Schroeder public-key authentication protocol, On the security of the Lucas function, Quantum Boolean image denoising, Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques, A chosen message attack on Demytko's elliptic curve cryptosystem, Computational hardness of IFP and ECDLP, Undeniable signature scheme based over group ring, Privacy protection in on-line shopping for electronic documents, Efficient verifiable multi-secret sharing scheme based on hash function, Provably secure proxy convertible authenticated encryption scheme based on RSA, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Trusted computing with addition machines. I, Permutation polynomials and a new public-key encryption, Compositional inverses and complete mappings over finite fields, Cryptanalysis of Dual RSA, Group rekeying in the exclusive subset-cover framework, Analyzing massively collaborative mathematics projects, Self-generated-certificate public key encryption without pairing and its application, Anonymous message communications with user hierarchy in a multicast system, Authenticated key agreement in dynamic peer groups, An ID-based multi-signer universal designated multi-verifier signature scheme, Encryption test of pseudo-aleatory messages embedded on chaotic laser signals: an information theory approach, An escrow electronic cash system with limited traceability, A new blind signature based on the discrete logarithm problem for untraceability, Reducing factorization of a semiprime number to the integration of highly oscillatory functions, Generic security-amplifying methods of ordinary digital signatures, Asymptotic granularity reduction and its application, A new generalization of the KMOV cryptosystem, A public key cryptosystem based on Diophantine equations of degree increasing type, Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\), Montgomery's method of polynomial selection for the number field sieve, Piecewise constructions of inverses of some permutation polynomials, On the concealability of messages by the Williams public-key encryption scheme, Thwarting side-channel analysis against RSA cryptosystems with additive blinding, Computer algebra tales on Goppa codes and McEliece cryptography, Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol, Quantum computation and quantum information, The design of a secure and fair sealed-bid auction service, An iterative modular multiplication algorithm in RNS, A new cryptosystem using generalized Mersenne primes, Quantum mechanics and computation, Some basics on privacy techniques, anonymization and their big data challenges, A practical anonymous payment scheme for electronic commerce, A one-way function from thermodynamics and applications to cryptography, Efficient algorithms for NMR quantum computers with small qubits, Functional inversion and communication complexity, An application of algebraic geometry to encryption: tame transformation method, Conducting secret ballot elections in computer networks: Problems and solutions, Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations, Certifying trapdoor permutations, revisited, On the security loss of unique signatures, Registration-based encryption: removing private-key generator from IBE, Repairing ElGamal-like multi-signature schemes using self-certified public keys, On dynamic threshold schemes, Robust key authentication scheme resistant to public key substitution attacks, Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications, Efficient data structures for Boolean functions, High-performance generic-point parallel scalar multiplication, A fast parallel modular exponentiation algorithm, Fast generation of prime numbers and secure public-key cryptographic parameters., A highly safe self-stabilizing mutual exclusion algorithm, Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm, Speeding up the computations of elliptic curves cryptoschemes, Efficient information hiding based on theory of numbers, Factoring RSA moduli with primes sharing bits in the middle, Memory lower bounds of reductions revisited, Password authentications using triangles and straight lines, Analysis of sliding window techniques for exponentiation, Batch RSA, Batch Diffie-Hellman key agreement systems, Quantum reversible circuit of AES-128, Carryless addition, The security of the birational permutation signature schemes, Redundant integer representations and fast exponentiation, Mathematical problems in cryptology, New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\), Some consequences of cryptographical conjectures for \(S_2^1\) and EF, A generalized attack on RSA type cryptosystems, RSA: a number of formulas to improve the search for \(p+q\), On the impossibility of cryptography with tamperable randomness, On the simulation of quantum Turing machines., A class of new permutation trinomials, Permutation polynomials of the form \(cx+\mathrm{Tr}_{q^l/ q}(x^a)\) and permutation trinomials over finite fields with even characteristic, How to fake an RSA signature by encoding modular root finding as a SAT problem, Improved low-computation partially blind signatures., A practical anonymous multi-authority e-cash scheme., An efficient quantum somewhat homomorphic symmetric searchable encryption, Unmediated communication in repeated games with imperfect monitoring., Privacy preserving distributed optimization using homomorphic encryption, Preimage selective trapdoor function: how to repair an easy problem, An XML multisignature scheme., Cryptanalysis of short secret exponents modulo RSA primes., Further improvement of factoring \(N=p^rq^s\) with partial known bits, Public key compression for constrained linear signature schemes, A generalized attack on some variants of the RSA cryptosystem, Parallel algorithms for modular multi-exponentiation, More classes of permutation trinomials with Niho exponents, Compositional inverses of permutation polynomials of the form \(x^rh(x^s)\) over finite fields, An arbitrated proxy blind signature based on hyper entanglement analysis, Towards a unified complexity theory of total functions, On the optimality of lattices for the Coppersmith technique, Deterministic MDI QKD with two secret bits per shared entangled pair, Attacks to some verifiable multi-secret sharing schemes and two improved schemes, On the security of RSA with primes sharing least-significant bits, Improvement of signature scheme based on factoring and discrete logarithms, A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli, Digital signature with message recovery using self-certified public keys without trustworthy system authority, Efficient on-line electronic checks, An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme, Meta-He digital signatures based on factoring and discrete logarithms, Chaotic synchronization cryptosystems combined with RSA encryption algorithm, Fast group operations on elliptic curves in Maple, Two varieties of finite automaton public key cryptosystem and digital signatures, Factoring with the quadratic sieve on large vector computers, A \((t,n)\) multi-secret sharing scheme, Threshold verification scheme to a valid-signature using identity only on specialized approval, Fast direct computation of modular reduction, From quantum cellular automata to quantum lattice gases, Synthesizers and their application to the parallel construction of pseudo-random functions, Secure distributed storage and retrieval, Input-trees of finite automata and application to cryptanalysis, Improvements of generalization of threshold signature and authenticated encryption for group communications, The multi-dimension RSA and its low exponent security, A model-theoretic characterization of the weak pigeonhole principle, Qubit authentication, How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps., Adaptively secure distributed public-key systems., Proxy signature schemes based on factoring, Function field sieve method for discrete logarithms over finite fields, Robust threshold DSS signatures, How to sign digital streams, Regular languages accepted by quantum automata, Access control in a hierarchy using a one-way trap door function, ID-based multisignatures with distinguished signing authorities for sequential and broadcasting architectures, Digital signature with message recovery using self-certified public keys and its variants, A traceable group signature scheme., A design of fast pipelined modular multiplier based on a diminished-radix algorithm, Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm, The discrete logarithm modulo a composite hides \(O(n)\) bits, A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\), An iterative modular multiplication algorithm, A Unified Framework for Small Secret Exponent Attack on RSA, POST QUANTUM CRYPTOGRAPHY FROM MUTANT PRIME KNOTS, Cryptanalysis of a public key cryptosystem based on boolean permutations, Crypto Galore!, Computational Number Theory and Cryptography, Universal characteristics of fractal fluctuations in prime number distribution, Partial Key Exposure Attack on CRT-RSA, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, RSA and Elliptic Curve Least Significant Bit Security, Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC), New Attacks on RSA with Moduli N = p r q, Factoring RSA Moduli with Weak Prime Factors, A Signature Scheme for a Dynamic Coalition Defence Environment Without Trusted Third Parties, Secure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques, Improving small private exponent attack on the Murru-Saettone cryptosystem, Signatures and Efficient Proofs on Committed Graphs and NP-Statements, Authenticated semi-quantum key distribution without entanglement, Practical quantum digital signature with configurable decoy states, Simple analysis of security of the BB84 quantum key distribution protocol, Quantum algorithms for typical hard problems: a perspective of cryptanalysis, Quantum digital signature in a network, Information hiding method based on quantum image by using Bell states, Quantum algorithm for solving hyperelliptic curve discrete logarithm problem, Quantum \((t, n)\) threshold group signature based on Bell state, Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, Revisiting lower dimension lattice attacks on NTRU, Asymptotic security analysis of teleportation-based quantum cryptography, A new quantum multi-party signature protocol based on SNOP states without arbitrator, A novel quantum blockchain scheme base on quantum entanglement and DPoS, Quantum public-key encryption schemes based on conjugate coding, A novel quantum \((t, n)\) threshold group signature based on \(d\)-dimensional quantum system, Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm, Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations, Parallel methods of representing multidigit numbers in numeral systems for testing multidigit arithmetic operations, Quantum dialogue mediated by EPR-type entangled coherent states, A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor, Tower building technique on elliptic curve with embedding degree 18, Constructing permutation trinomials via monomials on the subsets of \(\mu_{q+1}\), On completely factoring any integer efficiently in a single run of an order-finding algorithm, Quantum digital signature based on measurement-device-independent continuous-variable scheme, Public-key generation with verifiable randomness, SiGamal: a supersingular isogeny-based PKE and its application to a PRF, Groups of prime degree and the Bateman-Horn conjecture, Speed Optimizations in Bitcoin Key Recovery Attacks, Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption, Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH, RSA cryptosystem for rings with commuting ideals, Non-associative public-key cryptography, Improved Key Recovery Algorithms from Noisy RSA Secret Keys with Analog Noise, An Improved Analysis on Three Variants of the RSA Cryptosystem, Revisiting the Cubic UOV Signature Scheme, Improved Results on Cryptanalysis of Prime Power RSA, A NOVEL IDENTITY-BASED KEY-INSULATED CONVERTIBLE AUTHENTICATED ENCRYPTION SCHEME, Signcryption Schemes Based on the RSA Problem, Parallel Signcryption, Gate Elimination for Linear Functions and New Feebly Secure Constructions, Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation, Analyzing Standards for RSA Integers, Benaloh’s Dense Probabilistic Encryption Revisited, Electronic voting in a large-scale distributed system, Exponentiation modulo a polynomial for data security, A Simple and Improved Algorithm for Integer Factorization with Implicit Hints, Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace, Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents, On the Use of RSA Public Exponent to Improve Implementation Efficiency and Side-Channel Resistance, Perfect Structure on the Edge of Chaos, Cryptographic Assumptions: A Position Paper, On Constructing One-Way Permutations from Indistinguishability Obfuscation, Fast modular multiplication based on complement representation and canonical recoding, Post-Quantum Cryptography: State of the Art, What is the Future of Cryptography?, Double-Speed Barrett Moduli, Cryptography as an Attack Technology: Proving the RSA/Factoring Kleptographic Attack, A secure exponentiation algorithm resistant to a combined attack on RSA implementation, A New Rabin-type Trapdoor Permutation Equivalent to Factoring, Defeating RSA Multiply-Always and Message Blinding Countermeasures, Beyond Provable Security Verifiable IND-CCA Security of OAEP, An Efficient Post-Quantum One-Time Signature Scheme, Quantum algorithms for algebraic problems, Quantum information and relativity theory, Information and computation: Classical and quantum aspects, Sufficient conditions for factoring a class of large integers, The orthogonal signature, Algebraic cryptography: new constructions and their security against provable break, Energy-Efficient Elliptic Curve Cryptography for MSP430-Based Wireless Sensor Nodes, A New Attack on Three Variants of the RSA Cryptosystem, On Constructing 1-1 One-Way Functions, Three XOR-Lemmas — An Exposition, Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security, A novel fully homomorphic encryption scheme bsed on LWE, A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators, Quantum Homomorphic Encryption for Polynomial-Sized Circuits, Fine-Grained Cryptography, Shorter addition chain for smooth integers using decomposition method, Scalability of Shor’s algorithm with a limited set of rotation gates, Square Always Exponentiation, A Practical Cryptanalysis of the Algebraic Eraser, The k -ary Montgomery modular inverse over nonbinary computers, Efficient and Adaptive Threshold Signatures for Ad hoc networks, Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography, Unnamed Item, New weak keys in RSA, A power efficient aggregation of encrypted data in wireless sensor network, Homomorphism key agreement based on RSA, Further analysis of block ciphers against timing attacks, A new fast modular arithmetic method in public key cryptography, A new watermarking protocol against conspiracy, An efficient ECDSA-based signature scheme for wireless networks, Unnamed Item, Anonymous Authentication with Optional Shared Anonymity Revocation and Linkability, Optimal Use of Montgomery Multiplication on Smart Cards, Weaknesses in Some Threshold Cryptosystems, The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, New Generation of Secure and Practical RSA-Based Signatures, Compositeness test with nodal curves, A faster modular multiplication algorithm, Efficient Modular Reduction Algorithm Without Correction Phase, Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization, Cryptographic Technology for Benefiting from Big Data, Secure Cryptographic Module Implementation and Mathematics, The Shortest Signatures Ever, Another look at some fast modular arithmetic methods, A cryptographic primitive based on hidden-order groups, Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants, A password authentication scheme based on discrete logarithms, Fast modular multiplication using 2-power radix, Basics of Secrecy Coding, High-radix and bit recoding techniques for modular exponentiation, New public-key cryptosystem, Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS, A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security, A verification of brickell's fast modular multiplication algorithm, Asymptotically Fast Factorization of Integers, A Probabilistic Applied Pi–Calculus, An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels, Fast Point Decompression for Standard Elliptic Curves, Robust Threshold Schemes Based on the Chinese Remainder Theorem, Cryptanalysis of the TRMS Signature Scheme of PKC’05, Another Generalization of Wiener’s Attack on RSA, Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography, On the Improvement of the BDF Attack on LSBS-RSA, Public-Key Cryptosystems with Primitive Power Roots of Unity, Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation, Algebraic Cryptanalysis of CTRU Cryptosystem, Optimal Extension Field Inversion in the Frequency Domain, Modular Reduction in GF(2 n ) without Pre-computational Phase, Side Channels in the McEliece PKC, On the security of multi-prime RSA, An Identity-Based Key Agreement Protocol for the Network Layer, Revisiting Wiener’s Attack – New Weak Keys in RSA, Use of trapdoor structures in cryptography, Committing to Quantum Resistance, Better: A Speed-and-Risk-Configurable Defence for Bitcoin Against a Fast Quantum Computing Attack, Authentic Quantum Nonces, Integer Reconstruction Public-Key Encryption, Implicit Related-Key Factorization Problem on the RSA Cryptosystem, An algebra to represent security policies for cryptography-based secure storage systems, Integrating FPGA/ASIC into cryptographic storage systems to avoid re-encryption, Unnamed Item, FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR, Application of ECM to a class of RSA keys, A new signature scheme based on factoring and discrete logarithms, NMR Quantum Computing, Computing Logarithms in Finite Fields of Characteristic Two, Measurement-Based and Universal Blind Quantum Computation, Common modulus attacks on small private exponent RSA and some fast variants (in practice), Secret Codes and Online Security: A Seminar for Entering Students, A deterministic version of Pollard’s $p-1$ algorithm, Some remarks concerning the M.I.T. public-key cryptosystem, Bug Attacks, Graph Design for Secure Multiparty Computation over Non-Abelian Groups, The Hidden Root Problem, Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam, A teaching module on the history of public-key cryptography and RSA, An improved Monte Carlo factorization algorithm, Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors, Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients, Securing RSA against Fault Analysis by Double Addition Chain Exponentiation, Quantum computation and quantum information†, CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS, P SYSTEMS WITH INPUT IN BINARY FORM, Realizing Hash-and-Sign Signatures under Standard Assumptions, A New Operator for Multi-addition Calculations, RSA cryptosystem with fuzzy set theory for encryption and decryption, Reducing the Complexity in the Distributed Computation of Private RSA Keys, Random Order m-ary Exponentiation, Cryptanalysis of RSA Using the Ratio of the Primes, Unifying Zero-Knowledge Proofs of Knowledge, Algorithm for factoring some RSA and Rabin moduli, A designated verifier signature using secret sharing technique, A realistic divisible transferable electronic cash for general use, Attacks on provably secure proxy-protected signature schemes based on factoring, Distinguishing Multiplications from Squaring Operations, HECC Goes Embedded: An Area-Efficient Implementation of HECC, Analysis and Optimization of Cryptographically Generated Addresses, Partial Key Exposure: Generalized Framework to Attack RSA, Authenticated Byzantine Generals in Dual Failure Model, Efficiency Limitations for Σ-Protocols for Group Homomorphisms, Parallel computation of the multi-exponentiation for cryptosystems, TWO ATTACKS ON A TWO-FACTOR USER AUTHENTICATION IN WIRELESS SENSOR NETWORKS, Structured encryption algorithm for text cryptography, The improvement of initial value closer to the target for Fermat’s factorization algorithm, Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients, Public key authentication scheme over quaternions, AUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHM, Novel Digital Signature Scheme with Multiple Private Keys on Non-commutative Division Semirings, Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems, On the security of RSA textbook signature scheme on Paillier ciphertext, Toward RSA-OAEP Without Random Oracles, Efficient Key Generation for Rainbow, Taming access control security: extending capabilities using the views relationship, Confined types in Java, Smooth ideals in hyperelliptic function fields, An improvement of a key exchange protocol relying on polynomial maps, A new undeniable signature scheme on general linear group over group ring, A DSA-like digital signature protocol, Cryptanalysis of Prime Power RSA with two private exponents, Improved digital signature scheme based on factoring and discrete logarithms, Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security, LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4, Online Template Attack on ECDSA:, Attacking RSA Using an Arbitrary Parameter, XTR Algorithm: Efficient and Compact Subgroup Trace Representation, Boneh-Boyen IBE, Attribute-Based Encryption, A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA), Compact Lossy and All-but-One Trapdoor Functions from Lattice, Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption, An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers, Quantum fast Fourier transform using multilevel atoms, Public key cryptography based on Moufang loops, Symmetric text encryption scheme based Karhunen Loeve transform, Nested block design as key pre-distribution in wireless sensor networks, Application of Parallel Virtual Machine Framework to the Strong Prime Problem, Synchronization of a Memristor Chaotic System and Image Encryption, Parallel implementation of the rsa public-key cryptosystem, The Semi-Quantum Computer, Improved Harn Batch Digital Signature Algorithm for Multicast Authentication, PARALLEL COMPUTATION OF THE MODULAR CASCADE EXPONENTIATION, Blind one-time signature and its applications, A cryptographic key assignment scheme for access control in a hierarchy with exceptions, A fast modular multiplication algorithm, New permutation trinomials constructed from fractional polynomials, The game of matrix rings for cryptography, GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL, A server-aided computation protocol for rsa enciphering algorithm, Mechanism design and communication networks, On Addition Chains¹, Information gain when measuring an unknown qubit, Minimal weight k-SR representations, Authentication codes: An area where coding and cryptology meet, Code-Based Cryptosystems Using Generalized Concatenated Codes, Towards a Unified Complexity Theory of Total Functions, EPG-representations with Small Grid-Size, Secure and efficient off-line digital money (extended abstract), Sliding encryption: A cryptographic tool for mobile agents, Key exchange protocols over noncommutative rings. The case of, ROBUST MESSAGE AUTHENTICATION OVER A COLLECTIVE-NOISE CHANNEL, Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques, Functional Encryption: Origins and Recent Developments, Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors, Combined Attack on CRT-RSA, Fail-stop blind signature scheme based on the integer factorization, Private communications in hierarchical group-mobile radio system, A method for obtaining digital signatures and public-key cryptosystems, A Less Known Side of Quantum Cryptography, An asymmetric cryptographuic key assignment scheme for access control in totally-ordered hierarchies^∗, Public key cryptosystems based on boolean permutations and their applications, Cryptology, Mathematics, and Technology, Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer, Critical remarks on some public-key cryptosystems, RingRainbow – An Efficient Multivariate Ring Signature Scheme, Fast exponentiation by folding the signed-digit exponent in half, A new digital signature scheme based on factoring and discrete logarithms, Threshold-directed signature scheme based on hybrid number theoretic problems, A cubic analogue of the RSA cryptosystem, Provably secure Rabin-p cryptosystem in hybrid setting, Cryptosystems based on permutation polynomials, Random Sources for Cryptographic Systems, Blinding for Unanticipated Signatures, Demonstration of a Fundamental Quantum Logic Gate, Unnamed Item, Factorization of the tenth Fermat number, Digital Signatures, A practical parallel algorithm for computinga b modc *, Unnamed Item, The Prisoners’ Problem and the Subliminal Channel, An Overview of Factoring, Signatures Through Approximate Representations by Quadratic Forms, Analytical Characteristics of the DES, RSA bits are .732 + ε secure, The Complexity of Public-Key Cryptography, A remote password authentication scheme based on the digital signature method, A public key system with signature and master key functions, A note on Low Order assumptions in RSA groups, Cryptanalysis of ITRU, Equal To The Task?, A cryptographic encryption technique byte – Spiral rotation encryption algorithm, A new attack on RSA and Demytko’s elliptic curve cryptosystem, Forty years of attacks on the RSA cryptosystem: A brief survey, Unnamed Item, MEMRISTOR CELLULAR AUTOMATA AND MEMRISTOR DISCRETE-TIME CELLULAR NEURAL NETWORKS, Key management for Pay-TV broadcast systems in hierarchy, An efficient ID-based user identification scheme for mutual authentication in mobile environments, Unnamed Item, Insecure primitive elements in an ElGamal signature protocol, A Public Key Cryptosystem Using Hiil's Cipher, An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding, Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form, Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem, Two is better than one: How to securely combine two assumptions, Kleptographic (algorithmic) backdoors in the RSA key generator, Exploiting the security of N = prqs through approximation of ϕ(N), Generalised Mersenne numbers revisited, Modelling a public-key infrastructure, A new attack on some RSA variants, Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups, Efficient Nyberg-Rueppel type of NTRU digital signature algorithm, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, Mathematical etudes on quantum computation, Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm, Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method, Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation, A Hybrid Threshold Group Signature Scheme with Distinguished Signing Authority, A new quantum algorithm for computing RSA ciphertext period, Continuous variable controlled quantum dialogue and secure multiparty quantum computation, Efficient network authentication protocols: Lower bounds and optimal implementations, Secure reliable multicast protocols in a WAN, When e-th Roots Become Easier Than Factoring, How to Build a Hash Function from Any Collision-Resistant Function, Cryptography and cryptographic protocols, Delegation of cryptographic servers for capture-resilient devices, Representation of integers: a nonclassical point of view, An Asymmetric Image Encryption Algorithm Based on a Fractional-Order Chaotic System and the RSA Public-Key Cryptosystem, Structure Versus Hardness Through the Obfuscation Lens, A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA, ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES, Calculation of random pairs of primes whose product lies in a given short interval, A new method for generating keys in the RSA cryptosystem, Атаки на схемы электронной подписи, не учитываемые традиционными определениями стойкости, и меры противодействия им, A NOVEL EFFICIENT ACCESS CONTROL SCHEME FOR LARGE-SCALE DISTRIBUTED WIRELESS SENSOR NETWORKS, Efficient Image Encryption Scheme Based on 4-Dimensional Chaotic Maps, Computation of a 768-Bit Prime Field Discrete Logarithm, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Removing the Strong RSA Assumption from Arguments over the Integers, Magic Adversaries Versus Individual Reduction: Science Wins Either Way, Similarity in the statistics of prime numbers, Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques, Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\), On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols, Permutation polynomials modulo \(2^w\), Using LLL-Reduction for Solving RSA and Factorization Problems, The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance, Cryptanalysis of Liaw's broadcasting cryptosystem, The truth behind the myth of the folk theorem, Unnamed Item, Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?, An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm, Analogies and differences between quantum and stochastic automata, Toward Acceleration of RSA Using 3D Graphics Hardware, Speeding up the computations on an elliptic curve using addition-subtraction chains, Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms, Efficient Sequential Aggregate Signed Data, Oblivious signature-based envelope, Efficient ID-Based Digital Signatures with Message Recovery, RSA Moduli with a Predetermined Portion: Techniques and Applications, Threshold RSA for Dynamic and Ad-Hoc Groups, Multiparty generation of an RSA modulus, SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM, Minicrypt primitives with algebraic structure and applications, An anonymous and flexible í-out-of-n electronic voting scheme, Breaking RSA Generically Is Equivalent to Factoring, On the Communication Complexity of Key-Agreement Protocols., Authentication and delegation with smart-cards, Some active attacks on fast server-aided secret computation protocols for modular exponentiation, Access with pseudonyms, Public-key cryptography on smart cards, Integrating smart cards into authentication systems, AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM, Computing prime divisors in an interval, Optimal observables for minimum-error state discrimination in general probabilistic theories, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, Exploiting the Power of GPUs for Asymmetric Cryptography, An unconditionally secure location-aware key management scheme for static sensor networks, Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme, A New Class of Weak Encryption Exponents in RSA, A CCA Secure Hybrid Damgård’s ElGamal Encryption, On the Equivalence of Generic Group Models, A Practical Multivariate Blind Signature Scheme, Cryptographic Voting — A Gentle Introduction, Idempotent Factorizations in the Cryptography Classroom, A Unified Method for Private Exponent Attacks on RSA Using Lattices, Quantum blind signature with an offline repository, Multiparty generation of an RSA modulus, Unnamed Item, On the security of some variants of the RSA signature scheme, Rank-Metric Codes and Their Applications, A variant of RSA using continued fractions, A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure, A novel public-key encryption scheme based on Bass cyclic units in integral group rings, Some consequences of cryptographical conjectures for S 2 1 and EF, Practical attacks on small private exponent RSA: new records and new insights, Certifying giant nonprimes, Concrete quantum cryptanalysis of binary elliptic curves via addition chain, One round threshold ECDSA without roll call, Complete decomposition of the generalized quaternion groups, Implications of the arithmetic ratio of prime numbers for RSA security, Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey, Fully Continuous Leakage-Resilient Certificate-Based Signcryption Scheme for Mobile Communications, Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary, FUTURE: a lightweight block cipher using an optimal diffusion matrix, A generalized attack on the multi-prime power RSA, On the impossibility of key agreements from quantum random oracles, Practical statistically-sound proofs of exponentiation in any group, T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks, Finding points on elliptic curves with Coppersmith's method, TIDE: a novel approach to constructing timed-release encryption, A secure centralized multi-party quantum key distribution protocol with new encoding mode, An efficient encoding mechanism against eavesdropper with side channel information, A robust image encryption scheme using chaotic tent map and cellular automata, Continued fractions applied to a family of RSA-like cryptosystems, Further cryptanalysis of a type of RSA variants, Compositional inverses of AGW-PPs -- dedicated to Professor Cunsheng Ding for his 60th birthday, A quantum version of Pollard's Rho of which Shor's algorithm is a particular case, INFORMATION THEORETICALLY SECURE KEY EXCHANGE ALGORITHM, Homomorphic encryption: a mathematical survey, Permutation polynomials and their compositional inverses over finite fields by a local method, Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages, A quantum blockchain-enabled framework for secure private electronic medical records in Internet of medical things, Exploiting ROLLO's constant-time implementations with a single-trace analysis, Higher-order masked Saber, Short-lived zero-knowledge proofs and signatures, Fast two-party signature for upgrading ECDSA to two-party scenario easily, Shor's Factoring Algorithm and Modular Exponentiation Operators, Variational quantum computation integer factorization algorithm, One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions, Quantum information theory in infinite dimensions with application to optical channels, On one-way ring homomorphisms, Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates, How to build a trapdoor function from an encryption scheme, Dilithium for memory constrained devices, Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion, Cryptanalysis of the multi-power RSA cryptosystem variant, Efficiently masking polynomial inversion at arbitrary order, A new key recovery side-channel attack on HQC with chosen ciphertext, Public-key encryption from homogeneous CLWE, Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields, On new problems in asymmetric cryptography based on error-resistant coding, Practical multi-party quantum homomorphic encryption, Various matching keys for asymmetric topology encryption, A quantum key distribution on qudits using quantum operators, Cryptographic protocols for auctions and bargaining, Some new results on permutation polynomials of the form \(b (x^q + ax + \delta)^s - ax\) over \(\mathbb{F}_{q^2}\), On the various ways of quantum implementation of the modular exponentiation function for Shor's factorization, Improved cryptanalysis of the multi-power RSA cryptosystem variant, Applications of timed-release encryption with implicit authentication, Snowblind: a threshold blind signature in pairing-free groups, Private AI: Machine Learning on Encrypted Data, Factoring integers and oracles for elliptic and hyperelliptic curves, Unnamed Item, How to construct CSIDH on Edwards curves

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4145254&oldid=17947292"