Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation

DOI10.1007/978-3-642-38980-1_35MaRDI QIDQ2873658zbMATH OpenOpenAlexFDO

Authors Sonia Bogos, Ioana Boureanu, Serge Vaudenay

Publication date 24 January 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38980-1_35

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1303131
• A public key cryptosystem based on a subgroup membership problem
• scientific article; zbMATH DE number 1759305
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• On using primes for public key encryption systems

Cited in

(1)

• Duplication free public keys based on SIS-type problems

This page was built for publication: Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873658)