The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Fundamentals of Artificial Neural Networks
Fundamentals of Artificial Neural Networks
An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Designing Identification Schemes with Keys of Short Size
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A new identification scheme based on the perceptrons problem
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A New \mathcal{NP}-Complete Problem and Public-Key Identification
Designs, Codes and Cryptography
Fault Injection and a Timing Channel on an Analysis Technique
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hill climbing algorithms and Trivium
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
On the key schedule strength of PRESENT
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
| Hi-index | 0.00 |
This paper describes an attack on an identification scheme based on the permuted perceptron problem (PPP) as suggested by Point-cheval. The attack finds the secret key, a vector of n binary elements, in time much faster than estimated by its designer. The basic idea in the attack is to use several applications of a simulated annealing algorithm and combine the outcomes into an improved search. It is left as an open problem to what extent the methods developed in this paper are useful also in other combinatorial problems.