One-way trap door functions based on the Boolean satisfiability problem

Authors:
Sarita Singh;T. J. Mathew
Affiliations:
Infosys Fellow, National Centre for Software Technology, Juhu, Mumbai - 400 049;Professor (Information Tech.), Institute of Management, SNDT, Mumbai - 400 049
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 9
Cited 0

A course in number theory and cryptography

A course in number theory and cryptography
Cryptography and network security (2nd ed.): principles and practice

Cryptography and network security (2nd ed.): principles and practice
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Theory and Design Switching Circ

Theory and Design Switching Circ
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Public-Key Cryptosystems from Lattice Reduction Problems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new proposal for a trap-door one-way function, from which we derive a public-key encryption algorithm. The security of this new algorithm is related to the difficulty of finding an assignment that satisfies a given set of Boolean expressions, providing a possible alternative to existing public-key encryption and digital signature algorithms.