ISP-10 Call for papers
	ISP-10 Call for papers The 2010 International Conference on Information Security and Privacy (ISP-10) (website: [link]) will be held during 12-14 of July 2010 in Orlando, FL, USA. ISP is an important event in the areas of information security, privacy, cryptography and related... 更多 » 作者：James Heralds  - 11月15日 - 1 則新留言 (共有 1 則留言)

	"Inheritable" signatures?
	Hi all, for a research of mine I would need a special type of signature that I would call "inheritable". Since cryptography is not my main field of research, I am not sure if such a thing exists and, if it exists, what its "official" name is. I was wondering if you could give me some "pointers" or at least some keywords to google for.... 更多 » 作者：mockturtle  - 11月9日 - 2 則新留言 (共有 2 則留言)

	RSA 4096 public key operation on crypto block that natively supports 2048 bit only?
	I have a general purpose 32-bit CPU that has an onboard hardware crypto block that supports low level crypto primitives like: =95 Modulo exponentiation =95 Montgomery Multiplication =95 Montgomery modulo exponentiation The onboard hardware crypto block supports maximum 2048 bit operations... 更多 » 作者：crashedmind  - 10月17日 - 3 則新留言 (共有 3 則留言)

	Announcing: First-ever collection of declassified Chaocipher-related correspondences
	The "Chaocipher Clearing House" is a web site dedicated to tracking cryptanalytic work related to solving John F. Byrne's Chaocipher. The site can be found at [link]. ======================== Cryptologic books and texts that mention John F. Byrne's Chaocipher (e.g., David Kahn's "The Codebreakers", articles in Cryptologia) refer... 更多 » 作者：mosherubin  - 10月6日 - 1 則新留言 (共有 1 則留言)

	Crypto'09 Rump session to be webcast
	The first Crypto rump session took place in 1981 and was immediately heralded as the most important meeting in cryptography. Each subsequent Crypto rump session has reached a new level of historical significance, outstripped only by the Crypto rump sessions that followed it. The Crypto2009[1] Rump Session[2] will be broadcast live[3] starting... 更多 » 作者：James Hughes  - 8月17日 - 1 則新留言 (共有 1 則留言)

	AES question
	Hi all, At a system there are 2 black box AES engines AES1 is installed with a key, K; the other, AES2 is installed with the key Not(K). AES1 provides interfaces for both encryption and decryption operations. AES2 interface is the following: void decrypt(byte* data_to_decrypt) - it recieves data and decrypts it but it does not output the decrypted... 更多 » 作者：majorsoul  - 8月14日 - 1 則新留言 (共有 1 則留言)

	Simple cipher idea
	...First and foremost, posting code is a very bad way of trying to publish a specification. Second, the code is written horribly, so I, like everyone else, is not going to bother going through it. So I'm going to make the most likely pronunciation, it is weak against linear and differential attacks.... 更多 » 作者：Joseph Ashwood  - 8月17日 - 1 則新留言 (共有 1 則留言)

	cipher of historical interest
	Hello I have little detailed knowledge of cryptography, but in my research I have encountered a ciphered text that is of great historical interest and would like some assistance or suggestions about how to go about decoding it. I'd be very grateful for any help or pointers to other mailing lists, sources of... 更多 » 作者：Michael Friendly  - 7月14日 - 3 則新留言 (共有 3 則留言)

	Significance of Schnorr's "Factoring Integers in Polynomial Time"?
	Hello, at the rump session of Eurocrypt 2009, [link] Claus P. Schnorr reportedly presented slides titled "Average Time Fast SVP and CVP Algorithms: Factoring Integers in Polynomial Time" [link] I hardly understand 1/4 of the mathematical notation... 更多 » 作者：Francois Grieu  - 5月9日 - 3 則新留言 (共有 3 則留言)

Solving B from h(A || P) with h = MD5

On the code-base I am working with I came across a method to create one-off authentication URIs with format OneOff(A) = A || h(A || P) where A is the requested URI with username and other information and P that user's password. I am now wondering that is there a way to crack this sort of scheme faster than using brute-force? What I've gathered from different... 更多 » 作者：eon...@gmail.com  - 3月3日 - 1 則新留言 (共有 1 則留言)