A New Cryptographic Scheme Utilizing the Difficulty of Big Boolean Satisfiability
A search problem may be identified as one, which requires an actual “search” for an answer or a solution. Such a problem may have no obvious method, which could be followed to determine a solution, other than to intelligently search through all candidate or potential solutions, which constitute the...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Ram Arti Publishers
2018-03-01
|
| Colecção: | International Journal of Mathematical, Engineering and Management Sciences |
| Assuntos: | |
| Acesso em linha: | https://www.ijmems.in/assets//5-ijmems-17-005-vol.-3%2c-no.-1%2c-47%E2%80%9361%2c-2018.pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|